1997
DOI: 10.1109/34.643893
|View full text |Cite
|
Sign up to set email alerts
|

A robust visual method for assessing the relative performance of edge-detection algorithms

Abstract: A new method for evaluating edge detection algorithms is presented and applied to measure the relative performance of algorithms by Canny, Nalwa-Binford, Iverson-Zucker, Bergholm, and Rothwell. The basic measure of performance is a visual rating score which indicates the perceived quality of the edges for identifying an object. The process of evaluating edge detection algorithms with this performance measure requires the collection of a set of gray-scale images, optimizing the input parameters for each algorit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
241
0
9

Year Published

2000
2000
2012
2012

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 411 publications
(259 citation statements)
references
References 44 publications
3
241
0
9
Order By: Relevance
“…Gradient estimation from the original 'shapes' test image was used in the comparison. The dashed lines show the comparative results for an implementation of the Spann and Wilson method [11] and a Canny edge-detector [48] with a hysteresis based thresholding. The parameters of the Canny implementation were chosen separately for each input image to produce the most pleasing qualitative results.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Gradient estimation from the original 'shapes' test image was used in the comparison. The dashed lines show the comparative results for an implementation of the Spann and Wilson method [11] and a Canny edge-detector [48] with a hysteresis based thresholding. The parameters of the Canny implementation were chosen separately for each input image to produce the most pleasing qualitative results.…”
Section: Resultsmentioning
confidence: 99%
“…performance on simple shapes and those with sharp features (corners) (figure 7), performance on complex boundary shape ( figure 9(a)-(c)), performance at low inter-class contrast in the presence of noise (graphs 10, 11), Additionally, comparative results are presented using implementations of a quad-tree technique ( [11]), and supervised region-only (MAP estimation using ICM [26], figure 14) and boundary-only methods (Canny edge detection [48], figure 13). …”
Section: Resultsmentioning
confidence: 99%
“…The bottom row in Fig. 3 allows us to compare our results (orange image) with state-of-the-art but edge-only algorithms in computer vision, i.e., Bergholm, Canny, Iverson and Nalwa, see Heath et al (2000) and also http://marathon.csee.usf.edu/edge/edge detection.html. This site shows 12 results of each method obtained with different parameter selections.…”
Section: Line and Edge Detection And Classificationmentioning
confidence: 99%
“…There has been progress both in theoretical modeling of performance [3][4][5] and in empirical performance characterization [6][7][8][9]. Ramesh et al [3] follow a theoretical solution to the problem of parameter selection.…”
Section: Related Workmentioning
confidence: 99%