Efficient Computation of Convolution of Huge Images

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

SVOBODA David

Year of publication 2011
Type Article in Proceedings
Conference Image Analysis and Processing - ICIAP 2011
MU Faculty or unit

Faculty of Informatics

Citation
Field Use of computers, robotics and its application
Keywords Convolution; Fast Fourier Transform; Divide-et-Impera
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.