首页> 外文会议>Imaging Systems and Techniques, 2004. (IST). 2004 IEEE International Workshop on >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在输入数据属于其对应的拓扑空间时学会响应码本向量。此外,这些SVM遵循特定于任务的正则化策略,旨在将更多信息纳入其培训过程。已经发现,与通过平凡的零填充k空间方法或传统的更复杂的插值方法获得的模型相比,这种模型可非常有利地改善图像重建性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号