A fast VQ codebook generation algorithm via pattern reduction

Authors:
Chun-Wei Tsai;Chao-Yang Lee;Ming-Chao Chiang;Chu-Sing Yang
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan, ROC;Department of Electrical Engineering, National Cheng Kung University, Tainan 70101, Taiwan, ROC;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan, ROC;Department of Electrical Engineering, National Cheng Kung University, Tainan 70101, Taiwan, ROC
Venue:
Pattern Recognition Letters
Year:
2009

Citing 21
Cited 4

Data clustering: a review

ACM Computing Surveys (CSUR)
The enhanced LBG algorithm

Neural Networks
Refining Initial Points for K-Means Clustering

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Using a Chain of LVQ Neural Networks for Pattern Recognition of EEG Signals Related to Intermittent Photic-Stimulation

SBRN '02 Proceedings of the VII Brazilian Symposium on Neural Networks (SBRN'02)
An efficient law-of-cosine-based search for vector quantization

Pattern Recognition Letters
Improved adaptive vector quantization algorithm using hybrid codebook data structure

Real-Time Imaging
Fast codebook search algorithms based on tree-structured vector quantization

Pattern Recognition Letters
An adaptive incremental LBG for vector quantization

Neural Networks
An evolution-based tabu search approach to codebook design

Pattern Recognition
A fast VQ codebook generation algorithm using codeword displacement

Pattern Recognition
Linearly constrained generalized Lloyd algorithm for reducedcodebook vector quantization

IEEE Transactions on Signal Processing
Fast K-dimensional tree algorithms for nearest neighborsearch with application to vector quantization encoding

IEEE Transactions on Signal Processing
Progressive scalable interactive region-of-interest image coding using vector quantization

IEEE Transactions on Multimedia
A fast exact GLA based on code vector activity detection

IEEE Transactions on Image Processing
An efficient encoding algorithm for vector quantization based on subvector technique

IEEE Transactions on Image Processing
Adaptive vector quantization with codebook updating based on locality and history

IEEE Transactions on Image Processing
Variable-branch tree-structured vector quantization

IEEE Transactions on Image Processing
Design of vector quantizer for image compression using self-organizing feature map and surface fitting

IEEE Transactions on Image Processing
Fast-searching algorithm for vector quantization using projection and triangular inequality

IEEE Transactions on Image Processing
Fast vector quantization algorithms based on nearest partition set search

IEEE Transactions on Image Processing
Fast Planar-Oriented Ripple Search Algorithm for Hyperspace VQ Codebook

IEEE Transactions on Image Processing

Low-bit-rate lossless image coding using classified vector quantization with orthogonal polynomials transform

Proceedings of the 2011 International Conference on Communication, Computing & Security
Image retrieval based on GA integrated color vector quantization and curvelet transform

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
On the systematic development of fast fuzzy vector quantization for grayscale image compression

Neural Networks
PREACO: A fast ant colony optimization for codebook generation

Applied Soft Computing

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this paper, we present a simple but fast codebook generation algorithm, called PREGLA (Pattern Reduction Enhanced GLA). The proposed algorithm is fundamentally different from the previous approaches in that the previous approaches focus on reducing the size of the codebook whereas the proposed algorithm focuses on using pattern reduction to reduce the computation time. The proposed algorithm is motivated by the observation that input vectors that are ''static'' during the training process can be considered as part of the final solutions and thus can be compressed and removed to eliminate the redundant computations at the later iterations of the training process. To evaluate the performance of the proposed algorithm, we compare the proposed algorithm with ''efficient'' state-of-the-art GLA or GLA-based algorithms such as Codeword Displacement, Nearest Partition Set Search, Fast Vector Quantization Algorithm, Law of Cosines, and standard GLA. Our experimental results indicate that the proposed algorithm can reduce the computation time from 29.45% up to about 77.98% compared to those of standard GLA and other fast GLA-based algorithms alone.