A projection proximal-point algorithm for MR imaging using the hybrid regularization model

Abstract In this paper, we present a fast algorithm for MR image reconstruction based on the TV- L 1 /TGV- L 1 model. By utilizing the connection between the cut operator (called projection operator) and the shrink operator, the proposed algorithm adopts a semi-implicit scheme to get a compact iteration sequence so as to reduce computational cost. By combining the proximal point scheme, we can ensure that the system of linear equations to be solved at each iteration is well-conditioned. In addition, we also give convergence analysis of the proposed method. Numerical results with comparison to the split Bregman algorithm are supplied to demonstrate the efficiency of the proposed algorithm.

[1]  A. Pazy,et al.  On the asymptotic behavior of iterates of nonexpansive mappings in Hilbert space , 1977 .

[2]  Zhi-Feng Pang,et al.  A projection method based on the splitting Bregman iteration for the image denoising , 2011, Journal of Applied Mathematics and Computing.

[3]  Arvid Lundervold,et al.  Noise removal using fourth-order partial differential equation with applications to medical magnetic resonance images in space and time , 2003, IEEE Trans. Image Process..

[4]  Stanley Osher,et al.  Hybrid regularization for mri reconstruction with static field inhomogeneity correction , 2012, 2012 9th IEEE International Symposium on Biomedical Imaging (ISBI).

[5]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[6]  William W. Hager,et al.  Fast Algorithms for Image Reconstruction with Application to Partially Parallel MR Imaging , 2012, SIAM J. Imaging Sci..

[7]  Hanqing Zhao,et al.  A fast algorithm for the total variation model of image denoising , 2010, Adv. Comput. Math..

[8]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[9]  Shiqian Ma,et al.  An efficient algorithm for compressed MR imaging using total variation and wavelets , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Simon Setzer,et al.  Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing , 2011, International Journal of Computer Vision.

[11]  R. Bhatia.  Matrix Analysis , 1996 .

[12]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[13]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[14]  Wotao Yin,et al.  On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers , 2016, J. Sci. Comput..

[15]  Junfeng Yang,et al.  A Fast TVL1-L2 Minimization Algorithm for Signal Reconstruction from Partial Fourier Data , 2008 .

[16]  Yunmei Chen,et al.  Computational Acceleration for MR Image Reconstruction in Partially Parallel Imaging , 2011, IEEE Transactions on Medical Imaging.

[17]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[18]  Karl Kunisch,et al.  Total Generalized Variation , 2010, SIAM J. Imaging Sci..

[19]  P. L. Combettes,et al.  Solving monotone inclusions via compositions of nonexpansive averaged operators , 2004 .

[20]  Junfeng Yang,et al.  A Fast Alternating Direction Method for TVL1-L2 Signal Reconstruction From Partial Fourier Data , 2010, IEEE Journal of Selected Topics in Signal Processing.

[21]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[22]  T. Pock,et al.  Second order total generalized variation (TGV) for MRI , 2011, Magnetic resonance in medicine.