{"id":"https://openalex.org/W2155697938","doi":"https://doi.org/10.1109/cvpr.2009.5206604","title":"A convex relaxation approach for computing minimal partitions","display_name":"A convex relaxation approach for computing minimal partitions","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2155697938","doi":"https://doi.org/10.1109/cvpr.2009.5206604","mag":"2155697938"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2009.5206604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206604","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":"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/A5032205387","display_name":"Thomas Pock","orcid":"https://orcid.org/0000-0001-6120-1058"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thomas Pock","raw_affiliation_strings":["Graz University of Technology, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089573258","display_name":"Antonin Chambolle","orcid":"https://orcid.org/0000-0002-9465-4659"},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antonin Chambolle","raw_affiliation_strings":["Ecole Polytechnique, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Polytechnique, Paris, France","institution_ids":["https://openalex.org/I142476485"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087710605","display_name":"Daniel Cremers","orcid":"https://orcid.org/0000-0002-3079-7984"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Cremers","raw_affiliation_strings":["Bond University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bond University, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011359067","display_name":"Horst Bischof","orcid":"https://orcid.org/0000-0002-9096-6671"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Horst Bischof","raw_affiliation_strings":["Graz University of Technology, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graz University of Technology, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":19.0396,"has_fulltext":false,"cited_by_count":257,"citation_normalized_percentile":{"value":0.99528992,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"810","last_page":"817"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9994999766349792,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9994999766349792,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9986000061035156,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9955000281333923,"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/potts-model","display_name":"Potts model","score":0.705623984336853},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6269272565841675},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5512056946754456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5243090391159058},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5059570670127869},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.49432373046875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45248088240623474},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4440152049064636},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.42896515130996704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.394325315952301},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3792558014392853},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.24742639064788818},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19704824686050415},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15323024988174438},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09707024693489075},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08420205116271973},{"id":"https://openalex.org/keywords/statistical-physics","display_name":"Statistical physics","score":0.08368682861328125}],"concepts":[{"id":"https://openalex.org/C98925819","wikidata":"https://www.wikidata.org/wiki/Q7235385","display_name":"Potts model","level":3,"score":0.705623984336853},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6269272565841675},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5512056946754456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5243090391159058},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5059570670127869},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.49432373046875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45248088240623474},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4440152049064636},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.42896515130996704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.394325315952301},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3792558014392853},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.24742639064788818},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19704824686050415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15323024988174438},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09707024693489075},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08420205116271973},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.08368682861328125},{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2009.5206604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206604","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.364.4346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vision.in.tum.de/_media/spezial/bib/pock_et_al_cvpr09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.378.9823","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.378.9823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://gpu4vision.icg.tugraz.at/papers/2009/pockcvpr2009.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":41,"referenced_works":["https://openalex.org/W10769007","https://openalex.org/W53515490","https://openalex.org/W79315950","https://openalex.org/W1019822895","https://openalex.org/W1536031884","https://openalex.org/W1536329667","https://openalex.org/W1567885833","https://openalex.org/W1759347593","https://openalex.org/W1762430620","https://openalex.org/W1985588167","https://openalex.org/W1990510363","https://openalex.org/W2005089986","https://openalex.org/W2006293258","https://openalex.org/W2038495454","https://openalex.org/W2068674173","https://openalex.org/W2101309634","https://openalex.org/W2105365768","https://openalex.org/W2108619558","https://openalex.org/W2111957738","https://openalex.org/W2114487471","https://openalex.org/W2116040950","https://openalex.org/W2120688271","https://openalex.org/W2137117160","https://openalex.org/W2140502500","https://openalex.org/W2143516773","https://openalex.org/W2159793005","https://openalex.org/W2186531643","https://openalex.org/W2314012200","https://openalex.org/W2797302609","https://openalex.org/W2802276845","https://openalex.org/W3016074254","https://openalex.org/W3205656812","https://openalex.org/W3214968550","https://openalex.org/W6600410068","https://openalex.org/W6602130781","https://openalex.org/W6632205817","https://openalex.org/W6637790285","https://openalex.org/W6676934822","https://openalex.org/W6677820788","https://openalex.org/W6771138180","https://openalex.org/W6996817197"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2786581865","https://openalex.org/W2069861393","https://openalex.org/W2619966450","https://openalex.org/W3082232337","https://openalex.org/W4287552035","https://openalex.org/W1600160158","https://openalex.org/W2807981612","https://openalex.org/W2096411231","https://openalex.org/W1485007464"],"abstract_inverted_index":{"In":[0],"this":[1],"work":[2],"we":[3,57,89,107,135],"propose":[4,58],"a":[5,31,69,92,118],"convex":[6,49],"relaxation":[7,111],"approach":[8,14,77,112,121,148],"for":[9],"computing":[10],"minimal":[11,20],"partitions.":[12],"Our":[13],"is":[15],"based":[16],"on":[17,51,72,95,149],"rewriting":[18],"the":[19,40,52,86,96,99,103,128,138,143],"partition":[21],"problem":[22],"(also":[23],"known":[24],"as":[25],"Potts":[26,41,87],"model)":[27],"in":[28],"terms":[29],"of":[30,48,85,146],"primal":[32,61],"dual":[33,53,62],"Total":[34],"Variation":[35],"functional.":[36],"We":[37,141],"show":[38,108],"that":[39,109],"prior":[42],"can":[43,90],"be":[44],"incorporated":[45],"by":[46],"means":[47],"constraints":[50],"variables.":[54],"For":[55,131],"minimization":[56],"an":[59],"efficient":[60],"projected":[63],"gradient":[64],"algorithm":[65],"which":[66],"also":[67],"allows":[68,122],"fast":[70],"implementation":[71],"parallel":[73],"hardware.":[74],"Although":[75],"our":[76,110,120,147],"does":[78],"not":[79],"guarantee":[80],"to":[81,123,127],"find":[82,137],"global":[83,139],"minimizers":[84],"model":[88],"give":[91],"tight":[93],"bound":[94],"energy":[97],"between":[98],"computed":[100],"solution":[101],"and":[102,154],"true":[104,129],"minimizer.":[105,130,140],"Furthermore":[106],"dominates":[113],"recently":[114],"proposed":[115],"relaxations.":[116],"As":[117],"consequence,":[119],"compute":[124],"solutions":[125],"closer":[126],"many":[132],"practical":[133],"problems":[134],"even":[136],"demonstrate":[142],"excellent":[144],"performance":[145],"several":[150],"multi-label":[151],"image":[152],"segmentation":[153],"stereo":[155],"problems.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":29},{"year":2015,"cited_by_count":31},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":36},{"year":2012,"cited_by_count":33}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}