Search NASASearch

SEARCH · Search NASA

Results for “quantization”

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.

At least 55 records · Page 3

Uniform semiclassical quantization of regular and chaotic classical dynamics on the Henon-Heiles surface

Qualitative arguments are adduced which indicate that the apparently chaotic dynamics on the Henon-Heiles (1964) surface display sufficient regularity on a short to intermediate (but not long) time scale to allow the use of standard EBK quantization techniques. This takes advantage of the remnants of manifold structure implied. A complete uniform semiclassical quantization is performed using the time independent technique of the Birkhoff-Gustavson normal form, which was recently introduced in the context of semiclassical quantization by Swimm and Delos (1977, 1979).

Jaffe, C.

Image data compression with vector quantization in the transform domain

In this paper, an algorithm is presented for image data compression based upon vector quantization of the two-dimensional discrete cosine transformed coefficients. The ac energies of the transformed blocks are used to classify them into eight different ac classes. The ac coefficients of the transformed blocks of class one are set to zero, while those of classes two through eight are transmitted by seven different code books. The dc coefficients of all eight classes are scalar quantized by an adaptive uniform quantizer. As a result, only 4.5 bits instead of eight bits are required to transmit the dc coefficient with negligible additional degradation. Overall, this algorithm requires approximately 0.75 bits per pixel and gives an average reconstruction error of 7.1.

Abdelwahab, A. A.

Robust vector quantization for noisy channels

The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission errors. Two algorithms are presented for obtaining an efficient binary word assignment to the vector quantizer codewords without increasing the transmission rate. It is shown that about 4.5 dB gain over random assignment can be achieved with these algorithms. It is also proposed to reduce the effects of error propagation in vector-predictive quantizers by appropriately constraining the response of the predictive loop. The constrained system is shown to have about 4 dB of SNR gain over an unconstrained system in a noisy channel, with a small loss of clean-channel performance.

Demarca, J. R. B.

Quantized-"Gray-Scale" Electronic Synapses

Proposed array of programmable synaptic connections for electronic neural network applications offers multiple quantized levels of connection strength using only simple, two-terminal, binary microswitch devices. Subgrids in fine grid of programmable resistive connections connected externally in parallel to form coarser synaptic grid. By selection of pattern of connections in each subgrid, connection strength of synaptic node represented by that subgrid set at quantized "gray level". Device structures promise implementations of quantized-"gray-scale" synaptic arrays with very high density.

Lamb, James L.

The Hamiltonian structure of Dirac's equation in tensor form and its Fermi quantization

Currently, there is some interest in studying the tensor forms of the Dirac equation to elucidate the possibility of the constrained tensor fields admitting Fermi quantization. We demonstrate that the bispinor and tensor Hamiltonian systems have equivalent Fermi quantizations. Although the tensor Hamiltonian system is noncanonical, representing the tensor Poisson brackets as commutators for the Heisenberg operators directly leads to Fermi quantization without the use of bispinors.

Reifler, Frank

Vector Quantization With Emergent Codebook Structure

Proposed scheme under development for transmission of vector-quantized digital video images, vector quantizer codebook updated to adapt quantizer to changing signal statistics. Intended to be realized with electronic neural network. Codebook, which consists of patterns constituting video images, will undergo training during operation and scheme will develop codebooks ordered during training. System enables coding more compact, more immune to noise, and supports variable rate compression.

Ahalt, Stanley C.

Locally adaptive vector quantization: Data compression with feature preservation

A study of a locally adaptive vector quantization (LAVQ) algorithm for data compression is presented. This algorithm provides high-speed one-pass compression and is fully adaptable to any data source and does not require a priori knowledge of the source statistics. Therefore, LAVQ is a universal data compression algorithm. The basic algorithm and several modifications to improve performance are discussed. These modifications are nonlinear quantization, coarse quantization of the codebook, and lossless compression of the output. Performance of LAVQ on various images using irreversible (lossy) coding is comparable to that of the Linde-Buzo-Gray algorithm, but LAVQ has a much higher speed; thus this algorithm has potential for real-time video compression. Unlike most other image compression algorithms, LAVQ preserves fine detail in images. LAVQ's performance as a lossless data compression algorithm is comparable to that of Lempel-Ziv-based algorithms, but LAVQ uses far less memory during the coding process.

Cheung, K. M.

Necessary conditions for the optimality of variable rate residual vector quantizers

Residual vector quantization (RVQ), or multistage VQ, as it is also called, has recently been shown to be a competitive technique for data compression. The competitive performance of RVQ reported in results from the joint optimization of variable rate encoding and RVQ direct-sum code books. In this paper, necessary conditions for the optimality of variable rate RVQ's are derived, and an iterative descent algorithm based on a Lagrangian formulation is introduced for designing RVQ's having minimum average distortion subject to an entropy constraint. Simulation results for these entropy-constrained RVQ's (EC-RVQ's) are presented for memory less Gaussian, Laplacian, and uniform sources. A Gauss-Markov source is also considered. The performance is superior to that of entropy-constrained scalar quantizers (EC-SQ's) and practical entropy-constrained vector quantizers (EC-VQ's), and is competitive with that of some of the best source coding techniques that have appeared in the literature.

Kossentini, Faouzi

Vector quantizer designs for joint compression and terrain categorization of multispectral imagery

Two vector quantizer designs for compression of multispectral imagery and their impact on terrain categorization performance are evaluated. The mean-squared error (MSE) and classification performance of the two quantizers are compared, and it is shown that a simple two-stage design minimizing MSE subject to a constraint on classification performance has a significantly better classification performance than a standard MSE-based tree-structured vector quantizer followed by maximum likelihood classification. This improvement in classification performance is obtained with minimal loss in MSE performance. The results show that it is advantageous to tailor compression algorithm designs to the required data exploitation tasks. Applications of joint compression/classification include compression for the archival or transmission of Landsat imagery that is later used for land utility surveys and/or radiometric analysis.

Gorman, John D.

Performance of customized DCT quantization tables on scientific data

We show that it is desirable to use data-specific or customized quantization tables for scaling the spatial frequency coefficients obtained using the Discrete Cosine Transform (DCT). DCT is widely used for image and video compression (MP89, PM93) but applications typically use default quantization matrices. Using actual scientific data gathered from divers sources such as spacecrafts and electron-microscopes, we show that the default compression/quality tradeoffs can be significantly improved upon by using customized tables. We also show that significant improvements are possible for the standard test images Lena and Baboon. This work is part of an effort to develop a practical scheme for optimizing quantization matrices for any given image or video stream, under any given quality or compression constraints.

Ratnakar, Viresh

VLSI Processor For Vector Quantization

Pixel intensities in each kernel compared simultaneously with all code vectors. Prototype high-performance, low-power, very-large-scale integrated (VLSI) circuit designed to perform compression of image data by vector-quantization method. Contains relatively simple analog computational cells operating on direct or buffered outputs of photodetectors grouped into blocks in imaging array, yielding vector-quantization code word for each such block in sequence. Scheme exploits parallel-processing nature of vector-quantization architecture, with consequent increase in speed.

Tawel, Raoul

Visibility of DCT Quantization Error: Effects of Display Resolution

As part of a program of research to understand the visibility of DCT quantization errors and thereby design optimal quantizers, we measured visibility of DCT quantization error as a function of display resolution in pixels/degree. Visibilities are consistent with a model incorporating effects of block size and spatial pooling.

Watson, Andrew B.

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

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

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan

Numerical Simulation of Electron Magnetohydrodynamics with Landau-quantized Electrons in Magnetar Crusts

Abstract In magnetar crusts, magnetic fields are sufficiently strong to confine electrons into a small to moderate number of quantized Landau levels. This can have a dramatic effect on the crust's thermodynamic properties, generating field-dependent de Haas–van Alphen oscillations. We previously argued that the large-amplitude oscillations of the magnetic susceptibility could enhance the ohmic dissipation of the magnetic field by continuously generating small-scale, rapidly dissipating field features. This could be important to magnetar field evolution and contribute to their observed higher temperatures. To study this, we performed quasi-3D numerical simulations of electron MHD in a representative volume of neutron star crust matter, for the first time including the magnetization and magnetic susceptibility resulting from Landau quantization. We find that the potential enhancement in the ohmic dissipation rate due to this effect can be a factor ∼3 for temperatures of the order of 10 8 K, and ∼4.5 for temperatures of the order of 5 × 10 7 K, depending on the magnetic field configuration. The nonlinear Hall term is crucial to this amplification: without it, the magnetic field decay is only enhanced by a factor ≲2 even at 5 × 10 7 K. These effects generate a high wavenumber plateau in the magnetic energy spectrum associated with the small-scale de Haas–van Alphen oscillations. Our results suggest that this mechanism could help explain the magnetar heating problem, though due to the effect's temperature-dependence, full magneto-thermal evolution simulations in a realistic stellar model are needed to judge whether it is viable explanation.

Rau, Peter B. (ORCID:0000000152209277)

Analog quantizing circuit.

Analog circuit simulating quantization for analog simulation of hybrid control system, showing quantized output and error signal for wave forcing function

Coon, T. R.