{"id":"https://openalex.org/W2970355697","doi":null,"title":"muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking","display_name":"muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2970355697","mag":"2970355697"},"language":"en","primary_location":{"id":"mag:2970355697","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/2019/file/b1d10e7bafa4421218a51b1e1f1b0ba2-Paper.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075854295","display_name":"Congchao Wang","orcid":"https://orcid.org/0000-0002-1318-7180","observed_orcids":["https://orcid.org/0000-0002-1318-7180"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Congchao Wang","raw_affiliation_strings":["Virginia Tech, Blacksburg, United States"],"raw_orcid":"https://orcid.org/0000-0002-1318-7180","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, United States","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101969070","display_name":"Yizhi Wang","orcid":"https://orcid.org/0000-0001-8704-8290","observed_orcids":["https://orcid.org/0000-0001-8704-8290","https://orcid.org/0000-0001-6764-6234"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yizhi Wang","raw_affiliation_strings":["Virginia Tech, Blacksburg, United States"],"raw_orcid":"https://orcid.org/0000-0001-8704-8290","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, United States","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040372961","display_name":"Yinxue Wang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinxue Wang","raw_affiliation_strings":["Virginia Tech, Blacksburg, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, United States","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101646961","display_name":"Chiung-Ting Wu","orcid":"https://orcid.org/0000-0002-0493-2812","observed_orcids":["https://orcid.org/0000-0002-0493-2812"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chiung-Ting Wu","raw_affiliation_strings":["Virginia Tech, Blacksburg, United States"],"raw_orcid":"https://orcid.org/0000-0002-0493-2812","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, United States","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":null,"display_name":"Guoqiang Yu","orcid":"https://orcid.org/0000-0002-6743-7413","observed_orcids":["https://orcid.org/0000-0002-6743-7413"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoqiang Yu","raw_affiliation_strings":["Virginia Tech, Blacksburg, United States"],"raw_orcid":"https://orcid.org/0000-0002-6743-7413","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, United States","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.2995,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.81255647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":"32","issue":null,"first_page":"423","last_page":"432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9556000232696533,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9556000232696533,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.010900000110268593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.824999988079071},{"id":"https://openalex.org/keywords/multi-object-tracking","display_name":"multi-target tracking","score":0.9919999837875366},{"id":"https://openalex.org/keywords/data-association","display_name":"data association","score":0.7860000133514404},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.8180000185966492},{"id":"https://openalex.org/keywords/exact-optimal-solution","display_name":"exact optimal solution","score":0.7089999914169312},{"id":"https://openalex.org/keywords/graph-design","display_name":"graph design","score":0.42800000309944153}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6750100255012512},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6360235214233398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6315497159957886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608561635017395},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.5541773438453674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5255899429321289},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49817609786987305},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.48961788415908813},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.43878471851348877},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.396365225315094},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.37951022386550903},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27853137254714966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2573048174381256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17154258489608765},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09845587611198425}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2970355697","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/2019/file/b1d10e7bafa4421218a51b1e1f1b0ba2-Paper.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Neural Information Processing Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3088258746","https://openalex.org/W2989348894","https://openalex.org/W7095845054","https://openalex.org/W2913012045","https://openalex.org/W2597686627","https://openalex.org/W1863704471","https://openalex.org/W44380796","https://openalex.org/W2951115265","https://openalex.org/W2111644456","https://openalex.org/W2793584327"],"abstract_inverted_index":{"Min-cost":[0],"flow":[1,24,38,76],"has":[2],"been":[3],"a":[4,110],"widely":[5],"used":[6],"paradigm":[7],"for":[8],"solving":[9,22],"data":[10],"association":[11],"problems":[12,25],"in":[13,26,68,121],"multi-object":[14],"tracking":[15],"(MOT).":[16],"However,":[17],"most":[18,119],"existing":[19],"methods":[20],"of":[21,35,52,64,112,152],"min-cost":[23,37,75],"MOT":[27,69,102],"are":[28],"either":[29],"direct":[30],"adoption":[31],"or":[32],"slight":[33],"modifications":[34],"generic":[36],"algorithms,":[39],"yielding":[40],"sub-optimal":[41],"computation":[42],"efficiency":[43,96,132],"and":[44,62,92,109,144],"holding":[45],"the":[46,59,65,118,126,131,140,153],"applications":[47],"back":[48],"from":[49],"larger":[50],"scale":[51],"problems.":[53],"In":[54],"this":[55],"paper,":[56],"by":[57,133],"exploiting":[58],"special":[60],"structures":[61],"properties":[63],"graphs":[66],"formulated":[67],"problems,":[70],"we":[71,93],"develop":[72],"an":[73],"efficient":[74,120],"algorithm,":[77],"namely,":[78],"minimum-update":[79],"Successive":[80],"Shortest":[81],"Path":[82],"(muSSP).":[83],"muSSP":[84,115],"is":[85,116],"proved":[86],"to":[87,125,135,139,147,150],"provide":[88],"exact":[89],"optimal":[90],"solution":[91],"demonstrated":[94],"its":[95],"through":[97],"40":[98],"experiments":[99],"on":[100],"five":[101],"datasets":[103],"with":[104],"various":[105],"object":[106],"detection":[107],"results":[108],"number":[111],"graph":[113],"designs.":[114],"always":[117],"each":[122,151],"experiment":[123],"compared":[124],"three":[127,154],"peer":[128,155],"solvers,":[129],"improving":[130],"5":[134],"337":[136],"folds":[137,149],"relative":[138],"best":[141],"competing":[142],"algorithm":[143],"averagely":[145],"109":[146],"4089":[148],"methods.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2019-09-05T00:00:00"}