Robust Edge Detection

Abstract

A robust edge-detection algorithm which performs equally under a wide variety of noisy situations and a broad range of edges is described. The algorithm is executed in three phases. In phase 1, the step and linear edges are detected from the noise-corrupted image using a statistical classification technique. In phase 2, all the thin-line edges (i.e. which are lines less than two pixels wide) are detected by a supplementary technique since these edges cannot be detected simultaneously with the other step and linear edges. In phase 3, the spurious edge elements are suppressed and the isolated missing edge elements are interpolated using a number of hypothesized edge-segments. Finally some experimental results are provided to illustrate the success of the algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Kundu. "Robust Edge Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1989. doi:10.1109/CVPR.1989.37823

Markdown

[Kundu. "Robust Edge Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1989.](https://mlanthology.org/cvpr/1989/kundu1989cvpr-robust/) doi:10.1109/CVPR.1989.37823

BibTeX

@inproceedings{kundu1989cvpr-robust,
  title     = {{Robust Edge Detection}},
  author    = {Kundu, Amlan},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1989},
  pages     = {11-18},
  doi       = {10.1109/CVPR.1989.37823},
  url       = {https://mlanthology.org/cvpr/1989/kundu1989cvpr-robust/}
}