Compressed sensing parallel MRI

来源 :Computational Biomedical Imaging Workshop(2015计算生物医学成像研讨会) | 被引量 : 0次 | 上传用户:xingyu2266
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In the basic compressed sensing magnetic resonance imaging(CSMRI)model with fixed sparsifying transform,fine structure information(called “feature” hereafter in this paper for short)loss is usually observed and becomes especially serious at large acceleration factors.To alleviate this problem,dictionary learning and Bregman iteration techniques have exploited the patch-based sparsity prior to adaptively capture features and updated the acquired k-space data respectively for restoration of lost features.However,dictionary learning based methods usually suffer from high computational complexity due to the huge training matrix and Bregman iterative methods may converge to a noisy image due to the semi-convergence property.In this paper,we propose a novel CS framework by introducing a feature refinement module to the basic CSMRI model without increasing complexity.Unlike the basic CS model or the Bergman iterative method,which either throws away or adds back the residual image obtained from sparsity-promoting denoising,the proposed method extracts only the useful structure information using a feature descriptor,and refines the reconstruction by restoring the features.Numerical experiments on MR images demonstrate that the reconstructed image using the proposed iterative feature refinement scheme can preserve more features compared with other CS methods.
其他文献
会议
会议
会议
  Many problems in image processing and signal recovery with multiregularity terms can be formulated as minimization of three convex separable functions,which
会议
会议
  Nuclear magnetic resonance was first observed in bulk matter by Edward Purcells group at Harvard and Felix Blochs group at Stanford in 1946.Magnetic resonan
会议
会议
会议
会议
会议