Search NASA⌕ Search

SEARCH · Search NASA

Results for “transform-based compression”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Quantization Distortion in Block Transform-Compressed Data

The popular JPEG image compression standard is an example of a block transform-based compression scheme; the image is systematically subdivided into block that are individually transformed, quantized, and encoded. The compression is achieved by quantizing the transformed data, reducing the data entropy and thus facilitating efficient encoding. A generic block transform model is introduced.

block transform-compressed data quantization image↗

Image compression system and method having optimized quantization tables

A digital image compression preprocessor for use in a discrete cosine transform-based digital image compression device is provided. The preprocessor includes a gathering mechanism for determining discrete cosine transform statistics from input digital image data. A computing mechanism is operatively coupled to the gathering mechanism to calculate a image distortion array and a rate of image compression array based upon the discrete cosine transform statistics for each possible quantization value. A dynamic programming mechanism is operatively coupled to the computing mechanism to optimize the rate of image compression array against the image distortion array such that a rate-distortion-optimal quantization table is derived. In addition, a discrete cosine transform-based digital image compression device and a discrete cosine transform-based digital image compression and decompression system are provided. Also, a method for generating a rate-distortion-optimal quantization table, using discrete cosine transform-based digital image compression, and operating a discrete cosine transform-based digital image compression and decompression system are provided.

Ratnakar, Viresh↗

TTHRESH: Tensor Compression for Multidimensional Visual Data

Memory and network bandwidth are decisive bottlenecks when handling high-resolution multidimensional data sets in visualization applications, and they increasingly demand suitable data compression strategies. In this paper, we introduce a novel lossy compression algorithm for multidimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher, together with bit-plane, run-length and arithmetic coding to compress the HOSVD transform coefficients. Our scheme degrades the data particularly smoothly and achieves lower mean squared error than other state-of-the-art algorithms at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include very fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set.

97 MATHEMATICS AND COMPUTING↗

Integer cosine transform for image compression

This article describes a recently introduced transform algorithm called the integer cosine transform (ICT), which is used in transform-based data compression schemes. The ICT algorithm requires only integer operations on small integers and at the same time gives a rate-distortion performance comparable to that offered by the floating-point discrete cosine transform (DCT). The article addresses the issue of implementation complexity, which is of prime concern for source coding applications of interest in deep-space communications. Complexity reduction in the transform stage of the compression scheme is particularly relevant, since this stage accounts for most (typically over 80 percent) of the computational load.

Cheung, K.-M.↗

A new micromechanics based full field numerical framework to simulate the effects of dynamic recrystallization on the formability of HCP metals

This work presents a new full-field, efficient and mesh-free numerical framework to model microstructure evolution, dynamic recrystallization (DRX) and formability in hexagonal closed-packed (HCP) metals such as magnesium alloys at warm temperatures. A rate tangent-fast Fourier transform-based elasto-viscoplastic crystal plasticity constitutive model for HCP metals (RTCP-FFT-HCP) is coupled with a probabilistic cellular automata (CA) approach to model DRX (CA-DRX). Furthermore, this new model is coupled with the Marciniak-Kuczynski (M-K) approach to model formability of magnesium alloys at elevated temperatures. The RTCP-FFT-HCP model computes macro stress-strain, twinning volume fraction, micromechanical fields, texture evolution and local dislocation density. Nucleation of new grains and their subsequent growth is modeled using the cellular automata approach with probabilistic state switching rule. First, the proposed RTCP-FFT-HCP model is validated by comparing the predicted stress-strain responses and texture evolution under uniaxial tension and compression with experimental measurements for AZ31 sheet alloy at room temperature. The coupled CA-RTCPFFT-HCP model is further validated by comparing the predicted stress-strain responses and texture evolution in uniaxial compression with experimental measurements at 100 °C, 200 °C and 300 °C for the AZ31 sheet alloy. Next, the forming limit diagrams (FLDs) with and without including the effects of DRX are simulated at 100 °C, 200 °C and 300 °C for AZ31 sheet alloy. The predicted FLDs with DRX show very good agreement with the experimental measurements and clearly demonstrate the need for an accurate DRX model. The study reveals that the DRX strongly affects the deformed grain structure, grain size and texture evolution and also highlights the importance accounting for DRX during FLD simulations at high temperatures.

36 MATERIALS SCIENCE↗

A fast Fourier transform-based mesoscale field dislocation mechanics study of grain size effects and reversible plasticity in polycrystals

A numerical implementation of a non-local polycrystal plasticity theory based on a mesoscale version of the field dislocation mechanics theory (MFDM) of Acharya and Roy (2006) is presented using small-strain elasto-viscoplastic fast Fourier transform-based (EVPFFT) algorithm developed by Lebensohn et al. (2012). In addition to considering plastic flow and hardening only due to SSDs (statistically stored dislocations) as in the classic EVPFFT framework, the proposed method accounts for the evolution of GND (geometrically necessary dislocations) densities solving a hyperbolic-type partial differential equation, and GND effects on both plastic flow and hardening. This allows consideration of an enhanced strain-hardening law that includes the effect of the GND density tensor. The numerical implementation of a reduced version of the MFDM is presented in the framework of the FFT-based augmented Lagrangian procedure of Michel et al. (2001). A Finite Differences scheme combined with discrete Fourier transforms is applied to solve both incompatibility and equilibrium equations. The numerical procedure named MFDM-EVPFFT is used to perform full field simulations of polycrystal plasticity considering different grain sizes and their mechanical responses during monotonic tensile and reversible tension-compression tests. Using Voronoi tessellation and periodic boundary conditions, voxelized representative volume elements (RVEs) with different grain sizes are generated. With MFDM-EVPFFT, a Hall-Petch type scaling law is obtained in contrast with the conventional crystal plasticity EVPFFT. In the case of reversible plasticity, a stronger Bauschinger effect is observed with the MFDM-EVPFFT approach in comparison with conventional EVPFFT. Here, the origin of these differences is analyzed in terms of heterogeneity, GND density and stress evolutions during the compression stage.

36 MATERIALS SCIENCE↗