{"id":"https://openalex.org/W2171675680","doi":"https://doi.org/10.1109/cvpr.2009.5206846","title":"Beyond pairwise energies: Efficient optimization for higher-order MRFs","display_name":"Beyond pairwise energies: Efficient optimization for higher-order MRFs","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2171675680","doi":"https://doi.org/10.1109/cvpr.2009.5206846","mag":"2171675680"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2009.5206846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607795","display_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 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/A5043423948","display_name":"Nikos Komodakis","orcid":"https://orcid.org/0009-0000-6767-5641"},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Nikos Komodakis","raw_affiliation_strings":["Computer Science Department, University of Crete, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Crete, Greece","institution_ids":["https://openalex.org/I142617266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077223134","display_name":"Nikos Paragios","orcid":"https://orcid.org/0000-0002-9668-4763"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nikos Paragios","raw_affiliation_strings":["Ecole Centrale de Paris, INRIA Saclay \u00eele-de-France, France"],"affiliations":[{"raw_affiliation_string":"Ecole Centrale de Paris, INRIA Saclay \u00eele-de-France, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043423948"],"corresponding_institution_ids":["https://openalex.org/I142617266"],"apc_list":null,"apc_paid":null,"fwci":77.2879,"has_fulltext":false,"cited_by_count":177,"citation_normalized_percentile":{"value":1.0,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2985","last_page":"2992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11708","display_name":"Photochromic and Fluorescence Chemistry","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.9902999997138977,"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.7312518358230591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6943214535713196},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5573724508285522},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5154517292976379},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4676971435546875},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42546629905700684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40390825271606445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4036414623260498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3711644411087036},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3400641083717346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2070443034172058}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7312518358230591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6943214535713196},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5573724508285522},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5154517292976379},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4676971435546875},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42546629905700684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40390825271606445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4036414623260498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3711644411087036},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3400641083717346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2070443034172058},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cvpr.2009.5206846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607795","display_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.9794","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.9794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csd.uoc.gr/~komod/publications/docs/HighOrderMRFs_DualDecomposition_cvpr09a.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":15,"referenced_works":["https://openalex.org/W1590899626","https://openalex.org/W2103498186","https://openalex.org/W2107723815","https://openalex.org/W2108619558","https://openalex.org/W2111559961","https://openalex.org/W2114741181","https://openalex.org/W2116877738","https://openalex.org/W2121845348","https://openalex.org/W2128680590","https://openalex.org/W2135968022","https://openalex.org/W2164918853","https://openalex.org/W2169066680","https://openalex.org/W4252621450","https://openalex.org/W6635212758","https://openalex.org/W6677988828"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2562400057","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4360593462","https://openalex.org/W2194570607"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,18,106,153,159],"introduce":[4,79],"a":[5,24,40,80,113,173],"higher-order":[6,34,170],"MRF":[7,35,47],"optimization":[8],"framework.":[9],"On":[10,49],"the":[11,45,50,110,123,145,165],"one":[12],"hand,":[13,52],"it":[14,21,53],"is":[15,54,128],"very":[16,136,174],"general;":[17],"thus":[19,59,78],"use":[20],"to":[22,31,44,64,90,96,130,163],"derive":[23],"generic":[25,125],"optimizer":[26,126],"that":[27,37,155],"can":[28,60],"be":[29,61,97],"applied":[30],"almost":[32,132],"any":[33],"and":[36,58,95,115,127],"provably":[38],"optimizes":[39],"dual":[41],"relaxation":[42],"related":[43],"input":[46],"problem.":[48],"other":[51],"also":[55],"extremely":[56,116],"flexible":[57],"easily":[62],"adapted":[63],"yield":[65],"far":[66],"more":[67],"powerful":[68,82],"algorithms":[69],"when":[70],"dealing":[71],"with":[72],"subclasses":[73],"of":[74,84,135,148],"high-order":[75,85],"MRFs.":[76],"We":[77],"new":[81],"class":[83],"potentials,":[86],"which":[87,120],"are":[88,160],"shown":[89],"offer":[91],"enough":[92],"expressive":[93],"power":[94],"useful":[98],"for":[99,168],"many":[100],"vision":[101,142],"tasks.":[102],"To":[103],"address":[104],"them,":[105],"derive,":[107],"based":[108],"on":[109,141],"same":[111],"framework,":[112],"novel":[114],"efficient":[117,175],"message-passing":[118],"algorithm,":[119],"goes":[121],"beyond":[122],"aforementioned":[124],"able":[129,162],"deliver":[131],"optimal":[133],"solutions":[134],"high":[137],"quality.":[138],"Experimental":[139],"results":[140],"problems":[143],"demonstrate":[144],"extreme":[146],"effectiveness":[147],"our":[149],"approach.":[150],"For":[151],"instance,":[152],"show":[154],"in":[156,172],"some":[157],"cases":[158],"even":[161],"compute":[164],"global":[166],"optimum":[167],"NP-hard":[169],"MRFs":[171],"manner.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":26}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}