Abstract
Compressed sensing (CS) is an effective method to reduce k-space sampling for accelerated MRI data acquisition and reconstruction. Iterative-shrinkage algorithms provide an efficient numerical technique to minimize mixed ll − l2 norm minimization problems. These algorithms utilize a regularization parameter to introduce sparsity in the solution for CS recovery problem. This paper introduces a new method based on geometry factor (g-Factor) as an adaptive regularization parameter. For this purpose, Projection onto Convex Sets (POCS) algorithm is modified to include regularization term in the form of g-Factor and a priori constraint (data consistency) for image reconstruction from the highly under-sampled data. The performance of the proposed algorithm is verified using simulated and actual MRI data. The results show that g-Factor as a regularization parameter provides better image reconstruction from the highly under-sampled data as compared to a fixed regularization parameter in POCS.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
