Paper
30 August 2002 Comparing block matching algorithms
Hengli Yue, Zhengbing Zhang
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
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Motion estimation

Algorithm development

Video coding

Computer simulations

Distortion

Video

Electronics engineering

RELATED CONTENT

A novel approach to fast motion vector search
Proceedings of SPIE (January 20 2006)
A novel approach to skip mode decision for H.264
Proceedings of SPIE (January 28 2008)

Back to Top