检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘晓芳[1,2] 叶修梓[3] 张三元[1] 张引[1]
机构地区:[1]浙江大学计算机科学与技术学院,浙江杭州310027 [2]中国计量学院信息工程学院,浙江杭州310018 [3]温州大学数学与信息科学学院,浙江温州325035
出 处:《浙江大学学报(工学版)》2012年第11期2044-2051,共8页Journal of Zhejiang University:Engineering Science
基 金:国家"973"重点基础研究发展规划资助项目(2009CB320804);国家自然科学基金资助项目(61272304);国家青年科学基金资助项目(30900332);广东省教育部产学研结合资助项目(2010B090400193;2011B090400546)
摘 要:针对并行磁共振在欠采样率较高情况下重建图像存在的混迭伪影和噪声问题,提出一种非二次正则化的保边性图像重建算法.基于SENSE技术,该算法以保边平滑性的非二次凸函数为正则化项,构建一个非二次代价函数,并运用非线性共轭梯度算法求解该最小化问题,实现并行磁共振图像的保边性重建.为了评价算法的有效性和鲁棒性,以归一化均方误差作为评价准则,分析并行磁共振欠采样率最大时真实数据和仿真数据的图像重建.结果表明,该算法显著减少欠采样率较高时并行磁共振图像的混迭伪影,并能够有效抑制噪声和保留边缘信息.相比于其他图像重建算法,该算法能够快速收敛.Aiming at the images of poor quality resulted from the aliasing artifacts and noise in parallel magnetic resonance imaging,which was reconstructed from high reduction undersampling sensitivity-encoding data,a non-quadratic regularized edge-preserving reconstruction algorithm was proposed.Based on Sensitivity Encoding technique,the algorithm used an edge-preserving non-quadratic convex function as the regularization term,and then a non-quadratic cost function was constructed.Using nonlinear conjugate gradient method,reconstruction image was obtained by minimizing the objective function.In order to evaluate the robust and validity of the proposed algorithm,analysis on severe undersampling data was presented and discussed.Based on the analysis indicator known as normalized mean squared error,the results show that for high acceleration factors,the proposed algorithm evidently reduces the aliasing artifacts in the reconstruction images,and noise is effectively restrained as well as edge information is preserved.Furthermore,the proposed algorithm can be quick convergence.
关 键 词:并行磁共振成像 敏感性编码 非线性共轭梯度 保边性重建 非二次凸函数
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249