Thumbnail
Access Restriction
Subscribed

Author Martelli, Alberto
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Picture processing ♦ Contour following ♦ Contour detection ♦ Shortest path ♦ Problem solving methods ♦ Dynamic programming ♦ Pattern recognition ♦ Heuristic search methods ♦ Edge detection ♦ Optimization problems
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.
Description Affiliation: Istituto di Elaborazione della Informazione del Consiglio Nazionale delle Ricerche (Martelli, Alberto)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 19
Issue Number 2
Page Count 11
Starting Page 73
Ending Page 83


Open content in new tab

   Open content in new tab
Source: ACM Digital Library