Istituto di Scienza e Tecnologie dell'Informazione     
Martelli A. An application of heuristic search methods to edge and contour detection. Internal note IEI-B73-22, 1973.
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 presented as a shortest path problem on a graph and it can be solved using well-known graph searh algorithms. The relations between this representation of the minimization problem and a dynamic programming approach are discussed, showing that graph search method can lead to substantial improvements in computing time.
Subject picture processing, pattern recognition, edge detection, contour detection, contour following, optimization problems, dynamic programming, shortest path, heuristic search methods.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional