|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM177764392 |
| 003 |
DE-627 |
| 005 |
20231223150935.0 |
| 007 |
tu |
| 008 |
231223s1996 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0593.xml
|
| 035 |
|
|
|a (DE-627)NLM177764392
|
| 035 |
|
|
|a (NLM)18290075
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Hsieh, C H
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Lossless compression of VQ index with search-order coding
|
| 264 |
|
1 |
|c 1996
|
| 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 In memoryless vector quantization (VQ) for images, each block is quantized independently and its corresponding index is sent to the decoder. This paper presents a new lossless algorithm that exploits the interblock correlation in the index domain. We compare the current index with previous indices in a predefined search path, and then send the corresponding search order to the decoder. The new algorithm achieves significant reduction of bit rates without introducing extra coding distortion when compared to memoryless VQ. It is very simple and computationally efficient
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Tsai, J C
|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 5(1996), 11 vom: 15., Seite 1579-82
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:5
|g year:1996
|g number:11
|g day:15
|g pages:1579-82
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 5
|j 1996
|e 11
|b 15
|h 1579-82
|