Wasserstein barycenters and applications in image processing: Difference between revisions
No edit summary |
No edit summary |
||
Line 9: | Line 9: | ||
===Definition=== | ===Definition=== | ||
Let <math>\Omega</math> be a [https://en.wikipedia.org/wiki/Domain_(mathematical_analysis) domain] and <math>\mathcal{P}(\Omega)</math> be the set of probability measures on <math>\Omega</math>. Given a collection of probability measures <math> \{\mu_i \}_{i \in I}</math> and nonnegative weights <math>\{\lambda_i\}_{i \in I}</math>, we define a weighted barycenter of <math>\{\mu\}</math> as any probability measure <math>\mu</math> that minimizes | Let <math>\Omega</math> be a [https://en.wikipedia.org/wiki/Domain_(mathematical_analysis) domain] and <math>\mathcal{P}(\Omega)</math> be the set of probability measures on <math>\Omega</math>. Given a collection of probability measures <math> \{\mu_i \}_{i \in I}</math> and nonnegative weights <math>\{\lambda_i\}_{i \in I}</math>, we define a weighted barycenter of <math>\{\mu\}</math> as any probability measure <math>\mu</math> that minimizes | ||
<math>\sum_{i \in I} \lambda_i W_2 | <math>\sum_{i \in I} \lambda_i W_2( \mu_i, \mu)^2</math> over the space <math>\mu \in \mathcal{P}(\Omega)</math>. Here <math>W_2</math> denotes the 2-Wasserstein distance, which may be replaced with the <math>p</math>-Wasserstein distance, <math>W_p</math>, though this is not always as convenient. | ||
The minimization problem above was originally introduced by Agueh and Carlier <ref>Martial Agueh, Guillaume Carlier. Barycenters in the Wasserstein space. SIAM Journal on | |||
Mathematical Analysis, Society for Industrial and Applied Mathematics, 2011, 43 (2), pp.904-924. | |||
ff10.1137/100805741ff. ffhal-00637399f</ref>, who also proposed an alternative formulation of the problem above when there are finitely many measures <math>\{\mu_i\}_{i = 1}^N</math>. Instead of considering the sum over all probability measures <math>\mu \in \mathcal{P}(\Omega)</math>, one can equivalently consider the optimization problem over all multi-marginal transport plans <math>\gamma \in \mathcal{P}(\Omega^{N+1})</math> whose [https://en.wikipedia.org/wiki/Pushforward_measure push forwards] satisfy <math>(\pi_i)_{#} \gamma = \mu_i</math> for <math>i \in \{1, \ldots, N\}</math> and <math>(\pi_0)_{#} \gamma = \mu</math> for some variable probability measure <math>\mu</math>. | |||
===Existence and Uniqueness=== | ===Existence and Uniqueness=== |
Revision as of 00:45, 12 February 2022
In optimal transport, a Wasserstein barycenter [1] is a probability measure that acts as a center of mass between two or more probability measures. It generalizes the notions of physical barycenters and geometric centroids.
Introduction
Motivation
Barycenters in physics and geometry are points that represent a notion of a mean of a number of objects. In astronomy, the barycenter is the center of mass of two or more objects that orbit each other, and in geometry, a centroid is the arithmetic mean of all the points in an object. Given countably many points in with nonnegative weights , the weighted barycenter of the points is the unique point minimizing . Wasserstein barycenters attempt to capture this concept for probability measures by replacing the Euclidean distance with the Wasserstein distance of two probability measures, .
Definition
Let be a domain and be the set of probability measures on . Given a collection of probability measures and nonnegative weights , we define a weighted barycenter of as any probability measure that minimizes over the space . Here denotes the 2-Wasserstein distance, which may be replaced with the -Wasserstein distance, , though this is not always as convenient.
The minimization problem above was originally introduced by Agueh and Carlier [2], who also proposed an alternative formulation of the problem above when there are finitely many measures . Instead of considering the sum over all probability measures , one can equivalently consider the optimization problem over all multi-marginal transport plans whose push forwards satisfy Failed to parse (syntax error): {\displaystyle (\pi_i)_{#} \gamma = \mu_i} for and Failed to parse (syntax error): {\displaystyle (\pi_0)_{#} \gamma = \mu} for some variable probability measure .
Existence and Uniqueness
Examples
Applications
Barycenters in Image processing
Generalizations
Wasserstein barycenters are examples of Karcher and Fréchet means where the distance function used is the Wasserstein distance.
References
- ↑ Santambrogio, Filippo. Optimal Transport for Applied Mathematicians. Birkhäuser., 2015.
- ↑ Martial Agueh, Guillaume Carlier. Barycenters in the Wasserstein space. SIAM Journal on Mathematical Analysis, Society for Industrial and Applied Mathematics, 2011, 43 (2), pp.904-924. ff10.1137/100805741ff. ffhal-00637399f