End-to-end Learning of a Fisher Vector Encoding for Part Features in Fine-grained Recognition

• URL: http://arxiv.org/abs/2007.02080v2
• Date: Fri, 28 Jul 2023 07:17:05 GMT
• Title: End-to-end Learning of a Fisher Vector Encoding for Part Features in Fine-grained Recognition
• Authors: Dimitri Korsch, Paul Bodesheim, Joachim Denzler
• Abstract summary: We assume that part-based methods suffer from a missing representation of local features. We propose integrating a Fisher vector encoding of part features into convolutional neural networks. Our approach improves state-of-the-art accuracies for three bird species classification datasets.
• Score: 10.423464288613275
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Part-based approaches for fine-grained recognition do not show the expected performance gain over global methods, although explicitly focusing on small details that are relevant for distinguishing highly similar classes. We assume that part-based methods suffer from a missing representation of local features, which is invariant to the order of parts and can handle a varying number of visible parts appropriately. The order of parts is artificial and often only given by ground-truth annotations, whereas viewpoint variations and occlusions result in not observable parts. Therefore, we propose integrating a Fisher vector encoding of part features into convolutional neural networks. The parameters for this encoding are estimated by an online EM algorithm jointly with those of the neural network and are more precise than the estimates of previous works. Our approach improves state-of-the-art accuracies for three bird species classification datasets.

Related papers

• Class-Imbalanced Semi-Supervised Learning for Large-Scale Point Cloud Semantic Segmentation via Decoupling Optimization [64.36097398869774]
  Semi-supervised learning (SSL) has been an active research topic for large-scale 3D scene understanding. The existing SSL-based methods suffer from severe training bias due to class imbalance and long-tail distributions of the point cloud data. We introduce a new decoupling optimization framework, which disentangles feature representation learning and classifier in an alternative optimization manner to shift the bias decision boundary effectively.
  arXiv  Detail & Related papers  (2024-01-13T04:16:40Z)
• PDiscoNet: Semantically consistent part discovery for fine-grained recognition [62.12602920807109]
  We propose PDiscoNet to discover object parts by using only image-level class labels along with priors encouraging the parts to be. Our results on CUB, CelebA, and PartImageNet show that the proposed method provides substantially better part discovery performance than previous methods.
  arXiv  Detail & Related papers  (2023-09-06T17:19:29Z)
• Part-guided Relational Transformers for Fine-grained Visual Recognition [59.20531172172135]
  We propose a framework to learn the discriminative part features and explore correlations with a feature transformation module. Our proposed approach does not rely on additional part branches and reaches state-the-of-art performance on 3-of-the-level object recognition.
  arXiv  Detail & Related papers  (2022-12-28T03:45:56Z)
• Unsupervised Part Discovery from Contrastive Reconstruction [90.88501867321573]
  The goal of self-supervised visual representation learning is to learn strong, transferable image representations. We propose an unsupervised approach to object part discovery and segmentation. Our method yields semantic parts consistent across fine-grained but visually distinct categories.
  arXiv  Detail & Related papers  (2021-11-11T17:59:42Z)
• Learning Debiased and Disentangled Representations for Semantic Segmentation [52.35766945827972]
  We propose a model-agnostic and training scheme for semantic segmentation. By randomly eliminating certain class information in each training iteration, we effectively reduce feature dependencies among classes. Models trained with our approach demonstrate strong results on multiple semantic segmentation benchmarks.
  arXiv  Detail & Related papers  (2021-10-31T16:15:09Z)
• Point Cloud Registration using Representative Overlapping Points [10.843159482657303]
  We propose ROPNet, a new deep learning model using Representative Overlapping Points with discriminative features for registration. Specifically, we propose a context-guided module which uses an encoder to extract global features for predicting point overlap score. Experiments over ModelNet40 using noisy and partially overlapping point clouds show that the proposed method outperforms traditional and learning-based methods.
  arXiv  Detail & Related papers  (2021-07-06T12:52:22Z)
• Zero-Shot Learning from Adversarial Feature Residual to Compact Visual Feature [26.89763840782029]
  We propose a novel adversarial network to synthesize compact semantic visual features for zero-shot learning (ZSL) The residual generator is to generate the visual feature residual, which is integrated with a visual prototype predicted via the prototype predictor. The discriminator is to distinguish the synthetic visual features from the real ones extracted from an existing categorization CNN.
  arXiv  Detail & Related papers  (2020-08-29T11:16:11Z)
• Interpretable and Accurate Fine-grained Recognition via Region Grouping [14.28113520947247]
  We present an interpretable deep model for fine-grained visual recognition. At the core of our method lies the integration of region-based part discovery and attribution within a deep neural network. Our results compare favorably to state-of-the-art methods on classification tasks.
  arXiv  Detail & Related papers  (2020-05-21T01:18:26Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)

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.