{"id":"https://openalex.org/W2122612844","doi":"https://doi.org/10.1109/cvpr.2010.5540122","title":"Covering trees and lower-bounds on quadratic assignment","display_name":"Covering trees and lower-bounds on quadratic assignment","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2122612844","doi":"https://doi.org/10.1109/cvpr.2010.5540122","mag":"2122612844"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2010.5540122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5540122","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/A5006486625","display_name":"Julian Yarkony","orcid":"https://orcid.org/0000-0003-0479-6459"},"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":"Julian Yarkony","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA","Department of Computer Science, University of California, Irvine, CA, 92697"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, 92697","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","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 Fowlkes","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA","Department of Computer Science, University of California, Irvine, CA, 92697"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, 92697","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048047705","display_name":"Alexander Ihler","orcid":"https://orcid.org/0000-0002-4331-1015"},"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":"Alexander Ihler","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA","Department of Computer Science, University of California, Irvine, CA, 92697"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, 92697","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006486625"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":5.1724,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.96029782,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"887","last_page":"894"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9983000159263611,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9980999827384949,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5650233626365662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5523699522018433},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5242112874984741},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5135636329650879},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5105017423629761},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4874401390552521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48627960681915283},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4767678380012512},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4655390977859497},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45422911643981934},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4321511387825012},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42971470952033997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3933561146259308},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23695653676986694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.181529700756073}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5650233626365662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5523699522018433},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5242112874984741},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5135636329650879},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5105017423629761},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4874401390552521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48627960681915283},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4767678380012512},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4655390977859497},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45422911643981934},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4321511387825012},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42971470952033997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3933561146259308},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23695653676986694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.181529700756073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":3,"locations":[{"id":"doi:10.1109/cvpr.2010.5540122","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5540122","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:CiteSeerX.psu:10.1.1.187.8913","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.8913","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/yfi-cvpr10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.3081","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.3081","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/%7Ejyarkony/CT_CVPR.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8799999952316284,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1744214816","https://openalex.org/W2108182844","https://openalex.org/W2108444897","https://openalex.org/W2108619558","https://openalex.org/W2114741181","https://openalex.org/W2124465992","https://openalex.org/W2150760714","https://openalex.org/W2158863086","https://openalex.org/W2164918853","https://openalex.org/W2166524953","https://openalex.org/W2166820607","https://openalex.org/W2168002178","https://openalex.org/W2467020497","https://openalex.org/W2479567345","https://openalex.org/W2491954325","https://openalex.org/W4239749705","https://openalex.org/W6637760914","https://openalex.org/W6676079856","https://openalex.org/W6683341419"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2060252799","https://openalex.org/W2474680198","https://openalex.org/W1596350596","https://openalex.org/W3112462120","https://openalex.org/W2049828308","https://openalex.org/W2597689725","https://openalex.org/W4389261227"],"abstract_inverted_index":{"Many":[0],"computer":[1],"vision":[2],"problems":[3,22],"involving":[4],"feature":[5],"correspondence":[6,163],"among":[7],"images":[8],"can":[9,84],"be":[10,85],"formulated":[11],"as":[12,35,73],"an":[13],"assignment":[14,128],"problem":[15,136],"with":[16,75,115,140],"a":[17,60,103,122,154],"quadratic":[18,127],"cost":[19],"function.":[20],"Such":[21],"are":[23],"computationally":[24],"infeasible":[25],"in":[26,31,52,94,118],"general":[27],"but":[28],"recent":[29,155],"advances":[30],"discrete":[32],"optimization":[33],"such":[34],"tree-reweighted":[36],"belief":[37],"propagation":[38],"(TRW)":[39],"often":[40],"provide":[41,65],"high-quality":[42],"solutions.":[43],"In":[44],"this":[45,132],"paper,":[46],"we":[47,56,101],"improve":[48],"upon":[49],"these":[50,82],"algorithms":[51],"two":[53],"ways.":[54],"First,":[55],"introduce":[57,102],"covering":[58,116],"trees,":[59],"variant":[61],"of":[62,81,137],"TRW":[63,74,151],"which":[64],"the":[66,70,112,126,135,146],"same":[67],"bounds":[68],"on":[69,160],"MAP":[71],"energy":[72,142],"far":[76],"fewer":[77],"variational":[78],"parameters.":[79],"Optimization":[80],"parameters":[83],"carried":[86],"out":[87],"efficiently":[88],"using":[89],"either":[90],"fixed-point":[91],"iterations":[92],"(as":[93],"TRW)":[95],"or":[96],"sub-gradient":[97],"based":[98],"techniques.":[99],"Second,":[100],"new":[104],"technique":[105],"that":[106],"utilizes":[107],"bipartite":[108],"matching":[109],"applied":[110],"to":[111,120,134],"min-marginals":[113],"produced":[114],"trees":[117],"order":[119],"compute":[121],"tighter":[123],"lower-bound":[124],"for":[125],"problem.":[129],"We":[130],"apply":[131],"machinery":[133],"finding":[138],"correspondences":[139],"pairwise":[141],"functions,":[143],"and":[144,153],"demonstrate":[145],"resulting":[147],"hybrid":[148],"method":[149],"outperforms":[150],"alone":[152],"related":[156],"subproblem":[157],"decomposition":[158],"algorithm":[159],"benchmark":[161],"image":[162],"problems.":[164]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}