TY - JOUR
T1 - A fast and low complexity image codec based on backward coding of wavelet trees
AU - Guo, Jiangling
AU - Mitra, Sunanda
AU - Nutter, Brian
AU - Karp, Tanja
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=43449113785&partnerID=8YFLogxK
U2 - 10.1109/DCC.2006.2
DO - 10.1109/DCC.2006.2
M3 - Conference article
AN - SCOPUS:43449113785
SN - 1068-0314
SP - 292
EP - 301
JO - Data Compression Conference Proceedings
JF - Data Compression Conference Proceedings
M1 - 1607264
T2 - Data Compression Conference, DCC 2006
Y2 - 28 March 2006 through 30 March 2006
ER -