Local Smoothness in terms of Variance: the Adaptive GaussianFilter
Author(s) -
Generosa Gómez
Publication year - 2000
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.14.82
Subject(s) - smoothing , classification of discontinuities , smoothness , kernel (algebra) , mathematics , algorithm , gaussian , gaussian blur , variance (accounting) , convolution (computer science) , computer science , artificial intelligence , image (mathematics) , statistics , image restoration , image processing , artificial neural network , mathematical analysis , discrete mathematics , physics , accounting , quantum mechanics , business
Several techniques, such as adaptive smoothing [9, 10] or anisotropic di usion [4, 5] deal with the task of local smoothing. That is, preserving principal discontinuities and smoothing within regions. Unfortunately, these types of iterative techniques have as one of their main drawbacks, the determination of the threshold on the luminance gradient. There is no way to control it easily and researchers often fall into a trial-and-error procedure. In this paper an adaptive Gaussian lter that computes directly the local amount of Gaussian smoothing in terms of variance is presented. The local variance, (x; y), is selected, in a scale-space framework, through the minimal description length criterion (MDL). The MDL allows us to estimate the local smoothing in such a way that it respects the main discontinuities. The resulting smoothed image, in location x; y, is the intensity given by the convolution of the initial point I0(x; y) with its appropriate Gaussian kernel e x 2+y2 2 (x;y) . In fact, the proposed algorithm is not iterative, it is very stable, it is not based on derivatives nor requires any thresholds.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom