Efficient Computation of Convolution of Huge Images
In image processing, convolution is a frequently used operation. It is an important tool for performing basic image enhancement as well as sophisticated analysis. Naturally, due to its necessity and still continually increasing size of processed image data there is a great demand for its efficient implementation. The fact is that the slowest algorithms (that cannot be practically used) implementing the convolution are capable of handling the data of arbitrary dimension and size. On the other hand, the fastest algorithms have huge memory requirements and hence impose image size limits. Regarding the convolution of huge images, which might be the subtask of some more sophisticated algorithm, fast and correct solution is essential. In this paper, we propose a fast algorithm implementing exact computation of the shift invariant convolution over huge multi-dimensional image data.
KeywordsConvolution Fast Fourier Transform Divide-et-Impera
- 1.Parker, J.R.: Algorithms for image processing and computer vision. Wiley, Chichester (1996)Google Scholar
- 2.Gonzalez, R.C., Woods, R.E.: Digital Image Processing. Prentice-Hall, Englewood Cliffs (2002)Google Scholar
- 4.Verveer, P.J.: Computational and optical methods for improving resolution and signal quality in fluorescence microscopy, PhD Thesis. Delft Technical Univ. (1998)Google Scholar
- 8.Smith, S.W.: Digital Signal Processing. Newnes (2002)Google Scholar
- 9.Jan, J.: Digital Signal Filtering, Analysis and Restoration. Telecommunications Series. INSPEC, Inc. (2000) ISBN: 0852967608Google Scholar