提出UnionCut方法,用图割和集成学习自动识别图像前景区域,提升无监督目标发现的准确性和停止时机。
Ensemble Foreground Management for Unsupervised Object Discovery

- 基于最小割与集成方法构建鲁棒前景先验,识别图像前景并集
- 在多个基准上使现有最强算法在单对象发现、显著性检测等任务中性能提升
- 适合关注无监督目标发现、实例分割的科研与工程人员
无监督目标发现(UOD)旨在无需人工标注的情况下检测和分割2D图像中的物体。尽管自监督表征学习取得进展,但缺乏真实标签仍带来两大挑战:一是判断发现区域是否为前景,二是确定剩余未发现物体数量。现有方法依赖启发式前景先验,并固定迭代次数,导致分割不充分或过度。本文提出UnionCut,一种基于最小割与集成方法的鲁棒前景先验,可检测图像中所有前景区域的并集,帮助UOD算法准确识别前景并适时停止。此外,提出轻量级模型UnionSeg,更高效精准输出前景并集。实验表明,结合UnionCut或UnionSeg后,现有顶尖UOD方法在多种基准上的单对象发现、显著性检测和自监督实例分割性能均显著提升。代码已开源。
原文摘要 · Abstract (English)
Unsupervised object discovery (UOD) aims to detect and segment objects in 2D images without handcrafted annotations. Recent progress in self-supervised representation learning has led to some success in UOD algorithms. However, the absence of ground truth provides existing UOD methods with two challenges: 1) determining if a discovered region is foreground or background, and 2) knowing how many objects remain undiscovered. To address these two problems, previous solutions rely on foreground priors to distinguish if the discovered region is foreground, and conduct one or fixed iterations of discovery. However, the existing foreground priors are heuristic and not always robust, and a fixed number of discoveries leads to under or over-segmentation, since the number of objects in images varies. This paper introduces UnionCut, a robust and well-grounded foreground prior based on min-cut and ensemble methods that detects the union of foreground areas of an image, allowing UOD algorithms to identify foreground objects and stop discovery once the majority of the foreground union in the image is segmented. In addition, we propose UnionSeg, a distilled transformer of UnionCut that outputs the foreground union more efficiently and accurately. Our experiments show that by combining with UnionCut or UnionSeg, previous state-of-the-art UOD methods witness an increase in the performance of single object discovery, saliency detection and self-supervised instance segmentation on various benchmarks. The code is available at https://github.com/YFaris/UnionCut.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。