2014
DOI: 10.1016/j.jcp.2013.12.015
|View full text |Cite
|
Sign up to set email alerts
|

Numerical solution of the Optimal Transportation problem using the Monge–Ampère equation

Abstract: Abstract. A numerical method for the solution of the elliptic MongeAmpère Partial Differential Equation, with boundary conditions corresponding to the Optimal Transportation (OT) problem is presented. A local representation of the OT boundary conditions is combined with a finite difference scheme for the Monge-Ampère equation. Newton's method is implemented leading to a fast solver, comparable to solving the Laplace equation on the same grid several times. Theoretical justification for the method is given by a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
206
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 187 publications
(217 citation statements)
references
References 41 publications
2
206
0
Order By: Relevance
“…Our implementation is based on Chartrand, Wohlberg, Vixie, and Bollt (2009) and ideas from Benamou, Froese, and Oberman (2014) and uses the known fact that the Brenier map is the only mapping (i) that will transform the one given density into another given density and (ii) that can be written as the gradient of a convex function. The constraint that the original density f (y) be mapped to Φ (x) by the map x = T (y) can be expressed using the usual change of variables formula:…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our implementation is based on Chartrand, Wohlberg, Vixie, and Bollt (2009) and ideas from Benamou, Froese, and Oberman (2014) and uses the known fact that the Brenier map is the only mapping (i) that will transform the one given density into another given density and (ii) that can be written as the gradient of a convex function. The constraint that the original density f (y) be mapped to Φ (x) by the map x = T (y) can be expressed using the usual change of variables formula:…”
Section: Methodsmentioning
confidence: 99%
“…This characterization of the Brenier map actually even relaxes any requirement of y having a finite variance. Numerous numerical methods to find T (y) are available in the literature (e.g., Villani (2003), Villani (2009), Benamou and Brenier (2000), Chartrand, Wohlberg, Vixie, andBollt (2009), Benamou, Froese, andOberman (2014)). We show that this optimal transportation problem is directly related to the determination of nonlinear independent components that best represent the data.…”
Section: Outlinementioning
confidence: 99%
“…Alternatively, there are continuous solvers, based on the polar factorization theorem and the Monge-Ampère equation (e.g. [20,14,7]). These need not handle the full product space, but work directly with a transport map and thus can solve large problems more efficiently.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Assuming full support is also common for continuous solvers (e.g. [20,7]). This can be ensured by adding a small constant measure.…”
Section: Remark 62 (Truncation) Note That the Algorithms Lemon-ns Amentioning
confidence: 99%
“…We also describe how to construct first-order algorithms to compute critical points to the corresponding optimization problems and how to apply the proposed methods to image interpolation. Notice that due to this generalized form, the associated Euler-Lagrange equations are not of Monge-Ampère type and second-order algorithms based on this formulation [30], and recently [19,6,5,7], can not be used in our context. The dynamical optimal transportation formulation is also the only one that can handle vanishing densities (without any assumption on the support of the densities), which is also of interest for image processing applications.…”
Section: Introductionmentioning
confidence: 99%