Filtered least squares and ADMM both accelerate INR-based sparse-view CT reconstruction, with ADMM giving the lowest final error on a simulated breast phantom.
Accelerated Optimization of Implicit Neural Representations for CT Reconstruction
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Inspired by their success in solving challenging inverse problems in computer vision, implicit neural representations (INRs) have been recently proposed for reconstruction in low-dose/sparse-view X-ray computed tomography (CT). An INR represents a CT image as a small-scale neural network that takes spatial coordinates as inputs and outputs attenuation values. Fitting an INR to sinogram data is similar to classical model-based iterative reconstruction methods. However, training INRs with losses and gradient-based algorithms can be prohibitively slow, taking many thousands of iterations to converge. This paper investigates strategies to accelerate the optimization of INRs for CT reconstruction. In particular, we propose two approaches: (1) using a modified loss function with improved conditioning, and (2) an algorithm based on the alternating direction method of multipliers. We illustrate that both of these approaches significantly accelerate INR-based reconstruction of a synthetic breast CT phantom in a sparse-view setting.
fields
eess.IV 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Accelerated Optimization of Implicit Neural Representations for CT Reconstruction
Filtered least squares and ADMM both accelerate INR-based sparse-view CT reconstruction, with ADMM giving the lowest final error on a simulated breast phantom.