mlsanityData to 7 Oct 2026

Gradient-Based Trajectory Optimisation over Continuous Poses for Sparse-View Cone-Beam CT

arXiv 2610.09579 ↗First posted 7 Oct 2026cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Trajectory optimisation for cone-beam computed tomography (CT) determines which information sparse-view scans acquire. Fixed candidate pools prevent off-grid refinement and require new object-specific precomputation for each acquisition manifold. We make every source pose an individual continuous variable and move all poses jointly by gradient ascent on the scanner's kinematic manifold. The objective combines soft-Tuy plane coverage, continuous View Covariance Loss, and an analytic attenuation-aware ray-bundle penalty. The same optimiser handles circular, limited C-arm, two-axis, and freesphere parametrisations. On a Defrise flange, continuous selection recovers laminar defects invisible to a circular orbit, matches discrete swap search on the free sphere at the sparser budget, and leads at the denser one, with the same objective evaluated in every arm. A moderate elevation band already recovers most of the free-sphere gain at the defects, so the same optimiser transfers to bounded scanner envelopes. Photon noise preserves the ordering on the flange and compresses it on a dense fuel nozzle. Sparseprescan planning benefits from matching prescan and planned acquisition manifolds. Selection takes seconds rather than minutes without an object-specific reconstruction basis. Prescan-planned poses were executed on a robot CT bench and reconstructed in a common frame, demonstrating feasibility but no consistent metric gain over uniform band sampling. Continuous pose optimisation incorporates attenuation and scanner constraints directly into sparse-view acquisition design.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 54 references that are in the map. First posted on arXiv 7 Oct 2026.

Builds on

6 of 54 references.

References · 6

  1. 2016Deep Residual Learning for Compressed Sensing CT Reconstruction via Persistent Homology Analysiscited by 22
  2. 2023Task-based Generation of Optimized Projection Sets using Differentiable Rankingcited by 3
  3. 2024Integer Optimization of CT Trajectories using a Discrete Data Completeness Formulationcited by 2
  4. 2024Application of Gated Recurrent Units for CT Trajectory Optimizationcited by 2
  5. 2020C-Arm Non-Circular Orbits: Geometric Calibration, Image Quality, and Avoidance of Metal Artifactscited by 1
  6. 2026Soft Tuy-Completeness for Robust Projection Selection in Cone-Beam CTcited by 1

Built on by

Not cited yet.