Abstract

We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can be used as input to higher-level models. Different edge cues can be evaluated by the statistical effectiveness of their corresponding filters evaluated on a dataset of 100 presegmented images. We use information theoretic measures to determine the effectiveness of a variety of different edge detectors working at multiple scales on black and white and color images. Our results give quantitative measures for the advantages of multi-level processing, for the use of chromaticity in addition to greyscale, and for the relative effectiveness of different detectors.

Keywords

Enhanced Data Rates for GSM EvolutionGrayscaleEdge detectionComputer scienceArtificial intelligenceChromaticityInferenceDetectorComputer visionPattern recognition (psychology)MathematicsPixelImage processingImage (mathematics)

Affiliated Institutions

Related Publications

Publication Info

Year
2003
Type
article
Pages
573-579
Citations
87
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

87
OpenAlex

Cite This

S. Konishi, Alan Yuille, James M. Coughlan et al. (2003). Fundamental bounds on edge detection: an information theoretic evaluation of different edge cues. , 573-579. https://doi.org/10.1109/cvpr.1999.786996

Identifiers

DOI
10.1109/cvpr.1999.786996