Monge's Optimal Transport Distance for Image Classification
원문 초록
This paper focuses on a similarity measure, known as the Wasserstein distance, with which to compare images. The Wasserstein distance results from a partial differential equation (PDE) formulation of Monge's optimal transport problem. We present an efficient numerical solution method for solving Monge's problem. To demonstrate the measure's discriminatory power when comparing images, we use a $1$-Nearest Neighbour ($1$-NN) machine learning algorithm to illustrate the measure's potential benefits over other more traditional distance metrics and also the Tangent Space distance, designed to perform excellently on the well-known MNIST dataset. To our knowledge, the PDE formulation of the Wasserstein metric has not been presented for dealing with image comparison, nor has the Wasserstein distance been used within the $1$-nearest neighbour architecture.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Beyond the Attention: Distinguish the Discriminative and Confusable Features For Fine-grained Image Classification
Hyperspectral Image Classification Method Based on 2D–3D CNN and Multibranch Feature Fusion
Deep Prototypical Networks with Hybrid Residual Attention for Hyperspectral Image Classification
Fast Gradient Descent Algorithm for Image Classification with Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.