Share Email Print

Proceedings Paper

Fast block-matching algorithm using selective integral projections
Author(s): Jaehun Lee; Jong Beom Ra
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Existing fast block motion estimation algorithms, which reduce the computation by limiting the number of search points, utilize the motion vector (MV) characteristics of high spatial correlation as well as center-biased distribution in predicting an initial MV. Even though they provide good performance for slow motion sequences, they suffer from poor accuracy for fast or complex motion sequences. In this paper, a new fast and efficient block motion estimation algorithm is proposed. To find an initial search point, in addition to the predictors of zero MV and neighboring MVs, the algorithm utilizes another predictor obtained from one-dimensional feature matching using selective integral projections. This low complexity procedure enables the selection of a better initial search point so that a simple gradient descent search near this point may be enough to find the global minimum point. Compared to recent fast search algorithms, the proposed algorithm has lower computational complexity and provides better prediction performance, especially for fast or complex motion sequences.

Paper Details

Date Published: 4 January 2002
PDF: 10 pages
Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); doi: 10.1117/12.453086
Show Author Affiliations
Jaehun Lee, Korea Advanced Institute of Science and Technology (South Korea)
Jong Beom Ra, Korea Advanced Institute of Science and Technology (South Korea)

Published in SPIE Proceedings Vol. 4671:
Visual Communications and Image Processing 2002
C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top