SAGE-OR: Semi-supervised Adaptive Scene Graph Generation for Operating Rooms
- URL: http://arxiv.org/abs/2608.15336v1
- Date: Sat, 15 Aug 2026 17:32:48 GMT
- Title: SAGE-OR: Semi-supervised Adaptive Scene Graph Generation for Operating Rooms
- Abstract summary: Current surgical scene graph generation methods depend on dense multi-modal supervision and specialized hardware.<n>We propose SAGE-OR, a feature-centric framework that replaces the traditional detect-then-reason paradigm with a decoupled representation-reasoning paradigm.<n>General-purpose prompts are used to induce near-perfect recall, while precision is delegated to downstream attention-based reasoning.
- Score: 2.676349883103404
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Current surgical scene graph generation methods depend on dense multi-modal supervision and specialized hardware (synchronized RGB-D sensors, calibration rigs), making dataset construction expensive and restricting all existing benchmarks to simulated environments. We propose SAGE-OR, a feature-centric framework that replaces the traditional detect-then-reason paradigm with a decoupled representation-reasoning paradigm in which localization is derived from frozen foundation models, encoded implicitly in pre-computed features, and used without any localization supervision, while a lightweight graph transformer performs relational reasoning over cached features. We employ a semi-supervised formulation with general-purpose segmentation prompts to eliminate localization supervision while enabling unsupervised context augmentation through additional prompt-driven entities, such as hands, which are absent from annotations. General-purpose prompts are used to induce near-perfect recall, while precision is delegated to downstream attention-based reasoning, enabling simple adaptation to new entities via prompt-level modification. This design enables a lightweight 15M-parameter graph transformer that trains in 1.4 hours and runs relational inference at $\sim$1ms per frame with peak memory under 2GB, suitable for edge hardware used in the operating room; feature extraction runs offline as a separate caching stage (4.27s per frame). On the 4D-OR benchmark, the core model achieves 76% F1, matching the fully supervised 4D-OR baseline while eliminating all localization annotations, and unsupervised hand augmentation raises this to 86%, within 4 points of state-of-the-art (SOTA) methods requiring dense multi-modal supervision, providing a practical pathway for adaptation to new surgical settings without annotation other than relationship and class labels.
Related papers
- Hierarchical Adaptive Feature Refinement Network for VHR Remote Sensing Image Segmentation [15.24999553337715]
We present HAFR-Net, a progressive refinement framework that adaptively organizes and refines hierarchical representations.<n>Under a matched Swin-B training and single-scale inference protocol, HAFR-Net attains 84.12%, 87.86%, 55.17%, and 67.70% mIoU.
arXiv Detail & Related papers (2026-08-16T09:26:58Z) - 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) - Context Features Are Cheap: Rank-Aware Decomposition for Efficient Feature Interaction in Recommender Systems [0.0]
We present a rank-aware decomposition applicable to the dominant interaction mechanisms in recommender systems.<n>The decomposition moves context-only computation from once-per-candidate to once-per-request, identity-equivalent to the original model.<n> Applied to a production DLRM-style ranker without any architectural change, the decomposition increases per-pod throughput by 87.5%.
arXiv Detail & Related papers (2026-05-24T13:35:36Z) - AHPA: Adaptive Hierarchical Prior Alignment for Diffusion Transformers [24.937985157569823]
We argue that such timestep-agnostic alignment is suboptimal because the useful granularity of representation supervision changes systematically with the signal-to-noise ratio.<n>In high-noise regimes, diffusion models benefit more from coarse semantic and layout-level anchoring, whereas in low-noise regimes, the training signal should emphasize spatially detailed and structurally faithful refinement.<n>This non-stationary alignment behavior creates a representational mismatch for static single-level supervisors.
arXiv Detail & Related papers (2026-05-05T03:07:29Z) - Efficiency Follows Global-Local Decoupling [62.05489838893081]
We introduce ConvNeur, a two-branch architecture in which a lightweight neural memory branch aggregates global context on a compact set of tokens.<n>A learned gate lets global cues modulate local features without entangling their objectives.<n>On standard classification, detection, and segmentation benchmarks, ConvNeur matches or surpasses comparable alternatives at similar or lower compute.
arXiv Detail & Related papers (2026-03-20T02:20:16Z) - ReHARK: Refined Hybrid Adaptive RBF Kernels for Robust One-Shot Vision-Language Adaptation [3.8707695363745214]
ReHARK is a training-free framework that reinterprets few-shot adaptation through global proximal regularization.<n>A new state-of-the-art for one-shot adaptation is established by ReHARK, which achieves an average accuracy of 65.83%.
arXiv Detail & Related papers (2026-03-12T04:59:09Z) - Learning Accurate Segmentation Purely from Self-Supervision [87.78965637247107]
Selfment is a fully self-supervised framework that segments objects directly from raw images without human labels.<n>Selfment sets new state-of-the-art (SoTA) results across multiple benchmarks.
arXiv Detail & Related papers (2026-02-27T07:36:32Z) - Learning Adaptive Distribution Alignment with Neural Characteristic Function for Graph Domain Adaptation [33.32495506456439]
Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs.<n>Existing methods attempt to reduce distributional shifts by aligning manually selected graph elements.<n>We propose textbfADAlign, an Adaptive Distribution Alignment framework for GDA.
arXiv Detail & Related papers (2026-02-11T03:48:04Z) - Rethinking Multi-Condition DiTs: Eliminating Redundant Attention via Position-Alignment and Keyword-Scoping [61.459927600301654]
Multi-condition control is bottlenecked by the conventional concatenate-and-attend'' strategy.<n>Our analysis reveals that much of this cross-modal interaction is spatially or semantically redundant.<n>We propose Position-aligned and Keyword-scoped Attention (PKA), a highly efficient framework designed to eliminate these redundancies.
arXiv Detail & Related papers (2026-02-06T16:39:10Z) - Towards Generalizable Trajectory Prediction Using Dual-Level Representation Learning And Adaptive Prompting [107.4034346788744]
Existing vehicle trajectory prediction models struggle with generalizability, prediction uncertainties, and handling complex interactions.<n>We propose Perceiver with Register queries (PerReg+), a novel trajectory prediction framework that introduces: (1) Dual-Level Representation Learning via Self-Distillation (SD) and Masked Reconstruction (MR), capturing global context and fine-grained details; (2) Enhanced Multimodality using register-based queries and pretraining, eliminating the need for clustering and suppression; and (3) Adaptive Prompt Tuning during fine-tuning, freezing the main architecture and optimizing a small number of prompts for efficient adaptation.
arXiv Detail & Related papers (2025-01-08T20:11:09Z) - Guided Generative Models using Weak Supervision for Detecting Object
Spatial Arrangement in Overhead Images [5.5042961659167045]
This paper presents the target-guided generative model (TGGM) under the Variational Auto-encoder (VAE) framework.
Our experiments show that TGGM achieves results comparable to the state-of-the-art semi-supervised methods.
arXiv Detail & Related papers (2021-12-10T19:14:10Z) - Higher Performance Visual Tracking with Dual-Modal Localization [106.91097443275035]
Visual Object Tracking (VOT) has synchronous needs for both robustness and accuracy.
We propose a dual-modal framework for target localization, consisting of robust localization suppressingors via ONR and the accurate localization attending to the target center precisely via OFC.
arXiv Detail & Related papers (2021-03-18T08:47:56Z)
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.