title: A modified SPIHT algorithm for image coding with a joint MSE and classification distortion measure.
abstract: The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient wavelet-based progressive image-compression technique, designed to minimize the mean-squared error (MSE) between the original and decoded imagery. However, the MSE-based distortion measure is not in general well correlated with image-recognition quality, especially at low bit rates. Specifically, low-amplitude wavelet coefficients that may be important for classification are given low priority by conventional SPIHT. In this paper, we use the kernel matching pursuits (KMP) method to autonomously estimate the importance of each wavelet subband for distinguishing between different textures, with textural segmentation first performed via a hidden Markov tree. Based on subband importance determined via KMP, we scale the wavelet coefficients prior to SPIHT coding, with the goal of minimizing a Lagrangian distortion based jointly on the MSE and classification error. For comparison we consider Bayes tree-structured vector quantization (B-TSVQ), also designed to obtain a tradeoff between MSE and classification error. The performances of the original SPIHT, the modified SPIHT, and B-TSVQ are compared.
authors.affiliation: Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708-0291, USA. chshrong@ee.duke.edu
authors.forename: Shaorong
authors.initials: S
authors.lastname: Chang
authors.forename: Lawrence
authors.initials: L
authors.lastname: Carin
mesh_terms: D000465:Algorithms; D003195:Computer Communication Networks; D044962:Data Compression / Q000379:methods*; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016018:Least-Squares Analysis; D008390:Markov Chains; D015233:Models, Statistical; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted