Kernel matching pursuits prioritization of wavelet coefficients for SPIHT image coding

Shaorong Chang, Lawrence Carin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


The set partitioning in hierarchical trees (SPIHT), an efficient wavelet-based progressive image-compression scheme, is oriented to minimize the mean-squared error (MSE) between the original and decoded imagery. In this paper, we use the kernel matching pursuits (KMP) method to estimate the importance of each wavelet sub-band for distinguishing between different textures segmented by an HMT mixture model. Before the SPIHT coding, we weight the wavelet coefficients, with the goal of achieving improved image-classification results at low bit rates. A modified SPIHT algorithm is proposed to improve the coding efficiency. The performances of the original SPIHT and the modified SPIHT algorithms are compared.
Original languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - Sep 28 2004
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2021-02-09


Dive into the research topics of 'Kernel matching pursuits prioritization of wavelet coefficients for SPIHT image coding'. Together they form a unique fingerprint.

Cite this