{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T13:33:36Z","timestamp":1781271216425,"version":"3.54.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T00:00:00Z","timestamp":1437955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2015,7,27]]},"abstract":"<jats:p>This paper introduces a new class of algorithms for optimization problems involving optimal transportation over geometric domains. Our main contribution is to show that optimal transportation can be made tractable over large domains used in graphics, such as images and triangle meshes, improving performance by orders of magnitude compared to previous work. To this end, we approximate optimal transportation distances using entropic regularization. The resulting objective contains a geodesic distance-based kernel that can be approximated with the heat kernel. This approach leads to simple iterative numerical schemes with linear convergence, in which each iteration only requires Gaussian convolution or the solution of a sparse, pre-factored linear system. We demonstrate the versatility and efficiency of our method on tasks including reflectance interpolation, color transfer, and geometry processing.<\/jats:p>","DOI":"10.1145\/2766963","type":"journal-article","created":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T12:26:38Z","timestamp":1438086398000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":341,"title":["Convolutional wasserstein distances"],"prefix":"10.1145","volume":"34","author":[{"given":"Justin","family":"Solomon","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fernando","family":"de Goes","sequence":"additional","affiliation":[{"name":"Pixar Animation Studios"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriel","family":"Peyr\u00e9","sequence":"additional","affiliation":[{"name":"CNRS &amp; Univ. Paris-Dauphine"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Cuturi","sequence":"additional","affiliation":[{"name":"Kyoto University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Butscher","sequence":"additional","affiliation":[{"name":"Autodesk, Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andy","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Du","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonidas","family":"Guibas","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/100805741"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2000.10487522"},{"key":"e_1_2_2_3_1","volume-title":"Proc. ICCV Workshops, 1626--1633","author":"Aubry M.","unstructured":"Aubry , M. , Schlickewei , U. , and Cremers , D . 2011. The wave kernel signature: A quantum mechanical approach to shape analysis . In Proc. ICCV Workshops, 1626--1633 . Aubry, M., Schlickewei, U., and Cremers, D. 2011. The wave kernel signature: A quantum mechanical approach to shape analysis. In Proc. ICCV Workshops, 1626--1633."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050002"},{"key":"e_1_2_2_5_1","article-title":"Iterative Bregman projections for regularized transportation problems. SIAM","author":"Benamou J.-D.","year":"2015","unstructured":"Benamou , J.-D. , Carlier , G. , Cuturi , M. , Nenna , L. , and Peyr\u00e9 , G. 2015 . Iterative Bregman projections for regularized transportation problems. SIAM J. Sci. Comp., to appear. Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., and Peyr\u00e9, G. 2015. Iterative Bregman projections for regularized transportation problems. SIAM J. Sci. Comp., to appear.","journal-title":"J. Sci. Comp., to appear."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/563858.563893"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024192"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-014-0506-3"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Burkard R. Dell'Amico M. and Martello S. 2009. Assignment Problems. SIAM.   Burkard R. Dell'Amico M. and Martello S. 2009. Assignment Problems. SIAM.","DOI":"10.1137\/1.9780898717754"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Carlier G. Oberman A. and Oudet E. 2014. Numerical methods for matching for teams and Wasserstein barycenters. Preprint Ceremade.  Carlier G. Oberman A. and Oudet E. 2014. Numerical methods for matching for teams and Wasserstein barycenters. Preprint Ceremade.","DOI":"10.1051\/m2an\/2015033"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Cover T. and Thomas J. 2006. Elements of Information Theory. Wiley.   Cover T. and Thomas J. 2006. Elements of Information Theory. Wiley.","DOI":"10.1002\/047174882X"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516971.2516977"},{"key":"e_1_2_2_15_1","volume-title":"Proc. ICML","volume":"32","author":"Cuturi M.","unstructured":"Cuturi , M. , and Doucet , A . 2014. Fast computation of Wasserstein barycenters . In Proc. ICML , vol. 32 . Cuturi, M., and Doucet, A. 2014. Fast computation of Wasserstein barycenters. In Proc. ICML, vol. 32."},{"key":"e_1_2_2_16_1","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transportation","volume":"26","author":"Cuturi M.","year":"2013","unstructured":"Cuturi , M. 2013 . Sinkhorn distances: Lightspeed computation of optimal transportation . In Proc. NIPS , vol. 26. 2292 -- 2300 . Cuturi, M. 2013. Sinkhorn distances: Lightspeed computation of optimal transportation. In Proc. NIPS, vol. 26. 2292--2300.","journal-title":"Proc. NIPS"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Davis T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM.   Davis T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM.","DOI":"10.1137\/1.9780898718881"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02033.x"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366190"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602143"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.860328"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731829"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311576"},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Escalante R. and Raydan M. 2011. Alternating Projection Methods. Fundamentals of Algorithms. SIAM.   Escalante R. and Raydan M. 2011. Alternating Projection Methods. Fundamentals of Algorithms. SIAM.","DOI":"10.1137\/9781611971941"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929886"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Franklin J. and Lorenz J. 1989. On the scaling of multidimensional matrices. Linear Algebra and its Applications 114 717--735.  Franklin J. and Lorenz J. 1989. On the scaling of multidimensional matrices. Linear Algebra and its Applications 114 717--735.","DOI":"10.1016\/0024-3795(89)90490-4"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073229"},{"key":"e_1_2_2_30_1","first-page":"227","article-title":"On the transfer of masses (in Russian)","volume":"37","author":"Kantorovich L.","year":"1942","unstructured":"Kantorovich , L. 1942 . On the transfer of masses (in Russian) . Doklady Akademii Nauk 37 , 2, 227 -- 229 . Kantorovich, L. 1942. On the transfer of masses (in Russian). Doklady Akademii Nauk 37, 2, 227--229.","journal-title":"Doklady Akademii Nauk"},{"key":"e_1_2_2_31_1","unstructured":"Kim Y.-H. and Pass B. 2013. Multi-marginal optimal transport on Riemannian manifolds. arXiv:1303.6251.  Kim Y.-H. and Pass B. 2013. Multi-marginal optimal transport on Riemannian manifolds. arXiv:1303.6251."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/060659624"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2011.11.026"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2011.01.020"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.4310\/jdg\/1214459221"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1997.1634"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02032.x"},{"key":"e_1_2_2_39_1","unstructured":"Mosek ApS 2014. Mosek version 7. https:\/\/mosek.com.  Mosek ApS 2014. Mosek version 7. https:\/\/mosek.com."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2095869"},{"key":"e_1_2_2_41_1","unstructured":"Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation. Morgan Kaufmann July.   Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation. Morgan Kaufmann July."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2006.11.011"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601200"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.2307\/2314570"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03167.x"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12186"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601175"},{"key":"e_1_2_2_50_1","volume-title":"Proc. ICML, 306--314","author":"Solomon J.","unstructured":"Solomon , J. , Rustamov , R. , Leonidas , G. , and Butscher , A . 2014. Wasserstein propagation for semi-supervised learning . In Proc. ICML, 306--314 . Solomon, J., Rustamov, R., Leonidas, G., and Butscher, A. 2014. Wasserstein propagation for semi-supervised learning. In Proc. ICML, 306--314."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160200210"},{"key":"e_1_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Villani C. 2003. Topics in Optimal Transportation. Graduate Studies in Mathematics. AMS.  Villani C. 2003. Topics in Optimal Transportation. Graduate Studies in Mathematics. AMS.","DOI":"10.1090\/gsm\/058"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.135"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601145"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2766963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2766963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:01Z","timestamp":1750225381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2766963"}},"subtitle":["efficient optimal transportation on geometric domains"],"short-title":[],"issued":{"date-parts":[[2015,7,27]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7,27]]}},"alternative-id":["10.1145\/2766963"],"URL":"https:\/\/doi.org\/10.1145\/2766963","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,27]]},"assertion":[{"value":"2015-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}