Search NASA⌕ Search

SEARCH · Search NASA

Results for “QUANTIZER”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

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.↗
NASA NTRS1988

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.↗
NASA NTRS1990

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.↗
NASA NTRS1992

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↗
NASA NTRS1993

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.↗
NASA NTRS1992

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.↗
NASA NTRS1993

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↗
NASA NTRS1994

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.↗
NASA NTRS1994

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↗
NASA NTRS1995

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↗
NASA NTRS1994

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.↗
NASA NTRS1998

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↗
DOE OSTI2021

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗
NASA NTRS1995

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↗
DOE OSTI2022

Implementing the three-particle quantization condition for π + π + K + and related systems

Recently, the formalism needed to relate the finite-volume spectrum of systems of nondegenerate spinless particles has been derived. In this work we discuss a range of issues that arise when implementing this formalism in practice, provide further theoretical results that can be used to check the implementation, and make available codes for implementing the three-particle quantization condition. Specifically, we discuss the need to modify the upper limit of the cutoff function due to the fact that the left-hand cut in the scattering amplitudes for two nondegenerate particles moves closer to threshold; we describe the decomposition of the three-particle amplitude K df,3 into the matrix basis used in the quantization condition, including both s and p waves, with the latter arising in the amplitude for two nondegenerate particles; we derive the threshold expansion for the lightest three-particle state in the rest frame up to O(1/L 5 ); and we calculate the leading-order predictions in chiral perturbation theory for K df,3 in the π + π + K + and π + K + K + systems. We focus mainly on systems with two identical particles plus a third that is different (“2+1” systems). We describe the formalism in full detail, and present numerical explorations in toy models, in particular checking that the results agree with the threshold expansion, and making a prediction for the spectrum of π + π + K + levels using the two- and three-particle interactions predicted by chiral perturbation theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Axion periodicity and coupling quantization in the presence of mixing

Mixing of axion fields is widely used to generate EFTs with phenomenologically advantageous features, such as hierarchies between axion couplings to different gauge fields and/or large effective field ranges. While these features are strongly constrained by periodicity for models with only a single axion, mixing has been used in the literature (sometimes incorrectly) to try to evade some of these constraints. In this paper, we ask whether it is possible to use axion mixing to generate an EFT of axions that evades these constraints by flowing to a theory of a non-compact scalar in the IR. We conclude that as long as the light axion is exactly massless, it will inherit the periodicity and associated constraints of the UV theory. However, by giving the light axion a mass, we can relax these constraints with effects proportional to the axion mass squared, including non-quantized couplings and the realignment of monodromy to a light axion with a larger field range. To show this, we consider various examples of axions mixing with other axions or with non-compact scalar fields, and work in a basis where coupling quantization is manifest. This basis makes it clear that in the case where an axion is eaten through the Higgs or Stückelberg mechanism, the light axion does not have a large effective field range, in contrast to some recent claims in the literature. Additionally, we relate our results about axion EFTs to a well-known fact about gauge theory: that QFTs with compact gauge groups in the UV flow to QFTs with compact gauge groups in the IR, and make this correspondence precise in the 2+1 dimensional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Generalizing the relativistic quantization condition to include all three-pion isospin channels

We present a generalization of the relativistic, finite-volume, three-particle quantization condition for non-identical pions in isosymmetric QCD. The resulting formalism allows one to use discrete finite-volume energies, determined using lattice QCD, to constrain scattering amplitudes for all possible values of two- and three-pion isospin. As for the case of identical pions considered previously, the result splits into two steps: the first defines a non-perturbative function with roots equal to the allowed energies, E n (L), in a given cubic volume with side-length L. This function depends on an intermediate three-body quantity, denoted K d f , 3 , which can thus be constrained from lattice QCD in- put. The second step is a set of integral equations relating K d f , 3 to the physical scattering amplitude, M 3 . Both of the key relations, En(L) ↔ K d f , 3 and K d f , 3 &#x2194;<!-- ↔ --> M 3 , are shown to be block-diagonal in the basis of definite three-pion isospin, Iπππ , so that one in fact recovers four independent relations, corresponding to Iπππ = 0, 1, 2, 3. We also provide the generalized threshold expansion of K d f , 3 for all channels, as well as parameterizations for all three-pion resonances present for Iπππ = 0 and Iπππ = 1. As an example of the utility of the generalized formalism, we present a toy implementation of the quantization condition for Iπππ = 0, focusing on the quantum numbers of the ω and h 1 resonances.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

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↗