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

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Ferrari, L. A., & Sklansky, J. (1984). A fast recursive algorithm for binary-valued two-dimensional filters. Computer Vision, Graphics and Image Processing, 26(3), 292–302. https://doi.org/10.1016/0734-189X(84)90214-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free