Fast VQ encoding by an efficient kick-out condition

Authors:
Kuang-Shyr Wu;Ja-Chen Lin
Affiliations:
Inst. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu;-
Venue:
IEEE Transactions on Circuits and Systems for Video Technology
Year:
2000

Citing 0
Cited 13

A fast pixel mapping algorithm using principal component analysis

Pattern Recognition Letters
Filtering and Searching Vector Quantization

Journal of VLSI Signal Processing Systems
An improved fast encoding algorithm for vector quantization

Journal of the American Society for Information Science and Technology
An improved tree-structured codebook search algorithm for grayscale image compression

Fundamenta Informaticae
Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding

Information Sciences: an International Journal
Fast VQ codebook search algorithm for grayscale image coding

Image and Vision Computing
Predictive Grayscale Image Coding Scheme Using VQ and BTC

Fundamenta Informaticae
Fast Searching Algorithm for Vector Quantization Based on Subvector Technique

IEICE - Transactions on Information and Systems
A fast vector quantization encoding algorithm based on projection pyramid with Hadamard transformation

Image and Vision Computing
RSTC-invariant object representation with 2D modified Mellin-Fourier transform

WSEAS Transactions on Signal Processing
Predictive Grayscale Image Coding Scheme Using VQ and BTC

Fundamenta Informaticae
An Improved Tree-Structured Codebook Search Algorithm for Grayscale Image Compression

Fundamenta Informaticae
Fast K-means clustering using deletion by center displacement and norms product (CDNP)

Pattern Recognition and Image Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new fast approach to the nearest codeword search using a single kick-out condition is proposed. The nearest codeword found by the proposed approach is identical to the one found by the full search, although the processing time is much shorter. The principle is to bypass those codewords which satisfy the proposed kick-out condition without the actual (and time-consuming) computation of the distortions from the bypassed codewords to the query vector. Due to the efficiency and simplicity of the proposed condition, a considerable saving of the central processing unit time needed to encode a data set (using a given codebook) can be achieved. Moreover, the memory requirement is low. Comparisons with some previous works are included to show these two benefits