TY - GEN
T1 - Memory-efficient image codec using line-based backward coding of wavelet trees
AU - Ye, Linning
AU - Guo, Jiangling
AU - Nutter, Brian
AU - Mitra, Sunanda
PY - 2007
Y1 - 2007
N2 - Wavelet tree-based image compression algorithms have excellent rate distortion performance. However, they have a major drawback in their memory consumption. A new approach based on backward coding of wavelet trees (BCWT) has been recently developed. Although the BCWT algorithm itself uses much less memory than the SPIHT algorithm, the total system memory usage in BCWT coding is still high due to the large memory consumption of the wavelet transform. In this paper, the line-based BCWT algorithm is presented, which utilizes the line-based wavelet transform to achieve BCWT coding. Due to the backward coding feature of the BCWT algorithm, the line-based BCWT algorithm can significantly reduce the overall system memory usage. Depending upon the image size, the memory usage of the line-based BCWT algorithm can be less than 1% of the memory usage of the SPIHT algorithm. Compared with the original BCWT algorithm, the line-based BCWT algorithm can use less than 2% of the memory that the BCWT algorithm consumes, thus making this algorithm extremely suitable for implementation on resource-limited platforms.
AB - Wavelet tree-based image compression algorithms have excellent rate distortion performance. However, they have a major drawback in their memory consumption. A new approach based on backward coding of wavelet trees (BCWT) has been recently developed. Although the BCWT algorithm itself uses much less memory than the SPIHT algorithm, the total system memory usage in BCWT coding is still high due to the large memory consumption of the wavelet transform. In this paper, the line-based BCWT algorithm is presented, which utilizes the line-based wavelet transform to achieve BCWT coding. Due to the backward coding feature of the BCWT algorithm, the line-based BCWT algorithm can significantly reduce the overall system memory usage. Depending upon the image size, the memory usage of the line-based BCWT algorithm can be less than 1% of the memory usage of the SPIHT algorithm. Compared with the original BCWT algorithm, the line-based BCWT algorithm can use less than 2% of the memory that the BCWT algorithm consumes, thus making this algorithm extremely suitable for implementation on resource-limited platforms.
UR - http://www.scopus.com/inward/record.url?scp=34547635225&partnerID=8YFLogxK
U2 - 10.1109/DCC.2007.55
DO - 10.1109/DCC.2007.55
M3 - Conference contribution
AN - SCOPUS:34547635225
SN - 0769527914
SN - 9780769527918
T3 - Data Compression Conference Proceedings
SP - 213
EP - 222
BT - Proceedings - DCC 2007
Y2 - 27 March 2007 through 29 March 2007
ER -