Login / Signup
Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs.
Gennaro Auricchio
Federico Bassetti
Stefano Gualandi
Marco Veneroni
Published in:
NeurIPS (2018)
Keyphrases
</>
graph structure
multi dimensional
directed graph
graph matching
graph model
graph representation
feature vectors
distance measure
distance function
euclidean distance
graph partitioning
graph structures
image morphing