Results 11  20
of
118
Analysis And Design Of MinimaxOptimal Interpolators
 IEEE Trans. Signal Proc
, 1998
"... We consider a class of interpolation algorithms, including the leastsquares optimal Yen interpolator, and we derive a closedform expression for the interpolation error for interpolators of this type. The error depends on the eigenvalue distribution of a matrix which is specified for each set of sa ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
(Show Context)
We consider a class of interpolation algorithms, including the leastsquares optimal Yen interpolator, and we derive a closedform expression for the interpolation error for interpolators of this type. The error depends on the eigenvalue distribution of a matrix which is specified for each set of sampling points. The error expression can be used to prove that the Yen interpolator is optimal. The implementation of the Yen algorithm suffers from numerical illconditioning, forcing the use of a regularized, approximate solution. We suggest a new, approximate solution, consisting of a sinckernel interpolator with specially chosen weighting coefficients. The newly designed sinckernel interpolator is compared with the usual sinc interpolator using Jacobian (area) weighting, through numerical simulations. We show that the sinc interpolator with Jacobian weighting works well only when the sampling is nearly uniform. The newly designed sinckernel interpolator is shown to perform better than ...
New Fourier reconstruction algorithms for computerized tomography
"... In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N × N images from their Radon transform. Both algorithms are based on fast Fourier transforms for nonequispaced data (NFFT) and require only O(N²log N) arithmetic operations. While the ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
In this paper, we propose two new algorithms for high quality Fourier reconstructions of digital N &times; N images from their Radon transform. Both algorithms are based on fast Fourier transforms for nonequispaced data (NFFT) and require only O(N&sup2;log N) arithmetic operations. While the rst algorithm includes a bivariate NFFT on the polar grid, the second algorithm consists of several univariate NFFTs on the socalled linogram.
NONLINEAR APPROXIMATION BY SUMS OF EXPONENTIALS AND TRANSLATES
"... In this paper, we discuss the numerical solution of two nonlinear approximation problems. Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Let h be a linear combination of exponentials with real frequencies. Determine all frequ ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we discuss the numerical solution of two nonlinear approximation problems. Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Let h be a linear combination of exponentials with real frequencies. Determine all frequencies, all coefficients, and the number of summands, if finitely many perturbed, uniformly sampled data of h are given. We solve this problem by an approximate Prony method (APM) and prove the stability of the solution in the square and uniform norm. Further, an APM for nonuniformly sampled data is proposed too. The second approximation problem is related to the first one and reads as follows: Let ϕ be a given 1–periodic window function as defined in Section 4. Further let f be a linear combination of translates of ϕ. Determine all shift parameters, all coefficients, and the number of translates, if finitely many perturbed, uniformly sampled data of f are given. Using Fourier technique, this problem is transferred into the above parameter estimation problem for an exponential sum which is solved by APM. The stability of the solution is discussed in the square and uniform norm too. Numerical experiments show the performance of our approximation methods.
An optimal radial profile order based on the golden ratio for timeresolved MRI
 IEEE Trans
, 2007
"... Abstract—In dynamic magnetic resonance imaging (MRI) studies, the motion kinetics or the contrast variability are often hard to predict, hampering an appropriate choice of the image update rate or the temporal resolution. A constant azimuthal profile spacing (111.246), based on the Golden Ratio, is ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In dynamic magnetic resonance imaging (MRI) studies, the motion kinetics or the contrast variability are often hard to predict, hampering an appropriate choice of the image update rate or the temporal resolution. A constant azimuthal profile spacing (111.246), based on the Golden Ratio, is investigated as optimal for image reconstruction from an arbitrary number of profiles in radial MRI. The profile order is evaluated and compared with a uniform profile distribution in terms of signaltonoise ratio (SNR) and artifact level. The favorable characteristics of such a profile order are exemplified in two applications on healthy volunteers. First, an advanced sliding window reconstruction scheme is applied to dynamic cardiac imaging, with a reconstruction window that can be flexibly adjusted according to the extent of cardiac motion that is acceptable. Second, a contrastenhancingspace filter is presented that permits reconstructing an arbitrary number of images at arbitrary time points from one raw data set. The filter was utilized to depict the T1relaxation in the brain after a single inversion prepulse. While a uniform profile distribution with a constant angle increment is optimal for a fixed and predetermined number of profiles, a profile distribution based on the Golden Ratio proved to be an appropriate solution for an arbitrary number of profiles. Index Terms—Projection reconstruction, radial signaltonoise ratio (MRI), realtime imaging, timeresolved imaging. I.
DirectFourier Reconstruction In Tomography And Synthetic Aperture Radar
 Intl. J. Imaging Sys. and Tech
, 1998
"... We investigate the use of directFourier (DF) image reconstruction in computerized tomography and synthetic aperture radar (SAR). One of our aims is to determine why the convolutionbackprojection (CBP) method is favored over DF methods in tomography, while DF methods are virtually always used in SAR ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
We investigate the use of directFourier (DF) image reconstruction in computerized tomography and synthetic aperture radar (SAR). One of our aims is to determine why the convolutionbackprojection (CBP) method is favored over DF methods in tomography, while DF methods are virtually always used in SAR. We show that the CBP algorithm is equivalent to DF reconstruction using a Jacobianweighted 2D periodic sinckernel interpolator. This interpolation is not optimal in any sense, which suggests that DF algorithms utilizing optimal interpolators may surpass CBP in image quality. We consider use of two types of DF interpolation: a windowed sinc kernel, and the leastsquares optimal Yen interpolator. Simulations show that reconstructions using the Yen interpolator do not possess the expected visual quality, because of regularization needed to preserve numerical stability. Next, we show that with a concentricsquares sampling scheme, DF interpolation can be performed accurately and efficiently...
How GPUs can improve the quality of magnetic resonance imaging
 In The First Workshop on General Purpose Processing on Graphics Processing Units
, 2007
"... Abstract — In magnetic resonance imaging (MRI), nonCartesian scan trajectories are advantageous in a wide variety of emerging applications. Advanced reconstruction algorithms that operate directly on nonCartesian scan data using optimality criteria such as leastsquares (LS) can produce significan ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
Abstract — In magnetic resonance imaging (MRI), nonCartesian scan trajectories are advantageous in a wide variety of emerging applications. Advanced reconstruction algorithms that operate directly on nonCartesian scan data using optimality criteria such as leastsquares (LS) can produce significantly better images than conventional algorithms that apply a fast Fourier transform (FFT) after interpolating the scan data onto a Cartesian grid. However, advanced LS reconstructions require significantly more computation than conventional reconstructions based on the FFT. For example, one LS algorithm requires nearly six hours to reconstruct a single threedimensional image on a modern CPU. Our work demonstrates that this advanced reconstruction can be performed quickly and efficiently on a modern GPU, with the reconstruction of a 64 3 3D image requiring just three minutes, an acceptable latency for key applications. This paper describes how the reconstruction algorithm leverages the resources of the GeForce 8800 GTX (G80) to achieve over 150 GFLOPS in performance. We find that the combination of tiling the data and storing the data in the G80’s constant memory dramatically reduces the algorithm’s required bandwidth to offchip memory. The G80’s special functional units provide substantial acceleration for the trigonometric computations in the algorithm’s inner loops. Finally, experimentdriven code transformations increase the reconstruction’s performance by as much as 60 % to 80%. I.
Iterative image reconstruction in MRI with separate magnitude and phase regularization
 In Proc. IEEE Intl. Symp. Biomed. Imag
, 2004
"... Iterative methods for image reconstruction in MRI are useful in several applications, including reconstruction from nonCartesian kspace samples, compensation for magnetic field inhomogeneities, and imaging with multiple receive coils. Existing iterative MR image reconstruction methods are either u ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
Iterative methods for image reconstruction in MRI are useful in several applications, including reconstruction from nonCartesian kspace samples, compensation for magnetic field inhomogeneities, and imaging with multiple receive coils. Existing iterative MR image reconstruction methods are either unregularized, and therefore sensitive to noise, or have used regularization methods that smooth the complex valued image. These existing methods regularize the real and imaginary components of the image equally. In many MRI applications, including T ∗ 2weighted imaging as used in fMRI BOLD imaging, one expects most of the signal information of interest to be contained in the magnitude of the voxel value, whereas the phase values are expected to vary smoothly spatially. This paper proposes separate regularization of the magnitude and phase components, preserving the spatial resolution of the magnitude component while strongly regularizing the phase component. This leads to a nonconvex regularized leastsquares cost function. We describe a new iterative algorithm that monotonically decreases this cost function. The resulting images have reduced noise relative to conventional regularization methods. 1.
Numerical stability of nonequispaced fast Fourier transforms
"... Dedicated to Franz Locher in honor of his 65th birthday This paper presents some new results on numerical stability for multivariate fast Fourier transform of nonequispaced data (NFFT). In contrast to fast Fourier transform (of equispaced data), the NFFT is an approximate algorithm. In a worst case ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Dedicated to Franz Locher in honor of his 65th birthday This paper presents some new results on numerical stability for multivariate fast Fourier transform of nonequispaced data (NFFT). In contrast to fast Fourier transform (of equispaced data), the NFFT is an approximate algorithm. In a worst case study, we show that both approximation error and roundoff error have a strong influence on the numerical stability of NFFT. Numerical tests confirm the theoretical estimates of numerical stability.