Performance Evaluation of CS-MRI Reconstruction Algorithms
Performances of various compressed sensing reconstruction algorithms are compared under a common simulation environment with different real and synthetic MRI datasets. From experimental results, it has been observed that composite splitting based algorithms outperform others in terms of reconstruction quality, CPU time, and visual results. Additionally, to demonstrate the effectiveness of iterative reweighting an adaptive weighting scheme is combined with a fast composite splitting algorithm and its improvements are also presented.
- 6.Datta, S., Deka, B.: Efficient adaptive weighted minimization for compressed sensing magnetic resonance image reconstruction. In: Proceedings of the Tenth Indian Conference on Computer Vision, Graphics and Image Processing, ICVGIP 16, pp. 95:1–95:8. ACM, New York (2016)Google Scholar
- 9.Deka, B., Datta, S.: Weighted wavelet tree sparsity regularization for compressed sensing magnetic resonance image reconstruction. In: Advances in Electronics, Communication and Computing, Lecture Notes in Electrical Engineering, vol. 443, pp. 449–457. Springer, Singapore (2017)Google Scholar
- 15.Kim, S., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for largescale \(L_1\)-regularized least squares. IEEE J. Sel. Top. Signal Process. 1(4), 606–617 (2008)Google Scholar
- 17.Ma, S., Yin, W., Zhang, Y., Chakraborty, A.: An efficient algorithm for compressed MR imaging using total variation and wavelets. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008), pp. 1–8. Anchorage, AK (2008)Google Scholar