By Topic

A Fast Encoding Algorithm for Vector Quantization Using Difference Pyramid Structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chang-Hsing Lee ; Chung Hua Univ., Hsinchu

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.

Published in:

IEEE Transactions on Communications  (Volume:55 ,  Issue: 12 )