|
Large Scale Inverse Problem and Optimization
.Introduction We consider the minimization of a smooth convex function regularized by the composite prior models. This problem is generally difficult to solve even each subproblem regularized by one prior model is convex and easy. In this paper, we present two algorithms to effectively solve it. First, the original problem is decomposed into multiple simpler subproblems. Then, these subproblems are efficiently solved by existing techniques in parallel. Finally, the result of the original problem is obtained from the weighted average of solutions of subproblems in an iterative framework. The proposed composite splitting algorithms are applied to the compressed MR image reconstruction and low-rank tensor completion respectively. Numerous experiments demonstrate the superior performance of the proposed algorithm in terms of both the accuracy and computation complexity. .Download Junzhou Huang, Shaoting Zhang and Dimitris Metaxas. "Fast Optimization for Mixture Prior Models", In Proc. of the 11th European Conference on Computer Vision, ECCV'2010. [PDF] [CODE] Junzhou Huang, Shaoting Zhang, Hongsheng Li, Dimitris Metaxas, "Composite Splitting Algorithms for Convex Optimization", Computer Vision and Image Understanding, Volume 115, Number 12, pp. 1610-1622, December 2011.[PDF] [CODE] Junzhou Huang, Shaoting Zhang, Dimitris Metaxas, "Efficient MR Image Reconstruction for Compressed MR Imaging", Medical Image Analysis, Volume 15, Issue 5, pp. 670-679, October 2011. [CODE]
Notice: The codes was tested on Windows and MATLAB 2008. If you have any suggestions or you have found a bug, please contact us via email at jzhuang@uta.edu Efficient Image Reconstruction in Compressive Sensing MRI
Visual Comparison
Performance Comparisons
Related Sources [1] SparseMRI [2] TVMRI [3] RecPF Low Rank Tensor Completion
Visual Comparison
Performance Comparisons
Related Sources
|
|||||||||||||