Efficient transforms for multidimensional convolutions
暂无分享,去创建一个
A discrete transform is described for the computation of multidimensional convolutions often encountered in image and array-processing applications. The transform is free of multiplications in all dimensions but one, and has all advantages claimed by the d.f.t. methods.
[1] Henri J. Nussbaumer,et al. Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms , 1978, IBM J. Res. Dev..
[2] Garrett Birkhoff,et al. A survey of modern algebra , 1942 .