A new fast block matching algorithm using the simplex technique

A new fast technique for block-based motion estimation using the simplex technique is presented. Block-based motion estimation is used in several video compression applications and standards. The simplex search is a fast search technique that converges rapidly towards the minimum point in small or irregular search areas. It starts with a certain initial-point configuration and then moves towards the solution through a set of operations. These operations include reflection, expansion, and contraction. The proposed technique was implemented as part of the MPEG-2 encoder and was compared with different search techniques. The results obtained show that the technique has better performance over some existing techniques in terms of computation complexity and motion estimation accuracy.

[1]  Didier J. Le Gall,et al.  The MPEG video compression algorithm , 1992, Signal Process. Image Commun..

[2]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[3]  P. Pirsch,et al.  Advances in picture coding , 1985, Proceedings of the IEEE.

[4]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[5]  Anil K. Jain,et al.  Displacement Measurement and Its Application in Interframe Image Coding , 1981, IEEE Trans. Commun..

[6]  Eric Viscito,et al.  Hierarchical motion estimation with 2-scale tilings , 1994, Proceedings of 1st International Conference on Image Processing.

[7]  M. GHANBARI,et al.  The cross-search algorithm for motion estimation [image coding] , 1990, IEEE Trans. Commun..

[8]  T Koga,et al.  MOTION COMPENSATED INTER-FRAME CODING FOR VIDEO CONFERENCING , 1981 .