A Fast Encoding Algorithm for Vector Quantization Using Difference Pyramid Structure
This paper proposed a fast vector quantization encoding algorithm called difference pyramid search (DPS). According to the formation of the difference pyramid and partial distortion elimination, a rejection test inequality is derived to progressively reject a lot of nonclosest code words as early as...
Uloženo v:
| Vydáno v: | IEEE transactions on communications Ročník 55; číslo 12; s. 2245 - 2248 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.12.2007
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 0090-6778, 1558-0857 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper proposed a fast vector quantization encoding algorithm called difference pyramid search (DPS). According to the formation of the difference pyramid and partial distortion elimination, a rejection test inequality is derived to progressively reject a lot of nonclosest code words as early as possible. Experimental results show that the proposed DPS algorithm outperforms other pyramid-based fast search algorithms, including mean pyramid search, L2-norm pyramid search, and mean-variance pyramid search. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| ISSN: | 0090-6778 1558-0857 |
| DOI: | 10.1109/TCOMM.2007.910599 |