{"id":"https://openalex.org/W2016135469","doi":"https://doi.org/10.1109/cvpr.2011.5995604","title":"Globally-optimal greedy algorithms for tracking a variable number of objects","display_name":"Globally-optimal greedy algorithms for tracking a variable number of objects","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2016135469","doi":"https://doi.org/10.1109/cvpr.2011.5995604","mag":"2016135469"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2011.5995604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CVPR 2011","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5031860916","display_name":"Hamed Pirsiavash","orcid":"https://orcid.org/0000-0002-2528-3305"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hamed Pirsiavash","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, USA","Department of Computer Science, University of California - Irvine"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California - Irvine","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004353237","display_name":"Deva Ramanan","orcid":"https://orcid.org/0009-0008-9180-8983"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deva Ramanan","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, USA","Department of Computer Science, University of California - Irvine"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California - Irvine","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044978076","display_name":"Charless C. Fowlkes","orcid":"https://orcid.org/0000-0002-2990-1780"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charless C. Fowlkes","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, USA","Department of Computer Science, University of California - Irvine"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California - Irvine","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031860916"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":29.8211,"has_fulltext":false,"cited_by_count":802,"citation_normalized_percentile":{"value":0.99800008,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1201","last_page":"1208"},"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.9998999834060669,"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.9998999834060669,"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/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9957000017166138,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6955711245536804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.662455141544342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6399364471435547},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5546911954879761},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5210977792739868},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.506468653678894},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49028828740119934},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4406737685203552},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43632131814956665},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42618560791015625},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42440080642700195},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4191180467605591},{"id":"https://openalex.org/keywords/tracking","display_name":"Tracking (education)","score":0.4164654314517975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3877987861633301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20672070980072021}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6955711245536804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.662455141544342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6399364471435547},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5546911954879761},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5210977792739868},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.506468653678894},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49028828740119934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4406737685203552},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43632131814956665},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42618560791015625},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42440080642700195},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4191180467605591},{"id":"https://openalex.org/C2775936607","wikidata":"https://www.wikidata.org/wiki/Q466845","display_name":"Tracking (education)","level":2,"score":0.4164654314517975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3877987861633301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20672070980072021},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2011.5995604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CVPR 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.9186","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.9186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/%7Efowlkes/papers/prf-cvpr11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.1021","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.1021","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/%7Edramanan/papers/tracking2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1488584896","https://openalex.org/W1571268436","https://openalex.org/W1590686026","https://openalex.org/W1840672702","https://openalex.org/W1963951527","https://openalex.org/W1977545325","https://openalex.org/W2056262278","https://openalex.org/W2096590953","https://openalex.org/W2098699644","https://openalex.org/W2107775979","https://openalex.org/W2111644456","https://openalex.org/W2117082318","https://openalex.org/W2119958205","https://openalex.org/W2120079785","https://openalex.org/W2120419212","https://openalex.org/W2121224247","https://openalex.org/W2124541566","https://openalex.org/W2143516773","https://openalex.org/W2148442626","https://openalex.org/W2150440166","https://openalex.org/W2167462877","https://openalex.org/W2168119233","https://openalex.org/W2171243491","https://openalex.org/W2171932356","https://openalex.org/W2222512263","https://openalex.org/W2405686381","https://openalex.org/W6634116786","https://openalex.org/W6635175540","https://openalex.org/W6638575632","https://openalex.org/W6674533529","https://openalex.org/W6676780830","https://openalex.org/W6677452075","https://openalex.org/W6685202850","https://openalex.org/W6689029123"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W3209920515","https://openalex.org/W2107423006","https://openalex.org/W2979334915","https://openalex.org/W961142965","https://openalex.org/W18819324"],"abstract_inverted_index":{"We":[0,11,34],"analyze":[1],"the":[2,13,22,37,72,91,98],"computational":[3],"problem":[4,14],"of":[5,24,93],"multi-object":[6],"tracking":[7,73],"in":[8,87,90,97,117],"video":[9],"sequences.":[10],"formulate":[12],"using":[15,51],"a":[16,44,56,78],"cost":[17],"function":[18],"that":[19,36,47],"requires":[20],"estimating":[21],"number":[23,92],"tracks,":[25],"as":[26,28,68],"well":[27],"their":[29],"birth":[30],"and":[31,95,106],"death":[32],"states.":[33],"show":[35],"global":[38],"solution":[39],"can":[40],"be":[41],"obtained":[42],"with":[43],"greedy":[45],"algorithm":[46,80],"sequentially":[48],"instantiates":[49],"tracks":[50],"shortest":[52],"path":[53],"computations":[54],"on":[55,82],"flow":[57],"network.":[58],"Greedy":[59],"algorithms":[60,102],"allow":[61],"one":[62],"to":[63,110],"embed":[64],"pre-processing":[65],"steps,":[66],"such":[67],"nonmax":[69],"suppression,":[70],"within":[71],"algorithm.":[74],"Furthermore,":[75],"we":[76],"give":[77],"near-optimal":[79],"based":[81],"dynamic":[83],"programming":[84],"which":[85],"runs":[86],"time":[88],"linear":[89,96],"objects":[94],"sequence":[99],"length.":[100],"Our":[101],"are":[103],"fast,":[104],"simple,":[105],"scalable,":[107],"allowing":[108],"us":[109],"process":[111],"dense":[112],"input":[113],"data.":[114],"This":[115],"results":[116],"state-of-the-art":[118],"performance.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":35},{"year":2022,"cited_by_count":36},{"year":2021,"cited_by_count":65},{"year":2020,"cited_by_count":79},{"year":2019,"cited_by_count":90},{"year":2018,"cited_by_count":98},{"year":2017,"cited_by_count":78},{"year":2016,"cited_by_count":93},{"year":2015,"cited_by_count":84},{"year":2014,"cited_by_count":47},{"year":2013,"cited_by_count":40},{"year":2012,"cited_by_count":22}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}