Fast variable run-length coding for embedded progressive wavelet-based image compression

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on image processing Vol. 10; no. 12; pp. 1781 - 1790
Main Authors: Berghorn, W., Boskamp, T., Lang, M., Peitgen, H.-O.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.12.2001
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Artificial intelligence
Coding
Complexity
Compressing
Computer science; control theory; systems
Decoding
Discrete wavelet transforms
Entropy
Exact sciences and technology
Image coding
Image compression
Image processing
Image reconstruction
Information, signal and communications theory
Pattern recognition. Digital image processing. Computational geometry
Quantization
Scanning
Self-similarity
Signal processing
State of the art
Telecommunications and information theory
Visualization
Wavelet coefficients
Wavelet domain
Wavelet transforms
Performance evaluation
Image coding
Image processing
Wavelet transformation
Statistical model
Image compression
Fast algorithm
Variable length code
ISSN:1057-7149, 1941-0042
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1057-7149
1941-0042
DOI:10.1109/83.974563