Convergent Data-Driven Regularizations for CT Reconstruction
-
Published:2024-02-23
Issue:2
Volume:6
Page:1342-1368
-
ISSN:2096-6385
-
Container-title:Communications on Applied Mathematics and Computation
-
language:en
-
Short-container-title:Commun. Appl. Math. Comput.
Author:
Kabri SamiraORCID, Auras Alexander, Riccio DaniloORCID, Bauermeister Hartmut, Benning Martin, Moeller Michael, Burger Martin
Abstract
AbstractThe reconstruction of images from their corresponding noisy Radon transform is a typical example of an ill-posed linear inverse problem as arising in the application of computerized tomography (CT). As the (naïve) solution does not depend on the measured data continuously, regularization is needed to reestablish a continuous dependence. In this work, we investigate simple, but yet still provably convergent approaches to learning linear regularization methods from data. More specifically, we analyze two approaches: one generic linear regularization that learns how to manipulate the singular values of the linear operator in an extension of our previous work, and one tailored approach in the Fourier domain that is specific to CT-reconstruction. We prove that such approaches become convergent regularization methods as well as the fact that the reconstructions they provide are typically much smoother than the training data they were trained on. Finally, we compare the spectral as well as the Fourier-based approaches for CT-reconstruction numerically, discuss their advantages and disadvantages and investigate the effect of discretization errors at different resolutions.
Funder
Deutsche Forschungsgemeinschaft Engineering and Physical Sciences Research Council Alan Turing Institute Deutsches Elektronen-Synchrotron (DESY)
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Adler, J., Öktem, O.: Learned primal-dual reconstruction. IEEE Trans. Med. Imaging 37(6), 1322–1332 (2018). https://doi.org/10.1109/TMI.2018.2799231 2. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311–4322 (2006) 3. Alberti, G.S., De Vito, E., Lassas, M., Ratti, L., Santacesaria, M.: Learning the optimal Tikhonov regularizer for inverse problems. In: Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P.S., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems, vol. 34, pp. 25205–25216. Curran Associates Inc., New York (2021) 4. Ambrosio, L., Gigli, N.: A user’s guide to optimal transport. In: Modelling and Optimisation of Flows on Networks, pp. 1–155. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-32160-3_1 5. Amos, B., Xu, L., Kolter, J.Z.: Input convex neural networks. In: ICML, pp. 146–155. PMLR (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|