{"id":"https://openalex.org/W2162544301","doi":null,"title":"Primal-dual Algorithm for Convex Markov Random Fields","display_name":"Primal-dual Algorithm for Convex Markov Random Fields","publication_year":2005,"publication_date":"2005-09-01","ids":{"openalex":"https://openalex.org/W2162544301","mag":"2162544301"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.178.1531","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.1531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"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/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vladimir Kolmogorov","raw_affiliation_strings":["(Microsoft)"],"raw_orcid":"https://orcid.org/0000-0002-7625-8986","affiliations":[{"raw_affiliation_string":"(Microsoft)","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021390142"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":4.2765,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.94251998,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.2824999988079071,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.2824999988079071,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1526000052690506,"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/T10052","display_name":"Medical Image Segmentation Techniques","score":0.1387999951839447,"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/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.871999979019165},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"maximum a posteriori estimation","score":0.8870000243186951},{"id":"https://openalex.org/keywords/energy-minimization","display_name":"energy minimization","score":0.8349999785423279},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.5460000038146973},{"id":"https://openalex.org/keywords/image-restoration","display_name":"image restoration","score":0.6079999804496765},{"id":"https://openalex.org/keywords/total-variation-minimization","display_name":"total variation minimization","score":0.9890000224113464},{"id":"https://openalex.org/keywords/phase-unwrapping","display_name":"phase unwrapping","score":0.9380000233650208},{"id":"https://openalex.org/keywords/panoramic-image-stitching","display_name":"panoramic image stitching","score":0.8579999804496765}],"concepts":[{"id":"https://openalex.org/C29081049","wikidata":"https://www.wikidata.org/wiki/Q1364242","display_name":"Image stitching","level":2,"score":0.7235416769981384},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6687790751457214},{"id":"https://openalex.org/C2778045648","wikidata":"https://www.wikidata.org/wiki/Q176827","display_name":"Markov random field","level":4,"score":0.6288288831710815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5375485420227051},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5300034284591675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5261511206626892},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.5168031454086304},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.4656432867050171},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4635758697986603},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4458238184452057},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4215206503868103},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.4205670654773712},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40409424901008606},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.3610283136367798},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33207473158836365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3206619620323181},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29448479413986206},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.28162550926208496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24418678879737854},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C147597530","wikidata":"https://www.wikidata.org/wiki/Q369472","display_name":"Computational chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.178.1531","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.1531","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:eprints.ucl.ac.uk.OAI2:123707","doi":null,"is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/123707/","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":"Microsoft Research","raw_type":"Report"},{"id":"mag:2162544301","doi":null,"is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2005-117.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W306123262","https://openalex.org/W386493121","https://openalex.org/W1563007904","https://openalex.org/W1596169490","https://openalex.org/W1755572302","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1983289383","https://openalex.org/W2013347084","https://openalex.org/W2020999234","https://openalex.org/W2025350305","https://openalex.org/W2046715803","https://openalex.org/W2053352956","https://openalex.org/W2061130579","https://openalex.org/W2074078071","https://openalex.org/W2074872108","https://openalex.org/W2080375462","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/W2774038789","https://openalex.org/W2140502500","https://openalex.org/W7096100960","https://openalex.org/W119856381","https://openalex.org/W2214712460","https://openalex.org/W7097902050","https://openalex.org/W2107884096","https://openalex.org/W6967165876","https://openalex.org/W7095702004","https://openalex.org/W7061980811"],"abstract_inverted_index":{"Computing":[0],"maximum":[1,111],"a":[2,6,13,36,77,110,114],"posteriori":[3],"configuration":[4],"in":[5,17,41,56,68,113],"first-order":[7],"Markov":[8],"Random":[9],"Field":[10],"has":[11],"become":[12],"routinely":[14],"used":[15],"approach":[16,146],"computer":[18],"vision.":[19],"It":[20],"is":[21,87,95,104,123],"equivalent":[22],"to":[23,108],"minimizing":[24],"an":[25,82],"energy":[26,49],"function":[27,50],"of":[28,38,47,98,156],"discrete":[29],"variables.":[30],"In":[31],"this":[32,129],"paper":[33],"we":[34],"consider":[35],"subclass":[37],"minimization":[39],"problems":[40,54],"which":[42],"unary":[43],"and":[44,71,100,119],"pairwise":[45],"terms":[46],"the":[48,96,105,124,165],"are":[51],"convex.":[52],"Such":[53],"arise":[55],"many":[57],"vision":[58],"applications":[59],"including":[60],"image":[61,73],"restoration,":[62],"total":[63],"variation":[64],"minimization,":[65],"phase":[66],"unwrapping":[67],"SAR":[69],"images":[70],"panoramic":[72,166],"stitching.":[74],"We":[75],"give":[76],"new":[78],"algorithm":[79,127],"for":[80,128,141,164],"computing":[81],"exact":[83],"solution.":[84],"Its":[85],"complexity":[86],"K":[88,94],"\u00b7":[89],"T":[90,101,136],"(n,":[91,102],"m)":[92,103,154],"where":[93],"number":[97],"labels":[99],"time":[106,140],"needed":[107],"compute":[109],"flow":[112],"graph":[115],"with":[116],"n":[117],"nodes":[118],"m":[120],"edges.":[121],"This":[122],"fastest":[125],"maxflow-based":[126],"problem:":[130],"previously":[131],"best":[132],"known":[133],"technique":[134],"takes":[135],"(nK,":[137],"mK":[138,159],"2)":[139],"general":[142],"convex":[143],"functions.":[144],"Our":[145],"also":[147],"needs":[148],"much":[149],"less":[150],"memory":[151],"(O(n":[152],"+":[153,158],"instead":[155],"O(nK":[157],"2)).":[160],"Experimental":[161],"results":[162],"show":[163],"stitching":[167],"problem":[168],"our":[169],"method":[170],"outperforms":[171],"other":[172],"techniques.":[173]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}