R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua et al., Slic superpixels, 2010.

M. Arjovsky, S. Chintala, and L. Bottou, Wasserstein GAN, 2017.

J. Benamou, Numerical resolution of an "unbalanced" mass transport problem, ESAIM: Mathematical Modelling and Numerical Analysis, vol.37, p.5, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071800

N. Bonneel, G. Julien-rabin, H. Peyré, and . Pfister, Sliced and Radon Wasserstein Barycenters of Measures, J. of Math. Imaging and Vision, vol.51, p.1, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00881872

N. Bonneel, K. Sunkavalli, S. Paris, and H. Pfister, ExampleBased Video Color Grading, ACM Trans. on Graphics (SIGGRAPH), vol.32, p.4, 2013.

N. Bonneel, S. Van-de-panne, W. Paris, and . Heidrich, Displacement interpolation using Lagrangian mass transport, In ACM Trans. on Graphics (SIGGRAPH Asia), vol.30, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00763270

K. Charter, J. Schaeffer, and D. Szafron, Sequence alignment using FastLSA, International conference on mathematics and engineering techniques in medicine and biological sciences, pp.239-245, 2000.

L. Chizat, G. Peyré, B. Schmitzer, and F. Vialard, Scaling Algorithms for Unbalanced Transport Problems, Math. Comp, vol.87, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01434914

I. Deshpande, Z. Zhang, and A. Schwing, Generative Modeling using the Sliced Wasserstein Distance, IEEE Conf. on Comp. Vis. and Patt. Recognition (CVPR), 2018.

S. Du, N. Zheng, S. Ying, Q. You, and Y. Wu, An extension of the ICP algorithm considering scale factor, IEEE Int. Conf. on Image Processing (ICIP), vol.5, 2007.

A. Figalli, The optimal partial transport problem. Archive for rational mechanics and analysis, vol.195, pp.533-560, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00838842

A. William, K. W. Gale, and . Church, Identifying word correspondences in parallel texts, Speech and Natural Language: Proceedings of a Workshop Held at, 1991.

X. Gu, F. Luo, J. Sun, and S. Yau, Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampere equations, 2013.

D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Commun. ACM, vol.18, pp.341-343, 1975.

K. P. Berthold, H. M. Horn, S. Hilden, and . Negahdaripour, Closed-form solution of absolute orientation using orthonormal matrices, JOSA A, vol.5, p.7, 1988.

H. Kaprykowsky and X. Rodet, Globally optimal short-time dynamic time warping, application to score to audio alignment, IEEE Int. Conf. on Acoustics, Speech and Signal Processing, vol.5, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01106245

J. Kitagawa, Q. Mérigot, and B. Thibert, Convergence of a Newton algorithm for semi-discrete optimal transport, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01290496

S. Kolouri, E. Charles, G. K. Martin, and . Rohde, Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Model, 2018.

S. Kolouri, Y. Zou, and G. K. Rohde, Sliced wasserstein kernels for probability distributions, IEEE Conf. on Comp. Vis. and Patt. Recognition (CVPR), 2016.

. Vladimir-i-levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet physics doklady, vol.10, pp.707-710, 1966.

B. Lévy, A Numerical Algorithm for L2 semi-discrete optimal transport in 3D, ESAIM M2AN (Mathematical Modeling and Numerical Analysis, 2015.

T. Lu and C. Boutilier, Value-Directed Compression of Large-Scale Assignment Problems, AAAI Conf. on Artificial Intelligence, 2015.

E. Maass, Quentin Mérigot. 2011. A Multiscale Approach to Optimal Transport, Computer Graphics Forum, 2011.

G. Nader and G. Guennebaud, Instant Transport Maps on 2D Grids, ACM Trans. on Graphics (SIGGRAPH Asia), p.249, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01884157

S. Paris and F. Durand, A fast approximation of the bilateral filter using a signal processing approach, International journal of computer vision, vol.81, p.1, 2009.

G. Peyré and M. Cuturi, Computational optimal transport, 2017.

F. Pitié, C. Kokaram, and R. Dahyot, N-Dimensional Probablility Density Function Transfer and Its Application to Colour Transfer, IEEE Int. Conf. on Computer Vision (ICCV), 2005.

F. Pitié, C. Anil, R. Kokaram, and . Dahyot, Automated colour grading using colour distribution transfer, Comp. Vis. and Im. Understanding, vol.107, pp.1-2, 2007.

J. Rabin, J. Delon, and Y. Gousseau, Regularization of transportation maps for color and contrast transfer, IEEE Int. Conf. on Image Processing (ICIP), 2010.

J. Rabin, Adaptive color transfer with relaxed optimal transport, IEEE Int. Conf. on Image Processing (ICIP), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01002830

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.

F. Santambrogio, Optimal transport for applied mathematicians, 2015.

H. Peter and . Schönemann, A generalized solution of the orthogonal procrustes problem, Psychometrika, vol.31, pp.1-10, 1966.

J. Solomon, F. D. Goes, G. Peyré, M. Cuturi, A. Butscher et al., Convolutional wasserstein distances: Efficient optimal transportation on geometric domains, ACM Trans. on Graphics (SIGGRAPH), vol.34, p.4, 2015.

E. Robert, J. Tarjan, and . Van-leeuwen, Worst-case analysis of set union algorithms, Journal of the ACM (JACM), vol.31, pp.245-281, 1984.

S. Umeyama, Least-squares estimation of transformation parameters between two point patterns, IEEE Trans. on Patt. Analysis & Machine Intelligence, vol.4, 1991.

C. Villani, Topics in optimal transportation, 2003.

J. Yang, H. Li, and Y. Jia, Go-icp: Solving 3d registration efficiently and globally optimally, IEEE Int. Conf. on Computer Vision (ICCV), 2013.

T. Zinßer, J. Schmidt, and H. Niemann, A refined ICP algorithm for robust 3-D correspondence estimation, IEEE Int. Conf. on Image Processing, 2003.