使用约束正弦图恢复的有限角度断层扫描

Jerry L Prince, A. Willsky
{"title":"使用约束正弦图恢复的有限角度断层扫描","authors":"Jerry L Prince, A. Willsky","doi":"10.1109/MDSP.1989.97125","DOIUrl":null,"url":null,"abstract":"Summary form only given. An algorithm that calculates the maximum a posteriori estimate of the complete sinogram has been developed. It uses prior knowledge of the smoothness of the sinogram, fundamental mathematical constraints on the Radon transform, and a complete probabilistic characterization of the observation noise. The object is reconstructed using convolution backprojection applied to the restored sinogram. The observation that many objects of interest tend to have smooth sinograms, although the objects themselves may not be smooth, has been incorporated by defining a Markov random field prior probability on full sinograms, rather than on objects. The Markov random field used is of the simplest kind-nearest neighbor with quadratic potential terms-although more elaborate models can be used. Using a known noise model (zero-mean, Gaussian), the maximum a posteriori solution to the sinogram restoration problem can be formulated. The solution to this problem is a constrained optimization algorithm, and because of the simple form of both the prior and the observation noise, it was possible to develop an iterative primal-dual algorithm that converges quite rapidly too the desired solution.<<ETX>>","PeriodicalId":340681,"journal":{"name":"Sixth Multidimensional Signal Processing Workshop,","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Limited-angel tomography using constrained sinogram restoration\",\"authors\":\"Jerry L Prince, A. Willsky\",\"doi\":\"10.1109/MDSP.1989.97125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. An algorithm that calculates the maximum a posteriori estimate of the complete sinogram has been developed. It uses prior knowledge of the smoothness of the sinogram, fundamental mathematical constraints on the Radon transform, and a complete probabilistic characterization of the observation noise. The object is reconstructed using convolution backprojection applied to the restored sinogram. The observation that many objects of interest tend to have smooth sinograms, although the objects themselves may not be smooth, has been incorporated by defining a Markov random field prior probability on full sinograms, rather than on objects. The Markov random field used is of the simplest kind-nearest neighbor with quadratic potential terms-although more elaborate models can be used. Using a known noise model (zero-mean, Gaussian), the maximum a posteriori solution to the sinogram restoration problem can be formulated. The solution to this problem is a constrained optimization algorithm, and because of the simple form of both the prior and the observation noise, it was possible to develop an iterative primal-dual algorithm that converges quite rapidly too the desired solution.<<ETX>>\",\"PeriodicalId\":340681,\"journal\":{\"name\":\"Sixth Multidimensional Signal Processing Workshop,\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth Multidimensional Signal Processing Workshop,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDSP.1989.97125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth Multidimensional Signal Processing Workshop,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDSP.1989.97125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

只提供摘要形式。提出了一种计算完整正弦图的最大后验估计的算法。它利用了sinogram平滑性的先验知识,Radon变换的基本数学约束,以及观测噪声的完整概率表征。利用卷积反投影对恢复的正弦图进行重建。观察到许多感兴趣的对象倾向于具有光滑的正弦图,尽管对象本身可能不光滑,通过在完整的正弦图上而不是在对象上定义马尔可夫随机场先验概率来结合。使用的马尔可夫随机场是最简单的一类——具有二次势项的最近邻——尽管可以使用更复杂的模型。使用已知的噪声模型(零均值,高斯),正弦图恢复问题的最大后验解可以表述。该问题的解决方案是一种约束优化算法,由于先验和观测噪声的形式都很简单,因此有可能开发出一种迭代的原始对偶算法,该算法可以快速收敛到所需的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Limited-angel tomography using constrained sinogram restoration
Summary form only given. An algorithm that calculates the maximum a posteriori estimate of the complete sinogram has been developed. It uses prior knowledge of the smoothness of the sinogram, fundamental mathematical constraints on the Radon transform, and a complete probabilistic characterization of the observation noise. The object is reconstructed using convolution backprojection applied to the restored sinogram. The observation that many objects of interest tend to have smooth sinograms, although the objects themselves may not be smooth, has been incorporated by defining a Markov random field prior probability on full sinograms, rather than on objects. The Markov random field used is of the simplest kind-nearest neighbor with quadratic potential terms-although more elaborate models can be used. Using a known noise model (zero-mean, Gaussian), the maximum a posteriori solution to the sinogram restoration problem can be formulated. The solution to this problem is a constrained optimization algorithm, and because of the simple form of both the prior and the observation noise, it was possible to develop an iterative primal-dual algorithm that converges quite rapidly too the desired solution.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信