Interleaving between ant colony optimization and tabu search for image matching

Abstract EN

Image matching plays an important role in many applications such as multi-modality medical imaging and multi-spectral image analysis.

The role of matching is to integrate multiple sources of object information into a single image.

The matching problem consists of determining the unknown transform parameters required to map one image to match the other image (20).

Different non– traditional methods are used for solving this kind of problem.

Among these methods are the Genetic Algorithms, Neural Networks & Simulating Annealing.

Swarm Intelligence (SI) algorithms take their inspiration from the collective behavior of natural, for example, ant colonies, flocks of birds, or fish shoals, a particularly successful strand ant colony optimization (ACO)(1).

Ant Colony Optimization is a population-based general search technique, proposed by Dorigo (1992, 1996), for the solution of difficult combinatorial problems (4).

The studies show that, in nature, the ant colony is able to discover the shortest paths between the nest and food sources very efficiently, such a deposit substance is called pheromone during talking and another ants can smell it, if one of ants find a short path, it feedback on the same path and the value of pheromone on this path increases and a another ants gradually chose this path.

(22) Tabu search is one of the best known heuristic to choose the next neighbor to move on.

At each step, one chooses the best neighbor with respect to specific function (23).

The basic idea in this paper is using Ant Colony Optimization (ACO) & Tabu Search(TS) as a success strategy for matching two images.

The suggestion algorithm evaluation is a good promising solution, by providing an optimal algorithm which is executed by optimal time and coast, I believe that there is no prior research conjoining the two topics in this way.

The program is written in Matlab language (6.5).