diff options
| author | tlacombe <lacombe1993@gmail.com> | 2019-10-17 23:54:39 +0200 |
|---|---|---|
| committer | tlacombe <lacombe1993@gmail.com> | 2019-10-17 23:54:39 +0200 |
| commit | 7ea7dfe83e93dc3d33d8d50917f718c05f32ca7f (patch) | |
| tree | dad94535a7f615d259ad88b46ca113498b9cf683 /src/python/doc/wasserstein_distance_sum.inc | |
| parent | 91632989f92b89752dd4e59836dff80b43f349f1 (diff) | |
removed GPL license, updated expected gudhi release (set at 3.1.0 for now)
Diffstat (limited to 'src/python/doc/wasserstein_distance_sum.inc')
| -rw-r--r-- | src/python/doc/wasserstein_distance_sum.inc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/python/doc/wasserstein_distance_sum.inc b/src/python/doc/wasserstein_distance_sum.inc index 3b0b9025..24b72c0e 100644 --- a/src/python/doc/wasserstein_distance_sum.inc +++ b/src/python/doc/wasserstein_distance_sum.inc @@ -4,9 +4,9 @@ +-----------------------------------------------------------------+----------------------------------------------------------------------+------------------------------------------------------------------+ | .. figure:: | The p-Wasserstein distance measures the similarity between two | :Author: Theo Lacombe | | ../../doc/Bottleneck_distance/perturb_pd.png | persistence diagrams. It's the minimum value c that can be achieve by| | - | :figclass: align-center | a perfect matching between the points of the two diagrams (+ all the | :Introduced in: GUDHI 2.0.0 | + | :figclass: align-center | a perfect matching between the points of the two diagrams (+ all the | :Introduced in: GUDHI 3.1.0 | | | diagonal points), where the value of a matching is defined as the | | - | Wasserstein distance is the p-th root of the sum of the | p-th root of the sum of all edges lengths to the power p. Edges | :Copyright: MIT (`GPL v3 </licensing/>`_) | + | Wasserstein distance is the p-th root of the sum of the | p-th root of the sum of all edges lengths to the power p. Edges | :Copyright: MIT | | edges lengths to the power p. | lengths are measured in norm q, for :math:`1 \leq q \leq \infty`. | | | | | :Requires: Python Optimal Transport (POT) :math:`\geq` 0.5.1 | +-----------------------------------------------------------------+----------------------------------------------------------------------+------------------------------------------------------------------+ |