PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Martelli A. An application of heuristic search methods to edge and contour detection. In: Communications of the ACM, vol. 19 (n) pp. 73 - 83. W. Newman Editor, 1975.
 
 
Abstract
(English)
This paper presents a method for detecting edges and contours in noisy pictures. The properties of and edge are embedded in a figure of merit and the edge detection problem becames 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 weel-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 grom noisy pictures and the separation of touching objects.
Subject Picture processing
Pattern recognition
Edge/contour detection


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