. .. Imagerie-médicale-et-géométrie,

. .. , Forces et limitations des réseaux convolutifs, p.203

, Travailler avec des surfaces, courbes et nuages de points, p.206

, Doter un espace de formes d'une structure géométrique, p.210

. .. , Une introduction accessible au domaine, p.215

, Développer des méthodes géométriques robustes, p.216

B. , Imagerie médicale et géométrie

L. Médicale, Au cours des quarante dernières années, dans nos sociétés occidentales, un facteur essentiel pour l'amélioration des standards de santé a été le perfectionnement constant des matériels d'imagerie. Bénéficiant du fruit de décennies de recherche, un médecin peut aujourd'hui inspecter l'intérieur de ses patients en quelques minutes. L'industrie médicale produit plusieurs milliers de scanners IRM

, Au fur et à mesure, les techniques modernes d'imagerie deviennent donc accessibles à toujours plus de patients. Malheureusement, la formation de radiologues qualifiés pour interpréter ce volume croissant d'images ne peut pas suivre la même cadence : le manque de ressources humaines est donc rapidement devenu le principal facteur limitant l'accès aux soins dans nos campagnes

, transformer un signal physique brut en une donnée utile est un processus complexe que nous détaillons Figure B.1. Dans cette thèse, nous nous concentrons sur un maillon spécifique de cette chaîne : l'analyse de données anatomiques. Partant d'images 3D produites par nos collègues en amont, nous tâchons d'extraire une information géométrique pertinente pour des analyses ultérieures. En deux mots, notre métier est de fournir une représentation de haut niveau, fiable et interprétable de l'anatomie d'un patient qui puisse être utilisée simplement par les médecins et statisticiens. Comme on le voit Figure B.2, cette question peut être découpée en trois grands types de problèmes : 1, Un mathématicien peut-il être utile? L'automatisation partielle d'examens cliniques est un problème difficile : de l'acquisition d'un scan IRM à l'estimation de tendances globales dans une population

, L'analyse de formes : quantifier les variations anatomiques d'un organe. 3. La simulation biomécanique : utiliser notre connaissance fine du corps humain pour extraire une information physiologique de simples images

L. , Cette thèse est consacrée au problème "intermédiaire" de l'analyse de formes, illustré Figure B.2.b. Nous aborderons parfois des questions liées à des domaines de recherche voisins ; mais en fin de compte, nos efforts se concentreront toujours sur des cas d'utilisation pertinents pour le traitement de données médicales

, Les médecins interviennent directement dans nos algorithmes en annotant les données. 2. Les statisticiens choisissent les meilleurs paramètres d'un algorithme

, Les développeurs implémentent des codes efficaces sur carte graphique pour tirer parti des dernières avancées matérielles

, Les mathématiciens et informaticiens encodent a priori et hypothèses dans l'architecture de leurs programmes

, L'architecture des réseaux convolutifs est partiellement inspirée par la structure du cortex visuel (Hubel and Wiesel, 1962, 1968) et de nombreux chercheurs rêvent de pouvoir un jour simuler de véritables cerveaux humains sur ordinateur. Il faut toutefois nous garder d'attribuer de trop nombreuses qualités à des algorithmes qui ne sont, après tout, Vers l'intelligence artificielle ? Le vocabulaire pseudo-biologique qui prévaut dans notre domaine découle des liens historiques entre recherches sur les "réseaux de neurones" et véritables neurosciences, 1980.

D. Skodras, Mais il serait déraisonnable d'espérer l'émergence de comportements de haut niveau dans ces algorithmes rudimentaires : empiler des filtres de convolution les uns sur les autres n'a pas, les réseaux convolutifs sont les proches cousins d'algorithmes classiques comme la transformée en ondelettes rapide qui sous-tend le standard de compression JPEG-2000 pour le cinéma numérique, 2001.

. Nowak, Néanmoins, même après une coûteuse phase d'entraînement, les réseaux convolutifs restent toujours fortement biaisés vers l'analyse de texture et la détection de motifs, Limitations des algorithmes convolutionnels. Le traitement d'images et la vision par ordinateur ont considérablement progressé depuis les premiers travaux sur les pyramides de Laplace (Burt and Adelson, 1983) ou les descripteurs SIFT, 1999.

, 2 L'analyse de données géométriques, p.207

, 2 L'analyse de données géométriques

, En venant des sciences des données ou des statistiques, la spécificité notable de l'analyse de formes est l'absence des opérations algébriques "+" et "×". Calculer la somme de deux cerveaux ne fait guère de sens, et aucun modèle de coeur canonique ne pourra vraiment remplacer l, Les formes ne sont pas des vecteurs

, Heureusement, des distances entre formes peuvent toujours être définies : dire que deux crânes sont "proches" ou "éloignés" l'un de l'autre peut être tout à fait légitime. Un problème d'intérêt en anatomie computationnelle est donc de définir des structures métriques sur des espaces de formes qui soient : 1. Anatomiquement pertinentes et raisonnables du point de vue médical, Une théorie géométrique pour les données géométriques

, Algorithmiquement peu coûteuses pour être déployables sur des données cliniques

;. .. L'analyse-procrustéenne, N ) dans R N×D sont deux nuages de points non dégénérés (i.e. pas réduits à un seul point), on dira que x et y ont la même forme au sens de Procruste s'il existe un vecteur de translation ? ? R D , une matrice de rotation R ? O(D) ? R D×D, La plus simple de toutes ces métriques est celle que l'on peut définir sur l'espace des polygones indexés, définis à similitude près

. Géodésiques, En allant plus loin, on définit les courbes géodésiques comme des chemins continus ? : t ? [0, 1] ? ?(t) ? S qui minimisent la longueur localement -mais pas nécessairement entre leurs extrémités, pour cause de courbure et non-unicité, En un mot : les géodésiques sont des lignes droites généralisées

(. Si and . Est-une-variété-riemannienne--i.e, si elle est localement équivalente à un espace euclidien, comme une sphère est localement équivalente à ses plans tangents -on peut montrer que toute géodésique obéit à une équation différentielle d'ordre 2 (Lee, 2006)

. Fletcher, Le segment géodésique ? i entre une moyenne x * et un sujet x i est paramétré par sa vitesse initiale v i = d dt ? i (t = 0). Cela nous permet de réaliser des analyses statistiques comme l'ACP dans l'espace tangent T x * S à l'espace de formes S au point x *, Régression géodésique, modèles longitudinaux. En identifiant les géodésiques aux lignes droites, on peut généraliser la régression linéaire aux espaces de formes, 2004.

. Durrleman, Dans de nombreux cas d'application cliniques, on cherche à comparer la trajectoire d'un patient à la tendance globale de son groupe, Comme illustré Figure B, vol.18, 2013.

. Montagnat, Si D = 2 ou 3 et si ? : R D ? R D est une application qui envoie une forme source A sur une cible ?(A) = B, l'écart entre ? et la fonction identité Id : x ? R D ? x ? R D peut être utilisé pour définir une distance d(A, B). Réciproquement, une déformation plausible ? peut être comprise comme une géodésique qui transforme petit à petit Id(A) = A en ?(A) = B en suivant, pour une certaine métrique, une trajectoire de moindre effort dans un espace de déformations, Analyse de formes et recalage. Au cours des vingt dernières années, une littérature abondante s'est structurée autour de l'idée que des métriques entre formes peuvent être définies à partir d'algorithmes de recalage, 2001.

. Von-tycowicz, Un manuel de référence sur le sujet a récemment été publié, avec de nombreuses applications aux statistiques, ou via des déformations SVF (Arsigny et al., 2006) et LDDMM (Beg et, 1999.

. Ollier, il nous faut donc résoudre les problèmes suivants : 1. Vitesse d'exécution. Recaler finement deux volumes 3D à l'aide d'algorithmes itératifs prend au mieux une poignée de secondes, En 2020, la communauté semble avoir atteint les limites de ce qui peut raisonnablement être réalisé à l'aide d'équations explicites et de codes Matlab ou C++, 2005.

. Pertinence, Aujourd'hui, bien peu de modèles peuvent vraiment extrapoler de manière vraisemblable en dehors de leurs bases d'entraînement : les modèles à noyaux, SVF ou LDDMM reposent sur des hypothèses de régularité qui ne font pas beaucoup de sens d'un point de vue médical

. Durrleman, Pour apporter une réponse à ces questions, les chercheurs se sont principalement concentré sur des implémentations multi-échelles, ou basses fréquences (Zhang and Fletcher, 2019) d'algorithmes standards, sur des hypothèses de régularité implicites, 2014.

, Dans des cadres favorables comme la neuro-anatomie, il semble maintenant possible de calculer des déformations vraisemblables en quelques fractions de seconde. Toutefois, aucune réponse pleinement satisfaisante n'a encore pu être fournie à la question de la pertinence anatomique : le recherche de métriques robustes et inspirées par les données

B. Charlier, J. Feydy, D. W. Jacobs, and A. Trouvé, Distortion minimizing geodesic subspaces in shape spaces and computational anatomy, In European Congress on Computational Methods in Applied Sciences and Engineering, pp.1135-1144, 2017.

J. Feydy, B. Charlier, F. Vialard, and G. Peyré, Optimal transport for diffeomorphic registration, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.291-299, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540455

J. Feydy and A. Trouvé, Global divergences between measures: from Hausdorff distance to optimal transport, International Workshop on Shape in Medical Imaging, pp.102-115, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01827184

J. Feydy, T. Séjourné, F. Vialard, S. Amari, A. Trouvé et al., Interpolating between optimal transport and MMD using Sinkhorn divergences, The 22nd International Conference on Artificial Intelligence and Statistics, pp.2681-2690, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01898858

J. Feydy, P. Roussillon, A. Trouvé, and P. Gori, Fast and scalable optimal transport for brain tractograms, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.636-644, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02264177

T. Séjourné, J. Feydy, F. Vialard, A. Trouvé, and G. Peyré, Sinkorn divergences for unbalanced Optimal Transport, 2019.

B. Charlier, J. Feydy, J. A. Glaunès, F. Collin, and G. Durif, Kernel operations on the GPU, with autodiff, without memory overflows, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02517462

M. Bibliography-abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen et al., , 2015.

P. Addis, P. Melis, R. Cannas, M. Secci, F. Tinti et al., A morphometric approach for the analysis of body shape in bluefin tuna: preliminary results, Collect. Vol. Sci. Pap. ICCAT, vol.65, issue.3, pp.982-987, 2010.

A. Agarwal, C. Jawahar, and P. Narayanan, A survey of planar homography estimation techniques. Centre for Visual Information Technology, 2005.

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

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows. Alfred P. Sloan School of Management, 1988.

D. Aiger, N. J. Mitra, and D. Cohen-or, 4-points congruent sets for robust pairwise surface registration, ACM transactions on graphics (TOG), vol.27, issue.3, p.85, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00622443

R. Al-rfou, G. Alain, A. Almahairi, C. Angermueller, D. Bahdanau et al., , vol.221, p.222, 2016.

A. , M. Behr, J. Cohen-or, D. Fleishman, S. Levin et al., Point set surfaces, Proceedings of the Conference on Visualization'01, pp.21-28, 2001.

D. Ali-hamadi, T. Liu, B. Gilles, L. Kavan, F. Faure et al., Anatomy transfer, ACM Transactions on Graphics (TOG), vol.32, issue.6, p.188, 2013.

J. Altschuler, F. Bach, A. Rudi, and J. Weed, Approximating the quadratic transportation metric in near-linear time, 2018.

J. Altschuler, F. Bach, A. Rudi, and J. Weed, Massively scalable Sinkhorn distances via the Nyström method, 2018.

S. Amari, Natural gradient works efficiently in learning, Neural computation, vol.10, issue.2, pp.251-276, 1998.

S. Amari and H. Nagaoka, Methods of information geometry, vol.191, 2007.

N. Amenta and Y. J. Kil, Defining point-set surfaces, In ACM Transactions on Graphics, vol.23, issue.3, pp.264-270, 2004.

S. Arguillere, Géométrie sous-Riemannienne en dimension infinie et applications à l'analyse mathématique des formes, 2014.

S. Arguillere, E. Trélat, A. Trouvé, and L. Younes, Shape deformation analysis from the optimal control viewpoint, Journal de mathématiques pures et appliquées, vol.104, issue.1, pp.139-178, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00923570

S. Arguillere, E. Trélat, A. Trouvé, and L. Younes, Registration of multiple shapes using constrained optimal control, SIAM Journal on Imaging Sciences, vol.9, issue.1, pp.344-385, 2016.

M. Arjovsky, S. Chintala, and L. Bottou, Wasserstein generative adversarial networks, International conference on machine learning, pp.214-223, 2017.

V. Arnold, Sur la géométrie différentielle des groupes de lie de dimension infinie et ses applications à l'hydrodynamique des fluides parfaits, Annales de l'institut Fourier, vol.16, pp.319-361, 1966.

V. Arsigny, O. Commowick, N. Ayache, and X. Pennec, A fast and log-euclidean polyaffine framework for locally linear registration, Journal of Mathematical Imaging and Vision, vol.33, issue.2, pp.222-238, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00616084

V. Arsigny, O. Commowick, X. Pennec, A. , and N. , A log-euclidean framework for statistics on diffeomorphisms, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.924-931, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00615594

V. Arsigny, X. Pennec, A. , and N. , Polyrigid and polyaffine transformations: a novel geometrical tool to deal with non-rigid deformations-application to the registration of histological slices, Medical image analysis, vol.9, issue.6, pp.507-523, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00615665

J. Ashburner, A fast diffeomorphic image registration algorithm, Neuroimage, vol.38, issue.1, pp.95-113, 2007.

J. Ashburner and K. J. Friston, Diffeomorphic registration using geodesic shooting and gauss-newton optimisation, NeuroImage, vol.55, issue.3, pp.954-967, 2011.

M. Aussal and M. Bakry, The Fast and Free Memory method for the efficient computation of convolution kernels, 2019.

B. B. Avants, C. L. Epstein, M. Grossman, and J. C. Gee, Symmetric diffeomorphic image registration with cross-correlation: evaluating automated labeling of elderly and neurodegenerative brain, Medical image analysis, vol.12, issue.1, pp.26-41, 2008.

B. B. Avants, N. Tustison, and G. Song, Advanced normalization tools (ANTS), Insight journal, vol.2, pp.1-35, 2009.

U. Ayachit, The ParaView guide: a parallel visualization application, 2015.

G. Balakrishnan, A. Zhao, M. R. Sabuncu, J. Guttag, and A. V. Dalca, VoxelMorph: a learning framework for deformable medical image registration, IEEE transactions on medical imaging, 2019.

A. Baradat, Incompressible optimal transport: dependence to the data and entropic regularization, 2019.
URL : https://hal.archives-ouvertes.fr/tel-02270693

A. Baradat and L. Monsaingeon, Small noise limit and convexity for generalized incompressible flows, schrödinger problems, and optimal transport, 2018.

J. Barnes and P. Hut, A hierarchical O(N log N) force-calculation algorithm, Nature, vol.324, issue.6096, p.446, 1986.

P. J. Basser, J. Mattiello, and D. Lebihan, MR diffusion tensor spectroscopy and imaging, Biophysical journal, vol.66, issue.1, pp.259-267, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00349721

M. Bauer, M. Bruveris, P. Harms, and P. W. Michor, Geodesic distance for right invariant Sobolev metrics of fractional order on the diffeomorphism group, Annals of Global Analysis and Geometry, vol.44, issue.1, pp.5-21, 2013.

M. Bauer, M. Bruveris, and P. W. Michor, Uniqueness of the Fisher-Rao metric on the space of smooth densities, Bulletin of the London Mathematical Society, vol.48, issue.3, pp.499-506, 2016.

M. Bauer, S. Joshi, and K. Modin, Diffeomorphic density matching by optimal information transport, SIAM Journal on Imaging Sciences, vol.8, issue.3, pp.1718-1751, 2015.

M. Bauer, S. Joshi, and K. Modin, Diffeomorphic random sampling using optimal information transport, International Conference on Geometric Science of Information, pp.135-142, 2017.

M. Bauer, S. Joshi, and K. Modin, Diffeomorphic density registration, 2018.

R. Beatson and L. Greengard, A short course on fast multipole methods. Wavelets, multilevel methods and elliptic PDEs, vol.1, pp.1-37, 1997.

M. Bebendorf, Approximation of boundary element matrices, Numerische Mathematik, vol.86, issue.4, pp.565-589, 2000.

M. F. Beg, M. I. Miller, A. Trouvé, and L. Younes, Computing large deformation metric mappings via geodesic flows of diffeomorphisms, International journal of computer vision, vol.61, issue.2, pp.139-157, 2005.

A. Ben-tanfous, H. Drira, B. Amor, and B. , Coding Kendall's shape trajectories for 3d action recognition, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.2840-2849, 2018.

J. Benamou and Y. Brenier, A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem, Numerische Mathematik, vol.84, issue.3, pp.375-393, 2000.

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.
URL : https://hal.archives-ouvertes.fr/hal-01096124

J. Benamou, B. D. Froese, and A. M. Oberman, Numerical solution of the optimal transportation problem using the Monge-Ampère equation, Journal of Computational Physics, vol.260, pp.107-126, 2014.

R. J. Berman, The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations, 2017.

M. Bernot, V. Caselles, and J. Morel, Optimal transportation networks: models and theory, 2008.

G. Bertò, D. Bullock, P. Astolfi, S. Hayashi, L. Zigiotto et al., Classifyber, a robust streamline-based linear classifier for white matter bundle segmentation, 2020.

D. P. Bertsekas, A distributed algorithm for the assignment problem. Lab. for Information and Decision Systems Working Paper, M.I.T, 1979.

D. P. Bertsekas, Auction algorithms for network flow problems: A tutorial introduction, Computational optimization and applications, vol.1, issue.1, pp.7-66, 1992.

D. P. Bertsekas, Auction algorithms. Encyclopedia of optimization, pp.128-132, 2009.

P. J. Besl and N. D. Mckay, Method for registration of 3-d shapes, Sensor fusion IV: control paradigms and data structures, vol.1611, pp.586-606, 1992.

V. Blanz and T. Vetter, A morphable model for the synthesis of 3d faces, Proceedings of SIGGRAPH), vol.99, pp.187-194, 1999.

J. F. Blinn, A generalization of algebraic surface drawing, ACM transactions on graphics (TOG), vol.1, issue.3, pp.235-256, 1982.

A. Bône, M. Louis, B. Martin, and S. Durrleman, Deformetrica 4: an open-source software for statistical shape analysis, In International Workshop on Shape in Medical Imaging, pp.3-13, 2018.

J. Bonet and R. D. Wood, Nonlinear continuum mechanics for finite element analysis, 1997.

N. Bonneel and D. Coeurjolly, Sliced partial optimal transport, Proceedings of SIGGRAPH), vol.38, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02111220

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

F. L. Bookstein, Morphometric tools for landmark data: geometry and biology, 1991.

G. Borgefors, Distance transformations in arbitrary dimensions. Computer vision, graphics, and image processing, vol.27, pp.321-345, 1984.

S. Borgwardt, An LP-based, strongly polynomial 2-approximation algorithm for sparse Wasserstein barycenters, 2017.

M. Bossa, M. Hernandez, and S. Olmos, Contributions to 3D diffeomorphic atlas estimation: application to brain images, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.667-674, 2007.

S. Bouaziz, A. Tagliasacchi, H. Li, P. , and M. , Modern techniques and applications for real-time non-rigid registration, SIGGRAPH ASIA 2016 Courses, p.11, 2016.

S. Bouaziz, A. Tagliasacchi, P. , and M. , Sparse iterative closest point, Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing, pp.113-123, 2013.

C. Brandt, C. Von-tycowicz, and K. Hildebrandt, Geometric flows of curves in shape space for processing motion of deformable objects, Computer Graphics Forum, vol.35, pp.295-305, 2016.

L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR computational mathematics and mathematical physics, vol.7, issue.3, pp.200-217, 1967.

Y. Brenier, Polar factorization and monotone rearrangement of vector-valued functions, Comm. Pure Appl. Math, vol.44, issue.4, pp.375-417, 1991.

Y. Brenier, Minimal geodesics on groups of volume-preserving maps and generalized solutions of the euler equations, Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, vol.52, issue.4, pp.411-452, 1999.

S. Broadbent, Simulating the ley hunter, Journal of the Royal Statistical Society: Series A (General), vol.143, issue.2, pp.109-126, 1980.

M. M. Bronstein, J. Bruna, Y. Lecun, A. Szlam, and P. Vandergheynst, Geometric deep learning: going beyond euclidean data, IEEE Signal Processing Magazine, vol.34, issue.4, pp.18-42, 2017.

M. Brunn, N. Himthani, G. Biros, M. Mehl, and A. Mang, Fast 3D diffeomorphic image registration on GPUs, The International Conference for High Performance Computing, Networking, Storage, and Analysis, 2019.

M. Brunn, N. Himthani, G. Biros, M. Mehl, and A. Mang, Fast GPU 3D diffeomorphic image registration, 2020.

M. Bruveris and D. D. Holm, Geometry of image registration: The diffeomorphism group and momentum maps, Geometry, Mechanics, and Dynamics, pp.19-56, 2015.

B. Buet, G. P. Leonardi, and S. Masnou, Discrete varifolds: A unified framework for discrete approximations of surfaces and mean curvature, International Conference on Scale Space and Variational Methods in Computer Vision, pp.513-524, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02141373

B. Buet, G. P. Leonardi, and S. Masnou, A varifold approach to surface approximation. Archive for Rational Mechanics and, Analysis, vol.226, issue.2, pp.639-694, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02141325

P. Burt and E. Adelson, The Laplacian pyramid as a compact image code, IEEE Transactions on communications, vol.31, issue.4, pp.532-540, 1983.

G. Buttazzo, L. De-pascale, and P. Gori-giorgi, Optimal-transport formulation of electronic density-functional theory, Physical Review A, vol.85, issue.6, p.62502, 2012.

L. Cambier and E. Darve, Fast low-rank kernel matrix factorization through skeletonized interpolation, SIAM Journal on Scientific Computing, vol.41, issue.3, pp.1652-1680, 2019.

J. W. Cannon, W. J. Floyd, R. Kenyon, and W. R. Parry, Hyperbolic geometry. Flavors of geometry, vol.31, pp.59-115, 1997.

B. Charlier, Étude des propriétés statistiques des moyennes de Fréchet dans des modèles de déformations pour l'analyse de courbes et d'images en grande dimension, 2011.

B. Charlier, N. Charon, and A. Trouvé, The fshape framework for the variability analysis of functional shapes, Foundations of Computational Mathematics, vol.17, issue.2, pp.287-357, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00981805

B. Charlier, J. Feydy, J. A. Glaunès, F. Collin, and G. Durif, Kernel operations on the GPU, with autodiff, without memory overflows, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02517462

B. Charlier, J. Feydy, D. W. Jacobs, and A. Trouvé, Distortion minimizing geodesic subspaces in shape spaces and computational anatomy, European Congress on Computational Methods in Applied Sciences and Engineering, pp.1135-1144, 2017.

N. Charon and A. Trouvé, The varifold representation of nonoriented shapes for diffeomorphic registration, SIAM Journal on Imaging Sciences, vol.6, issue.4, pp.2547-2580, 2013.

É. Charpentier, E. Ghys, and A. Lesne, The scientific legacy of Poincaré, vol.36, 2010.

F. Chazal, D. Cohen-steiner, A. Lieutier, and B. Thibert, Stability of curvature measures, Computer Graphics Forum, vol.28, pp.1485-1496, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00344903

T. Chen, T. Moreau, Z. Jiang, L. Zheng, E. Yan et al., TVM: An automated end-to-end optimizing compiler for deep learning, 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pp.578-594, 2018.

L. Chizat, G. Peyré, B. Schmitzer, and F. Vialard, Scaling algorithms for unbalanced transport problems, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01434914

L. Chizat, G. Peyré, B. Schmitzer, and F. Vialard, Unbalanced optimal transport: Dynamic and Kantorovich formulations, Journal of Functional Analysis, vol.274, issue.11, pp.3090-3123, 2018.

C. Chnafa, S. Mendez, and F. Nicoud, Image-based large-eddy simulation in a realistic left heart, Computers & Fluids, vol.94, pp.173-187, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00943609

H. Chui and A. Rangarajan, A new algorithm for non-rigid point matching, Computer Vision and Pattern Recognition, vol.2, pp.44-51, 2000.

C. Ciliberto, L. Rosasco, and A. Rudi, A consistent regularization approach for structured prediction, Advances in neural information processing systems, pp.4412-4420, 2016.

A. Conner-simons and R. Gordon, , 2019.

, Using AI to predict breast cancer and personalize care

A. Constantin and B. Kolev, Geodesic flow on the diffeomorphism group of the circle, Commentarii Mathematici Helvetici, vol.78, issue.4, pp.787-804, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00003261

C. Cotar, G. Friesecke, and C. Klüppelberg, Density functional theory and optimal transportation with Coulomb cost, Communications on Pure and Applied Mathematics, vol.66, issue.4, pp.548-599, 2013.

I. Csiszár and P. C. Shields, Information theory and statistics: A tutorial, Foundations and Trends in Communications and Information Theory, vol.1, issue.4, pp.417-528, 2004.

B. Curless and M. Levoy, A volumetric method for building complex models from range images, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, pp.303-312, 1996.

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, International Conference on Machine Learning, pp.685-693, 2014.

A. Delmonte, C. Mercier, J. Pallud, I. Bloch, and P. Gori, White matter multiresolution segmentation using fuzzy set theory, 2019 IEEE 16th International Symposium on Biomedical Imaging (ISBI 2019), pp.459-462, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01983010

J. Delon, J. Salomon, and A. Sobolevski, Local matching indicators for transport problems with concave costs, SIAM Journal on Discrete Mathematics, vol.26, issue.2, pp.801-827, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00525994

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.

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society: Series B (Methodological), vol.39, issue.1, pp.1-22, 1977.

M. Descoteaux and R. Deriche, Mapping neuronal fiber crossings in the human brain, SPIE Newsroom, vol.2, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00431523

V. Dobri? and J. E. Yukich, Asymptotics for transportation cost in high dimensions, Journal of Theoretical Probability, vol.8, issue.1, pp.97-118, 1995.

A. Dominitz and A. Tannenbaum, Texture mapping via optimal mass transport, IEEE transactions on visualization and computer graphics, vol.16, issue.3, pp.419-433, 2009.

I. L. Dryden and K. V. Mardia, Statistical Shape Analysis: With Applications in R, vol.995, 1998.

R. M. Dudley, The speed of mean Glivenko-Cantelli convergence, The Annals of Mathematical Statistics, vol.40, issue.1, pp.40-50, 1969.

S. Durrleman, X. Pennec, A. Trouvé, J. Braga, G. Gerig et al., Toward a comprehensive framework for the spatiotemporal statistical analysis of longitudinal shape data, International journal of computer vision, vol.103, issue.1, pp.22-59, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00813825

S. Durrleman, M. Prastawa, N. Charon, J. R. Korenberg, S. Joshi et al., Morphometry of anatomical shape complexes with dense deformations and sparse parameters, NeuroImage, vol.101, pp.35-49, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01015771

A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM Journal on Scientific computing, vol.14, issue.6, pp.1368-1393, 1993.

O. Ecabert, J. Peters, M. J. Walker, T. Ivanc, C. Lorenz et al., Segmentation of the heart and great vessels in CT images using a model-based adaptation framework, Medical image analysis, vol.15, issue.6, pp.863-876, 2011.

F. Eckstein, W. Wirth, and M. C. Nevitt, Recent advances in osteoarthritis imaging-the osteoarthritis initiative, Nature Reviews Rheumatology, vol.8, issue.10, p.622, 2012.

S. Erlander, Optimal spatial interaction and the gravity model, vol.173, 1980.

H. Federer, Geometric measure theory, 1969.

A. Fedorov, R. Beichel, J. Kalpathy-cramer, J. Finet, J. Fillion-robin et al., 3D Slicer as an image computing platform for the quantitative imaging network, Magnetic resonance imaging, vol.30, issue.9, pp.1323-1341, 2012.

P. F. Felzenszwalb, R. B. Girshick, D. Mcallester, and D. Ramanan, Object detection with discriminatively trained part-based models, IEEE transactions on pattern analysis and machine intelligence, vol.32, pp.1627-1645, 2009.

R. Fernando, GPU gems: programming techniques, tips, and tricks for real-time graphics, vol.590, 2004.

S. Ferraris, M. Lorenzi, P. Daga, M. Modat, and T. Vercauteren, Accurate small deformation exponential approximant to integrate large velocity fields: Application to image registration, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, pp.17-24, 2016.

M. Fey and J. E. Lenssen, Fast graph representation learning with PyTorch Geometric, ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019.

J. Feydy, B. Charlier, F. Vialard, and G. Peyré, Optimal transport for diffeomorphic registration, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.291-299, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540455

J. Feydy, P. Roussillon, A. Trouvé, and P. Gori, Fast and scalable optimal transport for brain tractograms, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.636-644, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02264177

J. Feydy, T. Séjourné, F. Vialard, S. Amari, A. Trouvé et al., Interpolating between optimal transport and MMD using Sinkhorn divergences, The 22nd International Conference on Artificial Intelligence and Statistics, pp.2681-2690, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01898858

J. Feydy and A. Trouvé, Global divergences between measures: from Hausdorff distance to optimal transport, International Workshop on Shape in Medical Imaging, pp.102-115, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01827184

S. E. Fienberg, An iterative procedure for estimation in contingency tables, The Annals of Mathematical Statistics, vol.41, issue.3, pp.907-917, 1970.

B. Fischl, Freesurfer, Neuroimage, vol.62, issue.2, pp.774-781, 2012.

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 transactions on medical imaging, vol.23, issue.8, pp.995-1005, 2004.

P. T. Fletcher, S. Venkatasubramanian, and S. Joshi, Robust statistics on Riemannian manifolds via the geometric median, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.

T. Fletcher, Geodesic regression on Riemannian manifolds, Mathematical Foundations of Computational Anatomy, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00623920

A. Forrow, J. Hütter, M. Nitzan, P. Rigollet, G. Schiebinger et al., Statistical optimal transport via factored couplings, The 22nd International Conference on Artificial Intelligence and Statistics, pp.2454-2465, 2019.

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

K. Fukushima, Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position, Biological cybernetics, vol.36, issue.4, pp.193-202, 1980.

B. Galerne, A. Leclaire, and J. Rabin, A texture synthesis model based on semi-discrete optimal transport in patch space, SIAM Journal on Imaging Sciences, vol.11, issue.4, pp.2456-2493, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01726443

A. Galichon and B. Salanié, Matching with trade-offs: Revealed preferences over competing characteristics, 2010.

T. Gallouët and Q. Mérigot, A Lagrangian scheme for the incompressible Euler equation using optimal transport, 2016.

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering. Software: practice and experience, vol.30, pp.1203-1233, 2000.

J. Gardner, G. Pleiss, K. Q. Weinberger, D. Bindel, and A. G. Wilson, GPytorch: Blackbox matrix-matrix Gaussian process inference with GPU acceleration, Advances in Neural Information Processing Systems, pp.7576-7586, 2018.

L. A. Gatys, A. S. Ecker, and M. Bethge, Image style transfer using convolutional neural networks, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.2414-2423, 2016.

C. F. Gauss, Theoria motus corporum coelestium in sectionibus conicis solem ambientium, vol.7, 1809.

A. Genevay, L. Chizat, F. Bach, M. Cuturi, and G. Peyré, Sample complexity of Sinkhorn divergences, The 22nd International Conference on Artificial Intelligence and Statistics, pp.1574-1583, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02411822

A. Genevay, M. Cuturi, G. Peyré, and F. Bach, Stochastic optimization for large-scale optimal transport, Advances in Neural Information Processing Systems, pp.3440-3448, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01321664

A. Genevay, G. Peyré, and M. Cuturi, Learning generative models with Sinkhorn divergences, International Conference on Artificial Intelligence and Statistics, pp.1608-1617, 2018.

S. Gerber and M. Maggioni, Multiscale strategies for computing optimal transport, The Journal of Machine Learning Research, vol.18, issue.1, pp.2440-2471, 2017.

S. Gerber, M. Niethammer, M. Styner, A. , and S. , Exploratory population analysis with unbalanced optimal transport, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.464-472, 2018.

S. Gerber, T. Tasdizen, P. T. Fletcher, S. Joshi, R. Whitaker et al., Manifold modeling for brain population analysis, Medical image analysis, vol.14, issue.5, pp.643-653, 2010.

J. Glaunes, Transport par difféomorphismes de points, de mesures et de courants pour la comparaison de formes et l'anatomie numérique. These de sciences, p.13, 2005.

J. Glaunes, A. Trouvé, and L. Younes, Diffeomorphic matching of distributions: A new approach for unlabelled point-sets and sub-manifolds matching, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol.2, pp.II-II, 2004.

S. Gold, A. Rangarajan, C. Lu, S. Pappu, and E. Mjolsness, New algorithms for 2d and 3d point matching: Pose estimation and correspondence, Pattern recognition, vol.31, issue.8, pp.1019-1031, 1998.

I. Goodfellow, Y. Bengio, and A. Courville, Deep learning, 2016.

I. Goodfellow, J. Pouget-abadie, M. Mirza, B. Xu, D. Warde-farley et al., Generative adversarial nets, Advances in neural information processing systems, pp.2672-2680, 2014.

P. Gori-giorgi, M. Seidl, and G. Vignale, Density-functional theory for strongly interacting electrons, Physical review letters, vol.103, issue.16, p.166402, 2009.

L. Greengard, The rapid evaluation of potential fields in particle systems, 1988.

L. Greengard and J. Lee, Accelerating the nonuniform fast Fourier transform, SIAM review, vol.46, issue.3, pp.443-454, 2004.

U. Grenander and M. I. Miller, Computational anatomy: An emerging discipline, Quarterly of applied mathematics, vol.56, issue.4, pp.617-694, 1998.

A. Gretton, K. M. Borgwardt, M. J. Rasch, B. Schölkopf, and A. Smola, A kernel two-sample test, Journal of Machine Learning Research, vol.13, pp.723-773, 2012.

E. Grinspun, A. N. Hirani, M. Desbrun, and P. Schröder, Discrete shells, Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation, pp.62-67, 2003.

B. Gris, Incorporation of a deformation prior in image reconstruction, Journal of Mathematical Imaging and Vision, vol.61, issue.5, pp.691-709, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01810443

B. Gris, S. Durrleman, and A. Trouvé, A sub-Riemannian modular framework for diffeomorphism-based analysis of shape ensembles, SIAM Journal on Imaging Sciences, vol.11, issue.1, pp.802-833, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01321142

M. Gromov, Hyperbolic groups, Essays in group theory, pp.75-263, 1987.

E. Haber, T. Rehman, and A. Tannenbaum, An efficient numerical method for the solution of the L2 optimal mass transfer problem, SIAM Journal on Scientific Computing, vol.32, issue.1, pp.197-211, 2010.

W. Hackbusch, Hierarchical matrices: algorithms and analysis, vol.49, 2015.

S. Haker, L. Zhu, A. Tannenbaum, A. , and S. , Optimal mass transport for registration and warping, International Journal of computer vision, vol.60, issue.3, pp.225-240, 2004.

S. W. Hamilton, Second essay on a general method in dynamics, Philosophical Transactions of the Royal Society, 1835.

L. Hascoët and V. Pascual, The Tapenade Automatic Differentiation tool: Principles, Model, and Specification, ACM Transactions On Mathematical Software, issue.3, p.39, 2013.

J. Hensman, N. Fusi, and N. D. Lawrence, Gaussian processes for big data, Uncertainty in Artificial Intelligence, p.282, 2013.

N. J. Higham, The scaling and squaring method for the matrix exponential revisited, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.4, pp.1179-1193, 2005.

D. D. Holm and J. E. Marsden, Momentum maps and measure-valued solutions (peakons, filaments, and sheets) for the EPDiff equation, The breadth of symplectic and Poisson geometry, pp.203-235, 2005.

D. D. Holm, J. T. Ratnanather, A. Trouvé, and L. Younes, Soliton dynamics in computational anatomy, NeuroImage, vol.23, pp.170-178, 2004.

B. K. Horn and B. G. Schunck, Determining optical flow, Artificial intelligence, vol.17, issue.1-3, pp.185-203, 1981.

D. Huang, E. A. Swanson, C. P. Lin, J. S. Schuman, W. G. Stinson et al., Optical coherence tomography. Science, vol.254, issue.5035, pp.1178-1181, 1991.

D. H. Hubel and T. N. Wiesel, Receptive fields, binocular interaction and functional architecture in the cat's visual cortex, The Journal of physiology, vol.160, issue.1, pp.106-154, 1962.

D. H. Hubel and T. N. Wiesel, Receptive fields and functional architecture of monkey striate cortex, The Journal of physiology, vol.195, issue.1, pp.215-243, 1968.

J. D. Hunter, Matplotlib: A 2d graphics environment, Computing in science & engineering, vol.9, issue.3, p.90, 2007.

P. T. Inc, Collaborative data science, 2015.

M. L. Irons, The curvature and geodesics of the torus, 2005.

M. Jaderberg, K. Simonyan, and A. Zisserman, Spatial transformer networks, Advances in neural information processing systems, pp.2017-2025, 2015.

W. Jakob, J. Rhinelander, and D. Moldovan, PyBind11 -seamless operability between C++11 and python, 2017.

R. T. Jantzen, Geodesics on the torus and other surfaces of revolution clarified using undergraduate physics tricks with bonus: nonrelativistic and relativistic kepler problems, 2012.

S. Jayasumana, M. Salzmann, H. Li, and M. Harandi, A framework for shape analysis via Hilbert space embedding, Proceedings of the IEEE International Conference on Computer Vision, pp.1249-1256, 2013.

E. Jones, T. Oliphant, and P. Peterson, SciPy: Open source scientific tools for Python, 2001.

R. Jordan, D. Kinderlehrer, and F. Otto, The variational formulation of the Fokker-Planck equation, SIAM journal on mathematical analysis, vol.29, issue.1, pp.1-17, 1998.

W. Kahan, Further remarks on reducing truncation errors, Communications of the ACM, vol.8, issue.1, p.40, 1965.

I. Kaltenmark, Geometrical Growth Models for Computational Anatomy, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01396189

I. Kaltenmark, B. Charlier, C. , and N. , A general framework for curve and surface comparison and registration with oriented varifolds, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.3346-3355, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01817514

L. V. Kantorovich, On the translocation of masses, Dokl. Akad. Nauk. USSR (NS), vol.37, pp.199-201, 1942.

D. G. Kendall, The diffusion of shape, Advances in applied probability, vol.9, issue.3, pp.428-430, 1977.

D. G. Kendall, Shape manifolds, Procrustean metrics, and complex projective spaces, Bulletin of the London Mathematical Society, vol.16, issue.2, pp.81-121, 1984.

D. G. Kendall, A survey of the statistical theory of shape, Statistical Science, pp.87-99, 1989.

D. G. Kendall and W. S. Kendall, Alignments in two-dimensional random sets of points, Advances in Applied probability, vol.12, issue.2, pp.380-424, 1980.

M. Kilian, N. J. Mitra, and H. Pottmann, Geometric modeling in shape space, In ACM Transactions on Graphics, vol.26, p.64, 2007.

D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, 2014.

D. B. Kirk and W. H. Wen-mei, Programming massively parallel processors: a hands-on approach, 2010.

A. Klein, J. Andersson, B. A. Ardekani, J. Ashburner, B. Avants et al., Evaluation of 14 nonlinear deformation algorithms applied to human brain MRI registration, Neuroimage, vol.46, issue.3, pp.786-802, 2009.
URL : https://hal.archives-ouvertes.fr/inserm-00360790

S. Klein, M. Staring, K. Murphy, M. A. Viergever, and J. P. Pluim, Elastix: a toolbox for intensity-based medical image registration, IEEE transactions on medical imaging, vol.29, issue.1, pp.196-205, 2009.

C. P. Klingenberg, Analyzing fluctuating asymmetry with geometric morphometrics: concepts, methods, and applications, Symmetry, vol.7, issue.2, pp.843-934, 2015.

P. A. Knight, D. Ruiz, and B. Uçar, A symmetry preserving algorithm for matrix scaling, SIAM journal on Matrix Analysis and Applications, vol.35, issue.3, pp.931-955, 2014.
URL : https://hal.archives-ouvertes.fr/inria-00569250

T. C. Koopmans and M. Beckmann, Assignment problems and the location of economic activities, Econometrica: journal of the Econometric Society, pp.53-76, 1957.

J. J. Kosowsky and A. L. Yuille, The invisible hand algorithm: Solving the assignment problem with statistical physics, Neural networks, vol.7, issue.3, pp.477-490, 1994.

S. Kouranbaeva, The Camassa-Holm equation as a geodesic flow on the diffeomorphism group, Journal of Mathematical Physics, vol.40, issue.2, pp.857-868, 1999.

I. Koval, J. Schiratti, A. Routier, M. Bacci, O. Colliot et al., Statistical learning of spatiotemporal patterns from longitudinal manifold-valued networks, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.451-459, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540828

J. Krebs, H. Delingette, B. Mailhé, N. Ayache, and T. Mansi, Learning a probabilistic model for diffeomorphic registration, IEEE transactions on medical imaging, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01978339

J. Krebs, T. Mansi, H. Delingette, L. Zhang, F. C. Ghesu et al., Robust non-rigid registration through agent-based action learning, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.344-352, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01569447

A. Krizhevsky, I. Sutskever, and G. E. Hinton, Imagenet classification with deep convolutional neural networks, Advances in neural information processing systems, pp.1097-1105, 2012.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval research logistics quarterly, vol.2, pp.83-97, 1955.

L. Kühnel and S. Sommer, Computational anatomy in Theano, Graphs in Biomedical Image Analysis, Computational Anatomy and Imaging Genetics, pp.164-176, 2017.

S. Kullback, Information theory and statistics, 1997.

S. Kühn, Tissot's indicatrix, 2019.

H. Lavenant, Courbes et applications optimales à valeurs dans l'espace de Wasserstein, 2019.
URL : https://hal.archives-ouvertes.fr/tel-02146347

H. Lavenant, Harmonic mappings valued in the Wasserstein space, Journal of Functional Analysis, vol.277, issue.3, pp.688-785, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01668393

H. Lavenant, Unconditional convergence for discretizations of dynamical optimal transport, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02290609

H. Lavenant, S. Claici, E. Chien, and J. Solomon, Dynamical optimal transport on discrete surfaces, SIGGRAPH Asia, p.250, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01875836

L. Bihan, D. Mangin, J. Poupon, C. Clark, C. A. Pappata et al., Diffusion tensor imaging: concepts and applications, Journal of Magnetic Resonance Imaging: An Official Journal of the International Society for Magnetic Resonance in Medicine, vol.13, issue.4, pp.534-546, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00349820

C. Leary and T. Wang, XLA: TensorFlow, compiled, 2017.

A. Leclaire and J. Rabin, A fast multi-layer approximation to semi-discrete optimal transport, International Conference on Scale Space and Variational Methods in Computer Vision, pp.341-353, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02080222

Y. Lecun and Y. Bengio, Convolutional networks for images, speech, and time series. The handbook of brain theory and neural networks, vol.3361, 1995.

Y. Lecun and C. Cortes, The MNIST database of handwritten digits, 1998.

C. Ledig, A. Schuh, R. Guerrero, R. A. Heckemann, and D. Rueckert, Structural brain imaging in Alzheimer's disease and mild cognitive impairment: biomarker analysis and shared morphometry database, Scientific reports, vol.8, issue.1, p.11258, 2018.

J. M. Lee, Riemannian manifolds: an introduction to curvature, vol.176, 2006.

S. Lee, N. Charon, B. Charlier, K. Popuri, E. Lebed et al., Atlas-based shape analysis and classification of retinal optical coherence tomography images using the functional shape (fshape) framework, Medical image analysis, vol.35, pp.570-581, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01817551

A. M. Legendre and . Didot, Nouvelles méthodes pour la détermination des orbites des comètes, 1805.

F. Léger, A gradient descent perspective on Sinkhorn, 2020.

C. Léonard, From the Schrödinger problem to the Monge-Kantorovich problem, Journal of Functional Analysis, vol.262, issue.4, pp.1879-1920, 2012.

B. Lévy, A numerical algorithm for l2 semi-discrete optimal transport in 3d, ESAIM: Mathematical Modelling and Numerical Analysis, vol.49, issue.6, pp.1693-1715, 2015.

J. Leys, E. Ghys, and A. Alvarez, Chaos, 2013.

W. Li, E. K. Ryu, S. Osher, W. Yin, and W. Gangbo, A parallel method for earth mover's distance, Journal of Scientific Computing, vol.75, issue.1, pp.182-197, 2018.

M. Liero, A. Mielke, and G. Savaré, Optimal entropy-transport problems and a new hellinger-kantorovich distance between positive measures, Inventiones mathematicae, pp.1-149, 2015.

T. Lin and H. Zha, Riemannian manifold learning, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.5, pp.796-809, 2008.

O. Litany, A. Bronstein, M. Bronstein, and A. Makadia, Deformable shape completion with graph convolutional autoencoders, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.1886-1895, 2018.

D. C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Mathematical programming, vol.45, issue.1-3, pp.503-528, 1989.

H. Lombaert, L. Grady, X. Pennec, N. Ayache, and F. Cheriet, Spectral log-demons: diffeomorphic image registration with very large deformations, International journal of computer vision, vol.107, issue.3, pp.254-271, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00979616

M. Lorenzi, N. Ayache, G. B. Frisoni, X. Pennec, and A. D. Adni, LCC-Demons: a robust and accurate symmetric diffeomorphic registration algorithm, NeuroImage, vol.81, pp.470-483, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00819895

M. Lorenzi and X. Pennec, Geodesics, parallel transport & one-parameter subgroups for diffeomorphic image registration, International journal of computer vision, vol.105, issue.2, pp.111-127, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00623919

D. G. Lowe, Object recognition from local scale-invariant features, IEEE international conference on computer vision, vol.99, pp.1150-1157, 1999.

M. Lüthi, T. Gerig, C. Jud, and T. Vetter, Gaussian process morphable models, IEEE transactions on pattern analysis and machine intelligence, vol.40, pp.1860-1873, 2017.

J. Ma, J. Zhao, J. Tian, A. L. Yuille, and Z. Tu, Robust point matching via vector field consensus, IEEE Transactions on Image Processing, vol.23, issue.4, pp.1706-1721, 2014.

P. C. Mahalanobis, Analysis of race-mixture in Bengal, Journal of the Asiatic Society of Bengal, 1925.

P. C. Mahalanobis, On the generalised distance in statistics, Proceedings of the National Institute of Science of India, vol.12, pp.49-55, 1936.

J. Mairal, F. Bach, and J. Ponce, Sparse modeling for image and vision processing, Foundations and Trends® in Computer Graphics and Vision, vol.8, issue.2-3, pp.85-283, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01081139

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

S. Mallat, Understanding deep convolutional networks, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.374, p.20150203, 2016.

S. G. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.7, pp.674-693, 1989.

T. Mansi, I. Voigt, B. Leonardi, X. Pennec, S. Durrleman et al., A statistical model for quantification and prediction of cardiac remodelling: Application to tetralogy of Fallot, IEEE transactions on medical imaging, vol.30, issue.9, pp.1605-1616, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00616185

G. Mastroianni and D. Occorsio, Optimal systems of nodes for Lagrange interpolation on bounded intervals. a survey, Journal of computational and applied mathematics, vol.134, issue.1-2, pp.325-341, 2001.

K. Mcleod, A. Prakosa, T. Mansi, M. Sermesant, and X. Pennec, An incompressible log-domain demons algorithm for tracking heart tissue, International Workshop on Statistical Atlases and Computational Models of the Heart, pp.55-67, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00813851

G. Mena and J. Weed, Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem, 2019.

A. Mensch, M. Blondel, and G. Peyré, Geometric losses for distributional learning, International Conference on Machine Learning, pp.4516-4525, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02129281

Q. Mérigot, A multiscale approach to optimal transport, Computer Graphics Forum, vol.30, pp.1583-1592, 2011.

Q. Mérigot and J. Mirebeau, Minimal geodesics along volume-preserving maps, through semidiscrete optimal transport, SIAM Journal on Numerical Analysis, vol.54, issue.6, pp.3465-3492, 2016.

Q. Merigot and B. Thibert, Optimal transport: discretization and algorithms, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02494446

C. A. Micchelli, Y. Xu, and H. Zhang, Universal kernels, Journal of Machine Learning Research, vol.7, pp.2651-2667, 2006.

M. Micheli and J. A. Glaunès, Matrix-valued kernels for shape deformation analysis. Geometry, Imaging and Computing, vol.1, issue.1, pp.57-139, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00857313

M. Micheli, P. W. Michor, and D. Mumford, Sectional curvature in terms of the cometric, with applications to the Riemannian manifolds of landmarks, SIAM Journal on Imaging Sciences, vol.5, issue.1, pp.394-433, 2012.

P. W. Michor and D. B. Mumford, Riemannian geometries on spaces of plane curves, Journal of the European Mathematical Society, 2006.

G. Misio?ek, A shallow water equation as a geodesic flow on the bott-virasoro group, Journal of Geometry and Physics, vol.24, issue.3, pp.203-208, 1998.

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

J. Montagnat, H. Delingette, A. , and N. , A review of deformable surfaces: topology, geometry and deformation, Image and vision computing, vol.19, issue.14, pp.1023-1040, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00615110

J. Morvan, Generalized curvatures, 2008.

A. Myronenko and X. Song, Point set registration: Coherent point drift, IEEE transactions on pattern analysis and machine intelligence, vol.32, pp.2262-2275, 2010.

Q. Mérigot, A. Delalande, and F. Chazal, Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein space, 2019.

A. Nguyen, J. Yosinski, C. , and J. , Deep neural networks are easily fooled: High confidence predictions for unrecognizable images, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.427-436, 2015.

M. Niethammer, R. Kwitt, and F. Vialard, Metric learning for image registration, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.8463-8472, 2019.

M. Niethammer, Z. Shen, and R. Kwitt, Mermaid: Image registration via automatic differentiation, 2019.

Y. Nikulin and R. Novak, Exploring the neural algorithm of artistic style, 2016.

J. Norton, Philosophical significance of the general theory of relativity, 2013.

E. Nowak, F. Jurie, and B. Triggs, Sampling strategies for bag-of-features image classification, European conference on computer vision, pp.490-503, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00203752

N. Ogihara, H. Amano, T. Kikuchi, Y. Morita, K. Hasegawa et al., Towards digital reconstruction of fossil crania and brain morphology, Anthropological Science, p.141109, 2015.

C. Olah, A. Mordvintsev, and L. Schubert, Feature visualization, 2017.

W. Ollier, T. Sprosen, and T. Peakman, UK Biobank: from concept to reality, Pharmacogenomics, 2005.

A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang et al., Automatic differentiation in PyTorch, NIPS Autodiff Workshop, 2017.

F. Paty, A. Aspremont, and M. Cuturi, Regularity as regularization: Smooth and strongly convex Brenier potentials in optimal transport, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02340371

F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion et al., Scikit-learn: Machine learning in python, Journal of machine learning research, vol.12, pp.2825-2830, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00650905

M. Peemen, B. Mesman, and H. Corporaal, Speed sign detection and recognition by convolutional neural networks, Proceedings of the 8th international automotive congress, pp.162-170, 2011.

X. Pennec, Statistical computing on manifolds: from Riemannian geometry to computational anatomy, LIX Fall Colloquium on Emerging Trends in Visual Computing, pp.347-386, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00616104

X. Pennec, P. Fillard, A. , and N. , A Riemannian framework for tensor computing, International Journal of computer vision, vol.66, issue.1, pp.41-66, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070743

X. Pennec, S. Sommer, and T. Fletcher, Riemannian Geometric Statistics in Medical Image Analysis, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02341896

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

H. Poincaré, La science et l'hypothèse. Flammarion, 1902.

J. Portilla and E. P. Simoncelli, A parametric texture model based on joint statistics of complex wavelet coefficients, International journal of computer vision, vol.40, issue.1, pp.49-70, 2000.

, IRM picture, p.16, 2019.

C. R. Qi, H. Su, K. Mo, and L. J. Guibas, Pointnet: Deep learning on point sets for 3d classification and segmentation, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.652-660, 2017.

J. Rabin, S. Ferradans, and N. Papadakis, Adaptive color transfer with relaxed optimal transport, 2014 IEEE International Conference on Image Processing (ICIP), pp.4852-4856, 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.

J. Ragan-kelley, C. Barnes, A. Adams, S. Paris, F. Durand et al., Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines, Acm Sigplan Notices, vol.48, pp.519-530, 2013.

A. Rahimi and B. Recht, Random features for large-scale kernel machines, Advances in neural information processing systems, pp.1177-1184, 2008.

A. Ramdas, N. G. Trillos, and M. Cuturi, On Wasserstein two-sample testing and related families of nonparametric tests, Entropy, vol.19, issue.2, 2017.

C. E. Rasmussen, Gaussian processes in machine learning, Summer School on Machine Learning, pp.63-71, 2003.

N. Ray, D. Sokolov, S. Lefebvre, and B. Lévy, Meshless Voronoi on the GPU, SIGGRAPH Asia, p.265, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01927559

O. Ronneberger, P. Fischer, and T. Brox, U-net: Convolutional networks for biomedical image segmentation, International Conference on Medical image computing and computerassisted intervention, pp.234-241, 2015.

P. Roussillon, Modèles de cycles normaux pour l'analyse des déformations, 2017.

P. Roussillon and J. A. Glaunès, Representation of surfaces with normal cycles and application to surface registration, Journal of Mathematical Imaging and Vision, pp.1-27, 2019.

D. Rueckert, L. I. Sonoda, C. Hayes, D. L. Hill, M. O. Leach et al., Nonrigid registration using free-form deformations: application to breast MR images, IEEE transactions on medical imaging, vol.18, issue.8, pp.712-721, 1999.

L. Ruschendorf, Convergence of the iterative proportional fitting procedure, The Annals of Statistics, vol.23, issue.4, pp.1160-1174, 1995.

R. B. Rusu and S. Cousins, 3D is here: Point Cloud Library (PCL), IEEE International Conference on Robotics and Automation (ICRA), 2011.

E. K. Ryu, W. Li, P. Yin, and S. Osher, Unbalanced and partial L1 Monge-Kantorovich problem: A scalable parallel first-order method, Journal of Scientific Computing, vol.75, issue.3, pp.1596-1613, 2018.

T. Salimans, H. Zhang, A. Radford, and D. Metaxas, Improving GANs using optimal transport, 2018.

M. Sanjabi, J. Ba, M. Razaviyayn, and J. D. Lee, On the convergence and robustness of training GANs with regularized optimal transport, 2018.

F. Santambrogio, Optimal Transport for applied mathematicians, Nonlinear Differential Equations and their applications, vol.87, 2015.

F. Santambrogio, {Euclidean, metric, and Wasserstein} gradient flows: an overview, Bulletin of Mathematical Sciences, vol.7, issue.1, pp.87-154, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01365905

G. Schiebinger, J. Shu, M. Tabaka, B. Cleary, V. Subramanian et al., Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming, Cell, vol.176, issue.4, pp.928-943, 2019.

J. Schiratti, S. Allassonniere, O. Colliot, and S. Durrleman, Learning spatiotemporal trajectories from manifold-valued longitudinal data, Advances in Neural Information Processing Systems, pp.2404-2412, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01245909

C. Schmaltz, P. Gwosdek, A. Bruhn, and J. Weickert, Electrostatic halftoning, Computer Graphics Forum, vol.29, pp.2313-2327, 2010.

B. Schmitzer, Isometry Invariant Shape Priors for Variational Image Segmentation, 2014.

B. Schmitzer, A sparse multiscale algorithm for dense optimal transport, Journal of Mathematical Imaging and Vision, vol.56, issue.2, pp.238-259, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01385274

B. Schmitzer, Stabilized sparse scaling algorithms for entropy regularized transport problems, SIAM Journal on Scientific Computing, vol.41, issue.3, pp.1443-1481, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01385251

A. Schrijver, Combinatorial optimization: polyhedra and efficiency, vol.24, 2003.

E. Schrödinger, Sur la théorie relativiste de l'électron et l'interprétation de la mécanique quantique, Annales de l'institut Henri Poincaré, vol.2, pp.269-310, 1932.

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.

T. Séjourné, J. Feydy, F. Vialard, A. Trouvé, and G. Peyré, Sinkorn divergences for unbalanced Optimal Transport, 2019.

C. E. Shannon, A mathematical theory of communication. Bell system technical journal, vol.27, pp.379-423, 1948.

M. Sharify, S. Gaubert, and L. Grigori, Solution of the optimal assignment problem by diagonal scaling algorithms, 2011.

J. Shawe-taylor and N. Cristianini, Kernel methods for pattern analysis, 2004.

Z. Shen, F. Vialard, and M. Niethammer, Region-specific diffeomorphic metric mapping, Advances in Neural Information Processing Systems, 2019.

R. Sinkhorn, A relationship between arbitrary positive matrices and doubly stochastic matrices, Ann. Math. Statist, vol.35, pp.876-879, 1964.

J. Sivic and A. Zisserman, Video Google: A text retrieval approach to object matching in videos, Proceedings of the Ninth IEEE International Conference on Computer Vision, vol.2, p.1470, 2003.

A. Skodras, C. Christopoulos, and T. Ebrahimi, The JPEG 2000 still image compression standard, IEEE Signal processing magazine, vol.18, issue.5, pp.36-58, 2001.

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.

S. Sommer, F. Lauze, S. Hauberg, and M. Nielsen, Manifold valued statistics, exact principal geodesic analysis and the effect of linear approximations, European conference on computer vision, pp.43-56, 2010.

S. Sommer, F. Lauze, M. Nielsen, and X. Pennec, Sparse multi-scale diffeomorphic registration: the kernel bundle framework, Journal of mathematical imaging and vision, vol.46, issue.3, pp.292-308, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00813868

S. Sommer, M. Nielsen, S. Darkner, and X. Pennec, Higher-order momentum distributions and locally affine LDDMM registration, SIAM Journal on Imaging Sciences, vol.6, issue.1, pp.341-367, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00813869

S. Sommer, M. Nielsen, F. Lauze, and X. Pennec, A multi-scale kernel bundle for LDDMM: towards sparse deformation description across space and scales, Biennial International Conference on Information Processing in Medical Imaging, pp.624-635, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00616209

A. Song, V. Uhlmann, J. Fageot, and M. Unser, Dictionary learning for 2d Kendall shapes, 2019.

A. Srivastava, E. Klassen, S. H. Joshi, and I. H. Jermyn, Shape analysis of elastic curves in euclidean spaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.7, pp.1415-1428, 2010.

A. Srivastava and E. P. Klassen, Functional and shape data analysis, Bibliography, vol.243, 2016.

A. Staniforth and J. Côté, Semi-Lagrangian integration schemes for atmospheric models -a review, Monthly weather review, vol.119, issue.9, pp.2206-2223, 1991.

Z. Su, M. Bauer, S. C. Preston, H. Laga, and E. Klassen, Shape analysis of surfaces using general elastic metrics, 2019.

S. C. Surace, J. Pfister, W. Gerstner, B. , and J. , On the choice of metric in gradient-based theories of brain function, 2018.

G. J. Szekely and M. L. Rizzo, Hierarchical clustering via joint between-within distances: Extending Ward's minimum variance method, Journal of classification, vol.22, issue.2, pp.151-183, 2005.

H. Takeda, S. Farsiu, and P. Milanfar, Kernel regression for image processing and reconstruction, IEEE Transactions on image processing, vol.16, issue.2, pp.349-366, 2007.

G. Teschl, Ordinary differential equations and dynamical systems, vol.140, 2012.

A. Thibault, L. Chizat, C. Dossal, and N. Papadakis, Overrelaxed Sinkhorn-Knopp algorithm for regularized optimal transport, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01629985

D. W. Thompson, On growth and form, 1917.

A. Tissot, Mémoire sur la représentation des surfaces et les projections des cartes géographiques, Nouvelles annales de mathématiques: journal des candidats aux écoles polytechnique et normale, vol.17, pp.145-163, 1878.

J. Tournier, R. Smith, D. Raffelt, R. Tabbara, T. Dhollander et al., MRtrix3: A fast, flexible and open software framework for medical image processing and visualisation, NeuroImage, p.116137, 2019.

A. Trouvé and F. Vialard, Shape splines and stochastic shape evolutions: A second order point of view, Quarterly of Applied Mathematics, pp.219-251, 2012.

S. Uchida, Image processing and recognition for biological images, Development, growth & differentiation, vol.55, issue.4, pp.523-549, 2013.

D. Ulyanov, A. Vedaldi, and V. Lempitsky, Deep image prior, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.9446-9454, 2018.

M. Vaillant and J. Glaunès, Surface matching via currents, Biennial International Conference on Information Processing in Medical Imaging, pp.381-392, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00263652

S. Van-der-walt, S. C. Colbert, and G. Varoquaux, The NumPy array: a structure for efficient numerical computation, Computing in Science & Engineering, vol.13, issue.2, p.22, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00564007

D. C. Van-essen, S. M. Smith, D. M. Barch, T. E. Behrens, E. Yacoub et al., The WU-Minn human connectome project: an overview, Neuroimage, vol.80, pp.62-79, 2013.

N. Vasilache, O. Zinenko, T. Theodoridis, P. Goyal, Z. Devito et al., Tensor comprehensions: Framework-agnostic highperformance machine learning abstractions, 2018.

W. N. Venables and B. D. Ripley, Modern Applied Statistics with S-PLUS, 2002.

F. Vialard, An elementary introduction to entropic regularization and proximal methods for numerical optimal transport, p.2303456, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02303456

F. Vialard and L. Risser, Spatially-varying metric learning for diffeomorphic image registration: A variational framework, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.227-234, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02022533

C. Villani, Topics in optimal transportation, Graduate studies in Mathematics, 2003.

C. Villani, Optimal transport: old and new, vol.338, 2008.

P. Von-radziewsky, E. Eisemann, H. Seidel, and K. Hildebrandt, Optimized subspaces for deformation-based modeling and shape interpolation, Computers & Graphics, vol.58, pp.128-138, 2016.

C. Von-tycowicz, C. Schulz, H. Seidel, and K. Hildebrandt, Real-time nonlinear shape interpolation, ACM Transactions on Graphics (TOG), vol.34, issue.3, p.34, 2015.

H. F. Walker and P. Ni, Anderson acceleration for fixed-point iterations, SIAM Journal on Numerical Analysis, vol.49, issue.4, pp.1715-1735, 2011.

G. K. Wallace, The JPEG still picture compression standard, IEEE transactions on consumer electronics, vol.38, issue.1, pp.xviii-xxxiv, 1992.

K. A. Wang, G. Pleiss, J. R. Gardner, S. Tyree, K. Q. Weinberger et al., Exact Gaussian processes on a million data points, 2019.

J. Wasserthal, P. Neher, and K. H. Maier-hein, Tractseg -Fast and accurate white matter tract segmentation, NeuroImage, vol.183, pp.239-253, 2018.

J. Weed and F. Bach, Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance, Bernoulli, vol.25, issue.4A, pp.2620-2648, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01555307

D. Wei, B. Zhou, A. Torralba, and W. T. Freeman, mNeuron: A Matlab plugin to visualize neurons from deep models, 2017.

A. G. Wilson, The use of entropy maximising models, in the theory of trip distribution, mode split and route split, Journal of Transport Economics and Policy, pp.108-126, 1969.

J. Wu, C. Zhang, T. Xue, B. Freeman, and J. Tenenbaum, Learning a probabilistic latent space of object shapes via 3d generative-adversarial modeling, Advances in neural information processing systems, pp.82-90, 2016.

C. Yang, R. Duraiswami, N. A. Gumerov, D. , and L. , Improved fast Gauss transform and efficient kernel density estimation, Proceedings of the Ninth IEEE International Conference on Computer Vision, vol.2, p.464, 2003.

T. Yang, Y. Li, M. Mahdavi, R. Jin, and Z. Zhou, Nyström method vs random Fourier features: A theoretical and empirical comparison, Advances in neural information processing systems, pp.476-484, 2012.

X. Yang, R. Kwitt, M. Styner, and M. Niethammer, Quicksilver: Fast predictive image registration -a deep learning approach, NeuroImage, vol.158, pp.378-396, 2017.

T. S. Yoo, M. J. Ackerman, W. E. Lorensen, W. Schroeder, V. Chalana et al., Engineering and algorithm design for an image processing API: a technical report on ITK-the insight toolkit, Studies in health technology and informatics, pp.586-592, 2002.

L. Younes, Shapes and diffeomorphisms, vol.171, 2010.

G. U. Yule, On the methods of measuring association between two attributes, Journal of the Royal Statistical Society, vol.75, issue.6, pp.579-652, 1912.

F. Zhang, Y. Wu, I. Norton, L. Rigolo, Y. Rathi et al., An anatomically curated fiber clustering white matter atlas for consistent white matter tract parcellation across the lifespan, NeuroImage, vol.179, pp.429-447, 2018.

K. Zhang, I. W. Tsang, and J. T. Kwok, Improved Nyström low-rank approximation and error analysis, Proceedings of the 25th international conference on Machine learning, pp.1232-1239, 2008.

M. Zhang and P. T. Fletcher, Fast diffeomorphic image registration via Fourierapproximated Lie algebras, International Journal of Computer Vision, vol.127, issue.1, pp.61-73, 2019.

K. Zhao, M. N. Vouvakis, and J. Lee, The adaptive cross approximation algorithm for accelerated method of moments computations of emc problems, IEEE transactions on electromagnetic compatibility, vol.47, issue.4, pp.763-773, 2005.

K. Zhou, J. Huang, J. Snyder, X. Liu, H. Bao et al., Large mesh deformation using the volumetric graph Laplacian, Proceedings of SIGGRAPH), pp.496-503, 2005.

J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.