Quantum Compressed Sensing CT Reconstruction Algorithm Based on Penalized Weighted Least Squares and Guided Total Variation

• URL: http://arxiv.org/abs/2607.10566v1
• Date: Sun, 12 Jul 2026 04:48:08 GMT
• Title: Quantum Compressed Sensing CT Reconstruction Algorithm Based on Penalized Weighted Least Squares and Guided Total Variation
• Abstract summary: We propose a quantum compressed-sensing CT method combining penalized weighted least squares (PWLS) and guided total variation (GTV)<n>GTV consistently outperformed conventional total variation.<n>The framework incorporates photon-statistical weighting and structure-guided regularization into QUBO-based CT reconstruction without changing its quadratic form.
• Score: 11.78461984187436
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Objective. Existing quadratic unconstrained binary optimization (QUBO)-based sparse-view computed tomography (CT) reconstruction neglects photon-counting statistics and anatomical heterogeneity. We address both limitations within the QUBO framework.Approach. We propose a quantum compressed-sensing CT method combining penalized weighted least squares (PWLS) and guided total variation (GTV). PWLS weights projection residuals by photon-count reliability, whereas GTV uses gradients from a prior image reconstructed by the simultaneous algebraic reconstruction technique (SART) to preserve edges and suppress noise in homogeneous regions. After binary encoding, both terms form a unified QUBO model. Experiments used four 40 times 40 CT images under a 10-view fan-beam geometry with Poisson noise. Comparisons included conventional reconstruction methods, QUBO variants, gradient descent, simulated annealing, and a D-Wave hybrid quantum-classical solver.Main results. PWLS-GTV achieved the best reconstruction quality across all cases. In the representative chest case, it reached a peak signal-to-noise ratio (PSNR) of 36.64 dB, compared with 22.48 dB for SART, the best conventional baseline. GTV consistently outperformed conventional total variation. Simulated annealing and the D-Wave hybrid solver produced similar reconstructions, whereas gradient descent was ineffective. Repeated hybrid-solver runs showed stable performance.Significance. The framework incorporates photon-statistical weighting and structure-guided regularization into QUBO-based CT reconstruction without changing its quadratic form, providing a proof of concept for quantum-assisted sparse-view CT reconstruction.

Related papers

• Quantum CT via Dynamic Interval Encoding and Prior-Balanced QUBO Reconstruction [33.11370708200602]
  We propose a QUBO-based grayscale CT reconstruction framework that combines dynamic interval encoding with prior-balanced optimization.<n>Experiments on the D-Wave hybrid binary quadratic model (BQM) solver further demonstrate that the formulation is executable on a hardware-backed hybrid quantum--classical backend.
  arXiv  Detail & Related papers  (2026-06-23T13:28:12Z)
• Trustworthy MRI Reconstruction via Bayesian Uncertainty Quantification with Sparsity Prior Models [5.452868777437004]
  We propose a novel framework for joint image reconstruction and uncertainty quantification from compressed sensing magnetic resonance imaging data.<n>The problem is formulated as a linear inverse problem, where prior distributions are assigned to the unknown image parameters.<n>We develop a general framework applicable to any sparsifying transform and demonstrate its performance using (1) a total variation transform based on image spatial gradients and (2) a wavelet-domain transform.
  arXiv  Detail & Related papers  (2026-06-15T22:44:38Z)
• Resolution-Independent Neural Operators for Multi-Rate Sparse-View CT [67.14700058302016]
  Deep learning methods achieve high-fidelity reconstructions but often overfit to a fixed acquisition setup.<n>We propose Computed Tomography neural Operator (CTO), a unified CT reconstruction framework that extends to continuous function space.<n>CTO enables consistent multi-sampling-rate and cross-resolution performance, with on average >4dB PSNR gain over CNNs.
  arXiv  Detail & Related papers  (2025-12-13T08:31:46Z)
• Total Variation Subgradient Guided Image Fusion for Dual-Camera CASSI System [3.414706880536149]
  Spectral imaging technology has long-faced fundamental challenges in balancing spectral, spatial, and temporal resolutions.<n>Traditional model-based methods exhibit limited performance due to reliance on handcrafted inherent image priors.<n>We propose a dual-camera CASSI reconstruction framework that integrates total variation (TV) subgradient theory.
  arXiv  Detail & Related papers  (2025-09-13T16:57:06Z)
• Compressive Imaging Reconstruction via Tensor Decomposed Multi-Resolution Grid Encoding [50.54887630778593]
  Compressive imaging (CI) reconstruction aims to recover high-dimensional images from low-dimensional measurements compressed.<n>Existing unsupervised representations may struggle to achieve a desired balance between representation ability and efficiency.<n>We propose Decomposed multi-resolution Grid encoding (GridTD), an unsupervised continuous representation framework for CI reconstruction.
  arXiv  Detail & Related papers  (2025-07-10T12:36:20Z)
• Quantum compressed sensing tomographic reconstruction algorithm [0.0]
  Recent advances in quantum computing have begun to influence tomographic reconstruction techniques.<n>We formulate the QUBO model for quantum compressed sensing tomographic reconstruction.<n>We evaluate the performance of the new algorithm by reconstructing CT images using a hybrid solver.
  arXiv  Detail & Related papers  (2025-05-16T14:23:10Z)
• 2DQuant: Low-bit Post-Training Quantization for Image Super-Resolution [83.09117439860607]
  Low-bit quantization has become widespread for compressing image super-resolution (SR) models for edge deployment. It is notorious that low-bit quantization degrades the accuracy of SR models compared to their full-precision (FP) counterparts. We present a dual-stage low-bit post-training quantization (PTQ) method for image super-resolution, namely 2DQuant, which achieves efficient and accurate SR under low-bit quantization.
  arXiv  Detail & Related papers  (2024-06-10T06:06:11Z)
• Deep Equilibrium Diffusion Restoration with Parallel Sampling [120.15039525209106]
  Diffusion model-based image restoration (IR) aims to use diffusion models to recover high-quality (HQ) images from degraded images, achieving promising performance. Most existing methods need long serial sampling chains to restore HQ images step-by-step, resulting in expensive sampling time and high computation costs. In this work, we aim to rethink the diffusion model-based IR models through a different perspective, i.e., a deep equilibrium (DEQ) fixed point system, called DeqIR.
  arXiv  Detail & Related papers  (2023-11-20T08:27:56Z)
• Quantum annealing-based computed tomography using variational approach for a real-number image reconstruction [0.0]
  The study developed the QACT reconstruction algorithm using the variational approach for real-number reconstruction. Remarkably, only 2 qubits were required for each pixel representation, demonstrating their sufficiency for accurate reconstruction.
  arXiv  Detail & Related papers  (2023-06-03T23:35:10Z)
• Degradation-Aware Unfolding Half-Shuffle Transformer for Spectral Compressive Imaging [142.11622043078867]
  We propose a principled Degradation-Aware Unfolding Framework (DAUF) that estimates parameters from the compressed image and physical mask, and then uses these parameters to control each iteration. By plugging HST into DAUF, we establish the first Transformer-based deep unfolding method, Degradation-Aware Unfolding Half-Shuffle Transformer (DAUHST) for HSI reconstruction.
  arXiv  Detail & Related papers  (2022-05-20T11:37:44Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)

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.