A Parallel Method for Earth Mover’s Distance

We propose a new algorithm to approximate the Earth Mover’s distance (EMD). Our main idea is motivated by the theory of optimal transport, in which EMD can be reformulated as a familiar $$L_1$$L1 type minimization. We use a regularization which gives us a unique solution for this $$L_1$$L1 type problem. The new regularized minimization is very similar to problems which have been solved in the fields of compressed sensing and image processing, where several fast methods are available. In this paper, we adopt a primal-dual algorithm designed there, which uses very simple updates at each iteration and is shown to converge very rapidly. Several numerical examples are provided.

[1]  Michael Werman,et al.  Fast and robust Earth Mover's Distances , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[2]  Yann Brenier,et al.  A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem , 2000, Numerische Mathematik.

[3]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[4]  Bingsheng He,et al.  Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective , 2012, SIAM J. Imaging Sci..

[5]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[6]  Wotao Yin,et al.  Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗ , 2008 .

[7]  M. Beckmann.  A Continuous Model of Transportation , 1952 .

[8]  Ludovic Métivier,et al.  Measuring the misfit between seismograms using an optimal transport distance: application to full waveform inversion , 2016 .

[9]  Stephen P. Boyd,et al.  A Primer on Monotone Operator Methods , 2015 .

[10]  Leonidas J. Guibas,et al.  A metric for distributions with applications to image databases , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[11]  Joachim Gudmundsson,et al.  Small Manhattan Networks and Algorithmic Applications for the Earth Mover ’ s Distance , 2007 .

[12]  C. Villani.  Topics in Optimal Transportation , 2003 .

[13]  Dante Kalise,et al.  Proximal Methods for Stationary Mean Field Games with Local Couplings , 2016, SIAM J. Control. Optim..

[14]  Antonin Chambolle,et al.  Diagonal preconditioning for first order primal-dual algorithms in convex optimization , 2011, 2011 International Conference on Computer Vision.

[15]  Leonidas J. Guibas,et al.  Earth mover's distances on discrete surfaces , 2014, ACM Trans. Graph..

[16]  Peter J. Bickel,et al.  The Earth Mover's distance is the Mallows distance: some insights from statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[17]  L. Evans,et al.  Differential equations methods for the Monge-Kantorovich mass transfer problem , 1999 .

[18]  Jean-David Benamou,et al.  A numerical solution to Monge’s problem with a Finsler distance as cost , 2018, ESAIM: Mathematical Modelling and Numerical Analysis.

[19]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[20]  Jean-David Benamou,et al.  Augmented Lagrangian Methods for Transport Optimization, Mean Field Games and Degenerate Elliptic Equations , 2015, J. Optim. Theory Appl..

[21]  Haibin Ling,et al.  An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Gabriel Peyré,et al.  Optimal Transport with Proximal Splitting , 2013, SIAM J. Imaging Sci..

[23]  R. Rockafellar.  Conjugate Duality and Optimization , 1987 .

[24]  R. McCann,et al.  Monge's transport problem on a Riemannian manifold , 2001 .

[25]  David W. Jacobs,et al.  Approximate earth mover’s distance in linear time , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[26]  Filippo Santambrogio.  Absolute continuity and summability of transport densities: simpler proofs and new estimates , 2009 .

[27]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[28]  J. Moser,et al.  On a partial differential equation involving the Jacobian determinant , 1990 .

[29]  G. Strang.  L1 and L∞ Approximation of Vector Fields in the Plane , 1983 .