Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Computer Science > Computer Vision and Pattern Recognition

arXiv:2412.15668 (cs)
[Submitted on 20 Dec 2024 (v1), last revised 25 May 2026 (this version, v2)]

Title:Adaptive Hierarchical Graph Cut for Multi-granularity Out-of-distribution Detection

Authors:Xiang Fang, Arvind Easwaran, Blaise Genest, Ponnuthurai Nagaratnam Suganthan
View a PDF of the paper titled Adaptive Hierarchical Graph Cut for Multi-granularity Out-of-distribution Detection, by Xiang Fang and 3 other authors
View PDF HTML (experimental)
Abstract:This paper focuses on a significant yet challenging task: out-of-distribution detection (OOD detection), which aims to distinguish and reject test samples with semantic shifts, so as to prevent models trained on in-distribution (ID) data from producing unreliable predictions. Although previous works have made decent success, they are ineffective for real-world challenging applications since these methods simply regard all unlabeled data as OOD data and ignore the case that different datasets have different label granularity. For example, "cat" on CIFAR-10 and "tabby cat" on Tiny-ImageNet share the same semantics but have different labels due to various label granularity. To this end, in this paper, we propose a novel Adaptive Hierarchical Graph Cut network (AHGC) to deeply explore the semantic relationship between different images. Specifically, we construct a hierarchical KNN graph to evaluate the similarities between different images based on the cosine similarity. Based on the linkage and density information of the graph, we cut the graph into multiple subgraphs to integrate these semantics-similar samples. If the labeled percentage in a subgraph is larger than a threshold, we will assign the label with the highest percentage to unlabeled images. To further improve the model generalization, we augment each image into two augmentation versions, and maximize the similarity between the two versions. Finally, we leverage the similarity score for OOD detection. Extensive experiments on two challenging benchmarks (CIFAR- 10 and CIFAR-100) illustrate that in representative cases, AHGC outperforms state-of-the-art OOD detection methods by 81.24% on CIFAR-100 and by 40.47% on CIFAR-10 in terms of "FPR95", which shows the effectiveness of our AHGC.
Comments: Published in IEEE Transactions on Artificial Intelligence
Subjects: Computer Vision and Pattern Recognition (cs.CV)
Cite as: arXiv:2412.15668 [cs.CV]
  (or arXiv:2412.15668v2 [cs.CV] for this version)
  https://doi.org/10.48550/arXiv.2412.15668
arXiv-issued DOI via DataCite

Submission history

From: Xiang Fang [view email]
[v1] Fri, 20 Dec 2024 08:32:02 UTC (330 KB)
[v2] Mon, 25 May 2026 15:42:38 UTC (332 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Adaptive Hierarchical Graph Cut for Multi-granularity Out-of-distribution Detection, by Xiang Fang and 3 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

cs.CV
< prev   |   next >
new | recent | 2024-12
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences