{"id":"https://openalex.org/W2102424705","doi":"https://doi.org/10.1109/iccv.2011.6126250","title":"Generalized roof duality for pseudo-boolean optimization","display_name":"Generalized roof duality for pseudo-boolean optimization","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2102424705","doi":"https://doi.org/10.1109/iccv.2011.6126250","mag":"2102424705"},"language":"en","primary_location":{"id":"doi:10.1109/iccv.2011.6126250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2011.6126250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Computer Vision","raw_type":"proceedings-article"},"type":"conference-paper","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/A5112556001","display_name":"Fredrik Kahl","orcid":null},"institutions":[{"id":"https://openalex.org/I1279596006","display_name":"Statistics Sweden","ror":"https://ror.org/05x7wz523","country_code":"SE","type":"government","lineage":["https://openalex.org/I1279596006"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Kahl","raw_affiliation_strings":["Centre of Mathematical Sciences, Lund University, Sweden","Centre for Mathematical Sciences Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre of Mathematical Sciences, Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]},{"raw_affiliation_string":"Centre for Mathematical Sciences Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014742486","display_name":"Petter Strandmark","orcid":"https://orcid.org/0000-0002-9795-2694"},"institutions":[{"id":"https://openalex.org/I1279596006","display_name":"Statistics Sweden","ror":"https://ror.org/05x7wz523","country_code":"SE","type":"government","lineage":["https://openalex.org/I1279596006"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Petter Strandmark","raw_affiliation_strings":["Centre of Mathematical Sciences, Lund University, Sweden","Centre for Mathematical Sciences Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre of Mathematical Sciences, Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]},{"raw_affiliation_string":"Centre for Mathematical Sciences Lund University, Sweden","institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"255","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9904000163078308,"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/submodular-set-function","display_name":"Submodular set function","score":0.7850368618965149},{"id":"https://openalex.org/keywords/quartic-function","display_name":"Quartic function","score":0.7642004489898682},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7457032203674316},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.712429940700531},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.619322657585144},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.565257728099823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5535396933555603},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.518291175365448},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5099149942398071},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.4916413426399231},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4892258644104004},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3483238220214844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33173173666000366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3236072063446045},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18019241094589233},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11169856786727905},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0870220959186554}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7850368618965149},{"id":"https://openalex.org/C130432447","wikidata":"https://www.wikidata.org/wiki/Q11420049","display_name":"Quartic function","level":2,"score":0.7642004489898682},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7457032203674316},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.712429940700531},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.619322657585144},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.565257728099823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5535396933555603},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.518291175365448},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5099149942398071},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.4916413426399231},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4892258644104004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3483238220214844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33173173666000366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3236072063446045},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18019241094589233},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11169856786727905},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0870220959186554},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iccv.2011.6126250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccv.2011.6126250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Computer Vision","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.7432","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.lth.se/matematiklth/vision/publdb/reports/pdf/kahl-strandmark-iccv-11.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:edc225e6-2f9b-41f9-b0c9-630389f1491b","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/2225996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1549521126","https://openalex.org/W1748750709","https://openalex.org/W1809286105","https://openalex.org/W2021902776","https://openalex.org/W2022082128","https://openalex.org/W2065540576","https://openalex.org/W2074078071","https://openalex.org/W2076534077","https://openalex.org/W2082165536","https://openalex.org/W2085099404","https://openalex.org/W2101309634","https://openalex.org/W2106813532","https://openalex.org/W2107723815","https://openalex.org/W2112421114","https://openalex.org/W2121845348","https://openalex.org/W2124558257","https://openalex.org/W2133374323","https://openalex.org/W2135165032","https://openalex.org/W2143516773","https://openalex.org/W2153396823","https://openalex.org/W2159565918","https://openalex.org/W2169066680","https://openalex.org/W2171675680","https://openalex.org/W2540861673","https://openalex.org/W2606089130","https://openalex.org/W2964332764","https://openalex.org/W6632941271","https://openalex.org/W6637730771","https://openalex.org/W6677988828"],"related_works":["https://openalex.org/W2102424705","https://openalex.org/W1577070158","https://openalex.org/W2351663397","https://openalex.org/W1977927882","https://openalex.org/W2158019682","https://openalex.org/W2067227060","https://openalex.org/W2006180127","https://openalex.org/W2056263286","https://openalex.org/W4297663618","https://openalex.org/W2181355034"],"abstract_inverted_index":{"The":[0,18],"number":[1,157],"of":[2,60,76,131,146,151,158],"applications":[3],"in":[4,149,155],"computer":[5],"vision":[6],"that":[7,96,104,135],"model":[8],"higher-order":[9,29],"interactions":[10],"has":[11],"exploded":[12],"over":[13],"the":[14,28,52,62,66,94,98,114,156],"last":[15],"few":[16],"years.":[17],"standard":[19],"technique":[20],"for":[21,42,120,142],"solving":[22],"such":[23,107],"problems":[24],"is":[25,68],"to":[26,32,74,92],"reduce":[27],"objective":[30,64],"function":[31],"a":[33,44,85,128,143],"quadratic":[34,80],"pseudo-boolean":[35,125],"function,":[36,57,65],"and":[37,58,112,123,154],"then":[38],"use":[39],"roof":[40,81],"duality":[41,48,82],"obtaining":[43],"lower":[45,100,152],"bound.":[46,101],"Roof":[47],"works":[49],"by":[50],"constructing":[51],"tightest":[53],"possible":[54],"lower-bounding":[55],"submodular":[56],"instead":[59],"optimizing":[61],"original":[63],"relaxation":[67],"minimized.":[69],"We":[70,102],"generalize":[71],"this":[72],"idea":[73],"polynomials":[75],"higher":[77],"degree,":[78],"where":[79],"appears":[83],"as":[84,108],"special":[86],"case.":[87],"Optimal":[88],"relaxations":[89,115,137],"are":[90],"defined":[91],"be":[93,117],"ones":[95],"give":[97],"maximum":[99],"demonstrate":[103],"important":[105],"properties":[106],"persistency":[109],"still":[110],"hold":[111],"how":[113],"can":[116],"efficiently":[118],"constructed":[119],"general":[121],"cubic":[122],"quartic":[124],"functions.":[126],"From":[127],"practical":[129],"point":[130],"view,":[132],"we":[133],"show":[134],"our":[136],"perform":[138],"better":[139],"than":[140],"state-of-the-art":[141],"wide":[144],"range":[145],"problems,":[147],"both":[148],"terms":[150],"bounds":[153],"assigned":[159],"variables.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}