A fully automatic method for feature-based image registration

Most applications in computer vision rely heavily on a common task: the registration of a reference image with a newly sensed one. We propose a feature-based method for reliably registering two images. This method uses points of interest as feature space, rigid transformations as search space and as a novelty, a search strategy based on extremal optimization. Feature extraction and feature matching are the main crucial steps for feature-based image registration and so far no general method exists to solve both of them. Due to the results of the feature extraction step, feature matching may be computationally intensive. The search strategy we propose is able to reduce the complexity of feature matching and to withstand the effect of outliers. It integrates the search in the transformation space with the search in the feature correspondence space and progressively eliminates bad matches which results in robustly estimating the registering transformation parameters. Experimental results on a wide range of image pairs are very encouraging and demonstrate the effectiveness of the proposed method.

[1]  Sreeparna Banerjee,et al.  Shape matching in multimodal medical images using point landmarks with Hopfield net , 2000, Neurocomputing.

[2]  Siamak Khorram,et al.  A feature-based image registration algorithm using improved chain-code representation combined with invariant moments , 1999, IEEE Trans. Geosci. Remote. Sens..

[3]  Keith E. Price,et al.  Relaxation Matching Techniques-A Comparison , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Karl Rohr On 3D differential operators for detecting point landmarks , 1997, Image Vis. Comput..

[5]  Stefan Boettcher,et al.  Optimization with Extremal Dynamics , 2000, Complex..

[6]  Per Bak,et al.  How Nature Works , 1996 .

[7]  Bak,et al.  Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.

[8]  Lisa M. Brown,et al.  A survey of image registration techniques , 1992, CSUR.

[9]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..

[10]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..

[11]  Stefan Boettcher,et al.  Extremal Optimization for Graph Partitioning , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  George C. Stockman,et al.  Matching Images to Models for Registration and Object Detection via Clustering , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Karl Rohr,et al.  Extraction of 3d anatomical point landmarks based on invariance principles , 1999, Pattern Recognit..

[14]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[15]  Eric Mjolsness,et al.  New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence , 1998, NIPS.

[16]  David M. Mount,et al.  Efficient algorithms for robust feature matching , 1999, Pattern Recognit..

[17]  Mark Hedley,et al.  Fast corner detection , 1998, Image Vis. Comput..

[18]  Richard A. Baldock,et al.  Robust Point Correspondence Applied to Two-and Three-Dimensional Image Registration , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Kenichi Kanatani,et al.  Analysis of 3-D Rotation Fitting , 1994, IEEE Trans. Pattern Anal. Mach. Intell..