In this paper, two simple yet efficient embedded block-based image compression algorithms are presented. These algorithms not only improve the rate distortion performances of set partitioning in hierarchical trees (SPIHT) and set partitioning in embedded block coder (SPECK) at lower bit rates but also reduces the dynamic memory requirement by 91.1% in comparison to SPIHT. The former objective is achieved by better exploiting the coefficient decaying spectrum of the wavelet transformd images and the later objective is realised by improved listless implementation of the algorithms. The proposed algorithms explicitly perform breadth first search like SPECK. Extensive simulation conducted on various standard grayscale and color images indicate significant peak-signal-to-noise-ratio (PSNR) improvement over most of the state-of-the-art wavelet-based embedded coders including JPEG2000 at lower rates. The reduction of encoding and decoding time as well as improvement in coding efficiency at lower bit rates facilitate these coder as better candidates for multimedia applications.
Coding Efficiency Improvement By Applying Rate-Distortion Optimization To 3D-DCT Based Integral Image Compression Method
