Learning Generalized Hybrid Proximity Representation for Image Recognition

• URL: http://arxiv.org/abs/2301.13459v2
• Date: Sun, 16 Apr 2023 03:22:41 GMT
• Title: Learning Generalized Hybrid Proximity Representation for Image Recognition
• Authors: Zhiyuan Li, Anca Ralescu
• Abstract summary: We propose a novel supervised metric learning method that can learn the distance metrics in both geometric and probabilistic space for image recognition. In contrast to the previous metric learning methods which usually focus on learning the distance metrics in Euclidean space, our proposed method is able to learn better distance representation in a hybrid approach.
• Score: 8.750658662419328
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, deep metric learning techniques received attention, as the learned distance representations are useful to capture the similarity relationship among samples and further improve the performance of various of supervised or unsupervised learning tasks. We propose a novel supervised metric learning method that can learn the distance metrics in both geometric and probabilistic space for image recognition. In contrast to the previous metric learning methods which usually focus on learning the distance metrics in Euclidean space, our proposed method is able to learn better distance representation in a hybrid approach. To achieve this, we proposed a Generalized Hybrid Metric Loss (GHM-Loss) to learn the general hybrid proximity features from the image data by controlling the trade-off between geometric proximity and probabilistic proximity. To evaluate the effectiveness of our method, we first provide theoretical derivations and proofs of the proposed loss function, then we perform extensive experiments on two public datasets to show the advantage of our method compared to other state-of-the-art metric learning methods.

Related papers

• Hyp-UML: Hyperbolic Image Retrieval with Uncertainty-aware Metric Learning [8.012146883983227]
  Metric learning plays a critical role in training image retrieval and classification. Hyperbolic embedding can be more effective in representing the hierarchical data structure. We propose two types of uncertainty-aware metric learning, for the popular Contrastive learning and conventional margin-based metric learning.
  arXiv  Detail & Related papers  (2023-10-12T15:00:06Z)
• Histopathology Image Classification using Deep Manifold Contrastive Learning [8.590026259176806]
  We propose a novel extension of contrastive learning that leverages geodesic distance between features as a similarity metric for histopathology whole slide image classification. Results demonstrate that our method outperforms state-of-the-art cosine-distance-based contrastive learning methods.
  arXiv  Detail & Related papers  (2023-06-26T07:02:07Z)
• Learning Empirical Bregman Divergence for Uncertain Distance Representation [3.9142982525021512]
  We introduce a novel method for learning empirical Bregman divergence directly from data based on parameterizing the convex function underlying the Bregman divergence with a deep learning setting. Our approach performs effectively on five popular public datasets compared to other SOTA deep metric learning methods, particularly for pattern recognition problems.
  arXiv  Detail & Related papers  (2023-04-16T04:16:28Z)
• Metric Learning as a Service with Covariance Embedding [7.5989847759545155]
  Metric learning aims to maximize and minimize inter- and intra-class similarities. Existing models mainly rely on distance measures to obtain a separable embedding space. We argue that to enable metric learning as a service for high-performance deep learning applications, we should also wisely deal with inter-class relationships.
  arXiv  Detail & Related papers  (2022-11-28T10:10:59Z)
• Neural Bregman Divergences for Distance Learning [60.375385370556145]
  We propose a new approach to learning arbitrary Bregman divergences in a differentiable manner via input convex neural networks. We show that our method more faithfully learns divergences over a set of both new and previously studied tasks. Our tests further extend to known asymmetric, but non-Bregman tasks, where our method still performs competitively despite misspecification.
  arXiv  Detail & Related papers  (2022-06-09T20:53:15Z)
• Deep Relational Metric Learning [84.95793654872399]
  This paper presents a deep relational metric learning framework for image clustering and retrieval. We learn an ensemble of features that characterizes an image from different aspects to model both interclass and intraclass distributions. Experiments on the widely-used CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate that our framework improves existing deep metric learning methods and achieves very competitive results.
  arXiv  Detail & Related papers  (2021-08-23T09:31:18Z)
• Towards Interpretable Deep Metric Learning with Structural Matching [86.16700459215383]
  We present a deep interpretable metric learning (DIML) method for more transparent embedding learning. Our method is model-agnostic, which can be applied to off-the-shelf backbone networks and metric learning methods. We evaluate our method on three major benchmarks of deep metric learning including CUB200-2011, Cars196, and Stanford Online Products.
  arXiv  Detail & Related papers  (2021-08-12T17:59:09Z)
• An Adaptive Framework for Learning Unsupervised Depth Completion [59.17364202590475]
  We present a method to infer a dense depth map from a color image and associated sparse depth measurements. We show that regularization and co-visibility are related via the fitness of the model to data and can be unified into a single framework.
  arXiv  Detail & Related papers  (2021-06-06T02:27:55Z)
• SIMPLE: SIngle-network with Mimicking and Point Learning for Bottom-up Human Pose Estimation [81.03485688525133]
  We propose a novel multi-person pose estimation framework, SIngle-network with Mimicking and Point Learning for Bottom-up Human Pose Estimation (SIMPLE) Specifically, in the training process, we enable SIMPLE to mimic the pose knowledge from the high-performance top-down pipeline. Besides, SIMPLE formulates human detection and pose estimation as a unified point learning framework to complement each other in single-network.
  arXiv  Detail & Related papers  (2021-04-06T13:12:51Z)
• Towards Certified Robustness of Distance Metric Learning [53.96113074344632]
  We advocate imposing an adversarial margin in the input space so as to improve the generalization and robustness of metric learning algorithms. We show that the enlarged margin is beneficial to the generalization ability by using the theoretical technique of algorithmic robustness.
  arXiv  Detail & Related papers  (2020-06-10T16:51:53Z)

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.