Video coding using a deformation compensation algorithm based on adaptive matching pursuit image decompositions

Today's video codecs employ motion compensated prediction in combination with block matching techniques. These techniques, although achieving some level of adaptivity in their latest versions, continue to rely on the decomposition of frames on a set of artificial primitives: blocks. This paper presents a new approach to video coding. A geometrically adaptive image decomposition scheme using an over-complete basis is used to represent the scene. Using matching pursuit (MP), we are able to express local features such as position, anisotropic scale and orientation in terms of a set of spatio-frequential primitives. In order to perform frame prediction, only the changes in the parameters that determine these functions from frame to frame will have to be coded. Such an approach, in addition to being able to catch displacements in images deals as well in a natural way with local scale deformations and local rotations.

[1]  Avideh Zakhor,et al.  Matching pursuit video coding at very low bit rates , 1995, Proceedings DCC '95 Data Compression Conference.

[2]  Minh N. Do,et al.  On the compression of two-dimensional piecewise smooth functions , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[3]  V. Michael Bove,et al.  The coding ecology: image coding via competition among experts , 2000, IEEE Trans. Circuits Syst. Video Technol..

[4]  Avideh Zakhor,et al.  Video compression using matching pursuits , 1999, IEEE Trans. Circuits Syst. Video Technol..

[5]  Pascal Frossard,et al.  Efficient image representation by anisotropic refinement in matching pursuit , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[6]  E. Candès,et al.  Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges , 2000 .

[7]  Pascal Frossard,et al.  A posteriori quantization of progressive matching pursuit streams , 2004, IEEE Transactions on Signal Processing.

[8]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[9]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[10]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[11]  S. Valente Rate/distortion-based combination of multiple DCT transforms for video coding , 2002, Proceedings. International Conference on Image Processing.

[12]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[13]  Pierre Vandergheynst,et al.  R-D analysis of adaptive edge representations , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[14]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[15]  Minh N. Do,et al.  Contourlets: a directional multiresolution image representation , 2002, Proceedings. International Conference on Image Processing.

[16]  Avideh Zakhor,et al.  Very low bit-rate video coding based on matching pursuits , 1997, IEEE Trans. Circuits Syst. Video Technol..

[17]  Avideh Zakhor,et al.  Matching pursuit video coding .I. Dictionary approximation , 2002, IEEE Trans. Circuits Syst. Video Technol..