MRF的forMRI:通过图切割的MR图像的贝叶斯重建

A. Raj, Gurmeet Singh, R. Zabih
{"title":"MRF的forMRI:通过图切割的MR图像的贝叶斯重建","authors":"A. Raj, Gurmeet Singh, R. Zabih","doi":"10.1109/CVPR.2006.192","DOIUrl":null,"url":null,"abstract":"Markov Random Fields (MRF’s) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRF’s to a non-traditional but important problem in medical imaging: the reconstruction of MR images from raw fourier data. This can be formulated as a linear inverse problem, where the goal is to find a spatially smooth solution while permitting discontinuities. Although it is easy to apply MRF’s to the MR reconstruction problem, the resulting energy minimization problem poses some interesting challenges. It lies outside of the class of energy functions that can be straightforwardlyminimized with graph cuts. We show how graph cuts can nonetheless be adapted to solve this problem, and provide some theoretical analysis of the properties of our algorithm. Experimentally, our method gives very strong performance, with a substantial improvement in SNR when compared with widely-used methods for MR reconstruction.","PeriodicalId":89346,"journal":{"name":"Conference on Computer Vision and Pattern Recognition Workshops. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Workshops","volume":"56 1","pages":"1061-1068"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts\",\"authors\":\"A. Raj, Gurmeet Singh, R. Zabih\",\"doi\":\"10.1109/CVPR.2006.192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Markov Random Fields (MRF’s) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRF’s to a non-traditional but important problem in medical imaging: the reconstruction of MR images from raw fourier data. This can be formulated as a linear inverse problem, where the goal is to find a spatially smooth solution while permitting discontinuities. Although it is easy to apply MRF’s to the MR reconstruction problem, the resulting energy minimization problem poses some interesting challenges. It lies outside of the class of energy functions that can be straightforwardlyminimized with graph cuts. We show how graph cuts can nonetheless be adapted to solve this problem, and provide some theoretical analysis of the properties of our algorithm. Experimentally, our method gives very strong performance, with a substantial improvement in SNR when compared with widely-used methods for MR reconstruction.\",\"PeriodicalId\":89346,\"journal\":{\"name\":\"Conference on Computer Vision and Pattern Recognition Workshops. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Workshops\",\"volume\":\"56 1\",\"pages\":\"1061-1068\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Computer Vision and Pattern Recognition Workshops. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPR.2006.192\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Computer Vision and Pattern Recognition Workshops. IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPR.2006.192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

马尔可夫随机场(MRF)是计算机视觉中实现空间平滑的有效方法。我们描述了核磁共振成像在医学成像中一个非传统但重要的问题的应用:从原始傅里叶数据重建核磁共振图像。这可以被表述为一个线性逆问题,其目标是在允许不连续的情况下找到一个空间平滑的解决方案。虽然磁振函数很容易应用于磁振重建问题,但由此产生的能量最小化问题提出了一些有趣的挑战。它位于能量函数类之外,可以用图切割直接最小化。我们展示了如何利用图切来解决这个问题,并对我们的算法的特性进行了一些理论分析。实验表明,我们的方法具有很强的性能,与广泛使用的MR重建方法相比,信噪比有了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts
Markov Random Fields (MRF’s) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRF’s to a non-traditional but important problem in medical imaging: the reconstruction of MR images from raw fourier data. This can be formulated as a linear inverse problem, where the goal is to find a spatially smooth solution while permitting discontinuities. Although it is easy to apply MRF’s to the MR reconstruction problem, the resulting energy minimization problem poses some interesting challenges. It lies outside of the class of energy functions that can be straightforwardlyminimized with graph cuts. We show how graph cuts can nonetheless be adapted to solve this problem, and provide some theoretical analysis of the properties of our algorithm. Experimentally, our method gives very strong performance, with a substantial improvement in SNR when compared with widely-used methods for MR reconstruction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信