Fetching the paper…
Reading the bibliography…
This article introduces a new notion of optimal transport (OT) between tensor fields, which are measures whose values are positive semidefinite (PSD) matrices.
On the transfer of masses (in Russian)
Leonid V Kantorovich · 1942
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
Boris T Polyak · 1964
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Richard Sinkhorn · 1964
Earlier work this paper cites.
Iterative procedures for nonlinear integral equations
Donald G Anderson · 1965
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
Lev M Bregman · 1967
Earlier work this paper cites.
Convex analysis
Ralph Tyrell Rockafellar · 1970
Earlier work this paper cites.
An algorithm for restricted least squares regression
Richard L Dykstra · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Yann Brenier · 1991
Earlier work this paper cites.
Anisotropic diffusion in image processing
Joachim Weickert · 1998
Earlier work this paper cites.
Dykstra’s algorithm with Bregman projections: a convergence proof
Heinz H Bauschke and Adrian S. Lewis · 2000
Earlier work this paper cites.
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Jean-David Benamou and Yann Brenier · 2000
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J. Guibas · 2000
Earlier work this paper cites.
What is a good linear finite element? Interpolation, conditioning, anisotropy and quality measures (preprint)
Jonathan Shewchuk · 2002
Earlier work this paper cites.
Anisotropic polygonal remeshing
Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy, and Mathieu Desbrun · 2003
Earlier work this paper cites.
Classical complexity and quantum entanglement
Leonid Gurvits · 2004
Earlier work this paper cites.
Physically based methods for tensor field visualization
Ingrid Hotz, Louis Feng, Hans Hagen, Bernd Hamann, Kenneth Joy, and Boris Jeremic · 2004
Earlier work this paper cites.
Image compression by linear splines over adaptive triangulations
Laurent Demaret, Nira Dyn, and Armin Iske · 2006
Earlier work this paper cites.
Variational Approaches to the Estimation, Regularizatinn, and Segmentation of Diffusion Tensor Images
Rachid Deriche, D Tschumpelé, Christophe Lenglet, and Mikaël Rousson · 2006
Earlier work this paper cites.
Matrix nearness problems with Bregman divergences
Inderjit S Dhillon and Joel A Tropp · 2008
Cited alongside, same era.
A new scaling and squaring algorithm for the matrix exponential
Awad H Al-Mohy and Nicholas J Higham · 2009
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Cited alongside, same era.
Image compression with anisotropic geodesic triangulations
Sébastien Bougleux, Gabriel Peyré, and Laurent D Cohen · 2009
Cited alongside, same era.
Non-Euclidean statistics for covariance matrices, with applications to diffusion tensor imaging
Ian L Dryden, Alexey Koloydenko, and Diwei Zhou · 2009
Cited alongside, same era.
Low-rank kernel learning with Bregman matrix divergences
Brian Kulis, Mátyás A. Sustik, and Inderjit S. Dhillon · 2009
Unbalanced optimal transport: Geometry and Kantorovich formulation
Lénaïc Chizat, Gabriel Peyré, Bernhard Schmitzer, and François-Xavier Vialard · 2015
Later among the works it cites.
Learning with a Wasserstein loss
Charlie Frogner, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya, and Tomaso A. Poggio · 2015
Later among the works it cites.
Positive contraction mappings for classical and quantum Schrödinger systems
Tryphon T Georgiou and Michele Pavon · 2015
Later among the works it cites.
Optimal entropy-transport problems and a new Hellinger–Kantorovich distance between positive measures
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2015
Later among the works it cites.
On matrix-valued Monge–Kantorovich optimal mass transport
Lipeng Ning, Tryphon T Georgiou, and Allen Tannenbaum · 2015
Later among the works it cites.
Optimal transport for applied mathematicians
Filippo Santambrogio · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Trivial connections on discrete surfaces
Keenan Crane, Mathieu Desbrun, and Peter Schröder · 2010
Cited alongside, same era.
A survey of procedural noise functions
Ares Lagae, Sylvain Lefebvre, Rob Cook, Tony DeRose, George Drettakis, David S Ebert, JP Lewis, Ken Perlin, and Matthias Zwicker · 2010
Cited alongside, same era.
Barycenters in the Wasserstein space
Martial Agueh and Guillaume Carlier · 2011
Cited alongside, same era.
Displacement interpolation using Lagrangian mass transport
Nicolas Bonneel, Michiel Van De Panne, Sylvain Paris, and Wolfgang Heidrich · 2011
Cited alongside, same era.
Random phase textures: Theory and synthesis
Bruno Galerne, Yann Gousseau, and Jean-Michel Morel · 2011
Cited alongside, same era.
Improving Gabor noise
Ares Lagae, Sylvain Lefebvre, and Philip Dutré · 2011
Cited alongside, same era.
Later among the works it cites.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
Justin Solomon, Fernando De Goes, Gabriel Peyré, Marco Cuturi, Adrian Butscher, Andy Nguyen, Tao Du, and Leonidas Guibas · 2015
Later among the works it cites.
Matrix optimal mass transport: A quantum mechanical approach
Yongxin Chen, Tryphon T Georgiou, and Allen Tannenbaum · 2016
Closest in time.
An interpolating distance between optimal transport and Fisher–Rao metrics
Lénaïc Chizat, Gabriel Peyré, Bernhard Schmitzer, and François-Xavier Vialard · 2016
Closest in time.
Scaling algorithms for unbalanced transport problems
Lénaïc Chizat, Gabriel Peyré, Bernhard Schmitzer, and François-Xavier Vialard · 2016
Closest in time.
A new optimal transport distance on the space of finite radon measures
Stanislav Kondratyev, Léonard Monsaingeon, and Dmitry Vorotnikov · 2016
Closest in time.
Optimal transport in competition with reaction: The Hellinger–Kantorovich distance and geodesic curves
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2016
Closest in time.
Stabilized sparse scaling algorithms for entropy regularized transport problems
Bernhard Schmitzer · 2016
Closest in time.
Ensemble tractography
Hiromasa Takemura, Cesar F Caiafa, Brian A Wandell, and Franco Pestilli · 2016
Closest in time.
Directional field synthesis, design, and processing
Amir Vaxman, Marcel Campen, Olga Diamanti, Daniele Panozzo, David Bommes, Klaus Hildebrandt, and Mirela Ben-Chen · 2016
Closest in time.
Clarifying human white matter
Brian A Wandell · 2016
Closest in time.
Relative entropy optimization and its applications
Venkat Chandrasekaran and Parikshit Shah · 2017
Closest in time.
On the matrix Monge-Kantorovich problem
Yongxin Chen, Wilfrid Gangbo, Tryphon T Georgiou, and Allen Tannenbaum · 2017
Closest in time.