A modified ant colony based approach to digital image edge detection
Ant Colony Optimization (ACO) is a nature inspired meta-heuristic algorithms, which can be applied to a wide range of optimization problems. In this paper we present a modified method for edge detection based on the Ant Colony Optimization. Because of disadvantages of traditional edge detection methods, ACO as a relatively new meta-heuristic approach has been used to solve the edge detection problem. The performance of proposed method is compared with traditional ant colony methods, also we have large number of experiments to find out the suitable threshold for proposed method. The experimental results clearly indicate how the ACO can extracts edges in efficient way, also we speed up the proposed method by modifying the effective parameters in speed of the problem and replacing them by optimized values. The results show that this method is faster and more efficient than other former Ant Colony-based edge detection methods.
Code (1)
Tasks
Edge DetectionSimilar Papers 제목 키워드 기반
A Digital Pheromone-Based Approach for In-Control/Out-of-Control Classification
In complex production lines, it is essential to have strict, fast-acting rules to determine whether the system is In Control (InC) or Out of Control (OutC). This study explores a bio-inspired method that digitally mimics…
An Open Source Computer Vision and Machine Learning Framework for Affordable Life Science Robotic Automation
We present an open-source robotic framework that integrates computer vision and machine learning based inverse kinematics to enable low-cost laboratory automation tasks such as colony picking and liquid handling. The sys…
Semantic SegmentationIntegration of graph clustering with ant colony optimization for feature selection
Feature selection is an important preprocessing step in machine learning and pattern recognition. The ultimate goal of feature selection is to select a feature subset from the original feature set to increase the perfo…
ClusteringCommunity Detectionfeature selectionGeneral Classification+1An Improved ACS Algorithm for the Solutions of Larger TSP Problems
Solving large traveling salesman problem (TSP) in an efficient way is a challenging area for the researchers of computer science. This paper presents a modified version of the ant colony system (ACS) algorithm called Red…
Combinatorial OptimizationTraveling Salesman ProblemNeural Bee Colony Optimization: A Case Study in Public Transit Network Design
In this work we explore the combination of metaheuristics and learned neural network solvers for combinatorial optimization. We do this in the context of the transit network design problem, a uniquely challenging combina…
Combinatorial Optimization