A class of fast Gaussian binomial filters for speech and image processing

The authors present an efficient, in-place algorithm for the batch processing of linear data arrays. These algorithms are efficient, easily scaled, and have no multiply operations. They are suitable as front-end filters for a bank of quadrature mirror filters and for pyramid coding of images. In the latter application, the binomial filter was used as the low-pass filter in pyramid coding of images and compared with the Gaussian filter devised by P.J. Burt (Comput. Graph. Image Processing, vol.16, p.20-51, 1981). The binomial filter yielded a slightly larger signal-to-noise ratio in every case tested. More significantly, for an (L+1)*(L+1) image array processed in (N+1)*(N+1) subblocks, the fast Burt algorithm requires a total of 2(L+1)/sup 2/N adds and 2(L+1)/sup 2/ (N/2+1) multiplies. The binomial algorithm requires 2L/sup 2/N adds and zero multiplies. >

[1]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[2]  P. J. Burt,et al.  Fast Filter Transforms for Image Processing , 1981 .

[3]  Jan M. Van Campenhout,et al.  Maximum entropy and conditional probability , 1981, IEEE Trans. Inf. Theory.

[4]  Nevio Benvenuto,et al.  Dynamic programming methods for designing FIR filters using coefficients -1, 0 and +1 , 1986, IEEE Trans. Acoust. Speech Signal Process..

[5]  Shalhav Zohar,et al.  The Solution of a Toeplitz Set of Linear Equations , 1974, JACM.

[6]  R. A. Haddad,et al.  Efficient filtering of images using binomial sequences , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[7]  R. Haddad.  A class of orthogonal nonrecursive binomial filters , 1971 .

[8]  B. Liu,et al.  An approach to programmable CTD filters using coefficients 0, + 1, and -1 , 1980 .

[9]  KENNETH R. SLOAN,et al.  Progressive Refinement of Raster Images , 1979, IEEE Transactions on Computers.

[10]  G. B. Lockhart.  Binary transversal filters with quantised coefficients , 1971 .

[11]  Using Coefficients.  Realization of Finite Impulse Response Filters , 1985 .

[12]  C. Barnes,et al.  Block-shift invariance and block implementation of discrete-time filters , 1980 .

[13]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[14]  Wolfgang F. G. Mecklenbräuker,et al.  A New Type of Digital Filter for Data Transmission , 1975, IEEE Trans. Commun..

[15]  P. Burt.  Fast filter transform for image processing , 1981 .