Parallel Unbalanced Optimal Transport Regularization for Large Scale Imaging Problems

The modeling of phenomenological structure is a crucial aspect in inverse imaging problems. One emerging modeling tool in computational imaging is the optimal transport framework. Its ability to model geometric displacements across an image's support gives it attractive qualities similar to those of optical flow methods which are effective at capturing visual motion, but are restricted to operate in significantly smaller state-spaces. Despite this advantage, two major drawbacks make it unsuitable for general deployment: (i) it suffers from exorbitant computational costs due to a quadratic optimization-variable complexity, and (ii) it has a mass-balancing assumption that limits applications with natural images. We tackle these issues simultaneously by proposing a novel formulation for an unbalanced optimal transport regularizer that has linear optimization-variable complexity. In addition, we present a general parallelizable proximal method for this regularizer, and demonstrate superior empirical performance on novel dynamical tracking applications in synthetic and real video.

[1]  Kun Li,et al.  Foreground–Background Separation From Video Clips via Motion-Assisted Matrix Restoration , 2015, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

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

[4]  G. Carlier,et al.  Tomographic Reconstruction from a Few Views: A Multi-Marginal Optimal Transport Approach , 2017 .

[5]  Giuseppe Savaré,et al.  Optimal Entropy-Transport problems and a new Hellinger–Kantorovich distance between positive measures , 2015, 1508.07941.

[6]  Stanley Osher,et al.  Unbalanced and Partial $$L_1$$L1 Monge–Kantorovich Problem: A Scalable Parallel First-Order Method , 2018, J. Sci. Comput..

[7]  Xiaowei Zhou,et al.  Moving Object Detection by Detecting Contiguous Outliers in the Low-Rank Representation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[9]  Gabriel Peyré,et al.  Entropic Approximation of Wasserstein Gradient Flows , 2015, SIAM J. Imaging Sci..

[10]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[11]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[12]  Christopher J. Rozell,et al.  Sparse Dynamic Filtering via Earth Mover's Distance Regularization , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[13]  Georgios B. Giannakis,et al.  Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints , 2011, IEEE Transactions on Signal Processing.

[14]  Christopher J. Rozell,et al.  Earth Mover's Distance as a Dynamics Regularizer for Sparse Signal Tracking , 2018 .

[15]  Xiaodong Li,et al.  Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.

[16]  Aswin C. Sankaranarayanan,et al.  SpaRCS: Recovering low-rank and sparse matrices from compressive measurements , 2011, NIPS.

[17]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[18]  Marco Cuturi,et al.  Wasserstein regularization for sparse multi-task regression , 2018, AISTATS.

[19]  William C. Davidon,et al.  Variable Metric Method for Minimization , 1959, SIAM J. Optim..

[20]  Marco Cuturi,et al.  Sinkhorn Distances: Lightspeed Computation of Optimal Transport , 2013, NIPS.

[21]  Gabriel Peyré,et al.  Computational Optimal Transport , 2018, Found. Trends Mach. Learn..

[22]  El-hadi Zahzah,et al.  Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing , 2016 .

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

[24]  Gabriel Peyré,et al.  Convolutional wasserstein distances , 2015, ACM Trans. Graph..

[25]  Wotao Yin,et al.  A Parallel Method for Earth Mover’s Distance , 2018, J. Sci. Comput..

[26]  John Wright,et al.  Compressive principal component pursuit , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[27]  José M. Bioucas-Dias,et al.  Fast Image Recovery Using Variable Splitting and Constrained Optimization , 2009, IEEE Transactions on Image Processing.

[28]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[29]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[30]  José M. Bioucas-Dias,et al.  An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems , 2009, IEEE Transactions on Image Processing.

[31]  Jonathan Eckstein.  Splitting methods for monotone operators with applications to parallel optimization , 1989 .

[32]  D. Kinderlehrer,et al.  THE VARIATIONAL FORMULATION OF THE FOKKER-PLANCK EQUATION , 1996 .

[33]  Stanley Osher,et al.  Unnormalized optimal transport , 2019, J. Comput. Phys..

[34]  E. Mainini.  A description of transport cost for signed measures , 2012 .

[35]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[36]  Christophe Andrieu,et al.  Bayesian sequential compressed sensing in sparse dynamical systems , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[37]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[38]  Karl-Theodor Sturm,et al.  Heat flow with Dirichlet boundary conditions via optimal transport and gluing of metric measure spaces , 2018, Calculus of Variations and Partial Differential Equations.

[39]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[40]  Arthur Cayley,et al.  The Collected Mathematical Papers: On Monge's “Mémoire sur la théorie des déblais et des remblais” , 2009 .

[41]  L. Kantorovich.  On a Problem of Monge , 2006 .

[42]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[43]  Namrata Vaswani,et al.  LS-CS-Residual (LS-CS): Compressive Sensing on Least Squares Residual , 2009, IEEE Transactions on Signal Processing.

[44]  Christopher J. Rozell,et al.  Dynamic Filtering of Time-Varying Sparse Signals via $\ell _1$ Minimization , 2015, IEEE Transactions on Signal Processing.

[45]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

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

[47]  A. Figalli.  The Optimal Partial Transport Problem , 2010 .

[48]  Johan Karlsson,et al.  Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport , 2016, SIAM J. Imaging Sci..

[49]  M. Salman Asif,et al.  Dynamic Updating for ` 1 Minimization , 2009 .

[50]  Christopher J. Rozell,et al.  Earth-Mover's distance as a tracking regularizer , 2017, 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

[51]  R. McCann,et al.  Free boundaries in optimal transport and Monge-Ampere obstacle problems , 2010 .

[52]  Lénaïc Chizat,et al.  Scaling Algorithms for Unbalanced Transport Problems , 2016, 1607.05816.