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

Abstract

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.