Optimal transport with proximal splitting

SIAM Journal on Imaging Sciences

Volumn 7, Issue 1, 2014, Pages 212-238

  Papadakis, Nicolas ^a   Peyré, Gabriel ^b   Oudet, Edouard ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c UNIV GRENOBLE ALPES   (France)

Author keywords

Convex optimization; Image warping; Optimal transport; Proximal splitting

Indexed keywords

IMAGE PROCESSING; IMAGING TECHNIQUES;

IMAGE WARPING; LARGE-SCALE CONVEX OPTIMIZATION; OPTIMAL TRANSPORT; OPTIMIZATION SCHEME; PROXIMAL SPLITTING; RIEMANNIAN MANIFOLD; SPATIAL GRIDS; STAGGERED GRID;

CONVEX OPTIMIZATION;

EID: 84897483975     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/130920058     Document Type: Article

References (77)

1. M. Agueh and G. Carlier, Barycenters in the Wasserstein space, SIAM J. Math. Anal., 43 (2011), pp. 904-924.
2. J. Anderson, Computational Fluid Dynamics, McGraw-Hill Science/Engineering/Math, New York, 1995.
3. S. Angenent, S. Haker, and A. Tannenbaum, Minimizing flows for the Monge-Kantorovich problem, SIAM J. Math. Anal., 35 (2003), pp. 61-97.
4. K. J. Arrow, L. Hurwicz, and H. Uzawa, Studies in Linear and Non-linear Programming, Stanford University Press, Stanford, CA, 1958.
5. J. Benamou and Y. Brenier, Weak existence for the semigeostrophic equations formulated as a coupled Monge-Ampère/transport problem, SIAM J. Appl. Math., 58 (1998), pp. 1450-1461.
6. J.-D. Benamou, A domain decomposition method for the polar factorization of vector-valued mappings, SIAM J. Numer. Anal., 32 (1995), pp. 1808-1838.
7. J.-D. Benamou, Numerical resolution of an "unbalanced" mass transport problem, ESAIMMath.Model. Numer. Anal., 37 (2010), pp. 851-868.
8. J.-D. Benamou and Y. Brenier, A computational fluid mechanics solution of the Monge-Kantorovich mass transfer problem, Numer. Math., 84 (2000), pp. 375-393.
9. J.-D. Benamou and Y. Brenier, Wasserstein optimal mapping between prescribed densities functions, J. Optim. Theory Appl., 111 (2001), pp. 255-271.
10. J.-D. Benamou, B. D. Froese, and A. M. Oberman, A viscosity solution approach to the Monge-Ampere formulation of the optimal transportation problem, arXiv:1208.4873, 2013.
11. D. P. Bertsekas, The auction algorithm: A distributed relaxation method for the assignment problem, Ann. Oper. Res., 14 (1988), pp. 105-123.
12. J. Blum, F.-X. Le Dimet, and I. M. Navon, Data assimilation for geophysical fluids, in Handbook of Numerical Analysis 14, Elsevier, New York, 2009, pp. 385-441.
13. N. Bonneel, M. van de Panne, S. Paris, and W. Heidrich, Displacement interpolation using Lagrangian mass transport, ACM Trans. Graphics (Proceedings of SIGGRAPH Asia 2011), 30 (2011), 158.
14. F. Bornemann and C. Rasch, Finite-element discretization of static Hamilton-Jacobi equations based on a local variational principle, Comput. Visual. Sci., 9 (2006), pp. 57-69.
15. S. Boyd, B. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends Machine Learning, 3 (2011), pp. 1-122.
16. Y. Brenier, Polar factorization and monotone rearrangement of vector-valued functions, Comm. Pure Appl. Math., 44 (1991), pp. 375-417.
17. L. M. Bricẽno-Arias and P. L. Combettes, A monotone+skew splitting model for composite monotone inclusions in duality, SIAM J. Optim., 21 (2011), pp. 1230-1250.
18. M. Burger, M. Franek, and C.-B. Schönlieb, Regularized regression and density estimation based on optimal transport, Appl. Math. Res. Express. AMRX, (2011).
19. R. Burkard, M. Dell'Amico, and S. Martello, Assignment Problems, SIAM, Philadelphia, 2009.
20. P. Cardaliaguet, G. Carlier, and B. Nazaret, Geodesics for a class of distances in the space of probability measures, Calc. Var. Partial Differential Equations, (2012), pp. 1-26.
21. J. A. Carrillo and J. S. Moll, Numerical simulation of diffusive and aggregation phenomena in nonlinear continuity equations by evolving diffeomorphisms, SIAM J. Sci. Comput., 31 (2009), pp. 4305-4329.
22. A. Chambolle and T. Pock, A first-order primal-dual algorithm for convex problems with applications to imaging, J. Math. Imaging Vision, 40 (2011), pp. 120-145.
23. P. Clarysse, B. Delhay, M. Picq, and J. Pousin, Optimal extended optical flow subject to a statistical constraint, J. Comput. Appl. Math., 234 (2010), pp. 1291-1302.
24. P. L. Combettes and J.-C. Pesquet, A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery, IEEE J. Selected Topics Signal Process., 1 (2007), pp. 564-574.
25. P. L. Combettes and J.-C. Pesquet, Proximal splitting methods in signal processing, in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer, New York, 2011, pp. 185-212.
26. P. L. Combettes and J.-C. Pesquet, A proximal decomposition method for solving convex variational inverse problems, Inverse Problems, 24 (2011), 065014.
27. D. Cordero-Erausquin, B. Nazaret, and C. Villani, A mass-transportation approach to sharp Sobolev and Gagliardo-Nirenberg inequalities, Adv. Math., 182 (2004), pp. 307-332.
28. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
29. F. de Goes, D. Cohen-Steiner, P. Alliez, and M. Desbrun, An optimal transport approach to robust reconstruction and simplification of 2D shapes, Computer Graphics Forum, 30 (2011), pp. 1593-1602.
30. E. J. Dean and R. Glowinski, An augmented Lagrangian approach to the numerical solution of the Dirichlet problem for the elliptic Monge-Ampère equation in two dimensions, Electron. Trans. Numer. Anal., 22 (2006), pp. 71-96.
31. J. Delon, Movie and video scale-time equalization application to flicker reduction, IEEE Trans. Image Process., 15 (2006), pp. 241-248.
32. J. Delon, J. Salomon, and A. Sobolevski, Fast transport optimization for Monge costs on the circle, SIAM J. Appl. Math., 70 (2010), pp. 2239-2258.
33. J. Delon, J. Salomon, and A. Sobolevskii, Local matching indicators for transport problems with concave costs, SIAM J. Discrete Math., 26 (2012), pp. 801-827.
34. J. Digne, D. Cohen-Steiner, P. Alliez, F. Goes, and M. Desbrun, Feature-preserving surface reconstruction and simplification from defect-laden point sets, J. Math. Imaging Vision, (2013), pp. 1-14.
35. J. Dolbeault, B. Nazaret, and G. Savaré, A new class of transport distances between measures, Calc. Var. Partial Differential Equations, 34 (2009), pp. 193-231.
36. B. During, D. Matthes, and J. P. Milisic, A gradient flow scheme for nonlinear fourth order equations, Discrete Contin. Dyn. Syst. Ser. B, 14 (2010), pp. 935-959.
37. J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Programming, 55 (1992), pp. 293-318.
38. X. Feng and M. Neilan, Mixed finite element methods for the fully nonlinear Monge-Ampère equation based on the vanishing moment method, SIAM J. Numer. Anal., 47 (2009), pp. 1226-1250.
39. S. Ferradans, G.-S. Xia, G. Peyré, and J.-F. Aujol, Static and dynamic texture mixing using optimal transport, in Proceedings of the Fourth International Conference on Scale Space and Variational Methods in Computer Vision (SSVM'13), Lecture Notes in Comput. Sci. 7893, Springer, Berlin, Heidelberg, 2013, pp. 137-148.
40. L. Ferragut and I. Asensio, Mixed finite element methods for a class of nonlinear reaction diffusion problems, Neural Parallel Sci. Comput., 10 (2002), pp. 91-112.
41. M. Fortin and R. Glowinski, Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, Elsevier Science, New York, 1983.
42. U. Frisch, S. Matarrese, R. Mohayaee, and A. Sobolevski, A reconstruction of the initial conditions of the universe by optimal mass transportation, Nature, 417 (2002), pp. 260-262.
43. B. D. Froese, A numerical method for the elliptic Monge-Ampère equation with transport boundary conditions, SIAM J. Sci. Comput., 34 (2012), pp. A1432-A1459.
44. D. Gabay, Applications of the method of multipliers to variational inequalities, in Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems, M. Fortin and R. Glowinski, eds., North-Holland, Amsterdam, 1983, pp. 299-340.
45. D. Gabay and B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Comput. Math. Appl., 2 (1976), pp. 17-40.
46. R. Glowinski and A. Marroco, Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires, ESAIM Math. Model. Numer. Anal. Modél. Math. Anal. Numér., 9 (1975), pp. 41-76.
47. H. W. Kuhn, The Hungarian method of solving the assignment problem, Naval Res. Logistics Quart., 2 (1955), pp. 83-97.
48. E. Haber, T. Rehman, and A. Tannenbaum, An efficient numerical method for the solution of the L2 optimal mass transfer problem, SIAM J. Sci. Comput., 32 (2010), pp. 197-211.
49. S. Haker, L. Zhu, A. Tannenbaum, and S. Angenent, Optimal mass transport for registration and warping, Int. J. Computer Vision, 60 (2004), pp. 225-240.
50. F. H. Harlow and J. E. Welch, Numerical calculation of time-dependent viscous incompressible flow of fluid with free surface, Phys. Fluids, 8 (1965), pp. 2182-2189.
51. A. Iollo and D. Lombardi, A Lagrangian scheme for the solution of the optimal mass transfer problem, J. Comput. Phys., 230 (2011), pp. 3430-3442.
52. R. Jordan, D. Kinderlehrer, and F. Otto, The variational formulation of the Fokker-Planck equation, SIAM J. Math. Anal., 29 (1998), pp. 1-17.
53. Y.-H. Kim and B. Pass, Multi-marginal Optimal Transport on Riemannian Manifolds, preprint, arXiv: 1303.6251, 2013.
54. R. Kimmel and J. A. Sethian, Computing geodesic paths on manifolds, Proc. Natl. Acad. Sci., 95 (1998), pp. 8431-8435.
55. H. Ling and K. Okada, An efficient earth mover's distance algorithm for robust histogram comparison, IEEE Trans. Pattern Anal. Machine Intell., 29 (2007), pp. 840-853.
56. P. L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal., 16 (1979), pp. 964-979.
57. R. J. McCann, Polar factorization of maps on Riemannian manifolds, Geom. Funct. Anal., 11 (2001), pp. 589-608.
58. R. J. McCann, A convexity principle for interacting gases, Adv. Math., 128 (1997), pp. 153-179.
59. Q. Mérigot, A multiscale approach to optimal transport, Computer Graphics Forum, 30 (2011), pp. 1583-1592.
60. J. J. Moreau, Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. France, 93 (1965), pp. 273-299.
61. Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming, Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
62. A. M. Oberman, Wide stencil finite difference schemes for the elliptic Monge-Ampere equation and functions of the eigenvalues of the Hessian, Discrete Contin. Dyn. Syst. Ser. B, 1 (2008), pp. 221-238.
63. V. I. Oliker and L. D. Prussner, On the numerical solution of the equation and its discretizations, Numer. Math., 3 (1988), pp. 271-293.
64. N. Papadakis, E. Provenzi, and V. Caselles, A variational model for histogram transfer of color images, IEEE Trans. Image Process., 20 (2011), pp. 1682-1695.
65. O. Pele and M. Werman, Fast and robust earth mover's distances, in Proceedings of the IEEE International Conference on Computer Vision (ICCV'09), 2009, pp. 460-467.
66. N. Pustelnik, C. Chaux, and J. Pesquet, Parallel proximal algorithm for image restoration using hybrid regularization, IEEE Trans. Image Process., 20 (2011), pp. 2450-2462.
67. J. Rabin and G. Peyré, Wasserstein regularization of imaging problem, in Proceedings of the IEEE International Conference on Image Processing (ICIP'11), 2011, pp. 1541-1544.
68. J. Rabin, G. Peyré, J. Delon, and M. Bernot, Wasserstein barycenter and its application to texture mixing, in Proceedings of the Conference Scale Space and Variational Methods in Computer Vision (SSVM'11), Lecture Notes in Comput. Sci. 6667, Springer, Berlin, 2011, pp. 435-446.
69. Y. Rubner, C. Tomasi, and L. J. Guibas, A metric for distributions with applications to image databases, in Proceedings of the IEEE International Conference on Computer Vision (ICCV'98), 1998, pp. 59-66.
70. J. A. Sethian, A fast marching level set method for monotonically advancing fronts, Proc. Natl. Acad. Sci. USA, 93 (1996), pp. 1591-1595.
71. S. Shirdhonkar and D. W. Jacobs, Approximate earth mover's distance in linear time, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR'08), 2008, pp. 1-8.
72. J. E. Spingarn, Applications of the method of partial inverses to convex programming: Decomposition, Math. Programming, 32 (1985), pp. 199-223.
73. G. Strang, Linear Algebra and Its Applications, Brooks Cole, Pacific Grove, CA, 1988.
74. M. Sulman, J. F. Williams, and R. D. Russell, Optimal mass transport for higher dimensional adaptive grid generation, J. Comput. Phys., 230 (2011), pp. 3302-3330.
75. J. Tsitsiklis, Efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control, 40 (1995), pp. 1528-1538.
76. C. Villani, Topics in Optimal Transportation, Grad. Stud. Math., American Mathematical Society, Providence, RI, 2003.
77. C. Villani, Optimal Transport: Old and New, Grundl. Math. Wiss. 338, Springer, Berlin, 2009.