A class of fast Gaussian binomial filters for speech and image processing
暂无分享,去创建一个
[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 .