Warm-Started Reinforcement Learning for Iterative 3D/2D Liver Registration

• URL: http://arxiv.org/abs/2604.10245v1
• Date: Sat, 11 Apr 2026 14:58:45 GMT
• Title: Warm-Started Reinforcement Learning for Iterative 3D/2D Liver Registration
• Abstract summary: Learning-based methods have recently achieved registration errors comparable to optimization-based approaches.<n>We present a discrete-action reinforcement learning framework that formulates CT-to-video registration as a sequential decision-making process.
• Score: 13.711805805211247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Registration between preoperative CT and intraoperative laparoscopic video plays a crucial role in augmented reality (AR) guidance for minimally invasive surgery. Learning-based methods have recently achieved registration errors comparable to optimization-based approaches while offering faster inference. However, many supervised methods produce coarse alignments that rely on additional optimization-based refinement, thereby increasing inference time. We present a discrete-action reinforcement learning (RL) framework that formulates CT-to-video registration as a sequential decision-making process. A shared feature encoder, warm-started from a supervised pose estimation network to provide stable geometric features and faster convergence, extracts representations from CT renderings and laparoscopic frames, while an RL policy head learns to choose rigid transformations along six degrees of freedom and to decide when to stop the iteration. Experiments on a public laparoscopic dataset demonstrated that our method achieved an average target registration error (TRE) of 15.70 mm, comparable to supervised approaches with optimization, while achieving faster convergence. The proposed RL-based formulation enables automated, efficient iterative registration without manually tuned step sizes or stopping criteria. This discrete framework provides a practical foundation for future continuous-action and deformable registration models in surgical AR applications.

Related papers

• REFINE: Trajectory Representation Learning via Closed-Loop Transcription -- Extended Version [22.872723951282282]
  REFINE is a simple yet effective lEarning Framework vIa closed-loop trajector rEfinement for trajectory data.<n>We provide a control-theoretic analysis that establishes guarantees for the proposed closed-loop optimization.<n>Experiments on four real-world datasets demonstrate that REFINE consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-09-07T08:26:49Z)
• GIRL-DETR: Gradient-Isolated Reinforcement Learning for Video Moment Retrieval [10.034595422596562]
  Video Moment Retrieval (VMR) task requires accurately localizing temporal boundaries aligned with natural language queries.<n>GIRL-DETR introduces RL post-training into a lightweight temporal localization framework for the first time.
  arXiv  Detail & Related papers  (2026-05-30T15:40:00Z)
• Astrolabe: Steering Forward-Process Reinforcement Learning for Distilled Autoregressive Video Models [58.3184497327891]
  Distilled autoregressive (AR) video models enable efficient streaming generation but frequently misalign with human visual preferences.<n>We present Astrolabe, an efficient online reinforcement learning framework tailored for distilled AR models.
  arXiv  Detail & Related papers  (2026-03-17T18:32:18Z)
• Deriving Hyperparameter Scaling Laws via Modern Optimization Theory [55.63126290312615]
  We study modern first-order boundss for methods based on the Linear Minimization Oracle (LMO)<n>Treating bounds in recent literature as a proxy and minimizing them across different tuning regimes yields closed-form power-law schedules for learning rate, momentum, and batch size.<n>Our results draw particular attention to the interaction between momentum and batch-size scaling, suggesting that optimal performance may be achieved with several scaling strategies.
  arXiv  Detail & Related papers  (2026-03-16T22:21:27Z)
• Contextual Rollout Bandits for Reinforcement Learning with Verifiable Rewards [69.74686029941881]
  Reinforcement Learning with Verifiable Rewards (RLVR) is an effective paradigm for improving the reasoning capabilities of large language models.<n>We propose a unified neural scheduling framework that adaptively selects high-value rollouts throughout training.<n>Experiments on six mathematical reasoning benchmarks demonstrate consistent gains in performance and training efficiency across multiple RLVR optimization methods.
  arXiv  Detail & Related papers  (2026-02-09T10:51:58Z)
• Learning KAN-based Implicit Neural Representations for Deformable Image Registration [0.8037525071177886]
  We propose KAN-IDIR and RandKAN-IDIR, the first integration of Kolmogorov-Arnold Networks (KANs) into deformable image registration with implicit neural representations (INRs)<n>Our proposed randomized basis sampling strategy reduces the required number of basis functions in KAN while maintaining registration quality.<n>KAN-IDIR and RandKAN-IDIR achieved the highest accuracy among INR-based methods across all evaluated modalities and anatomies.
  arXiv  Detail & Related papers  (2025-09-26T19:37:46Z)
• Bridging Classical and Learning-based Iterative Registration through Deep Equilibrium Models [7.6061804149819885]
  We propose DEQReg, a novel registration framework based on Deep Equilibrium Models (DEQ)<n>We show that DEQReg can achieve competitive registration performance, while substantially reducing memory consumption.<n>We also reveal an intriguing phenomenon: the performance of existing unrolling methods first increases slightly then degrades irreversibly when the inference steps go beyond the training configuration.
  arXiv  Detail & Related papers  (2025-07-01T09:03:06Z)
• Dynamic Angle Selection in X-Ray CT: A Reinforcement Learning Approach to Optimal Stopping [1.7049036022350423]
  In industrial X-ray Computed Tomography (CT), the need for rapid in-line inspection is critical.<n>Sparse-angle tomography plays a significant role in this by reducing the required number of projections, thereby accelerating processing and conserving resources.
  arXiv  Detail & Related papers  (2025-03-16T23:09:13Z)
• Neural Graphics Primitives-based Deformable Image Registration for On-the-fly Motion Extraction [9.599774878892665]
  Intra-fraction motion in radiotherapy is commonly modeled using deformable image registration (DIR) Existing methods often struggle to balance speed and accuracy, limiting their applicability in clinical scenarios. This study introduces a novel approach that harnesses Neural Graphics Primitives (NGP) to optimize the displacement vector field (DVF) We validate this approach on the 4D-CT lung dataset DIR-lab, achieving a target registration error (TRE) of 1.15pm1.15 mm within a remarkable time of 1.77 seconds.
  arXiv  Detail & Related papers  (2024-02-08T11:09:27Z)
• Consensus-Adaptive RANSAC [104.87576373187426]
  We propose a new RANSAC framework that learns to explore the parameter space by considering the residuals seen so far via a novel attention layer. The attention mechanism operates on a batch of point-to-model residuals, and updates a per-point estimation state to take into account the consensus found through a lightweight one-step transformer.
  arXiv  Detail & Related papers  (2023-07-26T08:25:46Z)
• Stabilizing Q-learning with Linear Architectures for Provably Efficient Learning [53.17258888552998]
  This work proposes an exploration variant of the basic $Q$-learning protocol with linear function approximation. We show that the performance of the algorithm degrades very gracefully under a novel and more permissive notion of approximation error.
  arXiv  Detail & Related papers  (2022-06-01T23:26:51Z)
• Real-time landmark detection for precise endoscopic submucosal dissection via shape-aware relation network [51.44506007844284]
  We propose a shape-aware relation network for accurate and real-time landmark detection in endoscopic submucosal dissection surgery. We first devise an algorithm to automatically generate relation keypoint heatmaps, which intuitively represent the prior knowledge of spatial relations among landmarks. We then develop two complementary regularization schemes to progressively incorporate the prior knowledge into the training process.
  arXiv  Detail & Related papers  (2021-11-08T07:57:30Z)

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.