By Topic

Variable-rate predictive residual vector quantizer

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
$31 $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

2 Author(s)
Rizvi, S.A. ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Buffalo, NY, USA ; Nasrabadi, N.M.

A major problem with a VQ-based image compression scheme is its codebook search complexity. Recently, a predictive residual vector quantizer (PRVQ) was proposed by Rizvi and Nasrabadi (see IEEE Int. Conf. Image Processing, Austin, vol.1, p.608-612, Nov. 13-16, 1994). This scheme has a very low search complexity, and its performance is very close to that of the predictive vector quantizer (PVQ). The article presents a new VQ scheme called variable-rate PRVQ (VR-PRVQ), which is designed by imposing a constraint on the output entropy of the PRVQ. The proposed VR-PRVQ is found to give an excellent rate-distortion performance and clearly outperforms the state-of-the-art image compression algorithm developed by the Joint Photographic Experts Group (JPEG).<>

Published in:

Signal Processing Letters, IEEE  (Volume:2 ,  Issue: 4 )