Translator Disclaimer
1 December 2009 Specification of efficient block-matching scheme for motion estimation in video compression
Author Affiliations +
We present an adaptive algorithm that finds the best block-matching results in a computationally constrained and varied environment. The conventional diamond search algorithm, though faster than most known algorithms, is not very robust for sequences with scene variations or significant global motion. To solve this issue, rather than only using one fast motion estimation algorithm, we devise a more adaptive selection of fast motion estimation algorithms. Our adaptive selection approach for fast block search (ASFBS) algorithm uses a diamond search and two new subalgorithms: a cross-three-step search algorithm for large moving images and an advanced cross-diamond search algorithm for small moving images. The proposed ASFBS adapts based on the length of the motion vector, the number of search points, and the matching criteria of the neighboring block. Experimental results show that ASFBS is much more robust; it is faster than other popular fast block-matching algorithms, with smaller distortions.
©(2009) Society of Photo-Optical Instrumentation Engineers (SPIE)
Gwanggil Jeon, Sang-Jun Park, Yong Fang, Marco Anisetti, Valerio Bellandi, Ernesto Damiani, and Jechang Jeong "Specification of efficient block-matching scheme for motion estimation in video compression," Optical Engineering 48(12), 127005 (1 December 2009).
Published: 1 December 2009


A large scale video codec comparison of x264, x265 and...
Proceedings of SPIE (September 27 2016)
Error-resilient video compression
Proceedings of SPIE (November 22 1999)
Fast video segmentation using encoding cost data
Proceedings of SPIE (December 17 1998)

Back to Top