Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction
Not on the map. Why?
Abstract (arXiv)
In computed tomography (CT), the forward model consists of a linear Radon transform followed by an exponential nonlinearity based on the attenuation of light according to the Beer-Lambert Law. Conventional reconstruction often involves inverting this nonlinearity and then solving a linear inverse problem. However, this nonlinear measurement preprocessing is poorly conditioned in the vicinity of high-density materials, such as metal. This preprocessing makes CT reconstruction methods numerically sensitive and susceptible to artifacts near high-density regions. In this paper, we study a technique where the signal is directly reconstructed from raw measurements through the nonlinear forward model. Though this optimization is nonconvex, we show that gradient descent provably converges to the global optimum at a geometric rate, perfectly reconstructing the underlying signal with a near minimal number of random measurements. We also prove similar results in the under-determined setting where the number of measurements is significantly smaller than the dimension of the signal. This is achieved by enforcing prior structural information about the signal through constraints on the optimization variables. We illustrate the benefits of direct nonlinear CT reconstruction with cone-beam CT experiments on synthetic and real 3D volumes, in which metal artifacts are reduced compared to standard linear reconstruction methods. Our experiments also demonstrate that logarithmic preprocessing alone is sufficient to produce metal artifacts, even in the absence of other causes such as beam hardening.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 8 of its 31 references that are in the map. First posted on arXiv 6 Oct 2023.
Builds on
8 of 31 references.
References · 8
- 2021Plenoxels: Radiance Fields without Neural Networkscited by 1,613
- 2014Phase Retrieval via Wirtinger Flow: Theory and Algorithmscited by 125
- 2016The Landscape of Empirical Risk for Non-convex Lossescited by 86
- 2017Learning ReLUs via Gradient Descentcited by 54
- 2017Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimizationcited by 13
- 2015Sharp Time--Data Tradeoffs for Linear Inverse Problemscited by 8
- 2015Isometric sketching of any set via the Restricted Isometry Propertycited by 7
- 2016Fast and Reliable Parameter Estimation from Nonlinear Observationscited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Modelscited by 4
- 2025Accurate, provable and fast polychromatic tomographic reconstruction: A variational inequality approachcited by 3
- 2026Perfusion Imaging and Single Material Reconstruction in Polychromatic Photon Counting CTcited by 0
- 2026Perfusion Imaging and Single Material Reconstruction in Polychromatic Photon Counting CT2 Feb 2026
- 2025A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models16 May 2025
- 2025Accurate, provable and fast polychromatic tomographic reconstruction: A variational inequality approach13 Mar 2025