TALDS-Net: Task-Aware Adaptive Local Descriptors Selection for Few-shot Image Classification

• URL: http://arxiv.org/abs/2312.05449v2
• Date: Tue, 3 Sep 2024 08:01:47 GMT
• Title: TALDS-Net: Task-Aware Adaptive Local Descriptors Selection for Few-shot Image Classification
• Authors: Qian Qiao, Yu Xie, Ziyin Zeng, Fanzhang Li,
• Abstract summary: Few-shot image classification aims to classify images from unseen novel classes with few samples. Recent works demonstrate that deep local descriptors exhibit enhanced representational capabilities compared to image-level features. We propose a novel Task-Aware Adaptive Local Descriptors Selection Network (TALDS-Net)
• Score: 6.204356280380338
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Few-shot image classification aims to classify images from unseen novel classes with few samples. Recent works demonstrate that deep local descriptors exhibit enhanced representational capabilities compared to image-level features. However, most existing methods solely rely on either employing all local descriptors or directly utilizing partial descriptors, potentially resulting in the loss of crucial information. Moreover, these methods primarily emphasize the selection of query descriptors while overlooking support descriptors. In this paper, we propose a novel Task-Aware Adaptive Local Descriptors Selection Network (TALDS-Net), which exhibits the capacity for adaptive selection of task-aware support descriptors and query descriptors. Specifically, we compare the similarity of each local support descriptor with other local support descriptors to obtain the optimal support descriptor subset and then compare the query descriptors with the optimal support subset to obtain discriminative query descriptors. Extensive experiments demonstrate that our TALDS-Net outperforms state-of-the-art methods on both general and fine-grained datasets.

Related papers

• Feature Aligning Few shot Learning Method Using Local Descriptors Weighted Rules [0.0]
  Few-shot classification involves identifying new categories using a limited number of labeled samples. This paper proposes a Feature Aligning Few-shot Learning Method Using Local Descriptors Weighted Rules (FAFD-LDWR) It innovatively introduces a cross-normalization method into few-shot image classification to preserve the discriminative information of local descriptors as much as possible; and enhances classification performance by aligning key local descriptors of support and query sets to remove background noise.
  arXiv  Detail & Related papers  (2024-08-26T11:36:38Z)
• A Simple Task-aware Contrastive Local Descriptor Selection Strategy for Few-shot Learning between inter class and intra class [6.204356280380338]
  Few-shot image classification aims to classify novel classes with few labeled samples. Recent research indicates that deep local descriptors have better representational capabilities. This paper proposes a novel task-aware contrastive local descriptor selection network (TCDSNet)
  arXiv  Detail & Related papers  (2024-08-12T07:04:52Z)
• Residual Learning for Image Point Descriptors [56.917951170421894]
  We propose a very simple and effective approach to learning local image descriptors by using a hand-crafted detector and descriptor. We optimize the final descriptor by leveraging the knowledge already present in the handcrafted descriptor. Our approach has potential applications in ensemble learning and learning with non-differentiable functions.
  arXiv  Detail & Related papers  (2023-12-24T12:51:30Z)
• PromptNER: A Prompting Method for Few-shot Named Entity Recognition via k Nearest Neighbor Search [56.81939214465558]
  We propose PromptNER: a novel prompting method for few-shot NER via k nearest neighbor search. We use prompts that contains entity category information to construct label prototypes, which enables our model to fine-tune with only the support set. Our approach achieves excellent transfer learning ability, and extensive experiments on the Few-NERD and CrossNER datasets demonstrate that our model achieves superior performance over state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-20T15:47:59Z)
• Learning-Based Dimensionality Reduction for Computing Compact and Effective Local Feature Descriptors [101.62384271200169]
  A distinctive representation of image patches in form of features is a key component of many computer vision and robotics tasks. We investigate multi-layer perceptrons (MLPs) to extract low-dimensional but high-quality descriptors. We consider different applications, including visual localization, patch verification, image matching and retrieval.
  arXiv  Detail & Related papers  (2022-09-27T17:59:04Z)
• Disentangled Feature Representation for Few-shot Image Classification [64.40410801469106]
  We propose a novel Disentangled Feature Representation framework, dubbed DFR, for few-shot learning applications. DFR can adaptively decouple the discriminative features that are modeled by the classification branch, from the class-irrelevant component of the variation branch. In general, most of the popular deep few-shot learning methods can be plugged in as the classification branch, thus DFR can boost their performance on various few-shot tasks.
  arXiv  Detail & Related papers  (2021-09-26T09:53:11Z)
• Learning and aggregating deep local descriptors for instance-level recognition [11.692327697598175]
  Training only requires examples of positive and negative image pairs. At inference, the local descriptors are provided by the activations of internal components of the network. We achieve state-of-the-art performance, in some cases even with a backbone network as small as ResNet18.
  arXiv  Detail & Related papers  (2020-07-26T16:30:56Z)
• Online Invariance Selection for Local Feature Descriptors [93.32949876169785]
  A limitation of current feature descriptors is the trade-off between generalization and discriminative power. We propose to overcome this limitation with a disentanglement of invariance in local descriptors and with an online selection of the most appropriate invariance given the context. We demonstrate that our method can boost the performance of current descriptors and outperforms state-of-the-art descriptors in several matching tasks.
  arXiv  Detail & Related papers  (2020-07-17T14:08:22Z)
• D2D: Keypoint Extraction with Describe to Detect Approach [48.0325745125635]
  We present a novel approach that exploits the information within the descriptor space to propose keypoint locations. We propose an approach that inverts this process by first describing and then detecting the keypoint locations.
  arXiv  Detail & Related papers  (2020-05-27T19:27:46Z)

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.