Publications
Detailed Information
Extended mean-distance-ordered search using multiple l1and l2 inequalities for fast vector quantization
Cited 0 time in
Web of Science
Cited 1 time in Scopus
- Authors
- Issue Date
- 2000-04
- Citation
- IEEE Trans. Circuits Syst. II, vol. 47, pp. 349-352
- Keywords
- Anchor vector ; mean-distance-ordered search ; norm ; triangular ; inequality ; vector mean ; vector quantization
- Abstract
- Mean-distance-ordered search (MOS) algorithms [1], [2]
were proposed as a fast and efficient method for vector quantization (VQ)
encoding. However, the efficiency of MOS algorithms is limited because
they use only one inequality in reducing the search region. Therefore,
we propose an extended MOS algorithm using multiple anchor vectors
which exploits multiple and inequalities to reduce the search region
further.We also describe a greedy algorithm for selecting an anchor vector
set that reduces the computational cost of the extended MOS algorithm.
For eight test images, the number of operations required in the extended
MOS algorithm was 66.2% of that in the previous MOS algorithm on the
average when the codebook size is 256, while producing the same encoding
quality to that of the full-search VQ.
- ISSN
- 1057-7130
- Language
- English
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.