A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections

Mohamed GHONEIM  Norimichi TSUMURA  Toshiya NAKAGUCHI  Takashi YAHAGI  Yoichi MIYAKE  

IEICE TRANSACTIONS on Information and Systems   Vol.E92-D   No.2   pp.310-318
Publication Date: 2009/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.310
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Image Processing and Video Processing
video coding,  motion estimation,  adaptive block matching,  integral projection,  

Full Text: PDF(1.9MB)>>
Buy this Article

The block based motion estimation technique is adopted by various video coding standards to reduce the temporal redundancy in video sequences. The core of that technique is the search algorithm implemented to find the location of the best matched block. Indeed, the full search algorithm is the most straightforward and optimal but computationally demanding search algorithm. Consequently, many fast and suboptimal search algorithms have been proposed. Reduction of the number of location being searched is the approach used to decrease the computational load of full search. In this paper, hybridization between an adaptive search algorithm and the full search algorithm is proposed. The adaptive search algorithm benefits from the correlation within spatial and temporal adjacent blocks. At the same time, a feature domain based matching criteria is used to reduce the complexity resulting from applying the pixel based conventional criteria. It is shown that the proposed algorithm produces good quality performance and requires less computational time compared with popular block matching algorithms.