A Fast and Low Complexity Image Codec based on Backward Coding of Wavelet Trees

Authors:
Jiangling Guo;Sunanda Mitra;Brian Nutter;Tanja Karp
Affiliations:
Texas Tech University;Texas Tech University;Texas Tech University;Texas Tech University
Venue:
DCC '06 Proceedings of the Data Compression Conference
Year:
2006

Citing 0
Cited 3

M-LTW: A fast and efficient intra video codec

Image Communication
Ultra high resolution image coding and ROI viewing using line-based backward coding of wavelet trees (L-BCWT)

PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
A Novel VLSI Architecture of SPIHT Using Breadth First Search for Real-Time Applications

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common "forward"coding of wavelet trees from the highest level (lowest resolution), the new approach starts coding from the lowest level and goes backward by building a map of maximum quantization levels of descendants. BCWT eliminates several major bottlenecks of existing wavelet-tree-based codecs, namely tree-scanning, bitplane coding and dynamic lists management. Compared to SPIHT, BCWT encodes and decodes up to eight times faster without sacrificing PSNR. At the same time, BCWT provides desirable features such as low complexity, low memory usage, and resolution scalability.