Share Email Print

Proceedings Paper

Comparing block matching algorithms
Author(s): Hengli Yue; Zhengbing Zhang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 30 August 2002
PDF: 5 pages
Proc. SPIE 4925, Electronic Imaging and Multimedia Technology III, (30 August 2002); doi: 10.1117/12.481554
Show Author Affiliations
Hengli Yue, Jianghan Petroleum Institute (China)
Zhengbing Zhang, Jianghan Petroleum Institute (China)

Published in SPIE Proceedings Vol. 4925:
Electronic Imaging and Multimedia Technology III
LiWei Zhou; Chung-Sheng Li; Yoshiji Suzuki, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?