首页> 外文会议>IEEE International Workshop on Imaging Systems and Techniques >Two-stage neural network models for MR image reconstruction from sparsely sampled k-space
【24h】

Two-stage neural network models for MR image reconstruction from sparsely sampled k-space

机译:两级神经网络模型,用于稀疏采样k空间的MR图像重建

获取原文

摘要

A novel approach for magnetic resonance imaging (MRI) reconstruction using a two-stage neural network model, involving regularization techniques, is herein presented. The MRI reconstruction problem is considered when the k-space is sparsely scanned. Effective solutions to this problem are indispensable especially when dealing with MRI of dynamic phenomena since then, rapid sampling in k-space is required. The goal in such a case is to reduce the measurement time by omitting as many scanning trajectories as possible. The proposed model involves a regularized Kohonen feature map (SOFM) in the first stage which aims at quantizing the input variable space into smaller regions representative of the input space probability distribution and preserving its original topology, while increasing, on the other hand, cluster distances. This is achieved through adapting not only the winning neuron and its neighboring neurons weights but, also, loosing neurons weights during map's convergence phase. During convergence phase of the map, a group of support vector machines (SVM), associated with its codebook vectors, is simultaneously trained in an online fashion so that each SVM learns to respond when the input data belong to the topological space represented by its corresponding codebook vector. Moreover, these SVMs follow a task specific regularization strategy which aims at incorporating additional information in their training process. It is found that such a model results in an improved image reconstruction performance very favourably compared to the one obtained by the trivial zero-filled k-space approach or traditional more sophisticated interpolation approaches.
机译:本文提出了一种使用两级神经网络模型的磁共振成像(MRI)重建的新方法,包括涉及正则化技术。当K空间稀疏扫描时,考虑MRI重建问题。对于此问题的有效解决方案是必不可少的,特别是在处理动态现象的MRI时,需要在K空间中快速采样。这种情况下的目标是通过省略尽可能多的扫描轨迹来减少测量时间。所提出的模型涉及在第一阶段中的正则化的Kohonen特征图(SOFM),其旨在将输入可变空间量化到代表输入空间概率分布的较小区域并保留其原始拓扑,而另一方面则群集距离。这是通过不仅适应获胜的神经元及其邻近的神经元重量来实现的,而且还可以在地图的会聚阶段失去神经元重量来实现。在地图的收敛阶段期间,与其码本向量相关联的一组支持向量机(SVM),以在线方式同时训练,以便在输入数据属于其对应的拓扑空间时,每个SVM学习响应。码本矢量。此外,这些SVMS遵循任务特定的正则化策略,该策略旨在在其培训过程中纳入其他信息。结果发现,与通过通过琐碎的零填充的k空间方法或传统的更复杂的内插方法相比,这种模型非常有利地产生改善的图像重建性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号