24 February 2012 An iterative hard thresholding algorithm for CS MRI
Author Affiliations +
The recently proposed compressed sensing theory equips us with methods to recover exactly or approximately, high resolution images from very few encoded measurements of the scene. The traditional ill-posed problem of MRI image recovery from heavily under-sampled κ-space data can be thus solved using CS theory. Differing from the soft thresholding methods that have been used earlier in the case of CS MRI, we suggest a simple iterative hard thresholding algorithm which efficiently recovers diagnostic quality MRI images from highly incomplete κ-space measurements. The new multi-scale redundant systems, curvelets and contourlets having high directionality and anisotropy, and thus best suited for curved-edge representation are used in this iterative hard thresholding framework for CS MRI reconstruction and their performance is compared. The κ-space under-sampling schemes such as the variable density sampling and the more conventional radial sampling are experimented at the same sampling rate and the effect of encoding scheme on iterative hard thresholding compressed sensing reconstruction is studied.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. R. Rajani, S. R. Rajani, M. Ramasubba Reddy, M. Ramasubba Reddy, } "An iterative hard thresholding algorithm for CS MRI", Proc. SPIE 8314, Medical Imaging 2012: Image Processing, 83143W (24 February 2012); doi: 10.1117/12.911244; https://doi.org/10.1117/12.911244

Back to Top