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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 55; no. 12; pp. 2245 - 2248
Main Author: Lee, Chang-Hsing
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.12.2007
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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