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 [Haltmeier, Leitao, Scherzer 2007], in order to derive a convergent iterative regularization method for an inverse problem in MRI.
PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization
Institute of Natural Sciences, Shanghai Jiao Tong University(上海交通大学自然科学研究院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);Institute of Natural Sciences, School of Mathematical Sciences, and MOE-LSC, Shanghai Jiao Tong University(上海交通大学自然科学研究院、数学科学学院和教育部计算数学重点实验室)
Recently, the finite-rate-of-innovation (FRI) based continuous domain regularization is emerging as an alternative to the conventional on-the-grid sparse regularization for the compressed sensing (CS) due to its ability to alleviate the basis mismatch between the true support of the shape in the continuous domain and the discrete grid. In this paper, we propose a new off-the-grid regularization for the CS-MRI reconstruction. Following the recent works on two dimensional FRI, we assume that the discontinuities/edges of the image are localized in the zero level set of a band-limited periodic fun…
Connected with the rise of interest in inverse problems is the development and analysis of regularization methods, which are a necessity due to the ill-posedness of inverse problems. Tikhonov-type regularization methods are very popular in this regard. However, its direct implementation for large-scale linear or non-linear problems is a non-trivial task. In such scenarios, iterative regularization methods usually serve as a better alternative. In this paper we propose a new iterative regularization method which uses descent directions, different from the usual gradient direction, that enable a…
In this paper we propose a new class of iterative regularization methods for solving ill-posed linear operator equations. The prototype of these iterative regularization methods is in the form of second order evolution equation with a linear vanishing damping term, which can be viewed not only as an extension of the asymptotical regularization, but also as a continuous analog of the Nesterov's acceleration scheme. New iterative regularization methods are derived from this continuous model in combination with damped symplectic numerical schemes. The regularization property as well as convergenc…
Recently, inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications. After the discretization, many of inverse problems are reduced to linear systems. Due to the typical ill-posedness of inverse problems, the reduced linear systems are often ill-posed, especially when their scales are large. This brings great computational difficulty. Particularly, a small perturbation in the right side of an ill-posed linear system may cause a dramatical change in the solution. Therefore, regularization methods should be …
In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss applicability to the problem of identifying the spatially varying diffusivity in an elliptic PDE from different sets of observations. Among these is a novel hybrid imaging techology known as impedance acoustic tomography, for which we provide numerical experiments.
In this work we consider the image reconstruction problem of sparsely sampled dynamic contrast-enhanced (DCE) magnetic resonance imaging (MRI). DCE-MRI is a technique for acquiring a series of MR images before, during and after intravenous contrast agent administration, and it is used to study microvascular structure and perfusion. To overcome the ill-posedness of the related spatio-temporal inverse problem, we use regularization. In regularization one of the main problems is how to determine the regularization parameter which controls the balance between data fitting term and regularization t…
We investigate the Cauchy problem for linear elliptic operators with $C^\infty$-coefficients at a regular set $Ω\subset R^2$, which is a classical example of an ill-posed problem. The Cauchy data are given at the manifold $Γ\subset \partialΩ$ and our goal is to reconstruct the trace of the $H^1(Ω)$ solution of an elliptic equation at $\partial Ω/ Γ$. The method proposed here composes the segmenting Mann iteration with a fixed point equation associated with the elliptic Cauchy problem. Our algorithm generalizes the iterative method developed by Maz'ya et al., who proposed a method based on solv…
Western Norway University of Applied Sciences(西挪威应用科学大学);University of Warsaw(华沙大学);University of Bergen(卑尔根大学)
We propose a set of iterative regularization algorithms for the TV-Stokes model to restore images from noisy images with Gaussian noise. These are some extensions of the iterative regularization algorithm proposed for the classical Rudin-Osher-Fatemi (ROF) model for image reconstruction, a single step model involving a scalar field smoothing, to the TV-Stokes model for image reconstruction, a two steps model involving a vector field smoothing in the first and a scalar field smoothing in the second. The iterative regularization algorithms proposed here are Richardson's iteration like. We have e…
We analyze sparse frame based regularization of inverse problems by means of a diagonal frame decomposition (DFD) for the forward operator, which generalizes the SVD. The DFD allows to define a non-iterative (direct) operator-adapted frame thresholding approach which we show to provide a convergent regularization method with linear convergence rates. These results will be compared to the well-known analysis and synthesis variants of sparse $\ell^1$-regularization which are usually implemented thorough iterative schemes. If the frame is a basis (non-redundant case), the three versions of sparse…
Many inverse problems are concerned with the estimation of non-negative parameter functions. In this paper, in order to obtain non-negative stable approximate solutions to ill-posed linear operator equations in a Hilbert space setting, we develop two novel non-negativity preserving iterative regularization methods. They are based on fixed point iterations in combination with preconditioning ideas. In contrast to the projected Landweber iteration, for which only weak convergence can be shown for the regularized solution when the noise level tends to zero, the introduced regularization methods e…
These lecture notes for a graduate class present the regularization theory for linear and nonlinear ill-posed operator equations in Hilbert spaces. Covered are the general framework of regularization methods and their analysis via spectral filters as well as the concrete examples of Tikhonov regularization, Landweber iteration, regularization by discretization for linear inverse problems. In the nonlinear setting, Tikhonov regularization and iterative regularization (Landweber, Levenberg-Marquardt, and iteratively regularized Gauß-Newton methods) are discussed. The necessary background from fu…