Translator Disclaimer
Paper
30 August 2002 Comparing block matching algorithms
Author Affiliations +
Abstract
Motion estimation plays an important role in real-time video coding because it can improve compression efficiency greatly. Block matching algorithms are popular in motion estimation. The full search algorithm is the most obvious and simplistic block matching algorithm, but its high computational cost limits its practical use. Many fast algorithms are constantly proposed. Fast algorithms can greatly reduce the computation by only searching selected positions in the search window. In this paper, several block matching algorithms (including FS, TSS, TDL, and CS) are introduced and compared by compute simulation. Experiment results show that the full search algorithm provides high compression with low distortion, but it costs much time; fast algorithms reduce the computational time significantly while suffer performance loss; the three-step search algorithm is the most practicably algorithm in the fast algorithms.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hengli Yue and Zhengbing Zhang "Comparing block matching algorithms", Proc. SPIE 4925, Electronic Imaging and Multimedia Technology III, (30 August 2002); https://doi.org/10.1117/12.481554
PROCEEDINGS
5 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A novel approach to fast motion vector search
Proceedings of SPIE (January 20 2006)
Fast and robust algorithm for global motion estimation
Proceedings of SPIE (January 10 1997)
Coding of arbitrarily shaped regions
Proceedings of SPIE (April 21 1995)

Back to Top