蒙特问题最优运输距离用于图像分类
Monge's Optimal Transport Distance for Image Classification
AI总结:
本文提出利用Wasserstein距离进行图像比较,通过求解Monge问题的高效数值方法,并用1-NN算法展示其在图像分类中的优势。
摘要:
本文聚焦于一种用于图像比较的相似性度量,即Wasserstein距离。Wasserstein距离源于Monge最优运输问题的偏微分方程(PDE) formulation。我们提出了一个高效的数值求解方法来解决Monge问题。为了展示该度量在图像比较中的判别能力,我们使用$1$-近邻($1$-NN)机器学习算法来展示该度量相对于其他更传统距离度量以及Tangent Space距离在MNIST数据集上的优势。到目前为止,Wasserstein度量的PDE formulation尚未用于处理图像比较,也尚未在$1$-nearest neighbour架构中使用Wasserstein距离。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。