A fast and low complexity image codec based on backward coding of wavelet trees

Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja Karp

Research output: Contribution to journalConference articlepeer-review

26 Scopus citations

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.

Original languageEnglish
Article number1607264
Pages (from-to)292-301
Number of pages10
JournalData Compression Conference Proceedings
DOIs
StatePublished - 2006
EventData Compression Conference, DCC 2006 - Snowbird, UT, United States
Duration: Mar 28 2006Mar 30 2006

Fingerprint Dive into the research topics of 'A fast and low complexity image codec based on backward coding of wavelet trees'. Together they form a unique fingerprint.

Cite this