The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Sliced and Radon Wasserstein Barycenters of Measures
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Topics in Optimal Transportation
Villani, C. (2003) · Graduate Studies in Mathematics · doi:10.1090/gsm/058 · Cited by 4,412
A metric for distributions with applications to image databases
Rubner, Y., Tomasi, C., & Guibas, L. J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710701 · Cited by 1,726
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
Helgason, S. (1999) · Progress in Mathematics · doi:10.1007/978-1-4757-1463-0 · Cited by 1,166
(1978) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)x7141-5 · Cited by 1,123
Barycenters in the Wasserstein Space
Agueh, M., & Carlier, G. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100805741 · Cited by 749
The auction algorithm: A distributed relaxation method for the assignment problem
Bertsekas, D. P. (1988) · Annals of Operations Research · doi:10.1007/bf02186476 · Cited by 634
Wasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Self-citationFast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
N-dimensional probability density function transfer and its application to color transfer
Pitie, F., Kokaram, A. C., & Dahyot, R. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.166 · Cited by 331
Displacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · doi:10.1145/2024156.2024192 · Cited by 241
Self-citationOptimal Transport with Proximal Splitting
Papadakis, N., Peyré, G., & Oudet, E. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130920058 · Cited by 178
Self-citationDisplacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · ACM Transactions on Graphics · doi:10.1145/2070781.2024192 · Cited by 159
Self-citationTexture design using a simplicial complex of morphable textures
Matusik, W., Zwicker, M., & Durand, F. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073262 · Cited by 112
Galerne, B., Lagae, A., Lefèbvre, S., & George Drettakis, B. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185569 · Cited by 101
Movie and video scale-time equalization application to flicker reduction
Delon, J. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860328 · Cited by 71
A Framework for Discrete Integral Transformations II—The 2D Discrete Radon Transform
Averbuch, A. Z., Coifman, R. R., Donoho, D. L., Israeli, M., Shkolnisky, Y., & Sedelnikov, I. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/060650301 · Cited by 64
Removing Artefacts From Color and Contrast Modifications
Rabin, J., Delon, J., & Gousseau, Y. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2142318 · Cited by 42
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
Cited by
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
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Self-citationSliced Wasserstein Discrepancy for Unsupervised Domain Adaptation
Lee, C.-Y., Batra, T., Baig, M. H., & Ulbricht, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.01053 · Cited by 577
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
Self-citationOptimal Mass Transport: Signal processing and machine-learning applications
Kolouri, S., Park, S. R., Thorpe, M., Slepcev, D., & Rohde, G. K. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2695801 · Cited by 443
Metadata
- Authors
- Bonneel, N., Rabin, J., Peyré, G., & Pfister, H.
- Venue
- Journal of Mathematical Imaging and Vision
- Published
- 2014-04-08
- Volume
- 51
- Issue
- 1
- Pages
- 22-45
- ISSN
- 0924-9907 (ISSN-L)
- 1573-7683
- OpenAlex
- W2019106840
- Cited by
- 467
- References
- 20
- FWCI
- 28.15
- 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.