Vector quantization and signal compression
Vector quantization and signal compression
An improved search algorithm for vector quantization using mean pyramid structure
Pattern Recognition Letters
Tree Structured Vector Quantization with Dynamic Path Search
ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
A fast LBG codebook training algorithm for vector quantization
IEEE Transactions on Consumer Electronics
IEEE Transactions on Image Processing
Diagonal axes method (DAM): a fast search algorithm for vector quantization
IEEE Transactions on Circuits and Systems for Video Technology
Fast VQ encoding by an efficient kick-out condition
IEEE Transactions on Circuits and Systems for Video Technology
Hypergraphs for Generic Lossless Image Compression
Fundamenta Informaticae
Hi-index | 0.00 |
In this paper, an improved tree-structured codebook search algorithm is proposed. It is called the two-level codebook search algorithm (TLCS). The goal of this method is to reduce the computation cost of the multi-path-searching algorithm for TSVQ. It speeds up the codebook search by searching only a two-level codebook tree instead of the whole TSVQ codebook tree. According to the experimental results, a significant time reduction can be achieved with this method, compared to the multi-path-searching algorithm. In other words, our TLCS outperforms the multi-path-searching algorithm.