Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of...Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of this form arise in image reconstruction where A is the matrix describing the imaging device,f is the measured data,φis a regularization term,and B is a derivative operator.The proposed algorithm is designed to handle applications where A is a large dense,ill-conditioned matrix.The algorithm is based on the alternating direction method of multipliers(ADMM)and an approximation to Newton’s method in which a term in Newton’s Hessian is replaced by aBarzilai–Borwein(BB)approximation.It is shown thatADAN converges to a solution of the inverse problem.Numerical results are provided using test problems from parallel magnetic resonance imaging.ADAN was faster than a proximal ADMM scheme that does not employ a BB Hessian approximation,while it was more stable and much simpler than the related Bregman operator splitting algorithm with variable stepsize algorithm which also employs a BB-based Hessian approximation.展开更多
The Sensitivity Encoding (SENSE) parallel reconstruction scheme for magnetic resonance imaging (MRI) is implemented with non-cartesian sampled k-space trajectories in this paper. SENSE has the special capability to re...The Sensitivity Encoding (SENSE) parallel reconstruction scheme for magnetic resonance imaging (MRI) is implemented with non-cartesian sampled k-space trajectories in this paper. SENSE has the special capability to reduce the scanning time for MRI experiments while maintaining the image resolution with under-sampling data sets. In this manner, it has become an increasingly popular technique for multiple MRI data acquisition and image reconstruction schemes. The gridding algorithm is also implemented with SENSE due to its ability in evaluating forward and adjoin operator with non-cartesian sampled data. In this paper, the sensitivity map profile, field map information and the spiral k-space data collected from an array of receiver coils are used to reconstruct unaliased images from under-sampled data. The performance of SENSE with real data set identifies the computational issues to be improved for researched.展开更多
基金This research was partly supported by National Science Foundation(Nos.1115568 and 1016204)by Office of Naval Research Grants(Nos.N00014-11-1-0068 and N00014-15-1-2048).
文摘Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of this form arise in image reconstruction where A is the matrix describing the imaging device,f is the measured data,φis a regularization term,and B is a derivative operator.The proposed algorithm is designed to handle applications where A is a large dense,ill-conditioned matrix.The algorithm is based on the alternating direction method of multipliers(ADMM)and an approximation to Newton’s method in which a term in Newton’s Hessian is replaced by aBarzilai–Borwein(BB)approximation.It is shown thatADAN converges to a solution of the inverse problem.Numerical results are provided using test problems from parallel magnetic resonance imaging.ADAN was faster than a proximal ADMM scheme that does not employ a BB Hessian approximation,while it was more stable and much simpler than the related Bregman operator splitting algorithm with variable stepsize algorithm which also employs a BB-based Hessian approximation.
文摘The Sensitivity Encoding (SENSE) parallel reconstruction scheme for magnetic resonance imaging (MRI) is implemented with non-cartesian sampled k-space trajectories in this paper. SENSE has the special capability to reduce the scanning time for MRI experiments while maintaining the image resolution with under-sampling data sets. In this manner, it has become an increasingly popular technique for multiple MRI data acquisition and image reconstruction schemes. The gridding algorithm is also implemented with SENSE due to its ability in evaluating forward and adjoin operator with non-cartesian sampled data. In this paper, the sensitivity map profile, field map information and the spiral k-space data collected from an array of receiver coils are used to reconstruct unaliased images from under-sampled data. The performance of SENSE with real data set identifies the computational issues to be improved for researched.