Regularization, Scale-Space, and Edge Detection Filters

Abstract

Computational vision often needs to deal with derivatives of digital images. Such derivatives are not intrinsic properties of digital data; a paradigm is required to make them well-defined. Normally, a linear filtering is applied. This can be formulated in terms of scale-space, functional minimization, or edge detection filters. The main emphasis of this paper is to connect these theories in order to gain insight in their similarities and differences. We take regularization (or functional minimization) as a starting point, and show that it boils down to Gaussian scale-space if we require scale invariance and a semi-group constraint to be satisfied. This regularization implies the minimization of a functional containing terms up to infinite order of differentiation. If the functional is truncated at second order, the Canny-Deriche filter arises.

Cite

Text

Nielsen et al. "Regularization, Scale-Space, and Edge Detection Filters." European Conference on Computer Vision, 1996. doi:10.1007/3-540-61123-1_128

Markdown

[Nielsen et al. "Regularization, Scale-Space, and Edge Detection Filters." European Conference on Computer Vision, 1996.](https://mlanthology.org/eccv/1996/nielsen1996eccv-regularization/) doi:10.1007/3-540-61123-1_128

BibTeX

@inproceedings{nielsen1996eccv-regularization,
  title     = {{Regularization, Scale-Space, and Edge Detection Filters}},
  author    = {Nielsen, Mads and Florack, Luc and Deriche, Rachid},
  booktitle = {European Conference on Computer Vision},
  year      = {1996},
  pages     = {70-81},
  doi       = {10.1007/3-540-61123-1_128},
  url       = {https://mlanthology.org/eccv/1996/nielsen1996eccv-regularization/}
}