Cover Image

Soft Tuy-Completeness for Robust Projection Selection in Cone-Beam CT

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schneider, Linda-Sophie, Maier, Andreas
Format:	Preprint
Published:	2026
Subjects:	Computer Vision and Pattern Recognition Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Post-processing of coronary and myocardial spatial data
by: Mackenzie, Jay Aodh, et al.
Published: (2022)

Integer Optimization of CT Trajectories using a Discrete Data Completeness Formulation
by: Schneider, Linda-Sophie, et al.
Published: (2024)

Applications of Tao General Difference in Discrete Domain
by: Tao, Linmi, et al.
Published: (2024)

A Theory of General Difference in Continuous and Discrete Domain
by: Tao, Linmi, et al.
Published: (2023)

Application of Gated Recurrent Units for CT Trajectory Optimization
by: Yuan, Yuedong, et al.
Published: (2024)

Learning Wavelet-Sparse FDK for 3D Cone-Beam CT Reconstruction
by: Sun, Yipeng, et al.
Published: (2025)

Cautious Optimizers: Improving Training with One Line of Code
by: Liang, Kaizhao, et al.
Published: (2024)

The Central Spanning Tree Problem
by: Sanmartín, Enrique Fita, et al.
Published: (2024)

Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems
by: Henke, Kyle, et al.
Published: (2024)

Deep Learning Computed Tomography based on the Defrise and Clack Algorithm
by: Ye, Chengze, et al.
Published: (2024)

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
by: Elbassioni, Khaled
Published: (2024)

Equivariant Multiscale Learned Invertible Reconstruction for Cone Beam CT
by: Moriakov, Nikita, et al.
Published: (2024)

A 2D Sinogram-Based Approach to Defect Localization in Computed Tomography
by: Zhou, Yuzhong, et al.
Published: (2024)

Soft happy colourings and community structure of networks
by: Shekarriz, Mohammad H., et al.
Published: (2024)

DRACO: Differentiable Reconstruction for Arbitrary CBCT Orbits
by: Ye, Chengze, et al.
Published: (2024)

EAGLE: An Edge-Aware Gradient Localization Enhanced Loss for CT Image Reconstruction
by: Sun, Yipeng, et al.
Published: (2024)

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
by: Helleseth, Tor, et al.
Published: (2025)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
by: Banerjee, Arindam, et al.
Published: (2025)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Inapproximability of the independent set polynomial in the complex plane
by: Bezakova, Ivona, et al.
Published: (2017)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Improving Cone-Beam CT Image Quality with Knowledge Distillation-Enhanced Diffusion Model in Imbalanced Data Settings
by: Hwang, Joonil, et al.
Published: (2024)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
by: Li, Xiaorui, et al.
Published: (2024)

Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)

Compressibility Analysis for the differentiable shift-variant Filtered Backprojection Model
by: Ye, Chengze, et al.
Published: (2025)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
by: Alkhouri, Ismail, et al.
Published: (2025)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

Tournament Robustness via Redundancy
by: Efremenko, Klim, et al.
Published: (2025)

The Unreliable Job Selection and Sequencing Problem
by: Agnetis, Alessandro, et al.
Published: (2025)

An Upper Bound on the Weisfeiler-Leman Dimension
by: Schneider, Thomas, et al.
Published: (2024)

Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
by: Grüne, Christoph, et al.
Published: (2023)

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
by: la Tour, Max Dupré, et al.
Published: (2025)

Critical window for approximate counting in dense Ising models
by: Galanis, Andreas, et al.
Published: (2026)

Equivariant Multiscale Learned Invertible Reconstruction for Cone Beam CT: From Simulated to Real Data
by: Moriakov, Nikita, et al.
Published: (2025)