Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vector 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 37 records · Page 2

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

Vector quantization for efficient coding of upper subbands

This paper examines the application of vector quantization (VQ) to exploit both intra-band and inter-band redundancy in subband coding. The focus here is on the exploitation of inter-band dependency. It is shown that VQ is particularly suitable and effective for coding the upper subbands. Three subband decomposition-based VQ coding schemes are proposed here to exploit the inter-band dependency by making full use of the extra flexibility of VQ approach over scalar quantization. A quadtree-based variable rate VQ (VRVQ) scheme which takes full advantage of the intra-band and inter-band redundancy is first proposed. Then, a more easily implementable alternative based on an efficient block-based edge estimation technique is employed to overcome the implementational barriers of the first scheme. Finally, a predictive VQ scheme formulated in the context of finite state VQ is proposed to further exploit the dependency among different subbands. A VRVQ scheme proposed elsewhere is extended to provide an efficient bit allocation procedure. Simulation results show that these three hybrid techniques have advantages, in terms of peak signal-to-noise ratio (PSNR) and complexity, over other existing subband-VQ approaches.

Zeng, W. J.↗

Application of a VLSI vector quantization processor to real-time speech coding

Attention is given to a working vector quantization processor for speech coding that is based on a first-generation VLSI chip which efficiently performs the pattern-matching operation needed for the codebook search process (CPS). Using this chip, the CPS architecture has been successfully incorporated into a compact, single-board Vector PCM implementation operating at 7-18 kbits/sec. A real time Adaptive Vector Predictive Coder system using the CPS has also been implemented.

Davidson, G.↗

Progressive Vector Quantization on a massively parallel SIMD machine with application to multispectral image data

A progressive vector quantization (VQ) compression approach is discussed which decomposes image data into a number of levels using full search VQ. The final level is losslessly compressed, enabling lossless reconstruction. The computational difficulties are addressed by implementation on a massively parallel SIMD machine. We demonstrate progressive VQ on multispectral imagery obtained from the Advanced Very High Resolution Radiometer instrument and other Earth observation image data, and investigate the trade-offs in selecting the number of decomposition levels and codebook training method.

Manohar, Mareboyana↗

Improved Locally Adaptive Vector Quantization

Several refinements introduced to improve performance of data-compression scheme described in "Adaptive Vector-Quantization Scheme" (NPO-18186). Principal advantages of LAVQ are that complexity and coding time less than those of some other data-compression schemes. Also, does not require priori knowledge of either codebook or statistics of source data.

Cheung, Kar-Ming↗

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

Fast QSTS for Distributed PV Impact Studies Using Vector Quantization and Variable Time-Steps

As the penetration level of PV systems increases, utilities are in great need of methods to quickly and effectively analyze PV's impact on electric distribution systems. Compared to other conventional methods, quasi-static time-series (QSTS) based analysis has demonstrated its advantages of accurately capturing the impact of interest, e.g. control device operations, and min and max voltages. However, yearlong QSTS simulation with 1-second granularity is currently too computationally expensive for regular use. Therefore, vector quantization (VQ) and variable time-step (VTS) solution methods have been developed to accelerate QSTS simulation. This paper proposes the combination of VQ with VTS. We investigate the effectiveness of implementing VQ in combination with 2 VTS algorithms, predetermined time-step (PT) and VTS with backtrack downsampling (VTS-BD) to demonstrate a runtime reduction of 99.55% with error metrics below acceptable thresholds.

14 SOLAR ENERGY↗

Analysis and improvement of the vector quantization in SELP (Stochastically Excited Linear Prediction)

The Stochastically Excited Linear Prediction (SELP) algorithm is described as a speech coding method employing a two-stage vector quantization. The first stage uses an adaptive codebook which efficiently encodes the periodicity of voiced speech, and the second stage uses a stochastic codebook to encode the remainder of the excitation signal. The adaptive codebook performs well when the pitch period of the speech signal is larger than the frame size. An extension is introduced, which increases its performance for the case that the frame size is longer than the pitch period. The performance of the stochastic stage, which improves with frame length, is shown to be best in those sections of the speech signal where a high level of short-term correlations is present. It can be concluded that the SELP algorithm performs best during voiced speech where the pitch period is longer than the frame length.

Kleijn, W. B.↗

Systolic architectures for vector quantization

A family of architectural techniques are proposed which offer efficient computation of weighted Euclidean distance measures for nearest-neighbor codebook searching. The general approach uses a single metric comparator chip in conjunction with a linear array of inner product processor chips. Very high vector-quantization (VQ) throughput can be achieved for many speech and image-processing applications. Several alternative configurations allow reasonable tradeoffs between speed and VLSI chip area required.

Davidson, Grant A.↗

Vector quantization for volume rendering

Volume rendering techniques typically process volumetric data in raw, uncompressed form. As algorithmic and architectural advances improve rendering speeds, however, larger data sets will be evaluated requiring consideration of data storage and transmission issues. In this paper, we analyze the data compression requirements for volume rendering applications and present a solution based on vector quantization. The proposed system compresses volumetric data and then renders images directly from the new data format. Tests on a fluid flow data set demonstrate that good image quality may be achieved at a compression ratio of 17:1 with only a 5 percent cost in additional rendering time.

Ning, Paul↗

Investigation of process history and underlying phenomena associated with the synthesis of plutonium oxides using Vector Quantizing Variational Autoencoder

Accurate, high throughput, and unbiased analysis of plutonium oxide particles is needed for analysis of the phenomenology associated with process parameters in their synthesis. Compared to qualitative and taxonomic descriptors, quantitative descriptors of particle morphology through scanning electron microscopy (SEM) have shown success in analyzing process parameters of uranium oxides. Among other candidates, a neural network called a Vector Quantizing Variational Autoencoder (VQ-VAE) has shown the ability to quantitatively describe particle morphology to attain >85% accuracy in identifying uranium oxide processing routes. We utilize a VQ-VAE to quantitatively describe plutonium dioxide (PuO 2 ) particles created in a designed experiment and investigate their phenomenology and prediction of their process parameters. PuO 2 was calcined from Pu(III) oxalates that were precipitated under varying synthetic conditions that related to concentrations, temperature, addition and digestion times, precipitant feed, and strike order; the surface morphology of the resulting PuO 2 powders were analyzed by SEM. A pipeline was developed to extract and quantify useful image representations for individual particles with the VQ-VAE, then further reduce the dimensionality of the feature space using a bottlenecking neural network fit to perform multiple classification tasks simultaneously. The reduced feature space could predict process parameters with greater than 80% accuracies for some parameters with a single particle. They also showed utility for grouping particles with similar surface morphology characteristics together. Both the clustering and classification results reveal valuable information regarding which chemical process parameters chiefly influence the PuO 2 particle morphologies: strike order and oxalic acid feedstock. Doing the same analysis with multiple particles was shown to improve the classification accuracy on each process parameter over the use of a single particle, with statistically significant results generally seen with as few as four particles in a sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Recursive optimal pruning with applications to tree structured vector quantizers

A pruning algorithm of Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Kiang, Shei-Zein↗

Fast Quasi-Static Time-Series (QSTS) for yearlong PV impact studies using vector quantization

The rapidly growing penetration levels of distributed photovoltaic (PV) systems requires more comprehensive studies to understand their impact on distribution feeders. IEEE P.1547 highlights the need for Quasi-Static Time Series (QSTS) simulation in conducting distribution impact studies for distributed resource interconnection. Unlike conventional scenario-based simulation, the time series simulation can realistically assess time-dependent impacts such as the operation of various controllable elements (e.g. voltage regulating tap changers) or impacts of power fluctuations. However, QSTS simulations are still not widely used in the industry because of the computational burden associated with running yearlong simulations at a 1-s granularity, which is needed to capture device controller effects responding to PV variability. This study presents a novel algorithm that reduces the number of times that the non-linear 3-phase unbalanced AC power flow must be solved by storing and reassigning power flow solutions as it progresses through the simulation. Each unique power flow solution is defined by a set of factors affecting the solution that can easily be queried. We demonstrate a computational time reduction of 98.9% for a yearlong simulation at 1-s resolution with minimal errors for metrics including: number of tap changes, capacitor actions, highest and lowest voltage on the feeder, line losses, and ANSI voltage violations. Finally, the key contribution of this work is the formulation of an algorithm capable of: (i) drastically reducing the computational time of QSTS simulations, (ii) accurately modeling distribution system voltage-control elements with hysteresis, and (iii) efficiently compressing result time series data for post-simulation analysis.

14 SOLAR ENERGY↗

Fast Vector-Quantizing Data Compressor

Proposed encoding digital electronic data-processing system compresses 7-Mb/s input stream of data into 1-Mb/s output stream. Intended to reduce flow of data from orbiting synthetic-aperture-radar (SAR) system to rate low enough for transmission to ground. Features include reliability, light weight, and low power. Proves advantageous in such terrestrial applications as compression of speech and of video signals.

Chang, Chi-Yung↗