RbA: Segmenting Unknown Regions Rejected by All

• URL: http://arxiv.org/abs/2211.14293v2
• Date: Wed, 29 Mar 2023 17:57:09 GMT
• Title: RbA: Segmenting Unknown Regions Rejected by All
• Authors: Nazir Nayal, M{\i}sra Yavuz, Jo\~ao F. Henriques, Fatma G\"uney
• Abstract summary: We show that the object queries in mask classification tend to behave like one vs all classifiers. We propose a novel outlier scoring function called RbA by defining the event of being an outlier as being rejected by all known classes. Our experiments show that mask classification improves the performance of the existing outlier detection methods, and the best results are achieved with the proposed RbA.
• Score: 1.3381749415517021
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Standard semantic segmentation models owe their success to curated datasets with a fixed set of semantic categories, without contemplating the possibility of identifying unknown objects from novel categories. Existing methods in outlier detection suffer from a lack of smoothness and objectness in their predictions, due to limitations of the per-pixel classification paradigm. Furthermore, additional training for detecting outliers harms the performance of known classes. In this paper, we explore another paradigm with region-level classification to better segment unknown objects. We show that the object queries in mask classification tend to behave like one \vs all classifiers. Based on this finding, we propose a novel outlier scoring function called RbA by defining the event of being an outlier as being rejected by all known classes. Our extensive experiments show that mask classification improves the performance of the existing outlier detection methods, and the best results are achieved with the proposed RbA. We also propose an objective to optimize RbA using minimal outlier supervision. Further fine-tuning with outliers improves the unknown performance, and unlike previous methods, it does not degrade the inlier performance.

Related papers

• Collaborative Feature-Logits Contrastive Learning for Open-Set Semi-Supervised Object Detection [75.02249869573994]
  In open-set scenarios, the unlabeled dataset contains both in-distribution (ID) classes and out-of-distribution (OOD) classes. Applying semi-supervised detectors in such settings can lead to misclassifying OOD class as ID classes. We propose a simple yet effective method, termed Collaborative Feature-Logits Detector (CFL-Detector)
  arXiv  Detail & Related papers  (2024-11-20T02:57:35Z)
• Rethinking Unsupervised Outlier Detection via Multiple Thresholding [15.686139522490189]
  We propose a multiple thresholding (Multi-T) module to advance existing scoring methods. It generates two thresholds that isolate inliers and outliers from the unlabelled target dataset. Experiments verify that Multi-T can significantly improve proposed outlier scoring methods.
  arXiv  Detail & Related papers  (2024-07-07T14:09:50Z)
• SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learning [106.46648817126984]
  In this paper, we study the challenging and realistic open-set SSL setting. The goal is to both correctly classify inliers and to detect outliers. We find that inlier classification performance can be largely improved by incorporating high-confidence pseudo-labeled data.
  arXiv  Detail & Related papers  (2023-11-17T15:14:40Z)
• Retrieval-Augmented Classification with Decoupled Representation [31.662843145399044]
  We propose a $k$-nearest-neighbor (KNN)-based method for retrieval augmented classifications. We find that shared representation for classification and retrieval hurts performance and leads to training instability. We evaluate our method on a wide range of classification datasets.
  arXiv  Detail & Related papers  (2023-03-23T06:33:06Z)
• Parametric Classification for Generalized Category Discovery: A Baseline Study [70.73212959385387]
  Generalized Category Discovery (GCD) aims to discover novel categories in unlabelled datasets using knowledge learned from labelled samples. We investigate the failure of parametric classifiers, verify the effectiveness of previous design choices when high-quality supervision is available, and identify unreliable pseudo-labels as a key problem. We propose a simple yet effective parametric classification method that benefits from entropy regularisation, achieves state-of-the-art performance on multiple GCD benchmarks and shows strong robustness to unknown class numbers.
  arXiv  Detail & Related papers  (2022-11-21T18:47:11Z)
• Learning and Evaluating Representations for Deep One-class Classification [59.095144932794646]
  We present a two-stage framework for deep one-class classification. We first learn self-supervised representations from one-class data, and then build one-class classifiers on learned representations. In experiments, we demonstrate state-of-the-art performance on visual domain one-class classification benchmarks.
  arXiv  Detail & Related papers  (2020-11-04T23:33:41Z)
• Predicting Classification Accuracy When Adding New Unobserved Classes [8.325327265120283]
  We study how a classifier's performance can be used to extrapolate its expected accuracy on a larger, unobserved set of classes. We formulate a robust neural-network-based algorithm, "CleaneX", which learns to estimate the accuracy of such classifiers on arbitrarily large sets of classes.
  arXiv  Detail & Related papers  (2020-10-28T14:37:25Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)
• Few-Shot Open-Set Recognition using Meta-Learning [72.15940446408824]
  The problem of open-set recognition is considered. A new oPen sEt mEta LEaRning (PEELER) algorithm is introduced.
  arXiv  Detail & Related papers  (2020-05-27T23:49:26Z)

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.