dc.contributor.author | Moparthi, Rashmi | |
dc.description.abstract | Ant 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.publisher | North Dakota State University | en_US |
dc.rights | NDSU Policy 190.6.2 | |
dc.title | Speed Optimized Implementation of Ant Colony Optimization Algorithm for Image Edge Detection | en_US |
dc.type | Master's paper | en_US |
dc.date.accessioned | 2016-03-29T18:57:09Z | |
dc.date.available | 2016-03-29T18:57:09Z | |
dc.date.issued | 2016 | |
dc.identifier.uri | http://hdl.handle.net/10365/25557 | |
dc.subject.lcsh | Ant algorithms. | en_US |
dc.subject.lcsh | Image processing -- Digital techniques. | en_US |
dc.subject.lcsh | MATLAB. | en_US |
dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
ndsu.degree | Master of Science (MS) | en_US |
ndsu.college | Engineering | en_US |
ndsu.department | Computer Science | en_US |
ndsu.program | Computer Science | en_US |
ndsu.advisor | Ludwig, Simone | |