{"id":"https://openalex.org/W1908914118","doi":"https://doi.org/10.1109/cvpr.2015.7298690","title":"Efficient parallel optimization for potts energy with hierarchical fusion","display_name":"Efficient parallel optimization for potts energy with hierarchical fusion","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1908914118","doi":"https://doi.org/10.1109/cvpr.2015.7298690","mag":"1908914118"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2015.7298690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7298690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","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/A5020352214","display_name":"Olga Veksler","orcid":"https://orcid.org/0000-0002-9664-6601"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Olga Veksler","raw_affiliation_strings":["University of Western Ontario London, Canada","University of Western Ontario, London, Canada"],"affiliations":[{"raw_affiliation_string":"University of Western Ontario London, Canada","institution_ids":["https://openalex.org/I125749732"]},{"raw_affiliation_string":"University of Western Ontario, London, Canada","institution_ids":["https://openalex.org/I125749732"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020352214"],"corresponding_institution_ids":["https://openalex.org/I125749732"],"apc_list":null,"apc_paid":null,"fwci":0.1872,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56996733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":null,"first_page":"887","last_page":"895"},"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.9991999864578247,"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.9991999864578247,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9865999817848206,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/speedup","display_name":"Speedup","score":0.6525982618331909},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6409343481063843},{"id":"https://openalex.org/keywords/potts-model","display_name":"Potts model","score":0.5203263759613037},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4874994456768036},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.47679948806762695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4669082760810852},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4598373770713806},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4196430742740631},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.41691166162490845},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37826037406921387},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3569035530090332},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33674755692481995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3281393051147461},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24702581763267517}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6525982618331909},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6409343481063843},{"id":"https://openalex.org/C98925819","wikidata":"https://www.wikidata.org/wiki/Q7235385","display_name":"Potts model","level":3,"score":0.5203263759613037},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4874994456768036},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.47679948806762695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4669082760810852},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4598373770713806},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4196430742740631},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.41691166162490845},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37826037406921387},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3569035530090332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33674755692481995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3281393051147461},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24702581763267517},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2015.7298690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2015.7298690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.6801","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.6801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csd.uwo.ca/faculty/olga/Papers/h_fusion_final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.889.4305","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.889.4305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Veksler_Efficient_Parallel_Optimization_2015_CVPR_paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W183034762","https://openalex.org/W1548953334","https://openalex.org/W2001933992","https://openalex.org/W2012433182","https://openalex.org/W2023446761","https://openalex.org/W2037534739","https://openalex.org/W2051925299","https://openalex.org/W2082165536","https://openalex.org/W2090882560","https://openalex.org/W2101309634","https://openalex.org/W2104974755","https://openalex.org/W2113137767","https://openalex.org/W2137117160","https://openalex.org/W2140789035","https://openalex.org/W2143516773","https://openalex.org/W2144652879","https://openalex.org/W2146369368","https://openalex.org/W2146807782","https://openalex.org/W2148820904","https://openalex.org/W2153215387","https://openalex.org/W2153396823","https://openalex.org/W2155479981","https://openalex.org/W2162366888","https://openalex.org/W2163664777","https://openalex.org/W2164918853","https://openalex.org/W2167094141","https://openalex.org/W2171011251","https://openalex.org/W2951056087","https://openalex.org/W4231440629","https://openalex.org/W6680866351","https://openalex.org/W6682565752","https://openalex.org/W6683945134","https://openalex.org/W6684060895"],"related_works":["https://openalex.org/W3141688457","https://openalex.org/W2186707160","https://openalex.org/W2078695342","https://openalex.org/W2141353198","https://openalex.org/W2590727506","https://openalex.org/W2031630671","https://openalex.org/W1974018476","https://openalex.org/W2059382600","https://openalex.org/W2607998022","https://openalex.org/W3155269421"],"abstract_inverted_index":{"Potts":[0,16],"energy":[1,17],"frequently":[2],"occurs":[3],"in":[4,112],"computer":[5],"vision":[6],"applications.":[7],"We":[8,140],"present":[9],"an":[10],"efficient":[11],"parallel":[12,28,148],"method":[13],"for":[14],"optimizing":[15],"based":[18,30],"on":[19,150],"the":[20,56,63,96,102,119,131,137,143,151,166],"extension":[21],"of":[22,58,66,98,101,121,136,146,153,159,177,186],"hierarchical":[23],"fusion":[24],"algorithm.":[25,139],"Unlike":[26],"previous":[27],"graph-cut":[29],"optimization":[31],"algorithms,":[32],"our":[33,122,147],"approach":[34],"has":[35,70],"optimality":[36,78],"bounds":[37],"even":[38],"after":[39,47,124,133],"a":[40,75,157,174,183],"single":[41],"iteration":[42,126,135],"over":[43],"all":[44],"labels,":[45],"i.e.":[46],"solving":[48],"only":[49],"k-1":[50],"max-flow":[51,67],"problems,":[52],"where":[53],"k":[54],"is":[55,61,83,91],"number":[57,65,176,185],"labels.":[59],"This":[60],"perhaps":[62],"minimum":[64],"problems":[68],"one":[69,125,134],"to":[71,73,161,165],"solve":[72],"obtain":[74],"solution":[76],"with":[77,173,182],"guarantees.":[79],"Our":[80],"approximation":[81,100],"factor":[82,97,158],"O(log":[84],"<sub":[85],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[87],"k).":[88],"Although":[89],"this":[90],"not":[92],"as":[93,95],"good":[94,110],"2":[99],"well":[103],"known":[104],"expansion":[105,138],"algorithm,":[106],"we":[107,116],"achieve":[108],"very":[109],"results":[111,120,132,170],"practice.":[113],"In":[114],"particular,":[115],"found":[117],"that":[118],"algorithm":[123],"are":[127,188],"always":[128],"better":[129],"than":[130],"demonstrate":[141],"experimentally":[142],"computational":[144],"advantages":[145],"implementation":[149],"problem":[152],"stereo":[154],"correspondence,":[155],"achieving":[156],"1.5":[160],"2.6":[162],"speedup":[163],"compared":[164],"serial":[167],"implementation.":[168],"These":[169],"were":[171],"obtained":[172],"small":[175],"processors.":[178],"The":[179],"expected":[180],"speedups":[181],"larger":[184],"processors":[187],"greater.":[189]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}