ICA based algorithms for computing optimal 1-D linear block transforms in variable high-rate source coding

  • Authors:
  • Michel Narozny;Michel Barret;Dinh-Tuan Pham

  • Affiliations:
  • SUPELEC, Information Multimodality & Signal Team, 2 rue íí. Belin 57070 Metz, France;SUPELEC, Information Multimodality & Signal Team, 2 rue íí. Belin 57070 Metz, France;Jean Kuntzmann Laboratory, 51 rue des Mathématiques, BP 53, 38041 Grenoble Cedex 9, France

  • Venue:
  • Signal Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.08

Visualization

Abstract

The Karhunen-Loeve Transform (KLT) is optimal for transform coding of Gaussian sources, however, it is not optimal, in general, for non-Gaussian sources. Furthermore, under the high-resolution quantization hypothesis, nearly everything is known about the performance of a transform coding system with entropy constrained scalar quantization and mean-square distortion. It is then straightforward to find a criterion that, when minimized, gives the optimal linear transform under the abovementioned conditions. However, the optimal transform computation is generally considered as a difficult task and the Gaussian assumption is then used in order to simplify the calculus. In this paper, we present the abovementioned criterion as a contrast of independent component analysis modified by an additional term which is a penalty to non-orthogonality. Then we adapt the icainf algorithm by Pham in order to compute the transform minimizing the criterion either with no constraint or with the orthogonality constraint. Finally, experimental results show that the transforms we introduced can (1) outperform the KLT on synthetic signals, (2) achieve slightly better PSNR for high-rates and better visual quality (preservation of lines and contours) for medium-to-low rates than the KLT and 2-D DCT on grayscale natural images.