{"title":"Provably convergent coordinate descent in statistical tomographic reconstruction","authors":"S. S. Saquib, Jun Zheng, C. Bouman, K. Sauer","doi":"10.1109/ICIP.1996.561002","DOIUrl":null,"url":null,"abstract":"Statistical tomographic reconstruction algorithms generally require the efficient optimization of a functional. An algorithm known as iterative coordinate descent with Newton-Raphson updates (ICD/NR) has been shown to be much more computationally efficient than indirect optimization approaches based on the EM algorithm. However, while the ICD/NR algorithm has experimentally been shown to converge stably, no theoretical proof of convergence is known. We prove that a modified algorithm, which we call ICD functional substitution (ICD/FS), has guaranteed global convergence in addition to the computational efficiency of the ICD/NR. The ICD/FS method works by approximating the log likelihood at each pixel by an alternative quadratic functional. Experimental results show that the convergence speed of the globally convergent algorithm is nearly identical to that of ICD/NR.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd IEEE International Conference on Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1996.561002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Statistical tomographic reconstruction algorithms generally require the efficient optimization of a functional. An algorithm known as iterative coordinate descent with Newton-Raphson updates (ICD/NR) has been shown to be much more computationally efficient than indirect optimization approaches based on the EM algorithm. However, while the ICD/NR algorithm has experimentally been shown to converge stably, no theoretical proof of convergence is known. We prove that a modified algorithm, which we call ICD functional substitution (ICD/FS), has guaranteed global convergence in addition to the computational efficiency of the ICD/NR. The ICD/FS method works by approximating the log likelihood at each pixel by an alternative quadratic functional. Experimental results show that the convergence speed of the globally convergent algorithm is nearly identical to that of ICD/NR.