paper-with-me

홈 › Papers

FindMeIfYouCan: Bringing Open Set metrics to $\textit{near} $, $ \textit{far} $ and $\textit{farther}$ Out-of-Distribution Object Detection

2025-06-16 · Daniel Montoya, Aymen Bouguerra, Alexandra Gomez-Villa, Fabio Arnez

State-of-the-art Object Detection (OD) methods predominantly operate under a closed-world assumption, where test-time categories match those encountered during training. However, detecting and localizing unknown objects is crucial for safety-critical applications in domains such as autonomous driving and medical imaging. Recently, Out-Of-Distribution (OOD) detection has emerged as a vital research direction for OD, focusing on identifying incorrect predictions typically associated with unknown objects. This paper shows that the current evaluation protocol for OOD-OD violates the assumption of non-overlapping objects with respect to the In-Distribution (ID) datasets, and obscures crucial situations such as ignoring unknown objects, potentially leading to overconfidence in deployment scenarios where truly novel objects might be encountered. To address these limitations, we manually curate, and enrich the existing benchmark by exploiting semantic similarity to create new evaluation splits categorized as $\textit{near}$, $\textit{far}$, and $\textit{farther}$ from ID distributions. Additionally, we incorporate established metrics from the Open Set community, providing deeper insights into how effectively methods detect unknowns, when they ignore them, and when they mistakenly classify OOD objects as ID. Our comprehensive evaluation demonstrates that semantically and visually close OOD objects are easier to localize than far ones, but are also more easily confounded with ID objects. $\textit{Far}$ and $\textit{farther}$ objects are harder to localize but less prone to be taken for an ID object.

📄 PDF Abstract BibTeX arXiv:2506.14008

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous Drivingobject-detectionObject DetectionOut of Distribution (OOD) DetectionSemantic SimilaritySemantic Textual Similarity

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Platypus: Quick, Cheap, and Powerful Refinement of LLMs

2023-08-14 · Ariel N. Lee, Cole J. Hunter, Nataniel Ruiz

We present $\textbf{Platypus}$, a family of fine-tuned and merged Large Language Models (LLMs) that achieves the strongest performance and currently stands at first place in HuggingFace's Open LLM Leaderboard as of the r…

GPU

Causal-learn: Causal Discovery in Python

2023-07-31 · Yujia Zheng, Biwei Huang, Wei Chen, Joseph Ramsey 외

Causal discovery aims at revealing causal relations from observational data, which is a fundamental task in science and engineering. We describe $\textit{causal-learn}$, an open-source Python library for causal discovery…

Causal Discovery

Pymc-learn: Practical Probabilistic Machine Learning in Python

2018-10-31 · Emaasit Daniel

$\textit{Pymc-learn}$ is a Python package providing a variety of state-of-the-art probabilistic models for supervised and unsupervised machine learning. It is inspired by $\textit{scikit-learn}$ and focuses on bringing p…

BIG-bench Machine Learning

Probabilistic Inference for Learning from Untrusted Sources

2021-01-15 · Duc Thien Nguyen, Shiau Hoong Lim, Laura Wynter, Desmond Cai

Federated learning brings potential benefits of faster learning, better solutions, and a greater propensity to transfer when heterogeneous data from different parties increases diversity. However, because federated learn…

Bayesian InferenceCollaborative FilteringDiversityFederated Learning

Towards Standardization of Data Licenses: The Montreal Data License

2019-03-21 · Misha Benjamin, Paul Gagnon, Negar Rostamzadeh, Chris Pal 외

This paper provides a taxonomy for the licensing of data in the fields of artificial intelligence and machine learning. The paper's goal is to build towards a common framework for data licensing akin to the licensing of …