{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:00:33Z","timestamp":1773414033640,"version":"3.50.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["279593"],"award-info":[{"award-number":["279593"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26700002"],"award-info":[{"award-number":["26700002"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2016,7,11]]},"abstract":"<jats:p>This article defines a new way to perform intuitive and geometrically faithful regressions on histogram-valued data. It leverages the theory of optimal transport, and in particular the definition of Wasserstein barycenters, to introduce for the first time the notion of barycentric coordinates for histograms. These coordinates take into account the underlying geometry of the ground space on which the histograms are defined, and are thus particularly meaningful for applications in graphics to shapes, color or material modification. Beside this abstract construction, we propose a fast numerical optimization scheme to solve this backward problem (finding the barycentric coordinates of a given histogram) with a low computational overhead with respect to the forward problem (computing the barycenter). This scheme relies on a backward algorithmic differentiation of the Sinkhorn algorithm which is used to optimize the entropic regularization of Wasserstein barycenters. We showcase an illustrative set of applications of these Wasserstein coordinates to various problems in computer graphics: shape approximation, BRDF acquisition and color editing.<\/jats:p>","DOI":"10.1145\/2897824.2925918","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T16:04:33Z","timestamp":1468253073000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":89,"title":["Wasserstein barycentric coordinates"],"prefix":"10.1145","volume":"35","author":[{"given":"Nicolas","family":"Bonneel","sequence":"first","affiliation":[{"name":"Univ. Lyon, CNRS and LIRIS"}]},{"given":"Gabriel","family":"Peyr\u00e9","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris-Dauphine"}]},{"given":"Marco","family":"Cuturi","sequence":"additional","affiliation":[{"name":"Kyoto University"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"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.1007\/s002110050002"},{"key":"e_1_2_2_3_1","first-page":"37","article-title":"Iterative Bregman projections for regularized transportation problems","volume":"2","author":"Benamou J.-D.","year":"2015","unstructured":"Benamou , J.-D. , Carlier , G. , Cuturi , M. , Nenna , M. , and Peyr\u00e9 , G. 2015 . Iterative Bregman projections for regularized transportation problems . SIAM J. on Sci. Computing 2 , 37 . Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, M., and Peyr\u00e9, G. 2015. Iterative Bregman projections for regularized transportation problems. SIAM J. on Sci. Computing 2, 37.","journal-title":"SIAM J. on Sci. Computing"},{"key":"e_1_2_2_4_1","unstructured":"Bigot J. and Klein T. 2012. Consistent estimation of a population barycenter in the Wasserstein space. Preprint arXiv:1212.2562.  Bigot J. and Klein T. 2012. Consistent estimation of a population barycenter in the Wasserstein space. Preprint arXiv:1212.2562 ."},{"key":"e_1_2_2_5_1","unstructured":"Bigot J. Gouet R. Klein T. and L\u00f3pez A. 2015. Geodesic PCA in the Wasserstein space by Convex PCA. Annales de l'Institut Henri Poincar\u00e9 B: Probability and Statistics.  Bigot J. Gouet R. Klein T. and L\u00f3pez A. 2015. Geodesic PCA in the Wasserstein space by Convex PCA. Annales de l'Institut Henri Poincar\u00e9 B: Probability and Statistics ."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024192"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461939"},{"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","volume-title":"Adv. in Neural Information Proc. Sys.","author":"Brand M.","unstructured":"Brand , M. , and Brand , M . 2003. Charting a manifold . In Adv. in Neural Information Proc. Sys. Brand, M., and Brand, M. 2003. Charting a manifold. In Adv. in Neural Information Proc. Sys."},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Bregman L. M. 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR computational mathematics and mathematical physics 7 3 200--217.  Bregman L. M. 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR computational mathematics and mathematical physics 7 3 200--217.","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Burkard R. Dell'Amico M. and Martello S. 2009. Assignment Problems. Society for Industrial and App. Math.   Burkard R. Dell'Amico M. and Martello S. 2009. Assignment Problems. Society for Industrial and App. Math.","DOI":"10.1137\/1.9780898717754"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531379"},{"key":"e_1_2_2_13_1","volume-title":"Int. Conf. on Machine Learning (ICML).","author":"Cuturi M.","unstructured":"Cuturi , M. , and Doucet , A . 2014. Fast computation of Wasserstein barycenters . In Int. Conf. on Machine Learning (ICML). Cuturi, M., and Doucet, A. 2014. Fast computation of Wasserstein barycenters. In Int. Conf. on Machine Learning (ICML)."},{"key":"e_1_2_2_14_1","volume-title":"Adv. in Neural Information Proc. Sys.","author":"Cuturi M.","year":"2013","unstructured":"Cuturi , M. 2013 . Sinkhorn distances: Lightspeed computation of optimal transport . In Adv. in Neural Information Proc. Sys. Cuturi, M. 2013. Sinkhorn distances: Lightspeed computation of optimal transport. In Adv. in Neural Information Proc. Sys."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731829"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12477"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000036836.66311.97"},{"key":"e_1_2_2_18_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_19_1","doi-asserted-by":"crossref","unstructured":"Lewis A. S. and Overton M. L. 2013. Nonsmooth optimization via quasi-newton methods. Math. Programming 141.  Lewis A. S. and Overton M. L. 2013. Nonsmooth optimization via quasi-newton methods. Math. Programming 141.","DOI":"10.1007\/s10107-012-0514-2"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882343"},{"key":"e_1_2_2_21_1","first-page":"5","article-title":"A multiscale approach to optimal transport","volume":"30","author":"M\u00e9rigot Q.","year":"2011","unstructured":"M\u00e9rigot , Q. 2011 . A multiscale approach to optimal transport . Computer Graphics Forum (SGP) 30 , 5 . M\u00e9rigot, Q. 2011. A multiscale approach to optimal transport. Computer Graphics Forum (SGP) 30, 5.","journal-title":"Computer Graphics Forum (SGP)"},{"key":"e_1_2_2_22_1","unstructured":"Monge G. 1781. M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l'Acad\u00e9mie Royale des Sciences 666--704.  Monge G. 1781. M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l'Acad\u00e9mie Royale des Sciences 666--704."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/080743627"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2006.11.011"},{"key":"e_1_2_2_25_1","volume-title":"Proc. SSVM'15","author":"Rabin J.","unstructured":"Rabin , J. , and Papadakis , N . 2015. Convex color image segmentation with optimal transport distances . In Proc. SSVM'15 . Rabin, J., and Papadakis, N. 2015. Convex color image segmentation with optimal transport distances. In Proc. SSVM'15."},{"key":"e_1_2_2_26_1","volume-title":"IEEE International Conference on Image Processing (ICIP).","author":"Rabin J.","unstructured":"Rabin , J. , Delon , J. , and Gousseau , Y . 2010. Regularization of transportation maps for color and contrast transfer . In IEEE International Conference on Image Processing (ICIP). Rabin, J., Delon, J., and Gousseau, Y. 2010. Regularization of transportation maps for color and contrast transfer. In IEEE International Conference on Image Processing (ICIP)."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24785-9_37"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.946629"},{"key":"e_1_2_2_29_1","volume-title":"Proc. AISTATS'16","author":"Rolet A.","unstructured":"Rolet , A. , Cuturi , M. , and Peyr\u00e9 , G . 2016. Fast dictionary learning with a smoothed Wasserstein loss . In Proc. AISTATS'16 . Rolet, A., Cuturi, M., and Peyr\u00e9, G. 2016. Fast dictionary learning with a smoothed Wasserstein loss. In Proc. AISTATS'16."},{"key":"e_1_2_2_30_1","volume-title":"Computer Vision, 1998. Sixth International Conference on, 59--66","author":"Rubner Y.","unstructured":"Rubner , Y. , Tomasi , C. , and Guibas , L . 1998. A metric for distributions with applications to image databases . In Computer Vision, 1998. Sixth International Conference on, 59--66 . Rubner, Y., Tomasi, C., and Guibas, L. 1998. A metric for distributions with applications to image databases. In Computer Vision, 1998. Sixth International Conference on, 59--66."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_2_32_1","first-page":"29","article-title":"Barycentric coordinates on surfaces","volume":"5","author":"Rustamov R. M.","year":"2010","unstructured":"Rustamov , R. M. 2010 . Barycentric coordinates on surfaces . Computer Graphics Forum 5 , 29 . Rustamov, R. M. 2010. Barycentric coordinates on surfaces. Computer Graphics Forum 5, 29.","journal-title":"Computer Graphics Forum"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Sandler R. and Lindenbaum M. 2009. Nonnegative matrix factorization with earth mover's distance metric. In IEEE Computer Vision and Pattern Recognition (CVPR).  Sandler R. and Lindenbaum M. 2009. Nonnegative matrix factorization with earth mover's distance metric. In IEEE Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2009.5206834"},{"key":"e_1_2_2_34_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)","volume":"5","author":"Schmidt M. W.","unstructured":"Schmidt , M. W. , van den Berg , E. , Friedlander , M. P. , and Murphy , K. P . 2009. Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm . In International Conference on Artificial Intelligence and Statistics (AISTATS) , vol. 5 . Schmidt, M. W., van den Berg, E., Friedlander, M. P., and Murphy, K. P. 2009. Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm. In International Conference on Artificial Intelligence and Statistics (AISTATS), vol. 5."},{"key":"e_1_2_2_35_1","volume-title":"Adv. in Neural Information Proc. Sys.","author":"Seguy V.","unstructured":"Seguy , V. , and Cuturi , M . 2015. Principal geodesic analysis for probability measures under the optimal transport metric . In Adv. in Neural Information Proc. Sys. Seguy, V., and Cuturi, M. 2015. Principal geodesic analysis for probability measures under the optimal transport metric. In Adv. in Neural Information Proc. Sys."},{"key":"e_1_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Sinkhorn R. 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist. 35.  Sinkhorn R. 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist. 35 .","DOI":"10.1214\/aoms\/1177703591"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601175"},{"key":"e_1_2_2_38_1","volume-title":"Int. Conf. on Machine Learning (ICML).","author":"Solomon J.","unstructured":"Solomon , J. , Rustamov , R. , Guibas , L. , and Butscher , A . 2014. Wasserstein propagation for semi-supervised learning . In Int. Conf. on Machine Learning (ICML). Solomon, J., Rustamov, R., Guibas, L., and Butscher, A. 2014. Wasserstein propagation for semi-supervised learning. In Int. Conf. on Machine Learning (ICML)."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766963"},{"key":"e_1_2_2_40_1","volume-title":"International Conference on Artificial Intelligence and Statistics.","author":"Srivastava S.","unstructured":"Srivastava , S. , Cevher , V. , Tran-Dinh , Q. , and Dunson , D. B . 2015. Wasp: Scalable bayes via barycenters of subset posteriors . In International Conference on Artificial Intelligence and Statistics. Srivastava, S., Cevher, V., Tran-Dinh, Q., and Dunson, D. B. 2015. Wasp: Scalable bayes via barycenters of subset posteriors. In International Conference on Artificial Intelligence and Statistics."},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Villani C. 2003. Topics in optimal transportation. American Mathematical Soc.  Villani C. 2003. Topics in optimal transportation. American Mathematical Soc.","DOI":"10.1090\/gsm\/058"},{"key":"e_1_2_2_42_1","volume-title":"Optimal transport: old and new","author":"Villani C.","unstructured":"Villani , C. 2008. Optimal transport: old and new , vol. 338 . Villani, C. 2008. Optimal transport: old and new, vol. 338."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559755.1559760"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897824.2925918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:04Z","timestamp":1750222504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925918"}},"subtitle":["histogram regression using optimal transport"],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7,11]]}},"alternative-id":["10.1145\/2897824.2925918"],"URL":"https:\/\/doi.org\/10.1145\/2897824.2925918","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}