Convergence of iterative image reconstruction algorithms for Digital Breast Tomosynthesis

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

Most iterative image reconstruction algorithms are based on some form of optimization, such as minimization of a data-fidelity term plus an image regularizing penalty term. While achieving the solution of these optimization problems may not directly be clinically relevant, accurate optimization solutions can aid in iterative image reconstruction algorithm design. This issue is particularly acute for iterative image reconstruction in Digital Breast Tomosynthesis (DBT), where the corresponding data model IS particularly poorly conditioned. The impact of this poor conditioning is that iterative algorithms applied to this system can be slow to converge. Recent developments in first-order algorithms are now beginning to allow for accurate solutions to optimization problems of interest to tomographic imaging in general. In particular, we investigate an algorithm developed by Chambolle and Pock (2011 J. Math. Imag. Vol. 40, pgs 120-145) and apply it to iterative image reconstruction in DBT.
Original languageEnglish
Title of host publication2012 IEEE Nuclear Science Symposium and Medical Imaging Conference (NSS/MIC)
PublisherIEEE
Publication date2012
Pages3394-3396
ISBN (print)978-1-4673-2028-3
DOIs
StatePublished

Conference

Conference2012 IEEE Nuclear Science Symposium and Medical Imaging Conference
CountryUnited States
CityAnaheim, CA
Period29/10/1203/11/12
Internet addresshttp://www.nss-mic.org/2012/NSSMain.asp
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 57658135