{"id":"https://openalex.org/W2033003201","doi":"https://doi.org/10.1109/cvpr.2011.5995567","title":"Exhaustive family of energies minimizable exactly by a graph cut","display_name":"Exhaustive family of energies minimizable exactly by a graph cut","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2033003201","doi":"https://doi.org/10.1109/cvpr.2011.5995567","mag":"2033003201"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2011.5995567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995567","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00616370","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021255142","display_name":"Guillaume Charpiat","orcid":"https://orcid.org/0009-0003-6000-9410"},"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":true,"raw_author_name":"Guillaume Charpiat","raw_affiliation_strings":["Pulsar team, INRIA, Sophia-Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Pulsar team, INRIA, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021255142"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.7841,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74983509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1849","last_page":"1856"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991000294685364,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991000294685364,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.998199999332428,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.998199999332428,"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.7043700814247131},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5131815075874329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5068491101264954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.438989520072937},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42789602279663086},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3954455852508545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3788609504699707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3460001051425934}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7043700814247131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5131815075874329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5068491101264954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.438989520072937},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42789602279663086},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3954455852508545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3788609504699707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3460001051425934}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2011.5995567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995567","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.357.3058","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.357.3058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-sop.inria.fr/members/Guillaume.Charpiat/CVPR11_exhaustive_webv.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00616370v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00616370","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Vision and Pattern Recognition, Jun 2011, Colorado Springs, United States","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00616370v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00616370","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Vision and Pattern Recognition, Jun 2011, Colorado Springs, United States","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.6600000262260437,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W10769007","https://openalex.org/W79315950","https://openalex.org/W1603607404","https://openalex.org/W1605829949","https://openalex.org/W1649464328","https://openalex.org/W1835647349","https://openalex.org/W1847903816","https://openalex.org/W2012464972","https://openalex.org/W2040747066","https://openalex.org/W2101309634","https://openalex.org/W2110306576","https://openalex.org/W2111456086","https://openalex.org/W2113137767","https://openalex.org/W2113206213","https://openalex.org/W2115443511","https://openalex.org/W2132227485","https://openalex.org/W2135165032","https://openalex.org/W2135414191","https://openalex.org/W2137117160","https://openalex.org/W2140502500","https://openalex.org/W2146036075","https://openalex.org/W2148852318","https://openalex.org/W2162366888","https://openalex.org/W4251321576","https://openalex.org/W6600410068","https://openalex.org/W6636112134","https://openalex.org/W6637009331","https://openalex.org/W6638734688","https://openalex.org/W6638847846","https://openalex.org/W6674950339"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W1519201794","https://openalex.org/W2767824041","https://openalex.org/W1629505938"],"abstract_inverted_index":{"Graph":[0],"cuts":[1],"are":[2,110,160],"widely":[3],"used":[4],"in":[5,11,15,97,119,121,139,142,154],"many":[6,94],"fields":[7],"of":[8,22,47,60,75,81,87],"computer":[9],"vision":[10],"order":[12],"to":[13,32,39,56,128,136,149,162],"minimize":[14],"small":[16],"polynomial":[17],"time":[18],"complexity":[19,144],"certain":[20],"classes":[21,26],"energies.":[23],"These":[24],"specific":[25],"depend":[27],"on":[28],"the":[29,34,37,51,57,73,82,85,104,151,164],"way":[30],"chosen":[31],"build":[33,150],"graphs":[35,49],"representing":[36],"problems":[38],"solve.":[40],"We":[41],"study":[42],"here":[43],"all":[44],"possible":[45],"ways":[46],"building":[48],"and":[50,147],"associated":[52,152],"energies":[53,61,99,108,138],"minimized,":[54],"leading":[55],"exhaustive":[58],"family":[59,91],"minimizable":[62],"exactly":[63],"by":[64],"a":[65,125],"graph":[66,153],"cut.":[67],"To":[68],"do":[69,101],"this,":[70],"we":[71,123],"consider":[72],"issue":[74],"coding":[76],"pixel":[77],"labels":[78],"as":[79],"states":[80],"graph,":[83],"i.e.":[84],"choice":[86],"state":[88],"interpretations.":[89],"The":[90],"obtained":[92],"comprises":[93],"new":[95,165],"classes,":[96],"particular":[98,122],"that":[100,109],"not":[102,112],"satisfy":[103],"submodularity":[105],"condition,":[106],"including":[107],"even":[111],"permuted-submodular.":[113],"A":[114,157],"generating":[115],"subfamily":[116,141],"is":[117],"studied":[118],"details,":[120],"propose":[124],"canonical":[126],"form":[127],"represent":[129],"Markov":[130],"random":[131],"fields,":[132],"which":[133],"proves":[134],"useful":[135],"recognize":[137],"this":[140],"linear":[143],"almost":[145],"surely,":[146],"then":[148],"quasilinear":[155],"time.":[156],"few":[158],"experiments":[159],"performed,":[161],"illustrate":[163],"possibilities":[166],"offered.":[167]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}