By Topic

Image registration using the length code algorithm

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
$33 $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

3 Author(s)
R. A. Baggs ; Dept. of Comput. Sci., Florida Inst. of Technol., Melbourne, FL, USA ; D. E. Tamir ; T. Lam

Traditional image registration algorithms are often computationally intensive and therefore costly and time consuming. For instance, methods based on the cross-correlation function or on the average magnitude difference function (AMDF) involve a considerable amount of computation time. The paper investigates a technique which is referred to as the “length code algorithm”. The length code of an object in an image is the distance between the centroid of the object and a point on the object boundary. An object can therefore be represented as a sequence of length codes. Since the cyclic auto-correlation of a length code sequence is both translational and rotational invariant, the translational and rotational displacements between two images can be determined. A set of experiments devised to compare the cost/performance of length code based image registration to the AMDF based registration shows that the length code algorithm is more efficient than the AMDF. That is, the length code algorithm produces about the same registration result with less computational effort

Published in:

Southeastcon '96. Bringing Together Education, Science and Technology., Proceedings of the IEEE

Date of Conference:

11-14 Apr 1996