Improved MRI Restoration by Integrating Bayesian formalism and Support Vector Machines in a Time Delayed priors Framework

Dimitrios Alexios Karras, Basil G. Mertzios
{"title":"Improved MRI Restoration by Integrating Bayesian formalism and Support Vector Machines in a Time Delayed priors Framework","authors":"Dimitrios Alexios Karras, Basil G. Mertzios","doi":"10.1109/IST.2006.1650802","DOIUrl":null,"url":null,"abstract":"A data acquisition process is needed to form the MR images. Such data acquisition occurs in the spatial frequency (kspace) domain, where sampling theory determines resolution and field of view, and it results in the formation of the kspace matrix. Strategies for reducing image artifacts are often best developed in this domain. After obtaining such a k-space matrix, image reconstruction involves fast multi-dimensional Inverse Fourier transforms, often preceded by data interpolation and re-sampling. Sampling the k-space matrix occurs along suitable trajectories [1,2,3]. Ideally, these trajectories are chosen to completely cover the k-space according to the Nyquist sampling criterion. The measurement time of a single trajectory can be made short. However, prior to initiating a trajectory, return to thermal equilibrium of the nuclear spins needs to be awaited. The latter is governed by an often slow natural relaxation process that is beyond control of the scanner and impedes fast scanning. Therefore, the only way to shorten scan time in MRI when needed, as for instance in functional MRI, is to reduce the overall waiting time by using fewer trajectories, which in turn should individually cover more of k-space through added curvatures. Although, however, such trajectory omissions achieve the primary goal, i.e. more rapid measurements, they entail under-sampling and violations of the Nyquist criterion thus, leading to concomitant problems for image reconstruction. The above mentioned rapid scanning in MRI problem is highly related with two other ones. The first is the selection of the optimal scanning scheme in k-space that is the problem of finding the shape of sampling trajectories that more fully cover the k-space using fewer trajectories. Mainly three such alternative shapes have been considered in the literature and are used in actual scanners, namely, Cartesian, radial and spiral [1], associated with different reconstruction techniques. More specifically, the Cartesian scheme uses the inverse 2D FFT, while the radial and spiral scanning involve the Projection Reconstruction, the linogram or the SRS-FT approaches [1,2,3]. The second one is associated with image estimation from fewer samples in k-space that is the problem of omitting as many trajectories as possible without attaining worse reconstruction results. The main result of such scan trajectories omissions is that we have fewer samples in kspace than needed for estimating all pixel intensities in image space. Therefore, there is infinity of MRI images satisfying the sparse k-space data and thus, the image restoration problem becomes ill-posed. Additionally, omissions usually cause violation of the Nyquist sampling condition. Despite the fact that solutions are urgently needed, in functional MRI for instance, very few research efforts exist in the literature. –The goal of this paper is to present the development of a new image restoration methodology for extracting Magnetic Resonance Images (MRI) from reduced scans in k-space. The proposed approach considers the combined use of Support Vector Machine (SVM) models in a time delayed Bayesian priors framework and Bayesian restoration, in the problem of MR image reconstruction from sparsely sampled k-space, following several different sampling schemes, including spiral and radial. 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 make measurement time smaller by reducing scanning trajectories as much as possible. In this way, however, underdetermined equations are introduced and poor image extraction follows. It is suggested here that significant improvements could be achieved, concerning quality of the extracted image, by judiciously applying time delayed SVM priors and Bayesian estimation methods to the k-space data. More specifically, it is demonstrated that SVM neural network techniques could construct efficient time delayed Bayesian priors and introduce them in the procedure of Bayesian restoration. These time delayed Bayesian Priors are independent of specific image properties and probability distributions. They are based on training SVM neural filters to estimate the missing samples of complex k-space and thus, to improve k-space information capacity. Such a neural filter based time delayed Bayesian prior is integrated to the maximum likelihood procedure involved in the Bayesian reconstruction. It is found that the proposed methodology leads to enhanced image extraction results favorably compared to the ones obtained by the Integrated Bayesian MRI reconstruction approach involving simple and non time delayed SVM models priors [7], by the traditional Bayesian MRI reconstruction approach [1] as well as by the pure Neural Network (NN) filter based reconstruction approach [6].","PeriodicalId":175808,"journal":{"name":"Proceedings of the 2006 IEEE International Workshop on Imagining Systems and Techniques (IST 2006)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2006 IEEE International Workshop on Imagining Systems and Techniques (IST 2006)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IST.2006.1650802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A data acquisition process is needed to form the MR images. Such data acquisition occurs in the spatial frequency (kspace) domain, where sampling theory determines resolution and field of view, and it results in the formation of the kspace matrix. Strategies for reducing image artifacts are often best developed in this domain. After obtaining such a k-space matrix, image reconstruction involves fast multi-dimensional Inverse Fourier transforms, often preceded by data interpolation and re-sampling. Sampling the k-space matrix occurs along suitable trajectories [1,2,3]. Ideally, these trajectories are chosen to completely cover the k-space according to the Nyquist sampling criterion. The measurement time of a single trajectory can be made short. However, prior to initiating a trajectory, return to thermal equilibrium of the nuclear spins needs to be awaited. The latter is governed by an often slow natural relaxation process that is beyond control of the scanner and impedes fast scanning. Therefore, the only way to shorten scan time in MRI when needed, as for instance in functional MRI, is to reduce the overall waiting time by using fewer trajectories, which in turn should individually cover more of k-space through added curvatures. Although, however, such trajectory omissions achieve the primary goal, i.e. more rapid measurements, they entail under-sampling and violations of the Nyquist criterion thus, leading to concomitant problems for image reconstruction. The above mentioned rapid scanning in MRI problem is highly related with two other ones. The first is the selection of the optimal scanning scheme in k-space that is the problem of finding the shape of sampling trajectories that more fully cover the k-space using fewer trajectories. Mainly three such alternative shapes have been considered in the literature and are used in actual scanners, namely, Cartesian, radial and spiral [1], associated with different reconstruction techniques. More specifically, the Cartesian scheme uses the inverse 2D FFT, while the radial and spiral scanning involve the Projection Reconstruction, the linogram or the SRS-FT approaches [1,2,3]. The second one is associated with image estimation from fewer samples in k-space that is the problem of omitting as many trajectories as possible without attaining worse reconstruction results. The main result of such scan trajectories omissions is that we have fewer samples in kspace than needed for estimating all pixel intensities in image space. Therefore, there is infinity of MRI images satisfying the sparse k-space data and thus, the image restoration problem becomes ill-posed. Additionally, omissions usually cause violation of the Nyquist sampling condition. Despite the fact that solutions are urgently needed, in functional MRI for instance, very few research efforts exist in the literature. –The goal of this paper is to present the development of a new image restoration methodology for extracting Magnetic Resonance Images (MRI) from reduced scans in k-space. The proposed approach considers the combined use of Support Vector Machine (SVM) models in a time delayed Bayesian priors framework and Bayesian restoration, in the problem of MR image reconstruction from sparsely sampled k-space, following several different sampling schemes, including spiral and radial. 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 make measurement time smaller by reducing scanning trajectories as much as possible. In this way, however, underdetermined equations are introduced and poor image extraction follows. It is suggested here that significant improvements could be achieved, concerning quality of the extracted image, by judiciously applying time delayed SVM priors and Bayesian estimation methods to the k-space data. More specifically, it is demonstrated that SVM neural network techniques could construct efficient time delayed Bayesian priors and introduce them in the procedure of Bayesian restoration. These time delayed Bayesian Priors are independent of specific image properties and probability distributions. They are based on training SVM neural filters to estimate the missing samples of complex k-space and thus, to improve k-space information capacity. Such a neural filter based time delayed Bayesian prior is integrated to the maximum likelihood procedure involved in the Bayesian reconstruction. It is found that the proposed methodology leads to enhanced image extraction results favorably compared to the ones obtained by the Integrated Bayesian MRI reconstruction approach involving simple and non time delayed SVM models priors [7], by the traditional Bayesian MRI reconstruction approach [1] as well as by the pure Neural Network (NN) filter based reconstruction approach [6].
延迟先验框架下贝叶斯形式和支持向量机的改进MRI恢复
形成磁共振图像需要一个数据采集过程。这样的数据采集发生在空间频率(kspace)域中,其中采样理论决定了分辨率和视场,并导致了kspace矩阵的形成。减少图像伪影的策略通常最好是在这个领域开发的。在获得这样的k空间矩阵后,图像重建涉及到快速的多维傅里叶反变换,在此之前通常需要进行数据插值和重采样。k空间矩阵沿着合适的轨迹进行采样[1,2,3]。理想情况下,根据奈奎斯特抽样准则,选择这些轨迹以完全覆盖k空间。可以缩短单弹道的测量时间。然而,在启动轨道之前,需要等待核自旋回到热平衡状态。后者是由通常缓慢的自然松弛过程控制的,超出了扫描仪的控制,阻碍了快速扫描。因此,在需要时缩短MRI扫描时间的唯一方法,例如在功能MRI中,是通过使用更少的轨迹来减少总体等待时间,而这些轨迹又应该通过增加曲率来单独覆盖更多的k空间。然而,尽管这种轨迹遗漏实现了主要目标,即更快速的测量,但它们会导致采样不足和违反奈奎斯特准则,从而导致伴随的图像重建问题。上述MRI快速扫描问题与另外两个问题密切相关。首先是k空间中最优扫描方案的选择,即使用更少的轨迹找到更充分覆盖k空间的采样轨迹形状的问题。文献中主要考虑了三种可供选择的形状,并在实际扫描仪中使用,即笛卡尔形、径向形和螺旋形[1],它们与不同的重建技术相关。更具体地说,笛卡尔方案使用逆二维FFT,而径向和螺旋扫描涉及投影重建,线性图或SRS-FT方法[1,2,3]。第二个问题与k空间中较少样本的图像估计有关,这是在不获得较差重建结果的情况下忽略尽可能多的轨迹的问题。这种扫描轨迹遗漏的主要结果是,我们在k空间中的样本少于估计图像空间中所有像素强度所需的样本。因此,有无穷多的MRI图像满足稀疏的k空间数据,因此,图像恢复问题变得不适定。此外,遗漏通常会导致违反奈奎斯特采样条件。尽管迫切需要解决方案,例如在功能MRI方面,文献中很少有研究努力。本文的目标是提出一种新的图像恢复方法,用于从k空间的简化扫描中提取磁共振图像(MRI)。该方法考虑了在延迟贝叶斯先验框架和贝叶斯恢复中支持向量机(SVM)模型的结合使用,在稀疏采样的k空间中进行MR图像重建问题,遵循几种不同的采样方案,包括螺旋和径向。这一问题的有效解决是必不可少的,特别是在处理动态现象的MRI时,需要在k空间中快速采样。在这种情况下,目标是通过尽可能减少扫描轨迹来缩短测量时间。然而,这种方法引入了欠定方程,导致图像提取效果不佳。本文建议,通过明智地对k空间数据应用延迟SVM先验和贝叶斯估计方法,可以显著提高提取图像的质量。更具体地说,SVM神经网络技术可以构造有效的时滞贝叶斯先验,并将其引入贝叶斯恢复过程中。这些时间延迟贝叶斯先验是独立于特定的图像属性和概率分布。它们是基于训练SVM神经滤波器来估计复k空间的缺失样本,从而提高k空间的信息容量。将这种基于时滞贝叶斯先验的神经滤波器与贝叶斯重构中的最大似然过程相结合。研究发现,与涉及简单和非时间延迟SVM模型先验的综合贝叶斯MRI重建方法[7]、传统贝叶斯MRI重建方法[1]以及基于纯神经网络(NN)滤波器的重建方法[6]相比,所提出的方法可以获得更好的图像提取结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信