An optimal nonorthogonal separation of the anisotropic Gaussian convolution filter.
We give an analytical and geometrical treatment of what it means to separate a Gaussian kernel along arbitrary axes in R(n), and we present a separation scheme that allows us to efficiently implement anisotropic Gaussian convolution filters for data of arbitrary dimensionality. Based on our previous analysis we show that this scheme is optimal with regard to the number of memory accesses and interpolation operations needed. The proposed method relies on nonorthogonal convolution axes and works completely in image space. Thus, it avoids the need for a fast Fourier transform (FFT)-subroutine. Depending on the accuracy and speed requirements, different interpolation schemes and methods to implement the one-dimensional Gaussian (finite impulse response and infinite impulse response) can be integrated. Special emphasis is put on analyzing the performance and accuracy of the new method. In particular, we show that without any special optimization of the source code, it can perform anisotropic Gaussian filtering faster than methods relying on the FFT.
Lampert
Christoph H
CH
Image Understanding and Pattern Recognition Group, German Research Center for Artificial Intelligence GmbH, 67663 Kaiserslautern, Germany. chl@iupr.net
Wirjadi
Oliver
O
D000465:Algorithms; D016880:Anisotropy; D005374:Filtration / Q000379:methods; D005583:Fourier Analysis; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods; D015233:Models, Statistical; D016011:Normal Distribution; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity