LAMA: Stable Dual-Domain Deep Reconstruction For Sparse-View CT

Chi Ding, Qingchao Zhang, Ge Wang, Xiaojing Ye, Yunmei Chen
10/28/2024
cs.CVcs.LGmath.NA

No confident code implementation found for this paper.

Abstract

Inverse problems arise in many applications, especially tomographic imaging. We develop a Learned Alternating Minimization Algorithm (LAMA) to solve such problems via two-block optimization by synergizing data-driven and classical techniques with proven convergence. LAMA is naturally induced by a variational model with learnable regularizers in both data and image domains, parameterized as composite functions of neural networks trained with domain-specific data. We allow these regularizers to be nonconvex and nonsmooth to extract features from data effectively. We minimize the overall objective function using Nesterov's smoothing technique and residual learning architecture. It is demonstrated that LAMA reduces network complexity, improves memory efficiency, and enhances reconstruction accuracy, stability, and interpretability. Extensive experiments show that LAMA significantly outperforms state-of-the-art methods on popular benchmark datasets for Computed Tomography.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{ding2024lama,
  title  = {LAMA: Stable Dual-Domain Deep Reconstruction For Sparse-View CT},
  author = {Chi Ding and Qingchao Zhang and Ge Wang and Xiaojing Ye and Yunmei Chen},
  year   = {2024},
  eprint = {2410.21111},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.21111v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.21111.svg)](https://codeofpaper.com/paper/2410.21111)

Discussion