By Topic

A Fast Method to Approximate Affine-Transform using Control Points with Noise Reduction.

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

4 Author(s)
Kasaei, S. ; Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran ; Mohsen Amiri, S. ; Bassirnia, A. ; Mansouri, P.

Registration is the first challenge in many applications. The performance of many applications such as algorithms highly depend on the performance of registration algorithms. In this paper, a robust method to approximate the affine transform between two images of a scene is proposed. A general method to approximate the transform is to evaluate the performance of the transform by its square error and use a least mean square error optimization method to #nd the transform. The proposed algorithm uses the properties of the Fourier transform in complex domain. Our method is more robust in the mismatching error but it also has more computation cost than the LMSE method (S.K.A. Abadpour and S. Mohsen Amiri, 2005). Some experimental results have been provided to show the efficiency of the proposed algorithm

Published in:

Information and Communication Technologies, 2006. ICTTA '06. 2nd  (Volume:1 )

Date of Conference:

0-0 0