{"id":"https://openalex.org/W2112421114","doi":"https://doi.org/10.1109/cvpr.2010.5539886","title":"Parallel and distributed graph cuts by dual decomposition","display_name":"Parallel and distributed graph cuts by dual decomposition","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2112421114","doi":"https://doi.org/10.1109/cvpr.2010.5539886","mag":"2112421114"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2010.5539886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5539886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lup.lub.lu.se/record/1567612","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"P Strandmark","raw_affiliation_strings":["Centre for Mathematical Sciences, Lund University, Sweden","Centre for Mathematical Sciences Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Centre for 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/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":"F Kahl","raw_affiliation_strings":["Centre for Mathematical Sciences, Lund University, Sweden","Centre for Mathematical Sciences Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Centre for 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":["https://openalex.org/A5014742486"],"corresponding_institution_ids":["https://openalex.org/I1279596006","https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":11.9611,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.98960911,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2085","last_page":"2092"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","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/T10036","display_name":"Advanced Neural Network Applications","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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9955999851226807,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.9921000003814697,"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/computer-science","display_name":"Computer science","score":0.7502990961074829},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6428597569465637},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5776391625404358},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.558130145072937},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5333179235458374},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5275649428367615},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.47970646619796753},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46833252906799316},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.4603630602359772},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4318584203720093},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42530357837677},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4185047447681427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37243568897247314},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30853503942489624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18326565623283386},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17623049020767212}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7502990961074829},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6428597569465637},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5776391625404358},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.558130145072937},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5333179235458374},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5275649428367615},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.47970646619796753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46833252906799316},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.4603630602359772},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4318584203720093},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42530357837677},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4185047447681427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37243568897247314},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30853503942489624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18326565623283386},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17623049020767212},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cvpr.2010.5539886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2010.5539886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.206.910","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.211.3806","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.3806","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/strandmark-kahl-cvpr-2010.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:8d6fa8fb-cf7b-4e3f-b1f7-885f9e1f7c94","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/1567612","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1063-6919","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:8d6fa8fb-cf7b-4e3f-b1f7-885f9e1f7c94","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/1567612","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1063-6919","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W79315950","https://openalex.org/W1759347593","https://openalex.org/W2053913299","https://openalex.org/W2059378738","https://openalex.org/W2069277547","https://openalex.org/W2078337376","https://openalex.org/W2082165536","https://openalex.org/W2087490509","https://openalex.org/W2096139825","https://openalex.org/W2113137767","https://openalex.org/W2114741181","https://openalex.org/W2120804060","https://openalex.org/W2121927366","https://openalex.org/W2124351162","https://openalex.org/W2134436132","https://openalex.org/W2138165282","https://openalex.org/W2143776086","https://openalex.org/W2155852554","https://openalex.org/W2293828611","https://openalex.org/W2295887643","https://openalex.org/W2740373864","https://openalex.org/W2798766386","https://openalex.org/W4242209908","https://openalex.org/W6670988925","https://openalex.org/W6672046219"],"related_works":["https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W3141688457","https://openalex.org/W3155269421","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2141353198","https://openalex.org/W2078695342","https://openalex.org/W2590727506","https://openalex.org/W647071796"],"abstract_inverted_index":{"Graph":[0],"cuts":[1],"methods":[2],"are":[3,69],"at":[4],"the":[5,28,37,46,54,64,67,75,95,103,145],"core":[6],"of":[7,49,53,122,144],"many":[8,132],"state-of-the-art":[9],"algorithms":[10],"in":[11,18,33],"computer":[12],"vision":[13],"due":[14],"to":[15,66,71,97],"their":[16],"efficiency":[17],"computing":[19],"globally":[20],"optimal":[21],"solutions.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26],"solve":[27],"maximum":[29],"flow/minimum":[30],"cut":[31],"problem":[32],"parallel":[34],"by":[35,58,101],"splitting":[36,102],"graph":[38,50,104],"into":[39],"multiple":[40,106],"parts":[41],"and":[42,93],"hence,":[43],"further":[44],"increase":[45],"computational":[47],"efficacy":[48],"cuts.":[51],"Optimality":[52],"solution":[55],"is":[56,149],"guaranteed":[57],"dual":[59,78,146],"decomposition,":[60],"or":[61],"more":[62],"specifically,":[63],"solutions":[65],"subproblems":[68],"constrained":[70],"be":[72],"equal":[73],"on":[74,90,108,128],"overlap":[76],"with":[77,131],"variables.":[79],"We":[80],"demonstrate":[81],"that":[82],"our":[83,114],"approach":[84,115],"both":[85],"allows":[86],"(i)":[87],"faster":[88],"processing":[89],"multi-core":[91],"computers":[92,107],"(ii)":[94],"capability":[96],"handle":[98],"larger":[99],"problems":[100],"across":[105],"a":[109,119],"distributed":[110],"network.":[111],"Even":[112],"though":[113],"does":[116],"not":[117],"give":[118],"theoretical":[120],"guarantee":[121],"speedup,":[123],"an":[124],"extensive":[125],"empirical":[126],"evaluation":[127],"several":[129],"applications":[130],"different":[133],"data":[134],"sets":[135],"consistently":[136],"shows":[137],"good":[138],"performance.":[139],"An":[140],"open":[141],"source":[142],"implementation":[143],"decomposition":[147],"method":[148],"also":[150],"made":[151],"publicly":[152],"available.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}