Statistical edge detection: learning and evaluating edge cues (2003)
Cached
Download Links
- [www.stat.ucla.edu]
- [www.stat.ucla.edu]
- [www.stat.ucla.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Pattern Analysis and Machine Intelligence |
| Citations: | 44 - 4 self |
BibTeX
@ARTICLE{Konishi03statisticaledge,
author = {S. Konishi and A. L. Yuille and James M. Coughlan and Song Chun Zhu},
title = {Statistical edge detection: learning and evaluating edge cues},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {2003},
volume = {25},
pages = {57--74}
}
Years of Citing Articles
OpenURL
Abstract
We formulate edge detection as statistical inference. This statistical edge detection is data driven, unlike standard methods for edge detection which are model based. For any set of edge detection filters (implementing local edge cues) we use pre-segmented images to learn the probability distributions of filter responses conditioned on whether they are evaluated on or off an edge. Edge detection is formulated as a discrimina-tion task specified by a likelihood ratio test on the filter responses. This approach emphasizes the necessity of modeling the image background (the off-edges). We rep-resent the conditional probability distributions non-parametrically and learn them on two different datasets of 100 (Sowerby) and 50 (South Florida) images. Multiple edges cues, including chrominance and multiple-scale, are combined by using their joint dis-tributions. Hence this cue combination is optimal in the statistical sense. We evaluate the effectiveness of different visual cues using the Chernoff information and Receiver Operator Characteristic (ROC) curves. This shows that our approach gives quantita-tively better results than the Canny edge detector when the image background contains significant clutter. In addition, it enables us to determine the effectiveness of different edge cues and gives quantitative measures for the advantages of multi-level processing, for the use of chrominance, and for the relative effectiveness of different detectors. Fur-thermore, we show that we can learn these conditional distributions on one dataset and adapt them to the other with only slight degradation of performance without knowing the ground truth on the second dataset. This shows that our results are not purely domain specific. We apply the same approach to the spatial grouping of edge cues and obtain analogies to non-maximal suppression and hysteresis.







