diff options
author | Marc Glisse <marc.glisse@inria.fr> | 2020-04-23 14:51:53 +0200 |
---|---|---|
committer | Marc Glisse <marc.glisse@inria.fr> | 2020-04-23 14:51:53 +0200 |
commit | 031e6879f94503e5250c005f8cb71e581799d2f3 (patch) | |
tree | 500c55f4b47a33b933f03ffad16b8c26df121830 /src/python/doc/wasserstein_distance_sum.inc | |
parent | 65f6ca41a9cd6574a0ca8fa9b781c787064fe4ed (diff) | |
parent | e3f276ab5b7503ba7ce278fffbf73ebe66d6351c (diff) |
Merge remote-tracking branch 'origin/master' into compute_persistence
Diffstat (limited to 'src/python/doc/wasserstein_distance_sum.inc')
-rw-r--r-- | src/python/doc/wasserstein_distance_sum.inc | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/python/doc/wasserstein_distance_sum.inc b/src/python/doc/wasserstein_distance_sum.inc index 0ff22035..f9308e5e 100644 --- a/src/python/doc/wasserstein_distance_sum.inc +++ b/src/python/doc/wasserstein_distance_sum.inc @@ -3,11 +3,11 @@ +-----------------------------------------------------------------+----------------------------------------------------------------------+------------------------------------------------------------------+ | .. figure:: | The q-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 achieved | | - | :figclass: align-center | by a perfect matching between the points of the two diagrams (+ all | :Since: GUDHI 3.1.0 | - | | diagonal points), where the value of a matching is defined as the | | - | Wasserstein distance is the q-th root of the sum of the | q-th root of the sum of all edge lengths to the power q. Edge lengths| :License: MIT | - | edge lengths to the power q. | are measured in norm p, for :math:`1 \leq p \leq \infty`. | | + | ../../doc/Bottleneck_distance/perturb_pd.png | persistence diagrams using the sum of all edges lengths (instead of | | + | :figclass: align-center | the maximum). It allows to define sophisticated objects such as | :Since: GUDHI 3.1.0 | + | | barycenters of a family of persistence diagrams. | | + | | | :License: MIT | + | | | | | | | :Requires: Python Optimal Transport (POT) :math:`\geq` 0.5.1 | +-----------------------------------------------------------------+----------------------------------------------------------------------+------------------------------------------------------------------+ | * :doc:`wasserstein_distance_user` | | |