A FFT Based Fast Algorithm for Full Search Block Matching with Sum of Squared Difference Criterion

DOI Web Site 1 Citations 7 References
  • LI Zhen
    Dept. of Information and Communication Systems Engineering, Tokyo Metropolitan University
  • UEMURA Atsushi
    Dept. of Information and Communication Systems Engineering, Tokyo Metropolitan University
  • KIYA Hitoshi
    Dept. of Information and Communication Systems Engineering, Tokyo Metropolitan University

Bibliographic Information

Other Title
  • FFTを用いた全探索SSDブロックマッチングの高速化(ITS画像処理,映像メディア及び一般)
  • FFTを用いた全探索SSDブロックマッチングの高速化
  • FFT オ モチイタ ゼン タンサク SSD ブロックマッチング ノ コウソクカ

Search this article

Abstract

In this paper, we propose a FFT based full search BMA (block matching algorithm) with SSD (sum of squared difference) criterion. The proposed method focus on the relationship between the cyclical cross-correlation and the SSD criterion. By using FFT to calculate the cross-correlation between data in different sizes, the proposed method has a large increase in speed of block matching. Especially, when the intended block is made up of real signals we can finish matching two intended blocks in one time. In the simulation of motion estimation, it shows that the proposed method is more accurate than the conventional method with SAD criterion and is faster than the conventional method with SSD criterion. Compare to the direct SSD full search, the proposed method's processing speed is 10 to 700 times faster.

Journal

  • ITE Technical Report

    ITE Technical Report 33.6 (0), 25-30, 2009

    The Institute of Image Information and Television Engineers

Citations (1)*help

See more

References(7)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top