{"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 (MRFs) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRFs 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 MRFs 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 (MRFs) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRFs 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 MRFs 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}
MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts
Markov Random Fields (MRFs) are an effective way to impose spatial smoothness in computer vision. We describe an application of MRFs 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 MRFs 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.