FAST ALGORITHMS FOR LOW-LEVEL VISION

We propose in this paper a recursive filtering structure that drastically reduces the computational effort required for smoothing, performing the first and second directional derivatives or carrying out the Laplacian of an image. These operations are done with a fixed number of multiplications and additions per output point independently of the size of the neighborhood considered. The key to our approach is first the use of an exponentially based filter family and second the use of the recursive filtering. Applications to edge detection problems and multiresolution techniques are considered and a new edge detector allowing the extraction of zero-crossings of an image with only 14 operations per output element at any resolution is proposed. Various experimental results are shown. © 1990 IEEE.