无需训练即可精准分割新物体,靠循环阈值解决重复纹理干扰
NOCTIS: Novel Object Cyclic Threshold based Instance Segmentation
- 用循环阈值机制匹配物体,避免重复纹理导致的误判
- 在BOP 2023七大数据集上,平均精度超越现有RGB与RGB-D方法
- 仅用彩色图像就达到最优效果,适合快速部署的实例分割场景
给定每类新物体的示例图像,在RGB图像中实现其实例分割是计算机视觉中的经典难题。设计一个无需(重)训练即可适用于各类新物体的通用模型极具挑战。为此,我们提出无需训练的新框架NOCTIS:结合Grounded-SAM 2生成精确边界框和分割掩码,以及利用DINOv2的零样本能力获取鲁棒类别与图像块嵌入。内部通过类别嵌入相似性与图像块嵌入平均最大相似性的匹配得分,引入新的循环阈值(CT)机制,缓解由重复纹理或视觉相似模式引起的不稳定匹配。此外,NOCTIS还引入:(i) 免受物体选择偏差影响的外观得分;(ii) 使用提案边界框与掩码的平均置信度作为评分组件;(iii) 仅依赖RGB图像的管道,性能甚至优于含深度信息的方案。实验证明,NOCTIS在不进行额外训练或微调的情况下,于BOP 2023挑战赛七个核心数据集上的“基于模型的未见物体2D分割”任务中,平均精度(mean AP)超越当前最佳的RGB与RGB-D方法。
原文摘要 · Abstract (English)
Instance segmentation of novel objects instances in RGB images, given some example images for each object, is a well known problem in computer vision. Designing a model general enough to be employed for all kinds of novel objects without (re-) training has proven to be a difficult task. To handle this, we present a new training-free framework, called: Novel Object Cyclic Threshold based Instance Segmentation (NOCTIS). NOCTIS integrates two pre-trained models: Grounded-SAM 2 for object proposals with precise bounding boxes and corresponding segmentation masks; and DINOv2 for robust class and patch embeddings, due to its zero-shot capabilities. Internally, the proposal-object matching is realized by determining an object matching score based on the similarity of the class embeddings and the average maximum similarity of the patch embeddings with a new cyclic thresholding (CT) mechanism that mitigates unstable matches caused by repetitive textures or visually similar patterns. Beyond CT, NOCTIS introduces: (i) an appearance score that is unaffected by object selection bias; (ii) the usage of the average confidence of the proposals' bounding box and mask as a scoring component; and (iii) an RGB-only pipeline that performs even better than RGB-D ones. We empirically show that NOCTIS, without further training/fine tuning, outperforms the best RGB and RGB-D methods regarding the mean AP score on the seven core datasets of the BOP 2023 challenge for the "Model-based 2D segmentation of unseen objects" task.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。