Image enhancement applications are highly dependent on the efficiency of edge detection techniques. This paper presents a new method, which combines the random search mechanisms of Genetic Algorithms with linear time methods. The GA establishes candidate areas as edge containers. Such areas are then investigated by using near-neighbor linear techniques for edge identification and detection. The resulting edge detection process approaches linear time complexity as demonstrated in the experiments.
Most of the vision systems require the use of image processing applications that are highly dependent on the efficiency of edge detection techniques. These techniques are commonly implemented by applying an edge enhancement method followed by a thresholding point process. Most of these techniques are based on convolution algorithms that have a time complexity of O(n2) when the picture has size n x n. In order to reduce this time complexity, an improved solution depends on the reduction of the problem space. Such a reduction was recently achieved by a new method, named GALE, which combines the random search mechanisms of Genetic Algorithms with linear time methods. In this paper, a refinement of the GALE method is accomplished by introducing an iterative process that selectively eliminates from the population of the Genetic Algorithm those pixels that were previously identified as part of an edge. Experimental results show the improved performance of this method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.