Sciweavers

13 search results - page 1 / 3
» Nonequispaced Hyperbolic Cross Fast Fourier Transform
Sort
View
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 1 days 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
BILDMED
2008
124views Algorithms» more  BILDMED 2008»
13 years 6 months ago
Non-equispaced Fourier Transform Vs. Polynomial-Based Metal Artifact Reduction in Computed Tomography
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
Bärbel Kratz, Tobias Knopp, Jan Müller 0...
ICIP
2010
IEEE
13 years 2 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Christopher K. Turnes, Justin K. Romberg
JOT
2010
186views more  JOT 2010»
13 years 3 months ago
The Discrete Fourier Transform, Part 6: Cross-Correlation
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
Douglas Lyon
ICASSP
2011
IEEE
12 years 9 months ago
Computationally efficient regularized acoustic imaging
Sparse recovery techniques have been shown to produce very accurate acoustic images, significantly outperforming traditional deconvolution approaches. However, so far these propo...
Flavio P. Ribeiro, Vitor H. Nascimento