M. Agueh and G. Carlier, Barycenters in the Wasserstein Space, SIAM Journal on Mathematical Analysis, vol.43, issue.2, pp.904-924, 2011.
DOI : 10.1137/100805741
URL : https://hal.archives-ouvertes.fr/hal-00637399

N. Aifanti, C. Papachristou, and A. Delopoulos, The MUG facial expression database, Image Analysis for Multimedia Interactive Services (WIAMIS), 2010 11th International Workshop on, pp.1-4, 2010.

J. Altschuler, J. Weed, and P. Rigollet, Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration, 2017.

F. Bassetti, A. Bodini, and E. Regazzini, On minimum Kantorovich distance estimators, Statistics & Probability Letters, vol.76, issue.12, pp.1298-1302, 2006.
DOI : 10.1016/j.spl.2006.02.001

F. Bassetti and E. Regazzini, Asymptotic properties and robustness of minimum dissimilarity estimators 38 SCHMITZ & AL. of location-scale parameters, Theory of Probability & Its Applications, pp.50-171, 2006.

J. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré, Iterative Bregman Projections for Regularized Transportation Problems, SIAM Journal on Scientific Computing, vol.37, issue.2, pp.1111-1138, 2015.
DOI : 10.1137/141000439
URL : https://hal.archives-ouvertes.fr/hal-01096124

E. Bernton, P. E. Jacob, M. Gerber, and C. P. Robert, Inference in generative models using the wasserstein distance, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01517550

D. P. Bertsekas, The auction algorithm: A distributed relaxation method for the assignment problem, Annals of Operations Research, vol.5, issue.1, pp.105-123, 1988.
DOI : 10.1007/BF02186476

J. Bigot, R. Gouet, T. Klein, and A. López, Geodesic pca in the wasserstein space, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01581699

D. Blei and J. Lafferty, Topic models, Text mining: classification, clustering, and applications, p.71, 2009.

E. Boissard, T. Le-gouic, and J. Loubes, Distribution???s template estimate with Wasserstein metrics, Bernoulli, vol.21, issue.2, pp.740-759, 2015.
DOI : 10.3150/13-BEJ585
URL : http://arxiv.org/pdf/1111.5927

N. Bonneel, G. Peyré, and M. Cuturi, Wasserstein barycentric coordinates, Proceedings of SIGGRAPH 2016, p.35, 2016.
DOI : 10.1007/978-3-642-24785-9_37
URL : https://hal.archives-ouvertes.fr/hal-01303148

N. Bonneel, J. Rabin, G. Peyré, and H. Pfister, Sliced and Radon Wasserstein Barycenters of Measures, Journal of Mathematical Imaging and Vision, vol.11, issue.1, pp.22-45, 2015.
DOI : 10.1023/A:1018366000512
URL : https://hal.archives-ouvertes.fr/hal-00881872

G. Carlier, A. Oberman, and E. Oudet, Numerical methods for matching for teams and Wasserstein barycenters, ESAIM: Mathematical Modelling and Numerical Analysis, vol.49, issue.6, 2015.
DOI : 10.1007/978-3-540-71050-9
URL : https://hal.archives-ouvertes.fr/hal-00987292

L. Chizat, G. Peyré, B. Schmitzer, and F. Vialard, Scaling algorithms for unbalanced optimal transport problems, Mathematics of Computation, 2016.
DOI : 10.1090/mcom/3303

M. Cuturi, Sinkhorn distances: Lightspeed computation of optimal transport, Advances in Neural Information Processing Systems, pp.2292-2300, 2013.

M. Cuturi and A. Doucet, Fast computation of wasserstein barycenters, Proceedings of The 31st International Conference on Machine Learning, pp.685-693, 2014.

M. Cuturi and G. Peyré, A Smoothed Dual Approach for Variational Wasserstein Problems, SIAM Journal on Imaging Sciences, vol.9, issue.1, pp.320-343, 2016.
DOI : 10.1137/15M1032600
URL : https://hal.archives-ouvertes.fr/hal-01188954

A. Aspremont, L. Ghaoui, M. I. Jordan, and G. R. Lanckriet, A direct formulation for sparse pca using semidefinite programming, SIAM review, pp.49-434, 2007.

W. E. Deming and F. F. Stephan, On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known, The Annals of Mathematical Statistics, vol.11, issue.4, pp.427-444, 1940.
DOI : 10.1214/aoms/1177731829

S. Erlander and N. F. Stewart, The gravity model in transportation analysis: theory and extensions, p.Vsp, 1990.

P. T. Fletcher, C. Lu, S. M. Pizer, and S. Joshi, Principal Geodesic Analysis for the Study of Nonlinear Statistics of Shape, IEEE Transactions on Medical Imaging, vol.23, issue.8, pp.995-1005, 2004.
DOI : 10.1109/TMI.2004.831793

J. Franklin and J. Lorenz, On the scaling of multidimensional matrices, Linear Algebra and its applications, pp.717-735, 1989.

M. Fréchet, LesélémentsLeséléments aléatoires de nature quelconque dans un espace distancié, Annales de l'institut Henri Poincaré Presses universitaires de France, pp.215-310, 1948.

C. Frogner, C. Zhang, H. Mobahi, M. Araya, and T. A. Poggio, Learning with a wasserstein loss, Advances in Neural Information Processing Systems, pp.2053-2061, 2015.

A. Genevay, G. Peyré, and M. Cuturi, Sinkhorn-autodiff: Tractable wasserstein learning of generative models, 2017.

A. Griewank and A. Walther, Evaluating derivatives: principles and techniques of algorithmic differentiation, SIAM, 2008.
DOI : 10.1137/1.9780898717761

S. Haker, L. Zhu, A. Tannenbaum, and S. Angenent, Optimal Mass Transport for Registration and Warping, International Journal of Computer Vision, vol.60, issue.3, pp.225-240, 2004.
DOI : 10.1023/B:VISI.0000036836.66311.97
URL : http://www.ee.technion.ac.il/courses/048831/downloads/monge_ijcv.pdf

G. E. Hinton and R. R. Salakhutdinov, Reducing the dimensionality of data with neural networks, science, pp.313-504, 2006.

Z. Irace and H. Batatia, Motion-based interpolation to estimate spatially variant psf in positron emission tomography, Signal Processing Conference (EUSIPCO), 2013 Proceedings of the 21st European, pp.1-5, 2013.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.2140/pjm.1953.3.369

D. D. Lee and H. S. Seung, Learning the parts of objects by non-negative matrix factorization, Nature, pp.401-788, 1999.

H. Lee, A. Battle, R. Raina, and A. Y. Ng, Efficient sparse coding algorithms, in Advances in neural information processing systems, pp.801-808, 2007.

C. Léonard, A survey of the Schrödinger problem and some of its connections with optimal transport, Discrete and Continuous Dynamical Systems -Series A (DCDS-A), pp.34-1533, 2014.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

S. Mallat, A wavelet tour of signal processing, Academic press, 1999.

R. J. Mccann, A convexity principle for interacting gases Advances in mathematics, pp.153-179, 1997.

Q. Mérigot, A Multiscale Approach to Optimal Transport, Computer Graphics Forum, vol.40, issue.2, 2011.
DOI : 10.1007/978-3-540-71050-9

G. Monge, Mémoire sur la théorie des déblais et des remblais, Histoire de l'Académie Royale des Sciences de Paris, 1781.

G. Montavon, K. Müller, and M. Cuturi, Wasserstein training of restricted boltzmann machines, Advances in Neural Information Processing Systems, pp.3711-3719, 2016.

J. L. Morales and J. Nocedal, Remark on ???algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization???, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.38-45, 2011.
DOI : 10.1145/2049662.2049669

Y. Nesterov, Introductory lectures on convex optimization: A basic course, 2013.
DOI : 10.1007/978-1-4419-8853-9

F. Ngoì-e and J. Starck, Psf field learning based on optimal transport distances, arXiv preprint, 2017.

F. Ngoì-e, J. Starck, S. Ronayette, K. Okumura, and J. Amiaux, Super-resolution method using sparse regularization for point-spread function recovery, Astronomy & Astrophysics, pp.575-86, 2015.

N. Papadakis, Optimal Transport for Image Processing, habilitationàhabilitation`habilitationà diriger des recherches, 2015.

J. Pennington, R. Socher, and C. D. Manning, Glove: Global Vectors for Word Representation, Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp.1532-1543, 2014.
DOI : 10.3115/v1/D14-1162
URL : http://nlp.stanford.edu/projects/glove/glove.pdf

G. Peyré, L. Chizat, F. Vialard, and J. Solomon, Quantum optimal transport for tensor field processing, 2016.

F. Pitié, A. C. Kokaram, and R. Dahyot, N-dimensional probablility density function transfer and its application to colour transfer, Proceedings of the Tenth IEEE International Conference on Computer Vision, pp.1434-1439, 2005.

B. T. Polyak, Some methods of speeding up the convergence of iteration methods, USSR Computational Mathematics and Mathematical Physics, vol.4, issue.5, pp.1-17, 1964.
DOI : 10.1016/0041-5553(64)90137-5

J. Rabin, G. Peyré, J. Delon, and M. Bernot, Wasserstein Barycenter and Its Application to Texture Mixing, International Conference on Scale Space and Variational Methods in Computer Vision, pp.435-446, 2011.
DOI : 10.1109/18.119725
URL : https://hal.archives-ouvertes.fr/hal-00476064/document

S. Rachev and L. Rüschendorf, Mass Transportation Problems: Theory, 1998.

A. Rolet, M. Cuturi, and G. Peyré, Fast dictionary learning with a smoothed wasserstein loss, Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, pp.630-638, 2016.

Y. Rubner, C. Tomasi, and L. J. Guibas, The earth mover's distance as a metric for image retrieval, Int. J. Comput. Vision, pp.40-99, 2000.

G. Salton and M. J. Mcgill, Introduction to modern information retrieval, 1986.

R. Sandler and M. Lindenbaum, Nonnegative matrix factorization with earth mover's distance metric, in Computer Vision and Pattern Recognition, pp.1873-1880, 2009.

. Starck, Optimal transport-based dictionary learning and its application to euclid-like point spread function representation, SPIE Optical Engineering+ Applications, International Society for Optics and Photonics, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01635342

B. Schmitzer, Stabilized sparse scaling algorithms for entropy regularized transport problems, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01385251

B. Schölkopf, A. Smola, and K. Müller, Kernel principal component analysis, Artificial Neural Networks ? ICANN'97, pp.583-588, 1997.
DOI : 10.1007/BFb0020217

E. Schrödinger, ¨ Uber die umkehrung der naturgesetze, Verlag Akademie der wissenschaften in kommission bei, 1931.

V. Seguy and M. Cuturi, Principal geodesic analysis for probability measures under the optimal transport metric, Advances in Neural Information Processing Systems, pp.3312-3320, 2015.

S. Shirdhonkar and D. W. Jacobs, Approximate earth mover's distance in linear time, Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/cvpr.2008.4587662

R. Sinkhorn, Diagonal Equivalence to Matrices with Prescribed Row and Column Sums, The American Mathematical Monthly, vol.74, issue.4, pp.402-405, 1967.
DOI : 10.2307/2314570

J. Solomon, F. De-goes, G. Peyré, M. Cuturi, A. Butscher et al., Convolutional wasserstein distances, ACM Transactions on Graphics, vol.34, issue.4, pp.34-66, 2015.
DOI : 10.1145/563858.563893
URL : https://hal.archives-ouvertes.fr/hal-01188953

J. Solomon, R. Rustamov, L. Guibas, and A. Butscher, Wasserstein propagation for semi-supervised learning, Proceedings of The 31st International Conference on Machine Learning, pp.306-314, 2014.

M. Talagrand, Transportation cost for gaussian and other product measures, Geometric and Functional Analysis, pp.587-600, 1996.
DOI : 10.1007/bf02249265

M. Turk and A. Pentland, Eigenfaces for Recognition, Journal of Cognitive Neuroscience, vol.10, issue.9, pp.71-86, 1991.
DOI : 10.1007/BF00239352

C. Villani, Topics in optimal transportation, Optimal transport: old and new, 2003.
DOI : 10.1090/gsm/058

W. Wang, D. Slepcev, S. Basu, J. A. Ozolek, and G. K. Rohde, A Linear Optimal Transportation Framework for Quantifying and Visualizing Variations in Sets of Images, International Journal of Computer Vision, vol.13, issue.4, pp.254-269, 2013.
DOI : 10.1109/TITB.2009.2020159

J. Ye, P. Wu, J. Z. Wang, and J. Li, Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support, IEEE Transactions on Signal Processing, vol.65, issue.9, pp.65-2317, 2017.
DOI : 10.1109/TSP.2017.2659647
URL : http://arxiv.org/pdf/1510.00012

S. Zavriev and F. Kostyuk, Heavy-ball method in nonconvex optimization problems, Computational Mathematics and Modeling, vol.1, issue.3, pp.336-341, 1993.
DOI : 10.1007/BF01128757