Design Choices in Splitting-Based Self-Supervised Sparse-View CT Reconstruction

• URL: http://arxiv.org/abs/2607.10898v1
• Date: Sun, 12 Jul 2026 19:58:12 GMT
• Title: Design Choices in Splitting-Based Self-Supervised Sparse-View CT Reconstruction
• Abstract summary: Self-supervised data splitting has emerged as a promising paradigm for sparse-view CT reconstruction.<n>We introduce a unified framework that decomposes splitting-based reconstruction into partitioning strategy, preprocessing, and inference.<n>Experiments on simulated LoDoPaB-CT data under independent and correlated noise, together with validation on the real-world 2DeteCT dataset, show that the optimal partitioning strategy strongly depends on the measurement noise structure.
• Score: 3.4960251347719713
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Self-supervised data splitting has emerged as a promising paradigm for sparse-view CT reconstruction, enabling training from incomplete measurements without fully sampled ground truth. However, the influence of key design choices, including partitioning strategy, preprocessing, and inference, remains insufficiently understood. In this work, we introduce a unified framework that decomposes splitting-based reconstruction into these three components, enabling controlled comparison of existing methods and two incremental extensions: multi-partition splitting and an alternative inference strategy. Experiments on simulated LoDoPaB-CT data under independent and correlated noise, together with validation on the real-world 2DeteCT dataset, show that the optimal partitioning strategy strongly depends on the measurement noise structure. Lattice-based splitting performs favorably under independent noise, whereas angular masking is more robust under correlated noise and real measured data. Multi-partition splitting consistently improves over pure projection-wise splitting in several settings. Complementary perceptual and structural metrics, including LPIPS and HaarPSI, reveal differences between masking strategies that are less apparent from PSNR and SSIM alone. These results provide practical guidelines for designing self-supervised sparse-view CT reconstruction methods and highlight the limitations of common independence assumptions in realistic imaging environments.

Related papers

• Physics-Driven Independent Pair Generation for Iterative Self-Supervised Low-Dose CT Denoising [16.003879627285514]
  Low-dose computed tomography (LDCT) measurements contain mixed Poisson-Gaussian noise.<n>Most self-supervised methods rely on generic image statistics and do not explicitly model this noise.<n>We propose a physics-driven framework with cross-domain iteration for self-supervised LDCT denoising.
  arXiv  Detail & Related papers  (2026-09-01T12:18:28Z)
• Beyond the Performance Illusion: Structure-Aware Stratified Partitioning and Curriculum Distributionally Robust Optimization for Spatially Correlated Domains [1.8595194352358455]
  We propose a unified evaluation and training framework for spatially correlated data.<n>We show that this combination yields consistently improved generalization, more reliable confidence calibration, and exposes modes failure that remain hidden under conventional random-split evaluation.
  arXiv  Detail & Related papers  (2026-07-02T11:32:38Z)
• Deep Slice Interpolation for Reducing Through-Plane Anisotropy and Noise in Head CT [0.0]
  We present a deep learning system that synthesizes intermediate CT slices from pairs of neighboring axial slices.<n>The system improves three-dimensional visualization while simultaneously producing inherently denoised outputs.
  arXiv  Detail & Related papers  (2026-06-08T10:45:51Z)
• Hierarchical Consistency Learning for Test-time Adaptation in Camouflage Perception [50.278200968044665]
  Camouflaged object detection (COD) aims to localize targets that exhibit minimal perceptual differences from backgrounds through physical attributes.<n>Existing methods, constrained by the static train-then-freeze paradigm, suffer from domain rigidity and dependency annotation.<n>We propose the hierarchical consistency learning framework, which integrates test-time adaptation for dynamic representation recalibration.
  arXiv  Detail & Related papers  (2026-05-25T09:57:46Z)
• SEED: Targeted Data Selection by Weighted Independent Set [76.68391670109433]
  We develop a robust and scalable data selection pipeline dubbed SEED.<n>SEED consistently outperforms state-of-the-art methods on instruction tuning, visual instruction tuning, and semantic segmentation.
  arXiv  Detail & Related papers  (2026-05-15T07:26:54Z)
• Implicit Neural Representation-Based Continuous Single Image Super Resolution: An Empirical Study [50.15623093332659]
  Implicit neural representation (INR) has become the standard approach for arbitrary-scale image super-resolution (ASSR)<n>We compare existing techniques across diverse settings and present aggregated performance results on multiple image quality metrics.<n>We examine a new loss function that penalizes intensity variations while preserving edges, textures, and finer details during training.
  arXiv  Detail & Related papers  (2026-01-25T07:09:20Z)
• Mixture of Ranks with Degradation-Aware Routing for One-Step Real-World Image Super-Resolution [76.66229730098759]
  In real-world image super-resolution (Real-ISR), existing approaches mainly rely on fine-tuning pre-trained diffusion models.<n>We propose a Mixture-of-Ranks (MoR) architecture for single-step image super-resolution.<n>We introduce a fine-grained expert partitioning strategy that treats each rank in LoRA as an independent expert.
  arXiv  Detail & Related papers  (2025-11-20T04:11:44Z)
• Localized Kernel Projection Outlyingness: A Two-Stage Approach for Multi-Modal Outlier Detection [0.0]
  Two-Stage LKPLO is a novel multi-stage outlier detection framework.<n>It overcomes the coexisting limitations of conventional projection-based methods.<n>It achieves state-of-the-art performance on challenging datasets.
  arXiv  Detail & Related papers  (2025-10-28T03:53:46Z)
• ISCS: Parameter-Guided Channel Ordering and Grouping for Learned Image Compression [11.645256028223272]
  We propose a dataset-agnostic method to identify and organize important channels in pretrained LIC models.<n>Our method effectively reduces computation while maintaining reconstruction quality, providing a practical and modular enhancement to existing learned compression frameworks.
  arXiv  Detail & Related papers  (2025-09-21T00:44:15Z)
• Disentangled Noisy Correspondence Learning [56.06801962154915]
  Cross-modal retrieval is crucial in understanding latent correspondences across modalities. DisNCL is a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning.
  arXiv  Detail & Related papers  (2024-08-10T09:49:55Z)
• Out-of-distribution Generalization via Partial Feature Decorrelation [72.96261704851683]
  We present a novel Partial Feature Decorrelation Learning (PFDL) algorithm, which jointly optimize a feature decomposition network and the target image classification model. The experiments on real-world datasets demonstrate that our method can improve the backbone model's accuracy on OOD image classification datasets.
  arXiv  Detail & Related papers  (2020-07-30T05:48:48Z)
• Deep Semantic Matching with Foreground Detection and Cycle-Consistency [103.22976097225457]
  We address weakly supervised semantic matching based on a deep network. We explicitly estimate the foreground regions to suppress the effect of background clutter. We develop cycle-consistent losses to enforce the predicted transformations across multiple images to be geometrically plausible and consistent.
  arXiv  Detail & Related papers  (2020-03-31T22:38:09Z)

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.