Regularized discrete optimal transport

SIAM Journal on Imaging Sciences

Volumn 7, Issue 3, 2014, Pages 1853-1882

  Ferradans, Sira ^a,b   Papadakis, Nicolas ^c   Peyré, Gabriel ^a   Aujoll, Jean François ^c,d  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b DUKE UNIVERSITY   (United States)

^c UNIVERSITÉ BORDEAUX 1   (France)

^d INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

Color transfer; Convex optimization; Manifold learning; Optimal transport; Proximal splitting; Variation al regularization

Indexed keywords

COLOR TRANSFERS; MANIFOLD LEARNING; OPTIMAL TRANSPORT; PROXIMAL SPLITTING; VARIATION AL REGULARIZATION;

CONVEX OPTIMIZATION;

EID: 84908458659     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/130929886     Document Type: Article

References (47)

1. M. Agueh and G. Carlier, Barycenters in the Wasserstein space, SIAM J. Math. Anal., 43 (2011), pp. 904–924.
2. H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Trans. Pattern Anal. Mach. Intell., 15 (1993), pp. 522–525.
3. R. Palma Amestoy, E. Provenzi, M. Bertal mío, and V. Caselles, A perceptually inspired varia-tional framework for color enhancement, IEEE Trans. Pattern Anal. Mach. Intell., 31 (2009), pp. 458– 474.
4. S. Belongie, J. Malik, and J. Puzicha, Shape matching and object recognition using shape contexts, IEEE Trans. Pattern Anal. Mach. Intell., 24 (2002), pp. 509–522.
5. 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.
6. D. P. Bertsekas, The auction algorithm: A dis tributed relaxation method for the assignment problem, Ann. Oper. Res., 14 (1988), pp. 105–123.
7. N. Bonneel, M. van de Panne, S. Paris, and W. Heidrich, Displacement interpolation using La-grangian mass transport, ACM Trans. Graph., 30 (2011), 158.
8. 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.
9. L. Csink, D. Paulus, U. Ahlrichs, and B. Heigl, Color normalization and object localization, in Proceedings of the Vierter Workshop Farbbildverarbeitung, V. Rehrmann, ed., Föhringer, Koblenz, Germany, 1998, pp. 49–55.
10. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
11. J. Delon, Midway image equalization, J. Math. I maging Vision, 21 (2004), pp. 119–134.
12. J. Delon, Movie and video scale-time equalizatio n application to flicker reduction, IEEE Trans. Image Process., 15 (2006), pp. 241–248.
13. A. Elmoataz, O. Lezoray, and S. Bougleux, Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing, IEEE Trans. Image Process., 17 (2008), pp. 1047–1060.
14. S. Ferradans, N. Papadakis, J. Rabin, G. Peyré, and J.-F. Aujol, Regularized discrete optimal transport, in Scale Space and Variational Methods in Computer Vision (SSVM 2013), Springer-Verlag, Berlin, Heidelberg, 2013, pp. 428–439.
15. S. Ferradans, G.-S. Xia, G. Peyré, and J.-F. Aujol, Static and dynamic texture mixing using optimal transport, in Scale Space and Variational Methods in Computer Vision (SSVM 2013), Springer-Verlag, Berlin, Heidelberg, 2013, pp. 137–148.
16. W. Gangbo and A. Swięch, Optimal maps f or the multidimensional Monge-Kantorovich problem, Comm. Pure Appl. Math., 51 (1998), pp. 23–45.
17. G. Gilboa and S. Osher, Nonlocal linear image regularization and supervised segmentation, SIAM Multiscale Model. Simul., 6 (2007), pp. 595–630.
18. R. C. Gonzalez and R. E. Woods, Digital Image Processing, 2nd ed., Addison-Wesley Longman Publishing, Boston, 2001.
19. S. Haker, L. Zhu, A. Tannenbaum, and S. Angenent, Optimal mass transport for registration and warping, Int. J. Comput. Vis., 60 (2004), pp. 225–240.
20. L. Kantorovitch, On the translocation of masses, Management Sci., 5 (1958), pp. 1–4.
21. H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logist. Quart., 2 (1955), pp. 83–97.
22. E. H. Land and J. J. McCann, Lightness and r etinex theory, J. Opt. Soc. Amer., 61 (1971), pp. 1–11.
23. S. P. Lloyd, Least squares quantization in PCM, IEEE Trans. Inform. Theory, 28 (1982), pp. 129–137.
24. J. Louet and F. Santambrogio, A sharp inequality for transport maps in via approximation, Appl. Math. Lett., 25 (2012), pp. 648–653.
25. R.J. McCann, A convexity principle for interacting gases, Adv. Math., 128 (1997), pp. 153–179.
26. A. J. McCollum and W. F. Clocksin, Multidimensional histogram equalization and modification, in Proceedings of the 14th International Conference on Image Analysis and Processing (ICIAP 2007), IEEE Computer Society, Washington, DC, 2007, pp. 659–664.
27. J. Morovic and P.-L. Sun, Accurate 3D image colo ur histogram transformation, Pattern Recogn. Lett., 24 (2003), pp. 1725–1735.
28. Y. Nesterov and A. Nemirovskii, Interior-Poi nt Polynomial Methods in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
29. N. Papadakis, E. Provenzi, and V. Caselle s, A variational model for histogram transfer of color images, IEEE Trans. Image Process., 20 (2011), pp. 1682–1695.
30. 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.
31. F. Pitié, A. C. Kokaram, and R. Dahyot, Automated colour grading using colour distribution transfer, Comput. Vis. Image Underst., 107 (2007), pp. 123–137.
32. J. Rabin, J. Delon, and Y. Gousseau, Removing artefacts from color and contrast modifications, IEEE Trans. Image Process., 20 (2011), pp. 3073–3085.
33. J. Rabin and G. Peyré, Wasserstein regularization of imaging problem, in Proceedings of the 2011 18th IEEE International Conference on Image Processing (ICIP), 2011, pp. 1541–1544.
34. J. Rabin, G. Peyré, J. Delon, and M. Bernot, Wasserstein barycenter and its application to texture mixing, in Scale Space and Variational Metho ds in Computer Vision (SSVM 2011), Lecture Notes in Comput. Sci. 6667, Springer-Verlag, Berlin, H eidelberg, 2012, pp. 435–446.
35. E. Reinhard, M. Adhikhmin, B. Gooch, and P. Shirley, Color transfer between images, IEEE Comput. Graph. Appl., 21 (2001), pp. 34–41.
36. Y. Rubner, C. Tomasi, and L. J. Guibas, A metric for distributions with applications to image databases, in Proceedings of the Sixth International Conference on Computer Vision (ICCV’98), IEEE Computer Society, Washington, DC, 1998, pp. 59–66.
37. C. Schellewald, S. Roth, and C. Schnörr, Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views, Image Vision Comput., 25 (2007), pp. 1301–1314.
38. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, New York, 1986.
39. Y.-W. Tai, J. Jia, and C.-K. Tang, Local color transfer via probabilistic segmentation by expectation-maximization, in Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), Vol. 1, 2005, pp. 747–754.
40. J. B. Tenenbaum, V. de Silva, and J. C. Langford, A global geometric framework for nonlinear dimensionality reduction, Science, 290 (2000), pp. 2319–2323.
41. P. Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl., 109 (2001), pp. 475–494.
42. C. Villani, Topics in Optimal Transportation, Grad. Stud. Math. 58, AMS, Providence, RI, 2003.
43. C.-M. Wang and Y.-H. Huang, A novel color transfer algorithm for image sequences, JISE J. Inf. Sci. Eng., 20 (2004), pp. 1039–1056.
44. X. Xiao and L. Ma, Color transfer in correlated color space, in Proceedings of the 2006 ACM International Conference on Virtual Reality Continuu m and Its Applications (VRCIA’06), 2006, pp. 305–309.
45. M. Zaslavskiy, F. Bach, and J.-P. Vert, A path following algorithm for the graph matching problem, IEEE Trans. Pattern Anal. Mach. Intell., 31 (2009), pp. 2227–2242.
46. M. Zaslavskiy, F. Bach, and J.-P. Vert, Ma ny-to-many graph matching: A continuous relaxation approach, in Machine Learning and Knowledge Discovery in Databases: Part III (ECML PKDD’10), Springer-Verlag, Berlin, Heidelberg, 2010, pp. 515–530.
47. Y. Zheng and D. Doermann, Robust point matching for nonrigid shapes by preserving local neighborhood structures, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 643–649.