Fast transport optimization for monge costs on the circle

SIAM Journal on Applied Mathematics

Volumn 70, Issue 7, 2010, Pages 2239-2258

  Delon, Julie ^a   Salomon, Julien ^b   Sobolevski, Andrei ^c  

^a INSTITUT TELECOM   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Aubry Mather (weak KAM) theory; Monge Kantorovich problem; Supermodularity

Indexed keywords

AUBRY-MATHER (WEAK KAM) THEORY; CANDIDATE SOLUTION; CONVEX FUNCTIONS; EXACT SOLUTION; FAST TRANSPORT; MONGE-KANTOROVICH PROBLEM; OPTIMAL COSTS; OPTIMAL TRANSPORT; POINT MASS; QUADRATIC NUMBER; SHIFT PARAMETERS; SUPERMODULARITY; TOTAL MASS; TRANSPORTATION PROBLEM; TWO-POINT;

COSTS; IMAGE PROCESSING; MASS TRANSPORTATION;

OPTIMIZATION;

EID: 77955774805     PISSN: 00361399     EISSN: None     Source Type: Journal    
DOI: 10.1137/090772708     Document Type: Article

References (21)

1. A. Aggarwal, A. Bar-Noy, S. Khuller, D. Kravets, and B. Schieber, Efficient minimum cost matching using quadrangle inequality, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, IEEE Press, Piscataway, NJ, 1992, pp. 583-592.
2. L. Ambrosio, N. Gigli, and G. Savaré, Gradient Flows in Metric Spaces and in the Space of Probability Measures, Birkhaüser-Verlag, Basel, Switzerland, 2005.
3. S. Aubry and P. Y. Le Daeron, The discrete Frenkel-Kontorova model and its extensions I. Exact results for the ground-states, Phys. D, 8 (1983), pp. 381-422.
4. R. Venkatesh Babu, P. Pérez, and P. Bouthemy, Robust tracking with motion estimation and local Kernel-based color modeling, Image and Vision Computing, 25 (2007), pp. 1205-1216.
5. P. Bernard and B. Buffoni, Optimal mass transportation and Mather theory, J. Eur.Math. Soc., 9 (2007), pp. 85-121.
6. M. Brown, R. Szeliski, and S. Winder, Multi-image matching using multi-scale oriented patches, in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, IEEE Press, Piscataway, NJ, 2005, pp. 510-517.
7. R. E. Burkard, B. Klinz, and R. Rudolf, Perspectives of Monge properties in optimization, Discrete Appl. Math., 70 (1996), pp. 95-161.
8. D. Cordero-Erausquin, Sur le transport de mesures périodiques, C.R. Acad. Sci. Paris Sér. I Math., 329 (1999), pp. 199-202.
9. A. Fathi, Weak KAM Theorem in Lagrangian Dynamics, Cambridge Stud. Adv. Math., Cambridge University Press, Cambridge, UK, 2009.
10. M. Feldman and R. J. McCann, Monge's transport problem on a Riemannian manifold, Trans. Amer. Math. Soc., 354 (2002), pp. 1667-1697.
11. W. Gangbo and R. J. McCann, Shape recognition via Wasserstein distance, Quart. Appl. Math., 58 (2000), pp. 705-738.
12. W. Gangbo and R. J. McCann, The geometry of optimal transportation, Acta Math., 177 (1996), pp. 113-161.
13. R. M. Karp and S. Y. R. Li, Two special cases of the assignment problem, Discrete Math., 13 (1975), pp. 129-142.
14. O. Knill, Jürgen Moser, Selected Chapters in the Calculus of Variations, Birkhäuser-Verlag, Basel, Switzerland, 2003.
15. D. G. Lowe, Distinctive image features from scale-invariant keypoints, Int. J. Computer Vision, 60 (2004), pp. 91-110.
16. R. J. McCann, Exact solutions to the transportation problem on the line, R. Soc. Lond. Proc. Ser. A Math. Phys. Eng. Sci., 455 (1999), pp. 1341-1380.
17. J. Rabin, J. Delon, and Y. Gousseau, Transportation Distances on the Circle, manuscript, 2009, arXiv:0906.5499.
18. Y. Rubner, C. Tomasi, and L. J. Guibas, The earth mover's distance as a metric for image retrieval, Int. J. Computer Vision, 40 (2000), pp. 99-121.
19. C. Villani, Optimal Transport: Old and New, Grundlehren Math. Wiss. 338, Springer-Verlag, New York, 2009.
20. M. Werman, S. Peleg, R. Melter, and T. Y. Kong, Bipartite graph matching for points on a line or a circle, J. Algorithms, 7 (1986), pp. 277-284.
21. J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid, Local features and kernels for classification of texture and object categories: A comprehensive study, Int. J. Computer Vision, 73 (2007), pp. 213-238.