{"id":"https://openalex.org/W2016931466","doi":"https://doi.org/10.1109/cvpr.2011.5995515","title":"Efficient track linking methods for track graphs using network-flow and set-cover techniques","display_name":"Efficient track linking methods for track graphs using network-flow and set-cover techniques","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2016931466","doi":"https://doi.org/10.1109/cvpr.2011.5995515","mag":"2016931466"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2011.5995515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995515","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/A5101409712","display_name":"Zheng Wu","orcid":"https://orcid.org/0000-0003-4207-3657"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zheng Wu","raw_affiliation_strings":["Departments of Computer Science, Boston University, Boston, MA, USA","Departments of Computer Science, Boston University, Boston, MA 02215"],"affiliations":[{"raw_affiliation_string":"Departments of Computer Science, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Departments of Computer Science, Boston University, Boston, MA 02215","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083570181","display_name":"Thomas Kunz","orcid":"https://orcid.org/0000-0002-6241-778X"},"institutions":[{"id":"https://openalex.org/I33434090","display_name":"University of Massachusetts Boston","ror":"https://ror.org/04ydmy275","country_code":"US","type":"education","lineage":["https://openalex.org/I33434090"]},{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas H. Kunz","raw_affiliation_strings":["Departments of Biology, Boston University, Boston, MA, USA","Departments of Biology, Boston University, Boston, MA 02215"],"affiliations":[{"raw_affiliation_string":"Departments of Biology, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046","https://openalex.org/I33434090"]},{"raw_affiliation_string":"Departments of Biology, Boston University, Boston, MA 02215","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058798782","display_name":"Margrit Betke","orcid":"https://orcid.org/0000-0002-4491-6868"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Margrit Betke","raw_affiliation_strings":["Departments of Computer Science, Boston University, Boston, MA, USA","Departments of Computer Science, Boston University, Boston, MA 02215"],"affiliations":[{"raw_affiliation_string":"Departments of Computer Science, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Departments of Computer Science, Boston University, Boston, MA 02215","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101409712"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":7.4832,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.97898914,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1185","last_page":"1192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9962000250816345,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6838305592536926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5616097450256348},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5110257863998413},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.45246174931526184},{"id":"https://openalex.org/keywords/track","display_name":"Track (disk drive)","score":0.44619399309158325},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.413827121257782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38813960552215576},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3860706388950348},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3418287932872772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1920151710510254}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6838305592536926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5616097450256348},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5110257863998413},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.45246174931526184},{"id":"https://openalex.org/C89992363","wikidata":"https://www.wikidata.org/wiki/Q5961558","display_name":"Track (disk drive)","level":2,"score":0.44619399309158325},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.413827121257782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38813960552215576},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3860706388950348},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3418287932872772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1920151710510254},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cvpr.2011.5995515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995515","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.224.1282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs-people.bu.edu/wuzheng/research/publication/CVPR2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1840672702","https://openalex.org/W1981908713","https://openalex.org/W1989493360","https://openalex.org/W2061129250","https://openalex.org/W2098669323","https://openalex.org/W2111644456","https://openalex.org/W2115672710","https://openalex.org/W2120079785","https://openalex.org/W2122469558","https://openalex.org/W2124541566","https://openalex.org/W2124781496","https://openalex.org/W2147855783","https://openalex.org/W2160372277","https://openalex.org/W2163322487","https://openalex.org/W2166563909","https://openalex.org/W2168688492","https://openalex.org/W2171932356","https://openalex.org/W2537515364","https://openalex.org/W2542256560","https://openalex.org/W2571050459","https://openalex.org/W2611804663","https://openalex.org/W2752885492","https://openalex.org/W3187867541","https://openalex.org/W4250886557","https://openalex.org/W6638575632","https://openalex.org/W6676780830","https://openalex.org/W6678185843","https://openalex.org/W6681697924","https://openalex.org/W6685202850","https://openalex.org/W6729025360","https://openalex.org/W6729161146"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2999799752","https://openalex.org/W2372768926","https://openalex.org/W2115167491","https://openalex.org/W2567825307","https://openalex.org/W3088754131","https://openalex.org/W3038848193"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"novel":[3],"algorithms":[4],"that":[5,52,156],"use":[6],"network-flow":[7,44],"and":[8,37,57,127,160],"set-cover":[9],"techniques":[10,163],"to":[11,46,72,96,107],"perform":[12],"occlusion":[13],"reasoning":[14,34],"for":[15,33,124,142,172],"a":[16,30,42,49,81,103,120,137,144,168],"large":[17,174],"number":[18],"of":[19,83,176],"small,":[20],"moving":[21],"objects":[22],"in":[23,178],"single":[24],"or":[25],"multiple":[26,113],"views.":[27],"We":[28,40],"designed":[29],"track-linking":[31],"framework":[32],"about":[35],"short-term":[36,65],"long-term":[38,89],"occlusions.":[39],"introduce":[41],"two-stage":[43],"process":[45,76,101],"automatically":[47],"construct":[48],"\u201ctrack":[50],"graph\u201d":[51],"describes":[53],"the":[54,75,99,108,165],"track":[55,121,131,166],"merging":[56],"splitting":[58],"events":[59],"caused":[60],"by":[61],"occlusion.":[62],"To":[63,87],"explain":[64],"occlusions,":[66,90],"when":[67,91],"local":[68],"information":[69,93],"is":[70,94],"sufficient":[71],"distinguish":[73],"objects,":[74,98],"links":[77,130],"trajectory":[78],"segments":[79,132],"through":[80],"series":[82],"optimal":[84],"bipartite-graph":[85],"matches.":[86],"resolve":[88],"global":[92],"needed":[95],"characterize":[97],"linking":[100],"computes":[102],"logarithmic":[104,145],"approximation":[105,146],"solution":[106],"set":[109,139],"cover":[110,140],"problem.":[111],"If":[112],"views":[114],"are":[115],"available,":[116],"our":[117,157],"method":[118],"builds":[119],"graph,":[122,135],"independently":[123],"each":[125,134],"view,":[126],"then":[128],"simultaneously":[129],"from":[133],"solving":[136],"joint":[138],"problem":[141],"which":[143],"also":[147],"exists.":[148],"Through":[149],"experiments":[150],"on":[151],"different":[152],"datasets,":[153],"we":[154],"show":[155],"proposed":[158],"linear":[159],"integer":[161],"optimization":[162],"make":[164],"graph":[167],"particularly":[169],"useful":[170],"tool":[171],"tracking":[173],"groups":[175],"individuals":[177],"images.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}