Show simple item record

dc.contributor.authorMoparthi, Rashmi
dc.description.abstractAnt Colony algorithm (ACO) is an approach used to provide a solution to an optimization problem. ACO follows the mechanism adapted by Ants to search for optimal paths by performing combined activity of all ants in the colony. Ants adopt a probabilistic approach to solve problems of path discovery and alike. The behavior of ants has been mapped to a scientific algorithm to solve optimization problems. Different modified optimization variants have been run on the basic algorithm that resulted in in efficient and effective systems for solving different optimization problems including in the area of image processing. Study in this paper is applying ACO algorithm to solve the problem of image edge detection by modifying the algorithm to improve its efficiency and speed. The algorithm has been implemented in MATLAB and its speed has been enhanced by about 40-50 percent using the vectorization of different processes of the algorithm.en_US
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU Policy 190.6.2
dc.titleSpeed Optimized Implementation of Ant Colony Optimization Algorithm for Image Edge Detectionen_US
dc.typeMaster's paperen_US
dc.date.accessioned2016-03-29T18:57:09Z
dc.date.available2016-03-29T18:57:09Z
dc.date.issued2016
dc.identifier.urihttp://hdl.handle.net/10365/25557
dc.subject.lcshAnt algorithms.en_US
dc.subject.lcshImage processing -- Digital techniques.en_US
dc.subject.lcshMATLAB.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdf
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeEngineeringen_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US
ndsu.advisorLudwig, Simone


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record