Recursive implementation of the Gaussian filter

Abstract In this paper we propose a recursive implementation of the Gaussian filter. This implementation yields an infinite impulse response filter that has six MADDs per dimension independent of the value of σ in the Gaussian kernel. In contrast to the Deriche implementation (1987), the coefficients of our recursive filter have a simple, closed-form solution for a desired value of the Gaussian σ. Our implementation is, in general, faster than (1) an implementation based upon direct convolution with samples of a Gaussian, (2) repeated convolutions with a kernel such as the uniform filter, and (3) an FFT implementation of a Gaussian filter.

[1]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  A. Papoulis,et al.  The Fourier Integral and Its Applications , 1963 .

[3]  L. J. van Vliet,et al.  Grey-Scale Measurements in Multi-Dimensional Digitized Images , 1993 .

[4]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[5]  Stephen Wolfram,et al.  Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[6]  Lucas J. van Vliet,et al.  Estimators of 2D edge length and position, 3D surface area and position in sampled grey-valued images , 1993 .

[7]  N. Levan,et al.  Systems and signals , 1983 .

[8]  Piet W. Verbeek,et al.  Low-level image processing by max–min filters , 1988 .

[9]  Rachid Deriche Fast Algorithms for Low-Level Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[11]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .