A constrained ant colony algorithm for image registration

Authors:
Wen Peng;Ruofeng Tong;Guiping Qian;Jinxiang Dong
Affiliations:
State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou;State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou;State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou;State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou
Venue:
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Year:
2006

Citing 5
Cited 1

Landmark-based registration using features identified through differential geometry

Handbook of medical imaging
A Feature-Based, Robust, Hierarchical Algorithm for Registering Pairs of Images of the Curved Human Retina

IEEE Transactions on Pattern Analysis and Machine Intelligence
A new point matching algorithm for non-rigid registration

Computer Vision and Image Understanding - Special issue on nonrigid image registration
Image Registration Using Hierarchical B-Splines

IEEE Transactions on Visualization and Computer Graphics
Fast parametric elastic image registration

IEEE Transactions on Image Processing

A survey on parallel ant colony optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony optimization takes inspiration from the behavior of real ant colony to solve optimization problems. We attach some constraints to ant colony model and present a parallel constrained ant colony model to solve the image registration problem. The problem is represented by a directed graph so that the objective of the original problem becomes to find the shortest closed circuit on the graph under the problem-specific constraints. A number of artificial ants are distributed on the graph and communicate with one another through the pheromone trails which are a form of the long-term memory guiding the future exploration of the graph. The algorithm supports the parallel computation and facilitates quick convergence to the optimal solution. The performance of the proposed method as compared to those of the genetic-based approaches is very promising.