Deep neural network architectures based on unrolling optimization algorithms have been widely adopted in deep-learning based image reconstruction applications in recent years. However, these architectures only mimic the iterative schemes of the corresponding algorithms, but lack rigorous convergence guarantee; and the learned network layers are difficult to interpret. These issues have hindered their applications in clinical use. In this paper, we develop an efficient Learned Descent Algorithm with a Line Search strategy (LDA-LS) and apply it to the nonconvex nonsmooth optimization problem of low-dose CT (LDCT) reconstruction. We show that LDA-LS yields a highly interpretable neural network architecture, where the regularization parameterized as multilayer perception is explicitly integrated into the iterative scheme and learned during the training process. We demonstrate that LDA-LS retains convergence guarantee as classical optimization algorithms, while achieving improved efficiency and accuracy in LDCT image reconstruction problems.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.