Diagonal axes method (DAM): a fast search algorithm for vector quantization

Authors:
Tung-Shou Chen;Chin-Chen Chang
Affiliations:
Nat. Chin-Yi Inst. of Technol., Taichung;-
Venue:
IEEE Transactions on Circuits and Systems for Video Technology
Year:
1997

Citing 0
Cited 10

A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree

IEEE Transactions on Pattern Analysis and Machine Intelligence
Novel full-search schemes for speeding up image coding using vector quantization

Real-Time Imaging
Improved adaptive vector quantization algorithm using hybrid codebook data structure

Real-Time Imaging
An improved tree-structured codebook search algorithm for grayscale image compression

Fundamenta Informaticae
Fast codebook search algorithms based on tree-structured vector quantization

Pattern Recognition Letters
A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold

Fundamenta Informaticae
Vector quantization using the firefly algorithm for image compression

Expert Systems with Applications: An International Journal
Density-based image vector quantization using a genetic algorithm

MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold

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

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vector quantization (VQ) is a fundamental technique for image compression. But it takes time to search for a similar codeword in a codebook. Thus, the codebook search is one of the major bottlenecks in VQ. We propose a new search algorithm which is used to speed up both the codebook generation and the encoding. We call it the diagonal axes method (DAM). This new algorithm contains two major techniques: diagonal axes analysis (DAA) and orthogonal checking (OC). Since most of these procedures simply involve additions and subtractions, DAM is more efficient than some other related algorithms. Simulation results confirm this effectiveness