An Application of Heuristic Search Methods to Edge and Contour Detection

182Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a method for detecting edges and contours in noisy pictures. The properties of an edge are embedded in a figure of merit and the edge detection problem becomes the problem of minimizing the given figure of merit. This problem can be represented as a shortest path problem on a graph and can be solved using well-known graph search algorithms. The relations between this representation of the minimization problem and a dynamic programming approach are discussed, showing that the graph search method can lead to substantial improvements in computing time. Moreover, if heuristic search methods are used, the computing time will depend on the amount of noise in the picture. Some experimental results are given; these show how various information about the shape of the contour of an object can be embedded in the figure of merit, thus allowing the extraction of contours from noisy pictures and the separation of touching objects. © 1976, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Martelli, A. (1976). An Application of Heuristic Search Methods to Edge and Contour Detection. Communications of the ACM, 19(2), 73–83. https://doi.org/10.1145/359997.360004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free