Sciweavers

128 search results - page 3 / 26
» The efficient computation of Fourier transforms on the symme...
Sort
View
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
ICIP
2003
IEEE
14 years 9 months ago
Radon transform inversion via Wiener filtering over the Euclidean motion group
Inthispaper we formulatethe Radon transform asa wnvolution integral over the Euclidean motion group (SE(2)) and provideaminimummeansquare error(MMSE) stochastic deconvolution meth...
Can Evren Yarman, Birsen Yazici
SIPS
2008
IEEE
14 years 1 months ago
Efficient image reconstruction using partial 2D Fourier transform
In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, informati...
Lanping Deng, Chi-Li Yu, Chaitali Chakrabarti, Jun...
ACMSE
2006
ACM
13 years 11 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
MICCAI
2008
Springer
14 years 8 months ago
Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant...