Fourier-Domain Analysis of the Iterative Landweber Algorithm

作     者：Zeng, Gengsheng L. Li, Ya 

作者机构：Weber State Univ Dept Engn Ogden UT 84408 USA Univ Utah Dept Radiol & Imaging Sci Salt Lake City UT 84108 USA Utah Valley Univ Dept Math Orem UT 84058 USA 

出 版 物：《IEEE TRANSACTIONS ON RADIATION AND PLASMA MEDICAL SCIENCES》 (IEEE Trans. Radiat. Plasma Med. Sci.)

年 卷 期：2017年第1卷第6期

页      面：511-516页

核心收录：

基　　金：NIHUnited States Department of Health & Human ServicesNational Institutes of Health (NIH) - USA [R01HL108350] NATIONAL HEART, LUNG, AND BLOOD INSTITUTEUnited States Department of Health & Human ServicesNational Institutes of Health (NIH) - USANIH National Heart Lung & Blood Institute (NHLBI) [R01HL108350] Funding Source: NIH RePORTER 

主　　题：Fourier transform image reconstruction iterative algorithm linear filter numeric analysis tomography 

摘      要：This paper proposes a novel method of using the frequency-domain transfer function to investigate the property of an iterative algorithm for minimizing a quadratic objective function. This paper focuses on a 2-D tomography problem, which can be X-ray computed tomography (CT), positron emission tomography, and single photon emission CT. Two questions regarding to the linear iterative Landweber algorithm are considered. The first question is whether stopping early is equivalent to getting a minimum-norm solution. The second question is whether the low frequency components always converge first. Our answers to these two questions are No.