An FFT-Based Full-Search Block Matching Algorithm with Sum of Squared Differences Criterion

Zhen LI  Atushi UEMURA  Hitoshi KIYA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E93-A   No.10   pp.1748-1754
Publication Date: 2010/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E93.A.1748
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Digital Signal Processing
BMA,  cross-correlation,  SSD,  pattern recognition,  motion estimation,  FFT,  

Full Text: PDF(443.8KB)>>
Buy this Article

An FFT-based full-search block matching algorithm (BMA) is described that uses the sum of squared differences (SSD) criterion. The proposed method does not have to extend a real signal into complex one. This reduces the computational load of FFT approaches. In addition, if two macroblocks share the same search window, they can be matched at the same time. In a simulation of motion estimation, the proposed method achieved the same performance as a direct SSD full search and its processing speed is faster than other FFT-based BMAs.