Add to ORKGIn this paper, we suggest a new Fourier transform based algorithm for the reconstruction of functions from their nonstandard sampled Radon transform. The algorithm incorpo-rates recently developed fast Fourier transforms for nonequispaced data. We estimate the corresponding aliasing error in dependence on the sampling geometry of the Radon transform and conrm our theoretical results by numerical examples. 2000 Mathematics Subject Classication. 44A12, 65T50 Key words and phrases. Fast Fourier transform for nonequispaced data, Radon transform
In many scientific frameworks (e.g., radio and high energy astronomy, medical imaging) the data at o...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N &...
Abstract. In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruc...
fessler @ umic h.edu The is used widely in signal processing for efficient computation of the Fourie...
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) ...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
We derive a new relation between the discrete Fourier transform of a discrete sampling set of a comp...
Abstract—We provide conditions for exact reconstruction of a bandlimited function from irregular pol...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In many scientific frameworks (e.g., radio and high energy astronomy, medical imaging) the data at o...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N &...
Abstract. In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruc...
fessler @ umic h.edu The is used widely in signal processing for efficient computation of the Fourie...
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) ...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of di...
We derive a new relation between the discrete Fourier transform of a discrete sampling set of a comp...
Abstract—We provide conditions for exact reconstruction of a bandlimited function from irregular pol...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In many scientific frameworks (e.g., radio and high energy astronomy, medical imaging) the data at o...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...
In this paper, we suggest a new Fourier transform based algorithm forthe reconstruction of functions...