{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T19:00:59Z","timestamp":1769540459019,"version":"3.49.0"},"reference-count":76,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ASCENT"},{"name":"Semiconductor Research Corporation (SRC) Program"},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SUPREME"},{"name":"Semiconductor Research Corporation (SRC) Program"},{"name":"NSF","award":["CCF-2212239"],"award-info":[{"award-number":["CCF-2212239"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tmm.2025.3623529","type":"journal-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:57:06Z","timestamp":1760983026000},"page":"227-240","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Approximation of Earth Mover\u2019s Distance Based on Nearest Neighbor Search"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4825-6542","authenticated-orcid":false,"given":"Guangyu","family":"Meng","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3586-0935","authenticated-orcid":false,"given":"Ruyu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3307-1596","authenticated-orcid":false,"given":"Liu","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peixian","family":"Liang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3028-5927","authenticated-orcid":false,"given":"Fang","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6565-2884","authenticated-orcid":false,"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7776-4306","authenticated-orcid":false,"given":"Michael","family":"Niemier","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6636-9738","authenticated-orcid":false,"given":"Xiaobo Sharon","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1998.710701"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","volume":"338","author":"Villani","year":"2009"},{"key":"ref3","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Arjovsky","year":"2017"},{"key":"ref4","article-title":"Generative modeling with optimal transport maps","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rout","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58621-8_32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108911"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2025.102190"},{"key":"ref8","first-page":"957","article-title":"From word embeddings to document distances","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kusner","year":"2015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/d18-1482"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1058"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref12","first-page":"12191","article-title":"Screening Sinkhorn algorithm for regularized optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Alaya","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.21236\/ada594171"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587662"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6827"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2018.00095"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/437"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref19","first-page":"497","article-title":"Scalable nearest neighbor search for optimal transport","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Backurs","year":"2020"},{"key":"ref20","first-page":"12304","article-title":"Tree-sliced variants of Wasserstein distances","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Le","year":"2019"},{"key":"ref21","first-page":"10336","article-title":"Diffusion Earth Movers Distance and distribution embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tong","year":"2021"},{"key":"ref22","first-page":"9844","article-title":"Sobolev transport: A scalable metric for probability measures with graph metrics","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Le","year":"2022"},{"key":"ref23","article-title":"Hierarchical sliced Wasserstein distance","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Nguyen","year":"2023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.01031"},{"key":"ref25","first-page":"364","article-title":"Linear-complexity data-parallel Earth Movers Distance approximations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Atasu","year":"2019"},{"key":"ref26","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. 27th Int. Conf. Neural Inf. Process. Syst.","author":"Cuturi","year":"2013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00060"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-014-0506-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(84)90035-5"},{"key":"ref30","first-page":"29088","article-title":"Density-aware Chamfer distance as a comprehensive metric for point cloud completion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Wu","year":"2021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01342"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP55844.2023.10285995"},{"key":"ref34","first-page":"2454","article-title":"Statistical optimal transport via factored couplings","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Forrow","year":"2019"},{"key":"ref35","first-page":"9344","article-title":"Low-rank Sinkhorn factorization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Scetbon","year":"2021"},{"issue":"1","key":"ref36","first-page":"204","article-title":"A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread","volume":"13","author":"Fox","year":"2022","journal-title":"J. Comput. Geometry"},{"key":"ref37","first-page":"7:1","article-title":"Faster algorithms for the geometric transportation problem","volume-title":"Proc. 33rd Int. Symp. Comput. Geometry","author":"Agarwal","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.29"},{"issue":"1","key":"ref39","first-page":"3571","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25087-8_25"},{"key":"ref41","article-title":"Accelerating 3D deep learning with PyTorch3D","author":"Ravi","year":"2020","journal-title":"SIGGRAPH Asia Courses"},{"key":"ref42","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587635"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10235"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2883860"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2639065"},{"key":"ref50","first-page":"1532","article-title":"GloVe: Global vectors for word representation","volume-title":"Proc. Empirical Methods Natural Lang. Process.","author":"Pennington","year":"2014"},{"key":"ref51","article-title":"An image is worth 16x16 words: Transformers for image recognition at scale","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Dosovitskiy","year":"2021"},{"key":"ref52","first-page":"1","article-title":"Efficient estimation of word representations in vector space","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mikolov","year":"2013"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.36548\/jiip.2021.2.003"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.133"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"},{"key":"ref56","article-title":"An overview of color transfer and style transfer for images and videos","author":"Liu","year":"2022"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/38.946629"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2792050"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1049\/ipr2.12433"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/130929886"},{"key":"ref61","first-page":"880","article-title":"Smooth and sparse optimal transport","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Blondel","year":"2018"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2019.02.002"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.740"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-020-01921-6"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00785"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1049\/el:20080522"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1292216"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2109730"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14388"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/IC3D53758.2021.9687162"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982201"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2214050"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2227726"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/3626495.3626509"},{"key":"ref75","article-title":"Benchmarking neural network robustness to common corruptions and perturbations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hendrycks","year":"2019"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539861"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6046\/11342315\/11208595-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6046\/11342315\/11208595.pdf?arnumber=11208595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T05:56:47Z","timestamp":1769493407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11208595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":76,"URL":"https:\/\/doi.org\/10.1109\/tmm.2025.3623529","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}