A comparison of computations for spatial frequency filtering
- 1 July 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 60 (7) , 887-891
- https://doi.org/10.1109/PROC.1972.8789
Abstract
Three computational algorithms for performing spatial frequency filtering are compared and tradeoffs developed. Although each method is defined by a convolution relation, the convolution computations are different. Equal filter point-spread functions are assumed to effect the comparison. If the filter point-spread function is nonzero only over a small area, then the computation tradeoff is simply the well-known comparison between direct convolution and the fast Fourier trsnsform (FFT). If the filter point-spread function is nonzero over a large area, then a recursive filter is competitive with the FFT. Core memory requirements for this case are smallest with the recursive filter. Experimental examples are given to illustrate the subjective evaluation problem.Keywords
This publication has 3 references indexed in Scilit:
- Minimizing the Computation Time for Using the Technique of Sectioning for Digital Filtering of PicturesIEEE Transactions on Computers, 1972
- Stability and synthesis of two-dimensional recursive filtersIEEE Transactions on Audio and Electroacoustics, 1972
- Digital filter design techniques in the frequency domainProceedings of the IEEE, 1967