Graph Regularized Sparse Coding Method for Highly Undersampled MRI Reconstruction  被引量:1

Graph Regularized Sparse Coding Method for Highly Undersampled MRI Reconstruction

在线阅读下载全文

作  者:张明辉 尹子瑞 卢红阳 吴建华 刘且根 

机构地区:[1]Department of Electronic Information Engineering,Nanchang University

出  处:《Journal of Donghua University(English Edition)》2015年第3期434-441,共8页东华大学学报(英文版)

基  金:National Natural Science Foundations of China(Nos.61362001,61102043,61262084);Technology Foundations of Department of Education of Jiangxi Province,China(Nos.GJJ12006,GJJ14196);Natural Science Foundations of Jiangxi Province,China(Nos.20132BAB211030,20122BAB211015)

摘  要:The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.

关 键 词:magnetic resonance imaging graph regularized sparse coding Bregman iterative method dictionary updating alternating direction method 

分 类 号:Q334[生物学—遗传学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象