Utilization of Neighbor Information for Image Classification with Different Levels of Supervision

• URL: http://arxiv.org/abs/2503.14500v1
• Date: Tue, 18 Mar 2025 17:59:41 GMT
• Title: Utilization of Neighbor Information for Image Classification with Different Levels of Supervision
• Authors: Gihan Jayatilaka, Abhinav Shrivastava, Matthew Gwilliam,
• Abstract summary: We propose a flexible method that performs well for both generalized category discovery (GCD) and image clustering.<n>Our method yields state-of-the-art results for both clustering (+3% ImageNet-100, Imagenet200) and GCD (+0.8% ImageNet-100, +5% CUB, +2% SCars, +4% Aircraft)
• Score: 38.350123625613804
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose to bridge the gap between semi-supervised and unsupervised image recognition with a flexible method that performs well for both generalized category discovery (GCD) and image clustering. Despite the overlap in motivation between these tasks, the methods themselves are restricted to a single task -- GCD methods are reliant on the labeled portion of the data, and deep image clustering methods have no built-in way to leverage the labels efficiently. We connect the two regimes with an innovative approach that Utilizes Neighbor Information for Classification (UNIC) both in the unsupervised (clustering) and semisupervised (GCD) setting. State-of-the-art clustering methods already rely heavily on nearest neighbors. We improve on their results substantially in two parts, first with a sampling and cleaning strategy where we identify accurate positive and negative neighbors, and secondly by finetuning the backbone with clustering losses computed by sampling both types of neighbors. We then adapt this pipeline to GCD by utilizing the labelled images as ground truth neighbors. Our method yields state-of-the-art results for both clustering (+3% ImageNet-100, Imagenet200) and GCD (+0.8% ImageNet-100, +5% CUB, +2% SCars, +4% Aircraft).

Related papers

• Contrastive Mean-Shift Learning for Generalized Category Discovery [45.19923199324919]
  We address the problem of generalized category discovery (GCD) We revisit the mean-shift algorithm, i.e., a powerful technique for mode seeking, and incorporate it into a contrastive learning framework. The proposed method, dubbed Contrastive Mean-Shift (CMS) learning, trains an image encoder to produce representations with better clustering properties.
  arXiv  Detail & Related papers  (2024-04-15T04:31:24Z)
• SPTNet: An Efficient Alternative Framework for Generalized Category Discovery with Spatial Prompt Tuning [17.520137576423593]
  Generalized Category Discovery (GCD) aims to classify unlabelled images from both seen' and unseen' classes. We introduce a two-stage adaptation approach termed SPTNet, which iteratively optimize model parameters and data parameters. We demonstrate that our method outperforms existing GCD methods on standard benchmarks.
  arXiv  Detail & Related papers  (2024-03-20T15:41:39Z)
• Generalized Category Discovery with Clustering Assignment Consistency [56.92546133591019]
  Generalized category discovery (GCD) is a recently proposed open-world task. We propose a co-training-based framework that encourages clustering consistency. Our method achieves state-of-the-art performance on three generic benchmarks and three fine-grained visual recognition datasets.
  arXiv  Detail & Related papers  (2023-10-30T00:32:47Z)
• Rethinking Image Forgery Detection via Contrastive Learning and Unsupervised Clustering [26.923409536155166]
  We propose FOrensic ContrAstive cLustering (FOCAL) method for image forgery detection. FOCAL is based on contrastive learning and unsupervised clustering. Results show FOCAL significantly outperforms state-of-the-art competing algorithms.
  arXiv  Detail & Related papers  (2023-08-18T05:05:30Z)
• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discovery [36.01459228175808]
  We propose an EM-like framework that alternates between representation learning and class number estimation. We evaluate our framework on both generic image classification datasets and challenging fine-grained object recognition datasets.
  arXiv  Detail & Related papers  (2023-05-10T13:47:38Z)
• Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
  We propose a novel framework for image clustering that incorporates joint representation learning and clustering. Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
  arXiv  Detail & Related papers  (2021-07-24T15:36:49Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• SCAN: Learning to Classify Images without Labels [73.69513783788622]
  We advocate a two-step approach where feature learning and clustering are decoupled. A self-supervised task from representation learning is employed to obtain semantically meaningful features. We obtain promising results on ImageNet, and outperform several semi-supervised learning methods in the low-data regime.
  arXiv  Detail & Related papers  (2020-05-25T18:12:33Z)

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.