By Topic

Fast variable run-length coding for embedded progressive wavelet-based 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 $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

4 Author(s)
Berghorn, W. ; Center for Med. Diagnostic Syst. & Visualization, Bremen, Germany ; Boskamp, T. ; Lang, M. ; Peitgen, H.-O.

Run-length coding has attracted much attention in wavelet-based image compression because of its simplicity and potentially low complexity. The main drawback is the inferior RD-performance compared to the state-of-the-art-coder SPIHT. In this paper, we concentrate on the embedded progressive run-length code of Tian and Wells (1996, 1998). We consider significance sequences drawn from the scan in the dominant pass. It turns out that self-similar curves for scanning the dominant pass increase the compression efficiency significantly. This is a consequence of the correlation of direct neighbors in the wavelet domain. This dependence can be better exploited by using groups of coefficients, similar to the SPIHT algorithm. This results in a new and very fast coding algorithm, which shows performance similar to the state-of-the-art coder SPIHT, but with lower complexity and small and fixed memory overhead

Published in:

Image Processing, IEEE Transactions on  (Volume:10 ,  Issue: 12 )