Performance analysis of stereo coding algorithms

We discuss several techniques for stereo image coding. These techniques include those that are directly adapted from motion compensation such as disparity compensation, windowed disparity compensation, and variable block size disparity compensation (quadtree decomposition) as well as a novel stereo coding algorithm that we have previously proposed, namely the subspace projection technique (SPT). Also, combined techniques such as windowed disparity compensation followed by the SPT or variable block size disparity compensation followed by the SPT are implemented. In addition, improvements and modifications for the subspace projection technique are reported. These improvements include a non-statistical significance test for the subspace coefficients, two different implementations of the basic algorithm, a locally optimal bit-allocation scheme, and a new quantization scheme for the projection coefficients. In addition, we compare the rate-distortion performance of our approach to several stereo coding algorithms.

[1]  Avishai Henik,et al.  On stereo image coding , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[2]  Sharad Singhal,et al.  Windowed motion compensation , 1991, Other Conferences.

[3]  Michael G. Perkins,et al.  Data compression of stereopairs , 1992, IEEE Trans. Commun..

[4]  Ezzatollah Salari,et al.  Coding of stereoscopic images , 1993, Electronic Imaging.

[5]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

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

[7]  Hiroyuki Yamaguchi,et al.  Stereoscopic images disparity for predictive coding , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[8]  Monson H. Hayes,et al.  Stereo image coding , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.