Hierarchical image segmentation using ant colony and chemical computing approach

Authors:
Pooyan Khajehpour;Caro Lucas;Babak N. Araabi
Affiliations:
Control and Intelligent Processing Center of Excellence, Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Control and Intelligent Processing Center of Excellence, Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Control and Intelligent Processing Center of Excellence, Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 8
Cited 2

Digital Image Processing

Digital Image Processing
Computing in nonlinear media and automata collectives

Computing in nonlinear media and automata collectives
Artificial chemistries—a review

Artificial Life
An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Competing Ant Colonies to Solve k-way Partitioning Problems with Foraging and Raiding Strategies

ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Ant Colony Optimization

Ant Colony Optimization
Ai Application Programming (Charles River Media Programming)

Ai Application Programming (Charles River Media Programming)
Ant colony optimization for routing and load-balancing: survey and new directions

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

3-D object segmentation using ant colonies

Pattern Recognition
An efficient ant-based edge detector

Transactions on computational collective intelligence I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new method for hierarchical image segmentation. The hierarchical structure is represented by a binary tree with the main image as its root. At the lower levels, each node stands as one image segment, which is described by a weighted graph and may be divided into two new segments at the next level through a specific cut. Graph bi-sectioning is done by the self organizing property of ant systems. Ants are free to wander over one image segment graph to find the best cut on it. When an ant finds a suitable cut, it returns to its colony and leaves a proper value of pheromone over its trail to attract other ants to that cut. By using the Chemical Computing approach in this paper, it is assumed the mobile hormones (pheromone) are secreted which can diffuse around initial positions and attract more ants to the found cut. The advantages of this assumption are reducing the noise effects and improving the convergence speed of ants to find a new selected image segment, which can be seen in the practical results.