Coder selection for lossy compression of still images

Abstract A criterion for selecting a lossy coder for still images is proposed. The “optimum” coder using the proposed criterion is selected to minimize the maximum Chernoff information between the distribution for the original and any distribution from the optimal achievable region. The resulting coder has the property that the best achievable probability of error over the problems of hypothesis testing between these distributions, is greater than the best Bayesian error probability for any other choice of coder. The coder selection procedure may be applied without a knowledge of what distortion measure is more suitable for images or a knowledge of the properties of the human visual perception. Several examples of coder selection are included to illustrate the procedure.

[1]  Xosé R. Fernández-Vidal,et al.  Information Theoretic Measure for Visual Target Distinctness , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Xosé R. Fdez-Vidal,et al.  Computational Models for Predicting Visual Target Distinctness , 2001 .

[3]  Alexander Toet,et al.  Computing visual target distinctness through selective filtering, statistical features, and visual patterns , 2000 .

[4]  Xosé R. Fernández-Vidal,et al.  The role of integral features for perceiving image discriminability , 1997, Pattern Recognit. Lett..

[5]  G. Wallace,et al.  Subjective testing results for still picture compression algorithms for international standardization , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[6]  Tamás Linder,et al.  High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding , 1999, IEEE Trans. Inf. Theory.

[7]  Eero P. Simoncelli,et al.  Progressive wavelet image coding based on a conditional probability model , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Xosé R. Fernández-Vidal,et al.  Best Achievable Compression Ratio for Lossy Image Coding , 2003, IbPRIA.

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[11]  Nico Karssemeijer,et al.  Adaptive Noise Equalization and Image Analysis in Mammography , 1993, IPMI.

[12]  Lyman P. Hurd,et al.  Fractal image compression , 1993 .

[13]  Xosé R. Fernández-Vidal,et al.  The RGFF Representational Model: A System for the Automatically Learned Partitioning of 'Visual Patterns' in Digital Images , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Xosé R. Fernández-Vidal,et al.  Using models of feature perception in distortion measure guidance , 1998, Pattern Recognit. Lett..

[15]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[16]  Pamela C. Cosman,et al.  Tree-structured vector quantization of CT chest scans: image quality and diagnostic accuracy , 1993, IEEE Trans. Medical Imaging.

[17]  Robert M. Gray,et al.  Asymptotic Performance of Vector Quantizers with a Perceptual Distortion Measure , 1997, IEEE Trans. Inf. Theory.

[18]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[19]  John A. Robinson.  Efficient general-purpose image compression with binary tree predictive coding , 1997, IEEE Trans. Image Process..