By Topic

Convergent algorithms for successive approximation vector quantisation with applications to wavelet image compression

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

3 Author(s)
Craizer, M. ; Dept. de Matematica, PUC Rio, Rio de Janeiro, Brazil ; Da Silva, E.A.B. ; Ramos, E.G.

Embedded wavelet coders have become very popular in image compression applications, owing to their simplicity and high coding efficiency. Most of them incorporate some form of successive approximation scalar quantisation. Recently developed algorithms for successive approximation vector quantisation have been shown to be capable of outperforming successive approximation scalar quantisation ones. In the paper, some algorithms for successive approximation vector quantisation are analysed. Results that were previously known only on an experimental basis are derived analytically. An improved algorithm is also developed and is proved to be convergent. These algorithms are applied to the coding of wavelet coefficients of images. Experimental results show that the improved algorithm is more stable in a rate×distortion sense, while maintaining coding performances compatible with the state-of-the-art

Published in:

Vision, Image and Signal Processing, IEE Proceedings -  (Volume:146 ,  Issue: 3 )