A fast recursive algorithm for binary-valued two-dimensional filters

  • Ferrari L
  • Sklansky J
  • 2


    Mendeley users who have this article in their library.
  • 9


    Citations of this article.


An efficient algorithm for computing the response of a linear spatially varying digital image filter to an arbitrary digital input image is described. This response is the superposition summation of the input image with a digital point spread function (PSF). It is assumed here that the PSF is binary valued. The approach to this computation is based on the Principle of Inclusion and Exclusion. This approach leads to a new efficient algorithm. This algorithm is also efficient when the PSF is spatially invariant. © 1984.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Leonard A. Ferrari

  • Jack Sklansky

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free