Edge Detection Using Refined Regularization

Abstract

An edge detection algorithm based on the regularization theory in which the smoothness is controlled spatially over the image space is presented. The algorithm starts with an oversmoothed regularized solution and iteratively refines the surface around discontinuities using the knowledge on the structure of discontinuities exhibited in the error signal between the image data and the previous regularized solution. The spatial control of smoothness is shown to resolve the conflict between detection and localization criteria. The adaptive nature of the algorithm eliminates the need to select image-dependent parameters and enables the extraction of multiscale features from the image. The computational aspects of the algorithm as well as its performance on real and synthetic images are considered.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Gökmen and Li. "Edge Detection Using Refined Regularization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139690

Markdown

[Gökmen and Li. "Edge Detection Using Refined Regularization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/gokmen1991cvpr-edge/) doi:10.1109/CVPR.1991.139690

BibTeX

@inproceedings{gokmen1991cvpr-edge,
  title     = {{Edge Detection Using Refined Regularization}},
  author    = {Gökmen, Muhittin and Li, Ching-Chung},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {215-221},
  doi       = {10.1109/CVPR.1991.139690},
  url       = {https://mlanthology.org/cvpr/1991/gokmen1991cvpr-edge/}
}