Proceedings ArticleDOI
Fast and efficient spatial scalable image compression using wavelet lower trees
José Luis Hervás Oliver,Manuel P. Malumbres +1 more
- pp 133-142
TLDR
A new image compression algorithm is proposed based on the efficient construction of wavelet coefficient lower trees that presents state-of-the-art compression performance, while its temporal complexity is lower than the one presented in other wavelet coders, like SPIHT and JPEG2000.Abstract:
A new image compression algorithm is proposed based on the efficient construction of wavelet coefficient lower trees. This lower-tree wavelet (LTW) encoder presents state-of-the-art compression performance, while its temporal complexity is lower than the one presented in other wavelet coders, like SPIHT and JPEG2000. This fast execution is achieved by means of a simple two-pass coding and one-pass decoding algorithm. On the other hand, its computation does not need additional lists or complex data structures so there is no memory head. A formal description of the algorithm is provided, so that an implementation can be performed straightforwardly. The results show that the codec works faster than SPIHT and JPEG2000 with better performance in terms of rate-distortion metric.read more
Citations
More filters
IJCSI Publicity Board 2010
TL;DR: This paper presents a systematic analysis of a variety of different ad hoc network topologies in terms of node placement, node mobility and routing protocols through several simulated scenarios.
Journal ArticleDOI
Low-Complexity Multiresolution Image Compression Using Wavelet Lower Trees
TL;DR: A new image compression algorithm is proposed based on the efficient construction of wavelet coefficient lower trees, which presents state-of-the-art compression performance, whereas its complexity is lower than the one presented in other wavelet coders, like SPIHT and JPEG 2000.
Posted Content
Color Image Compression Based On Wavelet Packet Best Tree
TL;DR: It is proposed that proper selection of mother wavelet on the basis of nature of images, improve the quality as well as compression ratio remarkably, and the enhanced run length encoding technique is suggested provides better results than RLE.
Proceedings ArticleDOI
A fast and low complexity image codec based on backward coding of wavelet trees
TL;DR: BCWT eliminates several major bottlenecks of existing wavelet-tree-based codecs, namely tree-scanning, bitplane coding and dynamic lists management, and provides desirable features such as low complexity, low memory usage, and resolution scalability.
Journal ArticleDOI
Hierarchical Dynamic Range Coding of Wavelet Subbands for Fast and Efficient Image Decompression
Yushin Cho,W.A. Pearlman +1 more
TL;DR: An image coding algorithm, progressive resolution coding (PROGRES), for a high-speed resolution scalable decoding is proposed, designed based on a prediction of the decaying dynamic ranges of wavelet subbands, which validates the suitability of the proposed method to very large scale image encoding and decoding.
References
More filters
Journal ArticleDOI
Line-based, reduced memory, wavelet image compression
TL;DR: A line-based approach for the implementation of the wavelet transform is introduced, which yields the same results as a "normal" implementation, but where, unlike prior work, the memory issues arising from the need to synchronize encoder and decoder are addressed.
Journal ArticleDOI
Stack-run image coding
TL;DR: A new image coding approach in which a 4-ary arithmetic coder is used to represent significant coefficient values and the lengths of zero runs between coefficients, which involves much lower addressing complexity than other algorithms such as zerotree coding.
Journal ArticleDOI
Fast variable run-length coding for embedded progressive wavelet-based image compression
TL;DR: It turns out that self-similar curves for scanning the dominant pass increase the compression efficiency significantly, which 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.
Related Papers (5)
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Amir Said,William A. Pearlman +1 more