Significance-linked connected component analysis for wavelet image coding
IEEE Transactions on Image Processing
Image coding based on a morphological representation of wavelet data
IEEE Transactions on Image Processing
Fast adaptive wavelet packet image compression
IEEE Transactions on Image Processing
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
The set partitioning in hierarchical trees (SPIHT) coding algorithm, proposed by Said and Pearlman, provides effective progressive and embedding property. However, for images with high energy that is randomly dispersed throughout high frequency subbands in the wavelet domain, the SPIHT does not fully exploit energy compaction of the wavelet transform and thus becomes less efficient to represent these images. This paper presents an energy compaction method, block reordering wavelet packet SPIHT (BRWP-SPIHT) coding, to enhance the image visual quality. The block reordering technique divides the wavelet coefficients into blocks and reorders these blocks depending on the significance of each block. The simulation results show that BRWP-SPIHT is superior, on average, to SPIHT by 0.6 dB for texture rich images. Subjectively, it also shows significant enhancement to the quality of the reconstructed image, particularly for images with fractal and oscillatory patterns.