Block reordering wavelet packet SPIHT image coding

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Lu, T. T., Wen, K. W., & Chang, P. C. (2001). Block reordering wavelet packet SPIHT image coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2195, pp. 442–449). Springer Verlag. https://doi.org/10.1007/3-540-45453-5_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free