Projected Iterative Soft-Thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging.

Area of Science:

• Medical Imaging
• Signal Processing
• Computational Science

Background:

• Compressed sensing (CS) offers significant acceleration for Magnetic Resonance Imaging (MRI).
• CS-MRI aims to reconstruct high-quality images rapidly from minimal acquired data.
• Exploiting image sparsity is key to efficient CS-MRI reconstruction.

Purpose of the Study:

• To propose novel, fast algorithms for CS-MRI image reconstruction.
• To introduce the projected iterative soft-thresholding algorithm (pISTA) and its accelerated version, pFISTA.
• To analyze the convergence properties and parameter settings of the proposed algorithms.

Main Methods:

• Development of pISTA and pFISTA algorithms for CS-MRI.
• Utilizing the sparsity of MR images within a tight frame representation.
• Mathematical proof of convergence for pISTA and pFISTA to a convex function minimizer.
• Derivation of an explicit rule for setting the single adjustable parameter (step size) in pFISTA.

Main Results:

• pISTA and pFISTA algorithms demonstrate convergence properties for CS-MRI.
• pFISTA achieves faster convergence speeds compared to state-of-the-art methods.
• Reconstructed image quality (error) is comparable between pFISTA and existing techniques.
• pFISTA exhibits robustness, with reconstruction errors showing insensitivity to the step size parameter.

Conclusions:

• pFISTA is an effective and accelerated algorithm for compressed sensing MRI.
• The proposed algorithms provide a robust and efficient approach to CS-MRI reconstruction.
• The explicit step-size rule enhances the practical applicability of pFISTA.