Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform
The encoding of vector quantization (VQ) needs expensive computation for searching the closest codevector to the input vector. This paper presents several fast encoding algorithms based on multiple triangle inequalities and wavelet transform to overcome this problem. The multiple triangle inequaliti...
| Publié dans: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 9(2000), 3 vom: 15., Seite 321-8 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2000
|
| Accès à la collection: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Sujets: | Journal Article |
| Résumé: | The encoding of vector quantization (VQ) needs expensive computation for searching the closest codevector to the input vector. This paper presents several fast encoding algorithms based on multiple triangle inequalities and wavelet transform to overcome this problem. The multiple triangle inequalities confine a search range using the intersection of search areas generated from several control vectors. A systematic way for designing the control vectors is also presented. The wavelet transform combined with the partial distance elimination is used to reduce the computational complexity of the distance calculation of vectors. The proposed algorithms provide the same coding quality as the full search method. The experimental results indicate that the new algorithms perform more efficiently than existing algorithms |
|---|---|
| Description: | Date Completed 02.10.2012 Date Revised 07.02.2008 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1057-7149 |
| DOI: | 10.1109/83.826771 |