{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:58:05Z","timestamp":1761631085803,"version":"3.41.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Wallenberg AI, Autonomous Systems and Software Program"},{"name":"Knut and Alice Wallenberg Foundation, Sweden"},{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"crossref","award":["2020-03454"],"award-info":[{"award-number":["2020-03454"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100030798","name":"Digital Futures","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100030798","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/lcsys.2025.3573880","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T18:08:57Z","timestamp":1748282937000},"page":"498-503","source":"Crossref","is-referenced-by-count":1,"title":["Fast Computation of the TGOSPA Metric for Multiple Target Tracking via Unbalanced Optimal Transport"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2111-2004","authenticated-orcid":false,"given":"Viktor","family":"Nevelius Wernholm","sequence":"first","affiliation":[{"name":"Saab Surveillance, Saab AB, Gothenburg, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3105-1270","authenticated-orcid":false,"given":"Alfred","family":"W\u00e4rns\u00e4ter","sequence":"additional","affiliation":[{"name":"Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9778-1426","authenticated-orcid":false,"given":"Axel","family":"Ringh","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01868-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-022-01126-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MAES.2004.1263228"},{"volume-title":"Design and Analysis of Modern Tracking Systems","year":"1999","author":"Blackman","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref7","article-title":"Sinkhorn distances: Lightspeed computation of optimal transportation distances","volume-title":"Advances in Neural Information Processing Systems","author":"Cuturi","year":"2013"},{"key":"ref8","first-page":"9147","article-title":"On the complexity of the optimal transport problem with graph-structured cost","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Fan"},{"volume-title":"Coin-or\/Clp: Release\/1.17.9","year":"2023","author":"Forrest","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JOE.1983.1145560"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3005309"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/FUSION49465.2021.9626977"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2010009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/20M1320195"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.0148"},{"key":"ref16","article-title":"TGOSPA metric parameters selection and evaluation for visual multi-object tracking","author":"Krejc\u00ed","year":"2024","journal-title":"arXiv:2412.08321"},{"issue":"65","key":"ref17","first-page":"1","article-title":"On the complexity of approximating multimarginal optimal transport","volume":"23","author":"Lin","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939948"},{"article-title":"Efficient evaluation of target tracking using entropic optimal transport","year":"2024","author":"Wernholm","key":"ref19"},{"volume-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1982","author":"Papadimitriou","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.23919\/ICIF.2017.8009645"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/23M1571587"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/16M1106018"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/10939047\/11015915.pdf?arnumber=11015915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:41:32Z","timestamp":1750268492000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11015915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2025.3573880","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2025]]}}}