{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:02:03Z","timestamp":1774634523175,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01MH110504"],"award-info":[{"award-number":["R01MH110504"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1750931"],"award-info":[{"award-number":["1750931"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022,4,1]]},"DOI":"10.1109\/tpami.2020.3026257","type":"journal-article","created":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T20:51:42Z","timestamp":1600894302000},"page":"1888-1904","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Global MOT Under Minimum-Cost Circulation Framework"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1318-7180","authenticated-orcid":false,"given":"Congchao","family":"Wang","sequence":"first","affiliation":[{"name":"Bradley Department of Electrical and Computer Engineering, Virginia Tech, Arlington, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Bradley Department of Electrical and Computer Engineering, Virginia Tech, Arlington, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6743-7413","authenticated-orcid":false,"given":"Guoqiang","family":"Yu","sequence":"additional","affiliation":[{"name":"Bradley Department of Electrical and Computer Engineering, Virginia Tech, Arlington, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.312"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103448"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2577031"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.87"},{"key":"ref6","article-title":"Machine learning methods for solving assignment problems in multi-target tracking","author":"Emami","year":"2018"},{"key":"ref7","article-title":"A baseline for 3D multi-object tracking","author":"Xinshuo","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DICTA56598.2022.10034575"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.292"},{"key":"ref11","article-title":"Tracking the trackers: an analysis of the state of the art in multiple object tracking","author":"Leal-Taix\u00e9","year":"2017","journal-title":"arXiv:1704.02781"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.21"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587584"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.496"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-151683"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1117\/1.JEI.24.1.013009"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995604"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9776-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539792231179"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.0805"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299193"},{"key":"ref22","article-title":"Mot16: A benchmark for multi-object tracking","author":"Milan","year":"2016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2018.00192"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.002"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1979.1102177"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JOE.1983.1145560"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.347"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2505309"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298718"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2011.6130233"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.241"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2324292"},{"key":"ref33","article-title":"End-to-end learning deep CRF models for multi-object tracking","author":"Xiang","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.403"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126235"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2019.00105"},{"key":"ref37","first-page":"406","article-title":"Minimum cost flows in graphs with unit capacities","volume-title":"Proc. 32nd Int. Symp. Theor. Aspects Comput. Sci.","volume":"30","author":"Goldberg"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218x(94)90171-6"},{"key":"ref39","first-page":"157","article-title":"On implementing scaling push-relabel algorithms for the minimum-cost flow problem","author":"Goldberg","journal-title":"Network Flows and Matching"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248074"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2018.09.031"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587581"},{"key":"ref43","article-title":"CVPR19 tracking and detection challenge: How crowded can it get?","author":"Dendorfer","year":"2019"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2808"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.10"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3036"},{"key":"ref47","first-page":"1132","article-title":"Tracking objects with higher order interactions via delayed column generation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Wang"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-018-01147-z"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/PETS-WINTER.2009.5399556"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69568-4_1"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/34\/9729045\/9204816-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9729045\/09204816.pdf?arnumber=9204816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:13:24Z","timestamp":1704842004000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9204816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":50,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3026257","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]}}}