mlsanityData to 14 Oct 2026

NDPNet: A novel non-linear data projection network for few-shot fine-grained image classification

arXiv 2106.06988 ↗First posted 13 Jun 2021cs.CV cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Metric-based few-shot fine-grained image classification (FSFGIC) aims to learn a transferable feature embedding network by estimating the similarities between query images and support classes from very few examples. In this work, we propose, for the first time, to introduce the non-linear data projection concept into the design of FSFGIC architecture in order to address the limited sample problem in few-shot learning and at the same time to increase the discriminability of the model for fine-grained image classification. Specifically, we first design a feature re-abstraction embedding network that has the ability to not only obtain the required semantic features for effective metric learning but also re-enhance such features with finer details from input images. Then the descriptors of the query images and the support classes are projected into different non-linear spaces in our proposed similarity metric learning network to learn discriminative projection factors. This design can effectively operate in the challenging and restricted condition of a FSFGIC task for making the distance between the samples within the same class smaller and the distance between samples from different classes larger and for reducing the coupling relationship between samples from different categories. Furthermore, a novel similarity measure based on the proposed non-linear data project is presented for evaluating the relationships of feature information between a query image and a support set. It is worth to note that our proposed architecture can be easily embedded into any episodic training mechanisms for end-to-end training from scratch. Extensive experiments on FSFGIC tasks demonstrate the superiority of the proposed methods over the state-of-the-art benchmarks.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 13 Jun 2021.

Builds on

13 of 29 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  4. 2017Prototypical Networks for Few-shot Learningcited by 3,015
  5. 2015Fast R-CNNcited by 2,933
  6. 2016Matching Networks for One Shot Learningcited by 2,255
  7. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,143
  8. 2017Few-Shot Learning with Graph Neural Networkscited by 324
  9. 2019Revisiting Local Descriptor based Image-to-Class Measure for Few-shot Learningcited by 121
  10. 2019Low-Rank Pairwise Alignment Bilinear Network For Few-Shot Fine-Grained Image Classificationcited by 36
  11. 2018Piecewise classifier mappings: Learning fine-grained learners for novel categories with few examplescited by 27
  12. 2018Power Normalizing Second-order Similarity Network for Few-shot Learningcited by 13
1 more
  1. 2019Patchy Image Structure Classification Using Multi-Orientation Region Transformcited by 13

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 4; 2026: 6.

13 papers.

Sort: