All Questions
Tagged with wasserstein algorithms
1
question
0
votes
1
answer
205
views
What is a clever or efficient way to compute this variant of the Wasserstein distance between persistence diagrams?
A two-dimensional persistence diagram in $[0,1]$ say is just a multiset of points of $\mathbb R^2$. Given two diagrams $P=\{p_1=(a_1,b_1),\ldots, p_n= (a_n,b_n)\}$ and $Q=\{q_1=(c_1,d_1),\ldots, q_n= (...
- 10.4k