By Topic

Fast block matching algorithms using frequency domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aboutajdine, D. ; Lab. associe au CNRST, Univ. Mohamed V-Agdal, Rabat, Morocco ; Essannouni, F.

Translational template matching addresses the registration problem and has long been a problem of interest in such areas as video compression, robot vision, and biomedical engineering. In this paper, we will present new fast algorithms developed in our group for template and block matching purposes using either second or higher order statistics. Fast Fourier transforms (FFTs) have been called one of the ten most important algorithms of the twentieth century. Using some substitutions and complex arithmetic, computation of the sum square differences sum absolute difference and sum fourth order moment are derived to be correlation functions of substituting functions. The former can be computed using the fast Fourier transform (FFT) approach, which is greatly less computationally expensive than the direct computation. The performance of the proposed methods, as well as some illustrative comparisons with other matching algorithms in the literature, are verified through simulations. The algorithm based on the higher order moment is seen to have better performance in terms of fastness and robustness even in low SNR meanwhile the extra computational cost is negligible.

Published in:

Multimedia Computing and Systems (ICMCS), 2011 International Conference on

Date of Conference:

7-9 April 2011