{"id":"https://openalex.org/W2091098068","doi":"https://doi.org/10.1109/cvpr.2010.5540227","title":"Fast globally optimal 2D human detection with loopy graph models","display_name":"Fast globally optimal 2D human detection with loopy graph models","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2091098068","doi":"https://doi.org/10.1109/cvpr.2010.5540227","mag":"2091098068"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2010.5540227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5540227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","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/A5109225019","display_name":"Tai-Peng Tian","orcid":null},"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":"Tai-Peng Tian","raw_affiliation_strings":["Boston University, USA","Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Boston University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042663603","display_name":"Stan Sclaroff","orcid":"https://orcid.org/0000-0002-0711-4313"},"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":"Stan Sclaroff","raw_affiliation_strings":["Boston University, USA","Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Boston University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109225019"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":10.668,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.98715457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10812","display_name":"Human Pose and Action Recognition","score":0.9972000122070312,"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/T10812","display_name":"Human Pose and Action Recognition","score":0.9972000122070312,"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/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9934999942779541,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9932000041007996,"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/computer-science","display_name":"Computer science","score":0.6503245830535889},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5950079560279846},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.566459596157074},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5643146634101868},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.47371119260787964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4672313332557678},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4556361734867096},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4446712136268616},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4406469464302063},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42351460456848145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3490394055843353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3368532359600067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22246858477592468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16251108050346375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09001424908638}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6503245830535889},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5950079560279846},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.566459596157074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5643146634101868},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.47371119260787964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4672313332557678},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4556361734867096},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4446712136268616},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4406469464302063},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42351460456848145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3490394055843353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3368532359600067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22246858477592468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16251108050346375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09001424908638},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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.2010.5540227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5540227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:open.bu.edu:2144/3786","is_oa":false,"landing_page_url":"https://hdl.handle.net/2144/3786","pdf_url":null,"source":{"id":"https://openalex.org/S4306402183","display_name":"OpenBU/Boston University Institutional Repository (Boston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I111088046","host_organization_name":"Boston University","host_organization_lineage":["https://openalex.org/I111088046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W198893173","https://openalex.org/W1491239593","https://openalex.org/W1511986666","https://openalex.org/W1549083695","https://openalex.org/W1965865731","https://openalex.org/W2030536784","https://openalex.org/W2055916047","https://openalex.org/W2083975035","https://openalex.org/W2108619558","https://openalex.org/W2124864523","https://openalex.org/W2131263044","https://openalex.org/W2139461634","https://openalex.org/W2141876475","https://openalex.org/W2145108814","https://openalex.org/W2149098716","https://openalex.org/W2161361693","https://openalex.org/W2162253476","https://openalex.org/W2231883621","https://openalex.org/W3148215922","https://openalex.org/W6608119997","https://openalex.org/W6629458431","https://openalex.org/W6632640995","https://openalex.org/W6680689811","https://openalex.org/W6681420447","https://openalex.org/W6683590607"],"related_works":["https://openalex.org/W579810227","https://openalex.org/W2952780262","https://openalex.org/W2979495269","https://openalex.org/W2392917763","https://openalex.org/W1931020284","https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W4394849239","https://openalex.org/W2182290077"],"abstract_inverted_index":{"This":[0,19,107],"paper":[1],"presents":[2],"an":[3],"algorithm":[4,41,55,136],"for":[5,49,68,123,128],"recovering":[6],"the":[7,24,30,33,37,50,81,88,94,102,125,132,140],"globally":[8,51],"optimal":[9,52],"2D":[10],"human":[11],"figure":[12],"detection":[13],"using":[14,113],"a":[15,65],"loopy":[16],"graph":[17],"model.":[18],"is":[20,62,78,109,137,146],"computationally":[21],"challenging":[22],"because":[23],"time":[25],"complexity":[26],"scales":[27],"exponentially":[28],"in":[29,36,58],"size":[31],"of":[32,131],"largest":[34],"clique":[35],"graph.":[38],"The":[39,54,75,135],"proposed":[40],"uses":[42],"Branch":[43],"and":[44,60,144],"Bound":[45],"(BB)":[46],"to":[47,64,79,91,119,148],"search":[48],"solution.":[53],"converges":[56],"rapidly":[57],"practice":[59],"this":[61],"due":[63],"novel":[66],"method":[67],"quickly":[69],"computing":[70,124],"tree":[71,89,95],"based":[72,96],"lower":[73,97,103,126],"bounds.":[74],"key":[76],"idea":[77],"recycle":[80],"dynamic":[82],"programming":[83],"(DP)":[84],"tables":[85],"associated":[86],"with":[87],"model":[90],"look":[92],"up":[93,112],"bound":[98,104,127],"rather":[99],"than":[100],"recomputing":[101],"from":[105],"scratch.":[106],"technique":[108],"further":[110],"sped":[111],"Range":[114],"Minimum":[115],"Query":[116],"data":[117],"structures":[118],"provide":[120],"O(1)":[121],"cost":[122],"most":[129],"iterations":[130],"BB":[133],"algorithm.":[134],"evaluated":[138],"on":[139],"Iterative":[141],"Parsing":[142],"dataset":[143],"it":[145],"shown":[147],"run":[149],"fast":[150],"empirically.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}