论文信息 - Some algorithms for approximating convolutions

Some algorithms for approximating convolutions

Abstract This paper presents some algorithms for approximating two-dimensional convolution operators of size n × n , n odd, by a product, or sum of products, of 3 × 3 convolutions. Inaccuracies resulting from the approximation as well as from fixed point computation are discussed and examples are given.

Dianne P. O'Leary | D. O’Leary

[1] S. Treitel,et al. The Design of Multistage Separable Planar Filters , 1971 .

[2] Thomas S. Huang,et al. Recent advances in picture processing and digital filtering , 1979 .

[3] G. Stewart. Introduction to matrix computations , 1973 .

[4] Peter Pistor,et al. Stability Criterion for Recursive Filters , 1974, IBM J. Res. Dev..

[5] John E. Dennis,et al. Algorithm 573: NL2SOL—An Adaptive Nonlinear Least-Squares Algorithm [E4] , 1981, TOMS.

[6] Sanjit K. Mitra,et al. Sum and product separabilities of multivariable functions and applications , 1975 .

[7] M. Fahmy,et al. Recursibility of N-dimensional IIR digital filters , 1984 .

[8] Sanjit K. Mitra,et al. Two-dimensional digital signal processing , 1978 .

[9] G. Maria,et al. An l p design technique for two-dimensional digital recursive filters , 1974 .