{"id":"https://openalex.org/W2147899407","doi":"https://doi.org/10.1109/cvpr.2008.4587440","title":"Graph cut based image segmentation with connectivity priors","display_name":"Graph cut based image segmentation with connectivity priors","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2147899407","doi":"https://doi.org/10.1109/cvpr.2008.4587440","mag":"2147899407"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2008.4587440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 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/A5103363706","display_name":"Sara Vicente","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sara Vicente","raw_affiliation_strings":["University College London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021390142","display_name":"Vladimir Kolmogorov","orcid":"https://orcid.org/0000-0002-7625-8986"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vladimir Kolmogorov","raw_affiliation_strings":["University College London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034290170","display_name":"Carsten Rother","orcid":"https://orcid.org/0000-0002-4110-440X"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Carsten Rother","raw_affiliation_strings":["Microsoft Research Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":28.0452,"has_fulltext":false,"cited_by_count":387,"citation_normalized_percentile":{"value":0.9974486,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9997000098228455,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9997000098228455,"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.9993000030517578,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.6664372086524963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6521416902542114},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.586788535118103},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.5076581239700317},{"id":"https://openalex.org/keywords/prior-probability","display_name":"Prior probability","score":0.48256149888038635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4778187572956085},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4413830637931824},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.43906843662261963},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42403554916381836},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4116579592227936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3531652092933655},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3375030755996704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29203540086746216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2423684298992157},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.07929569482803345}],"concepts":[{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.6664372086524963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6521416902542114},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.586788535118103},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.5076581239700317},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.48256149888038635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4778187572956085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4413830637931824},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.43906843662261963},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42403554916381836},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4116579592227936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3531652092933655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3375030755996704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29203540086746216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2423684298992157},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.07929569482803345}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cvpr.2008.4587440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.146.4267","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.4267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~carrot/publications_files/ConnectedGraphCut_CVPR08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.333.3090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.333.3090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mplab.ucsd.edu/wp-content/uploads/CVPR2008/Conference/data/papers/100.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.611.9126","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.611.9126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www0.cs.ucl.ac.uk/staff/S.Vicente/papers/connectedGC-CVPR08-TR.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:123700","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/123700/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:  2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12.  (pp. 767 - 774).  IEEE (2008)     ","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W79315950","https://openalex.org/W1541134818","https://openalex.org/W1977545325","https://openalex.org/W2006293258","https://openalex.org/W2062558938","https://openalex.org/W2087194382","https://openalex.org/W2098979973","https://openalex.org/W2104095591","https://openalex.org/W2106569125","https://openalex.org/W2108619558","https://openalex.org/W2113137767","https://openalex.org/W2114741181","https://openalex.org/W2117740473","https://openalex.org/W2120804060","https://openalex.org/W2121947440","https://openalex.org/W2124351162","https://openalex.org/W2125637308","https://openalex.org/W2128089874","https://openalex.org/W2135414191","https://openalex.org/W2139383790","https://openalex.org/W2145861118","https://openalex.org/W2147899407","https://openalex.org/W2162310225","https://openalex.org/W2164918853","https://openalex.org/W2169551590","https://openalex.org/W2171187077","https://openalex.org/W2480543260","https://openalex.org/W2798766386","https://openalex.org/W4211092921","https://openalex.org/W4254313632"],"related_works":["https://openalex.org/W4386190339","https://openalex.org/W2968424575","https://openalex.org/W3142333283","https://openalex.org/W2021544484","https://openalex.org/W2032319136","https://openalex.org/W2109407305","https://openalex.org/W1582388844","https://openalex.org/W2897997384","https://openalex.org/W2088651901","https://openalex.org/W1544828638"],"abstract_inverted_index":{"Graph":[0],"cut":[1,18],"is":[2,44,118],"a":[3,45,80,90,99],"popular":[4],"technique":[5,83,109],"for":[6,113],"interactive":[7],"image":[8],"segmentation.":[9],"However,":[10],"it":[11],"has":[12,19],"certain":[13],"shortcomings.":[14],"In":[15],"particular,":[16],"graph":[17],"problems":[20,65],"with":[21],"segmenting":[22],"thin":[23],"elongated":[24],"objects":[25],"due":[26],"to":[27,37,110,120],"the":[28,56,62,103,107,122],"ldquoshrinking":[29],"biasrdquo.":[30],"To":[31],"overcome":[32],"this":[33],"problem,":[34],"we":[35,74,85],"propose":[36,75],"impose":[38],"an":[39],"additional":[40],"connectivity":[41,57],"prior,":[42],"which":[43,84,97],"very":[46],"natural":[47],"assumption":[48],"about":[49],"objects.":[50],"We":[51,105],"formulate":[52],"several":[53],"versions":[54,73],"of":[55,71],"constraint":[58],"and":[59,88],"show":[60],"that":[61,112],"corresponding":[63],"optimization":[64,77],"are":[66],"all":[67],"NP-hard.":[68],"For":[69],"some":[70,114],"these":[72],"two":[76],"algorithms:":[78],"(i)":[79],"practical":[81,115],"heuristic":[82],"call":[86],"DijkstraGC,":[87],"(ii)":[89],"slow":[91],"method":[92],"based":[93],"on":[94,102],"problem":[95],"decomposition":[96],"provides":[98],"lower":[100],"bound":[101],"problem.":[104],"use":[106],"second":[108],"verify":[111],"examples":[116],"DijkstraGC":[117],"able":[119],"find":[121],"global":[123],"minimum.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":35},{"year":2015,"cited_by_count":36},{"year":2014,"cited_by_count":36},{"year":2013,"cited_by_count":39},{"year":2012,"cited_by_count":31}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}