An Alternating Direction Approximate Newton Algorithm for Ill-Conditioned Inverse Problems with Application to Parallel MRI (original) (raw)
Related papers
Iterative Regularization Methods for a Discrete Inverse Problem in MRI
2008
We propose and investigate efficient numerical methods for inverse problems related to Magnetic Resonance Imaging (MRI). Our goal is to extend the recent convergence results for the Landweber-Kaczmarz method obtained in , in order to derive a convergent iterative regularization method for an inverse problem in MRI.
New algorithms for parallel MRI
Journal of Physics: Conference Series, 2008
Magnetic Resonance Imaging with parallel data acquisition requires algorithms for reconstructing the patient's image from a small number of measured lines of the Fourier domain (k-space).
Generalized reconstruction by inversion of coupled systems (GRICS) applied to parallel MRI
IEEE International Symposium on Biomedical Imaging, 2008
This paper presents a framework allowing parallel MRI to be optimized. Parallel imaging relies on good coil sensitivity map estimates. As these sensitivities are determined experimentally, errors may occur during their assessment, whether using prior calibration (due to patient motion between calibration and actual scan), or autocalibration (due to lower resolution, suboptimal estimates). Here we reformulate reconstruction as a coupled
In this study, we propose a linearized proximal alternating direction method with variable stepsize for solving total variation image reconstruction problems. Our method uses a linearized technique and the proximal function such that the closed form solutions of the subproblem can be easily derived. In the subproblem, we apply a variable stepsize, that is like Barzilai-Borwein stepsize, to accelerate the algorithm. Numerical results with parallel magnetic resonance imaging demonstrate the efficiency of the proposed algorithm.
Robust Solvers for Inverse Imaging Problems Using Dense Single-Precision Hardware
Journal of Mathematical Imaging and Vision, 2009
We present an iterative framework for robustly solving large inverse problems arising in imaging using only single-precision (or other reducedprecision) arithmetic, which allows the use of high-density processors (e.g. Cell BE and Graphics Processing Units). Robustness here means linearconvergence even for large problems (billions of variables), with high levels of noise (signal to noise levels less than unity). This framework handles problems formulated as quadratic and general non-linear minimization problems. Sparse and dense problems can be treated, as long as there are efficient parallelizable matrix-vector products for the transformations involved. Outer iterations correspond to approximate solutions of a quadratic minimization problem, using a single Newton step. Inner iterations correspond to the estimation of the step via truncated Neumann series or minimax polynomial approximations built from operator splittings. Given the simple convergence analysis, this approach can also be used in embedded environments with fixed computation budgets, or certification requirements, like real-time medical imaging. We describe a benchmark problem from MRI, and a series of penalty functions suited to this framework. An important family of such penalties is motivated by both Bilateral Filtering and Total Variation, and we show how they can be optimized using linear programming. We also discuss penalties designed to segment images, and use different types of a priori knowledge, and show numerically that the different penalties are effective when used in combination.