MOTION COMPENSATED COMPRESSED SENSING DYNAMIC MRI WITH LOW RANK PATCH-BASED RESIDUAL RECONSTRUCTION

被引:0
作者
Yoon, Huisu [1 ]
Kim, Kyung Sang [1 ]
Ye, Jong Chul [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Bio & Brain Engn, Taejon 305701, South Korea
来源
2013 IEEE 10TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI) | 2013年
关键词
compressed sensing; motion compensation; dynamic cardiac imaging; k-t FOCUSS; patch; CCCP; low-rank; thresholding; noise reduction;
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
One of the technical challenges of the predication/residual encoding in motion estimated and compensated k-t FOCUSS is that after the prediction, the energy of the residual measurement is significantly reduced compared to the original measurement. This implies that the residual measurement should be judiciously used to recover important geometric features rather than background noise during residual encoding stage. To address this, this paper proposes a novel patch-based residual encoding scheme to exploit geometric similarity in the residual images. In particular, this paper is interested in patch-based low rank constraint from similarity patches [1] since rank structures are relatively less sensitive to global intensity changes but easier to capture edges and etc. To address the nonconvexity and non-smoothess of the rank penalty, a concave-convex procedure is proposed. Experimental results show that the proposed algorithm clearly reconstructs important anatomic structures in cardiac cine image and provides significant performance improvement compared to the existing motion compensated k-t FOCUSS.
引用
收藏
页码:314 / 317
页数:4
相关论文
共 13 条
[11]   MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning [J].
Ravishankar, Saiprasad ;
Bresler, Yoram .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2011, 30 (05) :1028-1041
[12]  
Trzasko JD, 2011, CONF REC ASILOMAR C, P75, DOI 10.1109/ACSSC.2011.6189958
[13]   The concave-convex procedure [J].
Yuille, AL ;
Rangarajan, A .
NEURAL COMPUTATION, 2003, 15 (04) :915-936