{"id":"https://openalex.org/W2214712460","doi":null,"title":"New algorithms for the dual of the convex cost network flow problem with application to computer vision","display_name":"New algorithms for the dual of the convex cost network flow problem with application to computer vision","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2214712460","mag":"2214712460"},"language":"en","primary_location":{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:3746","doi":null,"is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/3746/","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,"listed_in":[],"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":"Mathematical Programming (2007)","raw_type":"Article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5021390142","display_name":"Vladimir Kolmogorov","orcid":"https://orcid.org/0000-0002-7625-8986","observed_orcids":["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\u2020"],"raw_orcid":"https://orcid.org/0000-0002-7625-8986","affiliations":[{"raw_affiliation_string":"University College London\u2020","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190","observed_orcids":["https://orcid.org/0000-0002-5216-7190"]},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["Tohoku University (),"],"raw_orcid":"https://orcid.org/0000-0002-5216-7190","affiliations":[{"raw_affiliation_string":"Tohoku University (),","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6391,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91717468,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":9.999999747378752e-05,"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/dual-problem","display_name":"dual problem","score":0.6420000195503235},{"id":"https://openalex.org/keywords/primal-algorithm","display_name":"primal algorithm","score":0.871999979019165},{"id":"https://openalex.org/keywords/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.972000002861023},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.9670000076293945},{"id":"https://openalex.org/keywords/iteration-complexity","display_name":"iteration complexity","score":0.5320000052452087},{"id":"https://openalex.org/keywords/panoramic-stitching","display_name":"panoramic stitching","score":0.8339999914169312},{"id":"https://openalex.org/keywords/computer-vision","display_name":"computer vision","score":0.8949999809265137}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6889013051986694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6062378287315369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5687870383262634},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5572371482849121},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5325535535812378},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4709929823875427},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.395699143409729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33778589963912964},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:3746","doi":null,"is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/3746/","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,"listed_in":[],"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":"Mathematical Programming (2007)","raw_type":"Article"},{"id":"mag:2214712460","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/3746/1/3746.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W39126767","https://openalex.org/W306123262","https://openalex.org/W386493121","https://openalex.org/W394138740","https://openalex.org/W1533665822","https://openalex.org/W1563007904","https://openalex.org/W1596169490","https://openalex.org/W1755572302","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W2013347084","https://openalex.org/W2020999234","https://openalex.org/W2025350305","https://openalex.org/W2046715803","https://openalex.org/W2049688189","https://openalex.org/W2053352956","https://openalex.org/W2061130579","https://openalex.org/W2074078071","https://openalex.org/W2074872108","https://openalex.org/W2080375462","https://openalex.org/W2090359754","https://openalex.org/W2093693728","https://openalex.org/W2113137767","https://openalex.org/W2113206213","https://openalex.org/W2139655189","https://openalex.org/W2140153585","https://openalex.org/W2140502500","https://openalex.org/W2143516773","https://openalex.org/W2169278451","https://openalex.org/W2304678994"],"related_works":["https://openalex.org/W7096100960","https://openalex.org/W1983075526","https://openalex.org/W1509202213","https://openalex.org/W1975387839","https://openalex.org/W7097890158","https://openalex.org/W1974548385","https://openalex.org/W2169278451","https://openalex.org/W1535814080","https://openalex.org/W1983853123","https://openalex.org/W1993305973"],"abstract_inverted_index":{"Motivated":[0],"by":[1,50,146],"various":[2],"applications":[3],"to":[4,63,102,153,181,199,227],"computer":[5,183],"vision,":[6],"we":[7,28,169],"consider":[8,178],"an":[9,37,179],"integer":[10],"convex":[11,20,127,244],"optimization":[12],"problem":[13,185,206,232,238],"which":[14,233],"is":[15,62,84,90,98,160,234],"the":[16,19,41,69,72,77,81,91,99,123,126,143,161,166,187,203,222,228,240,243],"dual":[17,124,148,241],"of":[18,40,71,80,93,125,142,195,202,242],"cost":[21,128,245],"network":[22,129,246],"flow":[23,130,247],"problem.":[24,42,131,190,248],"In":[25],"this":[26,60],"\\npaper,":[27],"first":[29],"propose":[30,118],"a":[31,65,104,108,119,139,172,182,235],"new":[32],"primal":[33,44,48,82,94,144,154,167,217],"algorithm":[34,45,83,121,134,145,198,218],"for":[35,68,122,165],"computing":[36],"optimal":[38],"solution":[39],"Our":[43],"iteratively":[46],"updates":[47],"variables":[49,95,149],"solving":[51],"associated":[52],"\\nminimum":[53],"cut":[54,106],"problems.":[55],"The":[56,132],"main":[57],"contribution":[58],"in":[59,107,151],"paper":[61],"provide":[64],"tight":[66],"bound":[67],"number":[70],"iterations.":[73],"We":[74,191],"show":[75,214],"that":[76,164,215],"time":[78,100,158],"complexity":[79,159],"K":[85,89],"\u00a2":[86],"T(n;m)":[87,97],"where":[88],"range":[92],"and":[96,113,207],"needed":[101],"compute":[103],"minimum":[105],"graph":[109],"with":[110],"n":[111],"nodes":[112],"m":[114],"edges.":[115],"\\nWe":[116,176,212],"then":[117],"primal-dual":[120,133,197],"can":[135,170,224],"be":[136,225],"seen":[137],"as":[138,163,219,221],"refined":[140],"version":[141],"maintaining":[147],"(flow)":[150],"addition":[152],"variables.":[155],"Although":[156],"its":[157],"same":[162],"algorithm,":[168],"expect":[171],"better":[173],"performance":[174],"\\npractically.":[175],"finally":[177],"application":[180],"vision":[184],"called":[186],"panoramic":[188,204],"stitching":[189,205],"apply":[192],"several":[193],"implementations":[194],"our":[196,216],"some":[200],"\\ninstances":[201],"test":[208],"their":[209],"practical":[210],"performance.":[211],"also":[213],"well":[220],"proofs":[223],"applied":[226],"L\\\\-convex":[229],"function":[230],"minimization":[231],"more":[236],"general":[237],"than":[239]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}