By Topic

Image registration with minimum spanning tree 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
$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)
Bing Ma ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Hero, A. ; Gorman, J. ; Michel, O.

Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graph-representation method for image registration with Renyi entropy as the dissimilarity metric between the images. The image matching is performed by minimizing the length of the minimum spanning tree (MST) which spans the graph generated from the overlapped images. Our method also takes advantage of the minimum k-point spanning tree (k-MST) approach to robustify the registration against spurious discrepancies in the images. The proposed algorithm is tested in two applications: registering magnetic resonance (MR) images, and registering an electro-optical image with a terrain height map. In both cases the algorithm is shown to be accurate and robust

Published in:

Image Processing, 2000. Proceedings. 2000 International Conference on  (Volume:1 )

Date of Conference: