84 search results - page 10 / 17 » Fast Convolution |
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
SIAMSC
2010
13 years 2 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
MICCAI
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large clas...
TIP
2008
13 years 7 months ago
2008
Abstract--A new grid conversion method is proposed to resample between two 2-D periodic lattices with the same sampling density. The main feature of our approach is the symmetric r...
MICCAI
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. Curves are often used as anatomical features to match surfaces that represent biological objects, such as the human brain. Automated and semi-automated methods for extrac...