Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization

This article discusses bit allocation and adaptive search algorithms for mean-residual vector quantization (MRVQ) and multistage vector quantization (MSVQ). The adaptive search algorithm uses a buffer and a distortion threshold function to control the bit rate that is assigned to each input vector....

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 4(1995), 7 vom: 15., Seite 1020-3
1. Verfasser: Liang, K M (VerfasserIn)
Weitere Verfasser: Huang, C M, Harris, R W
Format: Aufsatz
Sprache:English
Veröffentlicht: 1995
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000caa a22002652c 4500
001 NLM177764155
003 DE-627
005 20250209061418.0
007 tu
008 231223s1995 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0593.xml 
035 |a (DE-627)NLM177764155 
035 |a (NLM)18290051 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Liang, K M  |e verfasserin  |4 aut 
245 1 0 |a Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization 
264 1 |c 1995 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 21.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This article discusses bit allocation and adaptive search algorithms for mean-residual vector quantization (MRVQ) and multistage vector quantization (MSVQ). The adaptive search algorithm uses a buffer and a distortion threshold function to control the bit rate that is assigned to each input vector. It achieves a constant rate for the entire image but variable bit rate for each vector in the image. For a given codebook and several bit rates, we compare the performance between the optimal bit allocation and adaptive search algorithms. The results show that the performance of the adaptive search algorithm is only 0.20-0.53 dB worse than that of the optimal bit allocation algorithm, but the complexity of the adaptive search algorithm is much less than that of the optimal bit allocation algorithm 
650 4 |a Journal Article 
700 1 |a Huang, C M  |e verfasserin  |4 aut 
700 1 |a Harris, R W  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 4(1995), 7 vom: 15., Seite 1020-3  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnas 
773 1 8 |g volume:4  |g year:1995  |g number:7  |g day:15  |g pages:1020-3 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 4  |j 1995  |e 7  |b 15  |h 1020-3