Limited-angle CT reconstruction via the L1/L2 minimization

• URL: http://arxiv.org/abs/2006.00601v4
• Date: Thu, 18 Mar 2021 02:00:03 GMT
• Title: Limited-angle CT reconstruction via the L1/L2 minimization
• Authors: Chao Wang, Min Tao, James Nagy, Yifei Lou
• Abstract summary: We consider minimizing the L1/L2 term on the gradient for a limited-angle scanning problem in computed tomography (CT) reconstruction. We design a specific splitting framework for an unconstrained optimization model so that the alternating direction method of multipliers has guaranteed convergence.
• Score: 4.276675330854271
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we consider minimizing the L1/L2 term on the gradient for a limited-angle scanning problem in computed tomography (CT) reconstruction. We design a specific splitting framework for an unconstrained optimization model so that the alternating direction method of multipliers (ADMM) has guaranteed convergence under certain conditions. In addition, we incorporate a box constraint that is reasonable for imaging applications, and the convergence for the additional box constraint can also be established. Numerical results on both synthetic and experimental datasets demonstrate the effectiveness and efficiency of our proposed approaches, showing significant improvements over the state-of-the-art methods in the limited-angle CT reconstruction.

Related papers

• Visible Singularities Guided Correlation Network for Limited-Angle CT Reconstruction [5.107409624991683]
  Limited-angle computed tomography (LACT) offers the advantages of reduced radiation dose and shortened scanning time.<n>Traditional reconstruction algorithms exhibit various inherent limitations in LACT.<n>We propose a Visible Singularities Guided Correlation network for LACT reconstruction.
  arXiv  Detail & Related papers  (2026-01-30T05:29:22Z)
• Efficient estimation of error bounds for quantum multiparametric imaging with constraints [37.69303106863453]
  We propose a practical algorithm for approximate construction of a modified Fisher information matrix. We demonstrate the efficiency of the proposed technique by applying it to 1-, 2-, and multi- parameter model problems in quantum imaging.
  arXiv  Detail & Related papers  (2024-12-11T08:43:18Z)
• Alternating Minimization Schemes for Computing Rate-Distortion-Perception Functions with $f$-Divergence Perception Constraints [10.564071872770146]
  We study the computation of the rate-distortion-perception function (RDPF) for discrete memoryless sources. We characterize the optimal parametric solutions. We provide sufficient conditions on the distortion and the perception constraints.
  arXiv  Detail & Related papers  (2024-08-27T12:50:12Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• Low-resolution Prior Equilibrium Network for CT Reconstruction [3.5639148953570836]
  We present a novel deep learning-based CT reconstruction model, where the low-resolution image is introduced to obtain an effective regularization term for improving the networks robustness. Experimental results on both sparse-view and limited-angle reconstruction problems are provided, demonstrating that our end-to-end low-resolution prior equilibrium model outperforms other state-of-the-art methods in terms of noise reduction, contrast-to-noise ratio, and preservation of edge details.
  arXiv  Detail & Related papers  (2024-01-28T13:59:58Z)
• LRIP-Net: Low-Resolution Image Prior based Network for Limited-Angle CT Reconstruction [5.796842150589423]
  We build up a low-resolution reconstruction problem on the down-sampled projection data. We use the reconstructed low-resolution image as prior knowledge for the original limited-angle CT problem.
  arXiv  Detail & Related papers  (2022-07-30T13:03:20Z)
• Fast Multi-grid Methods for Minimizing Curvature Energy [6.882141405929301]
  We propose fast multi-grid algorithms for minimizing mean curvature and Gaussian curvature energy functionals. No artificial parameters are introduced in our formulation, which guarantees the robustness of the proposed algorithm. Numerical experiments are presented on both image denoising and CT reconstruction problem to demonstrate the ability to recover image texture.
  arXiv  Detail & Related papers  (2022-04-17T04:34:38Z)
• Multi-Channel Convolutional Analysis Operator Learning for Dual-Energy CT Reconstruction [108.06731611196291]
  We develop a multi-channel convolutional analysis operator learning (MCAOL) method to exploit common spatial features within attenuation images at different energies. We propose an optimization method which jointly reconstructs the attenuation images at low and high energies with a mixed norm regularization on the sparse features.
  arXiv  Detail & Related papers  (2022-03-10T14:22:54Z)
• Inverse design of photonic devices with strict foundry fabrication constraints [55.41644538483948]
  We introduce a new method for inverse design of nanophotonic devices which guarantees that designs satisfy strict length scale constraints. We demonstrate the performance and reliability of our method by designing several common integrated photonic components.
  arXiv  Detail & Related papers  (2022-01-31T02:27:25Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• Conditional gradient methods for stochastically constrained convex minimization [54.53786593679331]
  We propose two novel conditional gradient-based methods for solving structured convex optimization problems. The most important feature of our framework is that only a subset of the constraints is processed at each iteration. Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
  arXiv  Detail & Related papers  (2020-07-07T21:26:35Z)
• Cogradient Descent for Bilinear Optimization [124.45816011848096]
  We introduce a Cogradient Descent algorithm (CoGD) to address the bilinear problem. We solve one variable by considering its coupling relationship with the other, leading to a synchronous gradient descent. Our algorithm is applied to solve problems with one variable under the sparsity constraint.
  arXiv  Detail & Related papers  (2020-06-16T13:41:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.