scispace - formally typeset
Proceedings ArticleDOI

A gain-shape vector quantizer for image coding

Ho John Lee, +1 more
- Vol. 11, pp 141-144
Reads0
Chats0
TLDR
Among the implementation features, an k-d tree nearest neighbor clustering process is used to generate the initial codebook for the VQ codebook optimization procedure and is shown to yield significant improvements in performance.
Abstract
The design of a gain-shape vector quantizer (GSVQ) for image coding that gives significantly improved image quality over basic VQ is presented. The quantizer is a spatial domain quantizer belonging to the class of product code VQ called mean-residual vector quantizers (MRVQ). In MRVQ the basic vector space of image blocks is transformed into a space of vector residuals by removing the block sample mean from the vectors. This results in a better utilization of code vectors for encoding shade blocks because they are mapped into small regions near the origin where they can be encoded efficiently. There still remains a problem, however, in finding an optimal partition for the rest of the space to encode the remaining visually sennitive edge/texture blocks so that distortion is minimized. GSVQ handles this problem nicely by a normalization process that maps each block into a gain part representing the vector's magnitude that controls the luminance level of the block and a shape part representing the spatial distribution of the vector elements. Among the implementation features, an k-d tree nearest neighbor clustering process is used to generate the initial codebook for the VQ codebook optimization procedure and is shown to yield significant improvements in performance.

read more

Citations
More filters
Journal ArticleDOI

Image compression with variable block size segmentation

TL;DR: High-quality variable-rate image compression is achieved by segmenting an image into regions of different sizes, classifying each region into one of several perceptually distinct categories, and using a distinct coding procedure for each category.
Proceedings ArticleDOI

Mean-gain-shape vector quantization

TL;DR: A mean-gain-shape product code which obtains the minimum distortion reproduction vector by successive encoding in each of the three codebooks is presented and compares favorably with other tree-structured VQ methods.
Journal ArticleDOI

Image compression by vector quantization: a review focused on codebook generation

TL;DR: After reviewing the state-of-the-art in the field of vector quantization, this work focuses on iterative and non-iterative codebook generation algorithms.
Journal ArticleDOI

Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm

TL;DR: In this paper, the authors discuss some algorithms to be used for the generation of an efficient and robust codebook for vector quantization (VQ) and present a new adaptive tree search algorithm which improves the performance of any product VQ structure.

Data compression techniques applied to high resolution high frame rate video technology

TL;DR: An investigation is presented of video data compression applied to microgravity space experiments using High Resolution High Frame Rate Video Technology (HHVT), and an extensive survey of methods, described in the open literature, was conducted.
References
More filters
Journal ArticleDOI

An Algorithm for Vector Quantizer Design

TL;DR: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.
Journal ArticleDOI

Multidimensional binary search trees used for associative searching

TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Journal ArticleDOI

An Algorithm for Finding Best Matches in Logarithmic Expected Time

TL;DR: An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Journal Article

Vector quantization

TL;DR: During the past few years several design algorithms have been developed for a variety of vector quantizers and the performance of these codes has been studied for speech waveforms, speech linear predictive parameter vectors, images, and several simulated random processes.
Journal ArticleDOI

Product code vector quantizers for waveform and voice coding

TL;DR: Several algorithms are presented for the design of shape-gain vector quantizers based on a traning sequence of data or a probabilistic model, and their performance is compared to that of previously reported vector quantization systems.
Related Papers (5)