{"title":"Total variation based Fourier reconstruction and regularization for computer tomography","authors":"Xiao-Qun Zhang, Jacques Froment","doi":"10.1109/NSSMIC.2005.1596801","DOIUrl":null,"url":null,"abstract":"The paper develops a tomographic reconstruction and regularization method based on a total variation minimization constrained by the knowledge of the input intervals the Fourier coefficients belong to. Experiments show that the approach outperforms classical reconstruction methods such as direct Fourier method (DFM), filtered back-projection (FBP) and Tikhonov iterative method (TIM), both in terms of PSNR (an objective mean-square error) and visual quality, especially in the case of noisy or sparse data. In addition the resulting algorithm requires a number of operations of O(N/sup 2/ log N) only, and is therefore faster than ordinary iterative methods, such as space-based TIM.","PeriodicalId":105619,"journal":{"name":"IEEE Nuclear Science Symposium Conference Record, 2005","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Nuclear Science Symposium Conference Record, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSSMIC.2005.1596801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28
Abstract
The paper develops a tomographic reconstruction and regularization method based on a total variation minimization constrained by the knowledge of the input intervals the Fourier coefficients belong to. Experiments show that the approach outperforms classical reconstruction methods such as direct Fourier method (DFM), filtered back-projection (FBP) and Tikhonov iterative method (TIM), both in terms of PSNR (an objective mean-square error) and visual quality, especially in the case of noisy or sparse data. In addition the resulting algorithm requires a number of operations of O(N/sup 2/ log N) only, and is therefore faster than ordinary iterative methods, such as space-based TIM.