用小模块统一精修定位框与排序,提升手术视频时序定位精度。
RefineRank: Joint Box Refinement and Ranking for Surgical Spatio-Temporal Grounding

- 融合语言模型与检测器候选框,预测修正坐标和评分。
- 在MedVidBench上达0.421 mIoU,为当前最高分。
- 无需重训主干网络,适合医疗视觉任务落地。
手术时空定位(Surgical Spatio-Temporal Grounding, STG)需在视频每个问题指定的时间点,准确定位问题所指物体。现有方法存在权衡:视觉语言模型理解问题上下文但定位不精确;开集检测器提供局部候选框,但置信度无法反映哪个框回答问题。本文提出RefineRank,通过一个轻量可训练模块RefineNet,在候选框层面弥合这一差距。该模块结合冻结的医学视觉语言模型的语言与区域特征,以及冻结的开集检测器的候选框提议:为每个候选框预测有界坐标修正量和质量得分,并采用固定解码规则返回原始或修正后得分最高的框。在MedVidBench官方排行榜(已验证)中,RefineRank取得0.421的STG mIoU,为当前显示最高分,全局多指标排名11。在独立训练/评估视频的控制实验中,坐标修正使候选框最优上限从0.6772提升至0.7302;通过RefineNet得分对原始与修正候选框联合排序,使STG mIoU从0.2719提升至0.4534,而对同一池子分别训练的筛选器最多仅达0.4186。结果表明,一个小的框级模块可在不重训主干的情况下,实现问题理解与精准定位的统一。代码已开源。
原文摘要 · Abstract (English)
Surgical spatio-temporal grounding (STG) requires locating, at each video time specified by a procedural question, the object that the question asks about. Existing approaches face a trade-off: vision language models understand the question context but produce imprecise coordinates, whereas open-set detectors provide localized candidate boxes whose confidence does not reflect which box answers the question. We introduce RefineRank, which closes this gap at the candidate-box level. A compact trainable module, RefineNet, combines the language and regional features of a frozen medical vision language model with the proposals of a frozen open-set detector: it predicts a bounded coordinate correction and a quality score for every candidate box, and a fixed decoding rule returns the original or refined box with the highest score. On the MedVidBench Official Rankings (Verified), RefineRank records 0.421 STG mIoU, the highest displayed STG score, while its global multi-metric rank is 11. In a controlled evaluation on separate training and evaluation videos, coordinate correction raises the candidate oracle upper bound from 0.6772 to 0.7302, and ranking the joint pool of original and refined candidates by their RefineNet scores improves STG mIoU from 0.2719 to 0.4534, whereas separately trained selectors over the same pool reach at most 0.4186. These results show that a small box-level module can reconcile question understanding with precise localization without retraining either backbone. Code is available at [https://github.com/linzhe001/RefineRank](https://github.com/linzhe001/RefineRank).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。