.png){kind=icon}
Return
Fast variable run-length coding for embedded progressive wavelet-based image compression
.png){kind=icon}
PRE
AI
DOI：10.1109/83.974563.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Run-length coding has recently 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. 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.
Keywords:
embedded progressive wavelet-based image compression
run-length coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
ShareSaveShareSave
View more