mlsanityData to 7 Oct 2026

Probabilistic Deep Metric Learning for Hyperspectral Image Classification

arXiv 2211.08349 ↗First posted 15 Nov 2022cs.CV cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

This paper proposes a probabilistic deep metric learning (PDML) framework for hyperspectral image classification, which aims to predict the category of each pixel for an image captured by hyperspectral sensors. The core problem for hyperspectral image classification is the spectral variability between intraclass materials and the spectral similarity between interclass materials, motivating the further incorporation of spatial information to differentiate a pixel based on its surrounding patch. However, different pixels and even the same pixel in one patch might not encode the same material due to the low spatial resolution of most hyperspectral sensors, leading to an inconsistent judgment of a specific pixel. To address this issue, we propose a probabilistic deep metric learning framework to model the categorical uncertainty of the spectral distribution of an observed pixel. We propose to learn a global probabilistic distribution for each pixel in the patch and a probabilistic metric to model the distance between distributions. We treat each pixel in a patch as a training sample, enabling us to exploit more information from the patch compared with conventional methods. Our framework can be readily applied to existing hyperspectral image classification methods with various network architectures and loss functions. Extensive experiments on four widely used datasets including IN, UP, KSC, and Houston 2013 datasets demonstrate that our framework improves the performance of existing methods and further achieves the state of the art. Code is available at: https://github.com/wzzheng/PDML.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 100 references that are in the map. First posted on arXiv 15 Nov 2022.

Builds on

25 of 100 references.

References · 25

  1. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
  2. 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
  3. 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
  4. 2017Sampling Matters in Deep Embedding Learningcited by 285
  5. 2020Proxy Anchor Loss for Deep Metric Learningcited by 195
  6. 2019Probabilistic Face Embeddingscited by 171
  7. 2021Probabilistic Embeddings for Cross-Modal Retrievalcited by 150
  8. 2020Data Uncertainty Learning in Face Recognitioncited by 134
  9. 2014Word Representations via Gaussian Embeddingcited by 96
  10. 2017Smart Mining for Deep Metric Learningcited by 96
  11. 2019Improved Embeddings with Easy Positive Triplet Miningcited by 66
  12. 2021Learning Probabilistic Ordinal Embeddings for Uncertainty-Aware Regressioncited by 58
13 more
  1. 2019Hardness-Aware Deep Metric Learningcited by 55
  2. 2019Deep Learning for Classification of Hyperspectral Data: A Comparative Reviewcited by 51
  3. 2018Three dimensional Deep Learning approach for remote sensing image classificationcited by 50
  4. 2019View-Invariant Probabilistic Embedding for Human Posecited by 47
  5. 2022Probabilistic Representations for Video Contrastive Learningcited by 33
  6. 2021Deep Metric Learning for Few-Shot Image Classification: A Review of Recent Developmentscited by 23
  7. 2021Deep Relational Metric Learningcited by 22
  8. 2020Hyperspectral Image Classification with Attention Aided CNNscited by 18
  9. 2017A Mixture Model for Learning Multi-Sense Word Embeddingscited by 12
  10. 2022Attributable Visual Similarity Learningcited by 12
  11. 2021Superpixel-guided Discriminative Low-rank Representation of Hyperspectral Images for Classificationcited by 4
  12. 2014Sparsity Constrained Graph Regularized NMF for Spectral Unmixing of Hyperspectral Datacited by 2
  13. 2019A Convolutional Neural Network with Mapping Layers for Hyperspectral Image Classificationcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.