Robust Point Correspondence for Image Registration Using Optimization with Extremal Dynamics

Authors:
Souham Meshoul;Mohamed Batouche
Affiliations:
-;-
Venue:
Proceedings of the 24th DAGM Symposium on Pattern Recognition
Year:
2002

Citing 4
Cited 3

A survey of image registration techniques

ACM Computing Surveys (CSUR)
Nature's way of optimizing

Artificial Intelligence
Robust Point Correspondence Applied to Two-and Three-Dimensional Image Registration

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimization with extremal dynamics

Complexity - Complex Adaptive systems: Part I

A Multiresolution Approach Based on MRF and Bak-Sneppen Models for Image Segmentation

Informatica
Multimodal genetic algorithms-based algorithm for automatic point correspondence

Pattern Recognition
Self-organizing dynamics for optimization

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Robust Point Correspondence for image registration is still a challenging problem in computer vision and many of its related applications. It is a computationally intensive task which requires an expensive search process especially when issues of noisy and outlying data have to be considered. In this paper, we cast the problem as a combinatorial optimization task and we solve it using extremal optimization, a new general purpose heuristic recently proposed by Boettcher and colleagues. We show how this heuristic has been tailored to the point correspondence problem and resulted in an efficient outlier removal scheme. Experimental results are very encouraging and demonstrate the ability of the proposed method in identifying outliers and achieving robust matching.