| Paper: | IMDSP-P12.1 | ||
| Session: | Image Coding | ||
| Time: | Friday, May 21, 13:00 - 15:00 | ||
| Presentation: | Poster | ||
| Topic: | Image and Multidimensional Signal Processing: Image and Video Coding | ||
| Title: | KERNEL MATCHING PURSUITS PRIORITIZATION OF WAVELET COEFFICIENTS FOR SPIHT IMAGE CODING | ||
| Authors: | Lawrence Carin; Duke University | ||
| Shaorong Chang; Duke University | |||
| Abstract: | 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 performance of the original SPIHT and the modified SPIHT algorithms are compared. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops