The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Optimal Mass Transport: Signal processing and machine-learning applications
Open accessAbstract
Transport-based techniques for signal and data analysis have received increased attention recently. Given their ability to provide accurate generative models for signal intensities and other data distributions, they have been used in a variety of applications including content-based retrieval, cancer detection, image super-resolution, and statistical machine learning, to name a few, and shown to produce state of the art results in several applications. Moreover, the geometric characteristics of transport-related metrics have inspired new kinds of algorithms for interpreting the meaning of data distributions. Here we provide a practical overview of the mathematical underpinnings of mass transport-related methods, including numerical implementation, as well as a review, with demonstrations, of several applications. Software accompanying this tutorial is available at [43].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Voxel-Based Morphometry—The Methods
Ashburner, J., & Friston, K. J. (2000) · NeuroImage · doi:10.1006/nimg.2000.0582 · Cited by 8,676
Cootes, T. F., Edwards, G. J., & Taylor, C. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927467 · Cited by 5,409
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
Sinkhorn Distances: Lightspeed Computation of Optimal TransportPreprint
Cuturi, M. (2013) · Cited by 2,385
Arjovsky, M., Chintala, S., & Bottou, L. (2017) · arXiv · doi:10.48550/arxiv.1701.07875 · Cited by 2,225
(2008) · doi:10.1007/978-3-7643-8722-8 · Cited by 2,220
Polar factorization and monotone rearrangement of vector‐valued functions
Brenier, Y. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440402 · Cited by 1,641
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Benamou, J.-D., & Brenier, Y. (2000) · Numerische Mathematik · doi:10.1007/s002110050002 · Cited by 1,609
Deming, W. E., & Stephan, F. F. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731829 · Cited by 1,537
THE GEOMETRY OF DISSIPATIVE EVOLUTION EQUATIONS: THE POROUS MEDIUM EQUATION
Otto, F. (2001) · Communications in Partial Differential Equations · doi:10.1081/pde-100002243 · Cited by 1,490
Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling
Santambrogio, F. (2015) · Progress in Nonlinear Differential Equations and Their Applications · doi:10.1007/978-3-319-20828-2 · Cited by 1,339
Optimal Transport for Domain Adaptation
Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2615921 · Cited by 989
The geometry of optimal transportation
Gangbo, W., & McCann, R. J. (1996) · Acta Mathematica · doi:10.1007/bf02392620 · Cited by 813
Iterative Bregman Projections for Regularized Transportation Problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/141000439 · Cited by 672
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Sliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
The regularity of mappings with a convex potential
Caffarelli, L. A. (1992) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1992-1124980-8 · Cited by 397
Learning with a Wasserstein Loss
Frogner, C., Zhang, C., Mobahi, H., Araya‐Polo, M., & Poggio, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05439 · Cited by 337
Bayesian inference with optimal maps
El Moselhy, T. A., & Marzouk, Y. M. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.07.022 · Cited by 267
Wang, W., Slepčev, D., Basu, S., Ozolek, J. A., & Rohde, G. K. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-012-0566-z · Cited by 177
Self-citationDomain Adaptation with Regularized Optimal Transport
Courty, N., Flamary, R., & Tuia, D. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44848-9_18 · Cited by 175
Minimizing Flows for the Monge--Kantorovich Problem
Angenent, S., Haker, S. J., & Tannenbaum, A. (2003) · SIAM Journal on Mathematical Analysis · doi:10.1137/s0036141002410927 · Cited by 158
Sliced Wasserstein Kernels for Probability Distributions
Kolouri, S., Zou, Y., & Rohde, G. K. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.568 · Cited by 143
Self-citationTests of goodness of fit based on the $L_2$-Wasserstein distance
Cuesta-Albertos, J. A., Matrán, C., Rodríguez-Rodríguez, J. M., & del Barrio, E. (1999) · The Annals of Statistics · doi:10.1214/aos/1017938923 · Cited by 129
The Radon Cumulative Distribution Transform and Its Application to Image Classification
Kolouri, S., Park, S. R., & Rohde, G. K. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2509419 · Cited by 94
Self-citationTransport-based single frame super resolution of very low resolution face images
Kolouri, S., & Rohde, G. K. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7299121 · Cited by 93
Self-citationA Novel Earth Mover's Distance Methodology for Image Matching with Gaussian Mixture Models
Li, P., Wang, Q., & Zhang, L. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.212 · Cited by 89
Basu, S., Kolouri, S., & Rohde, G. K. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1319779111 · Cited by 85
Self-citationWasserstein Propagation for Semi-Supervised Learning
Solomon, J., Rustamov, R. M., Guibas, L. J., & Butscher, A. (2014) · Cited by 84
A Sparse Multiscale Algorithm for Dense Optimal Transport
Schmitzer, B. (2016) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-016-0653-9 · Cited by 76
Adaptive color transfer with relaxed optimal transport
Rabin, J., Ferradans, S., & Papadakis, N. (2014) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2014.7025983 · Cited by 74
Accurate diagnosis of thyroid follicular lesions from nuclear morphology using supervised learning
Ozolek, J. A., Tosun, A. B., Wang, W., Chen, C., Kolouri, S., Basu, S., Huang, H., & Rohde, G. K. (2014) · Medical Image Analysis · doi:10.1016/j.media.2014.04.004 · Cited by 72
Self-citationA continuous linear optimal transport approach for pattern analysis in image datasets
Kolouri, S., Tosun, A. B., Ozolek, J. A., & Rohde, G. K. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2015.09.019 · Cited by 69
Self-citationThe cumulative distribution transform and linear pattern classification
Park, S. R., Kolouri, S., Kundu, S., & Rohde, G. K. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2017.02.002 · Cited by 62
Self-citationStatic and Dynamic Texture Mixing Using Optimal Transport
Ferradans, S., Xia, G.-S., Gabriel Peyré, A., & Aujol, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38267-3_12 · Cited by 17
Wasserstein Training of Boltzmann MachinesPreprint
Montavon, G., Müller, K., & Cuturi, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.01972 · Cited by 12
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Zio, E. (2022) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2021.108119 · Cited by 714
Inferring spatial and signaling relationships between cells from single cell transcriptomic data
Cang, Z., & Nie, Q. (2020) · Nature Communications · doi:10.1038/s41467-020-15968-5 · Cited by 400
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Morphological Prototyping for Unsupervised Slide Representation Learning in Computational Pathology
Song, A. H., Chen, R. J., Ding, T., Williamson, D. F. K., Jaume, G., & Mahmood, F. (2024) · 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52733.2024.01099 · Cited by 79
Metadata
- Authors
- Kolouri, S., Park, S. R., Thorpe, M., Slepcev, D., & Rohde, G. K.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2017-07
- Volume
- 34
- Issue
- 4
- Pages
- 43-59
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2735418187
- Cited by
- 443
- References
- 37
- FWCI
- 44.85
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.