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

A. Andoni, A. Naor, and O. Neiman, Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost, 43rd International Colloquium on Automata, Languages, and Programming, vol.55, pp.1-83, 2016.

M. Arjovsky, S. Chintala, and L. Bottou, Wasserstein generative adversarial networks, Proceedings of the 34th International Conference on Machine Learning, vol.70, pp.6-11, 2017.

J. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré, Iterative Bregman projections for regularized transportation problems, 2015.
DOI : 10.1137/141000439
URL : https://hal.archives-ouvertes.fr/hal-01096124

J. Bigot, T. Gouet, A. Klein, and . López, Geodesic pca in the wasserstein space by convex pca, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, vol.53, pp.1-26, 2017.
DOI : 10.1214/15-aihp706
URL : https://hal.archives-ouvertes.fr/hal-01978864

N. Bonneel, M. Van-de-panne, S. Paris, and W. Heidrich, Displacement interpolation using Lagrangian mass transport, ACM Transaction on Graphics, vol.30, issue.6, 2011.
DOI : 10.1145/2070752.2024192
URL : https://hal.archives-ouvertes.fr/hal-00763270

N. Bonneel, J. Rabin, G. Peyré, and H. Pfister, Sliced and radon wasserstein barycenters of measures, Journal of Mathematical Imaging and Vision, vol.51, issue.1, pp.22-45, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00881872

N. Bonneel, G. Peyré, and M. Cuturi, Wasserstein barycentric coordinates: Histogram regression using optimal transport, ACM Trans. Graph, vol.35, issue.4, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01303148

J. Bromley, I. Guyon, Y. Lecun, E. Säckinger, and R. Shah, Signature verification using a" siamese" time delay neural network, Advances in Neural Information Processing Systems, pp.737-744, 1994.

M. ,

. Charikar, Similarity estimation techniques from rounding algorithms, Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, STOC '02, pp.380-388, 2002.

S. Chopra, R. Hadsell, and Y. Lecun, Learning a similarity metric discriminatively, with application to face verification, Computer Vision and Pattern Recognition, vol.1, pp.539-546, 2005.

N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy, Optimal transport for domain adaptation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01170705

M. Cuturi, Sinkhorn distances: Lightspeed computation of optimal transportation, Advances on Neural Information Processing Systems (NIPS), pp.2292-2300, 2013.

M. Cuturi and A. Doucet, Fast computation of Wasserstein barycenters, ICML, 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.
URL : https://hal.archives-ouvertes.fr/hal-01188954

F. De-goes, K. Breeden, V. Ostromoukhov, and M. Desbrun, Blue noise through optimal transport, ACM Trans. Graph, vol.31, issue.6, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01353135

R. Flamary and N. Courty, Pot python optimal transport library, 2017.

P. T. Fletcher, C. Lu, S. M. Pizer, and S. Joshi, Principal geodesic analysis for the study of nonlinear statistics of shape, IEEE Trans. Medical Imaging, vol.23, issue.8, pp.995-1005, 2004.

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

G. Gasso, A. Rakotomamonjy, and S. Canu, Recovering sparse signals with a certain family of nonconvex penalties and dc programming, IEEE Transactions on Signal Processing, vol.57, issue.12, pp.4686-4698, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00439453

A. Genevay, M. Cuturi, G. Peyré, and F. Bach, Stochastic optimization for large-scale optimal transport, NIPS, pp.3432-3440, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01321664

G. Huang, C. Guo, M. Kusner, Y. Sun, F. Sha et al., Supervised word mover's distance, Advances in Neural Information Processing Systems, pp.4862-4870, 2016.

P. Indyk and N. Thaper, Fast image retrieval via embeddings, 3rd International Workshop on Statistical and Computational Theories of Vision, pp.1-15, 2003.

S. Khot and A. Naor, Nonembeddability theorems via fourier analysis, Mathematische Annalen, vol.334, issue.4, pp.821-852, 2006.

G. Koch, R. Zemel, and R. Salakhutdinov, Siamese neural networks for one-shot image recognition, ICML Deep Learning Workshop, vol.2, 2015.

S. Kolouri, S. R. Park, and G. K. Rohde, The radon cumulative distribution transform and its application to image classification, IEEE Transactions on Image Processing, vol.25, issue.2, pp.920-934, 2016.

S. Kolouri, A. Tosun, J. Ozolek, and G. Rohde, A continuous linear optimal transport approach for pattern analysis in image datasets, Pattern Recognition, vol.51, pp.453-462, 2016.

S. Kolouri, Y. Zou, and G. Rohde, Sliced wasserstein kernels for probability distributions, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.5258-5267, 2016.

S. Kolouri, S. R. Park, M. Thorpe, D. Slepcev, and G. K. Rohde, Optimal mass transport: Signal processing and machine-learning applications, IEEE Signal Processing Magazine, vol.34, issue.4, pp.43-59, 2017.

J. Matou?ek, Lecture notes on metric embeddings, 2013.

J. Matou?ek and A. Naor, Open problems on embeddings of finite metric spaces, 2011.

A. Rolet, M. Cuturi, and G. Peyré, Fast dictionary learning with a smoothed wasserstein loss, AISTATS, pp.630-638, 2016.

F. Santambrogio, Introduction to optimal transport theory. Notes, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00519456

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, CVPR, pp.1-8, 2008.

J. Solomon, F. De-goes, G. Peyré, M. Cuturi, A. Butscher et al., Convolutional wasserstein distances: Efficient optimal transportation on geometric domains, ACM Trans. Graph, vol.34, issue.4, pp.1-66, 2015.

J. Solomon, F. De-goes, G. Peyré, M. Cuturi, A. Butscher et al., Convolutional wasserstein distances: Efficient optimal transportation on geometric domains, ACM Transactions on Graphics (TOG), vol.34, issue.4, p.66, 2015.

M. Staib, S. Claici, J. Solomon, and S. Jegelka, Parallel streaming wasserstein barycenters, 2017.

C. Villani, Optimal transport: old and new. Grund. der mathematischen Wissenschaften, 2009.

W. Wang, D. Slep?ev, S. Basu, J. Ozolek, and G. Rohde, A linear optimal transportation framework for quantifying and visualizing variations in sets of images, International Journal of Computer Vision, vol.101, issue.2, pp.254-269, 2013.

J. Weston, F. Ratle, H. Mobahi, and R. Collobert, Deep learning via semi-supervised embedding, Neural Networks: Tricks of the Trade, pp.639-655, 2012.

C. Wu and E. Tabak, Statistical archetypal analysis, 2017.

W. Yu, G. Zeng, P. Luo, F. Zhuang, Q. He et al., Embedding with autoencoder regularization, ECML/PKDD, pp.208-223, 2013.