Robust Consensus Based Edge Detection
Abstract
A robust algorithm for edge detection is presented. The algorithm detects both roof- and step-type edges. A pixel is declared as an edge pixel if there is a consensus between different processes that try to determine if the pixel lies on a discontinuity. Robust methods are used to estimate local fits to windows in the pixel's neighborhood and accumulate votes from each fit. The use of robust estimators allows the transformation of any window possibly containing a discontinuity to a binary window containing a step edge in the location of the discontinuity. Conventional methods are used to detect this step edge.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Mintz. "Robust Consensus Based Edge Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223210Markdown
[Mintz. "Robust Consensus Based Edge Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/mintz1992cvpr-robust/) doi:10.1109/CVPR.1992.223210BibTeX
@inproceedings{mintz1992cvpr-robust,
title = {{Robust Consensus Based Edge Detection}},
author = {Mintz, Doron},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {651-653},
doi = {10.1109/CVPR.1992.223210},
url = {https://mlanthology.org/cvpr/1992/mintz1992cvpr-robust/}
}