Top-Related Meta-Learning Method for Few-Shot Object Detection
- URL: http://arxiv.org/abs/2007.06837v6
- Date: Tue, 15 Jun 2021 08:29:50 GMT
- Title: Top-Related Meta-Learning Method for Few-Shot Object Detection
- Authors: Qian Li, Nan Guo, Xiaochun Ye, Duo Wang, Dongrui Fan and Zhimin Tang
- Abstract summary: We propose a Top-C classification loss (i.e., TCL-C) for classification task and a category-based grouping mechanism for category-based meta-features obtained by the meta-model.
Ours significantly outperforms previous state-of-the-art methods for few-shot detection.
- Score: 8.144721518458844
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Many meta-learning methods are proposed for few-shot detection. However,
previous most methods have two main problems, poor detection APs, and strong
bias because of imbalance and insufficient datasets. Previous works mainly
alleviate these issues by additional datasets, multi-relation attention
mechanisms and sub-modules. However, they require more cost. In this work, for
meta-learning, we find that the main challenges focus on related or irrelevant
semantic features between categories. Therefore, based on semantic features, we
propose a Top-C classification loss (i.e., TCL-C) for classification task and a
category-based grouping mechanism for category-based meta-features obtained by
the meta-model. The TCL-C exploits the true-label prediction and the most
likely C-1 false classification predictions to improve detection performance on
few-shot classes. According to similar appearance (i.e., visual appearance,
shape, and limbs etc.) and environment in which objects often appear, the
category-based grouping mechanism splits categories into disjoint groups to
make similar semantic features more compact between categories within a group
and obtain more significant difference between groups, alleviating the strong
bias problem and further improving detection APs. The whole training consists
of the base model and the fine-tuning phases. According to grouping mechanism,
we group the meta-features vectors obtained by meta-model, so that the
distribution difference between groups is obvious, and the one within each
group is less. Extensive experiments on Pascal VOC dataset demonstrate that
ours which combines the TCL-C with category-based grouping significantly
outperforms previous state-of-the-art methods for few-shot detection. Compared
with previous competitive baseline, ours improves detection APs by almost 4%
for few-shot detection.
Related papers
- Queryable Prototype Multiple Instance Learning with Vision-Language Models for Incremental Whole Slide Image Classification [10.667645628712542]
This paper proposes the first Vision-Language-based framework with Queryable Prototype Multiple Instance Learning (QPMIL-VL) specially designed for incremental WSI classification.
experiments on four TCGA datasets demonstrate that our QPMIL-VL framework is effective for incremental WSI classification.
arXiv Detail & Related papers (2024-10-14T14:49:34Z) - MMCL: Boosting Deformable DETR-Based Detectors with Multi-Class Min-Margin Contrastive Learning for Superior Prohibited Item Detection [8.23801404004195]
Prohibited Item detection in X-ray images is one of the most effective security inspection methods.
overlapping unique phenomena in X-ray images lead to the coupling of foreground and background features.
We propose a Multi-Class Min-Margin Contrastive Learning (MMCL) method to clarify the category semantic information of content queries.
arXiv Detail & Related papers (2024-06-05T12:07:58Z) - Balanced Classification: A Unified Framework for Long-Tailed Object
Detection [74.94216414011326]
Conventional detectors suffer from performance degradation when dealing with long-tailed data due to a classification bias towards the majority head categories.
We introduce a unified framework called BAlanced CLassification (BACL), which enables adaptive rectification of inequalities caused by disparities in category distribution.
BACL consistently achieves performance improvements across various datasets with different backbones and architectures.
arXiv Detail & Related papers (2023-08-04T09:11:07Z) - Dynamic Conceptional Contrastive Learning for Generalized Category
Discovery [76.82327473338734]
Generalized category discovery (GCD) aims to automatically cluster partially labeled data.
Unlabeled data contain instances that are not only from known categories of the labeled data but also from novel categories.
One effective way for GCD is applying self-supervised learning to learn discriminate representation for unlabeled data.
We propose a Dynamic Conceptional Contrastive Learning framework, which can effectively improve clustering accuracy.
arXiv Detail & Related papers (2023-03-30T14:04:39Z) - Mutual Exclusive Modulator for Long-Tailed Recognition [12.706961256329572]
Long-tailed recognition is the task of learning high-performance classifiers given extremely imbalanced training samples between categories.
We introduce a mutual exclusive modulator which can estimate the probability of an image belonging to each group.
Our method achieves competitive performance compared to the state-of-the-art benchmarks.
arXiv Detail & Related papers (2023-02-19T07:31:49Z) - 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) - The Overlooked Classifier in Human-Object Interaction Recognition [82.20671129356037]
We encode the semantic correlation among classes into the classification head by initializing the weights with language embeddings of HOIs.
We propose a new loss named LSE-Sign to enhance multi-label learning on a long-tailed dataset.
Our simple yet effective method enables detection-free HOI classification, outperforming the state-of-the-arts that require object detection and human pose by a clear margin.
arXiv Detail & Related papers (2022-03-10T23:35:00Z) - Adaptive Class Suppression Loss for Long-Tail Object Detection [49.7273558444966]
We devise a novel Adaptive Class Suppression Loss (ACSL) to improve the detection performance of tail categories.
Our ACSL achieves 5.18% and 5.2% improvements with ResNet50-FPN, and sets a new state of the art.
arXiv Detail & Related papers (2021-04-02T05:12:31Z) - Model Patching: Closing the Subgroup Performance Gap with Data
Augmentation [50.35010342284508]
We introduce model patching, a framework for improving robustness of machine learning models.
Model patching encourages the model to be invariant to subgroup differences, and focus on class information shared by subgroups.
We instantiate model patching with CAMEL, which (1) uses a CycleGAN to learn the intra-class, inter-subgroup augmentations, and (2) balances subgroup performance using a theoretically-motivated consistency regularizer.
We demonstrate CAMEL's effectiveness on 3 benchmark datasets, with reductions in robust error up to 33% relative to the best baseline.
arXiv Detail & Related papers (2020-08-15T20:01:23Z)
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.