{"id":"https://openalex.org/W2104371080","doi":"https://doi.org/10.1109/cvpr.2009.5206504","title":"Markov Chain Monte Carlo combined with deterministic methods for Markov random field optimization","display_name":"Markov Chain Monte Carlo combined with deterministic methods for Markov random field optimization","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2104371080","doi":"https://doi.org/10.1109/cvpr.2009.5206504","mag":"2104371080"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2009.5206504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206504","pdf_url":null,"source":{"id":"https://openalex.org/S4363607795","display_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5102760187","display_name":"Wonsik Kim","orcid":"https://orcid.org/0000-0002-8658-6262"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Wonsik Kim","raw_affiliation_strings":["Department of EECS, ASRI, Seoul National University, Seoul, South Korea","[Department of EECS, Seoul National University, Seoul, South Korea]"],"affiliations":[{"raw_affiliation_string":"Department of EECS, ASRI, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"[Department of EECS, Seoul National University, Seoul, South Korea]","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046504049","display_name":"Kyoung Mu Lee","orcid":"https://orcid.org/0000-0001-7210-1036"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyoung Mu Lee","raw_affiliation_strings":["Department of EECS, ASRI, Seoul National University, Seoul, South Korea","[Department of EECS, Seoul National University, Seoul, South Korea]"],"affiliations":[{"raw_affiliation_string":"Department of EECS, ASRI, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"[Department of EECS, Seoul National University, Seoul, South Korea]","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102760187"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.2488,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.60981448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"30","issue":null,"first_page":"1406","last_page":"1413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9998000264167786,"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.9998000264167786,"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/T11605","display_name":"Visual Attention and Saliency Detection","score":0.9958999752998352,"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.9933000206947327,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6046004891395569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5773099064826965},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.563792884349823},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.537568211555481},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5368789434432983},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4843636453151703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46760880947113037},{"id":"https://openalex.org/keywords/markov-random-field","display_name":"Markov random field","score":0.44075602293014526},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.43905436992645264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29034537076950073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21583828330039978},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1602071225643158},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.13571178913116455},{"id":"https://openalex.org/keywords/image-segmentation","display_name":"Image segmentation","score":0.09034433960914612},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08033439517021179}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6046004891395569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5773099064826965},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.563792884349823},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.537568211555481},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5368789434432983},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4843636453151703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46760880947113037},{"id":"https://openalex.org/C2778045648","wikidata":"https://www.wikidata.org/wiki/Q176827","display_name":"Markov random field","level":4,"score":0.44075602293014526},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.43905436992645264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29034537076950073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21583828330039978},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1602071225643158},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.13571178913116455},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.09034433960914612},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08033439517021179},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cvpr.2009.5206504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2009.5206504","pdf_url":null,"source":{"id":"https://openalex.org/S4363607795","display_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.3292","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.3292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cv.snu.ac.kr/publication/conf/2009/WKim_CVPR09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"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":28,"referenced_works":["https://openalex.org/W1498678288","https://openalex.org/W1502653686","https://openalex.org/W1966158039","https://openalex.org/W1995875710","https://openalex.org/W2001933992","https://openalex.org/W2074078071","https://openalex.org/W2095783300","https://openalex.org/W2101309634","https://openalex.org/W2107884096","https://openalex.org/W2108619558","https://openalex.org/W2113137767","https://openalex.org/W2120272360","https://openalex.org/W2121845348","https://openalex.org/W2126290786","https://openalex.org/W2137117160","https://openalex.org/W2143516773","https://openalex.org/W2164918853","https://openalex.org/W2166925018","https://openalex.org/W2169282664","https://openalex.org/W2171614029","https://openalex.org/W2184872067","https://openalex.org/W3167728093","https://openalex.org/W6629867751","https://openalex.org/W6630102353","https://openalex.org/W6650956993","https://openalex.org/W6677988828","https://openalex.org/W6685269397","https://openalex.org/W6795773589"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3188646203","https://openalex.org/W2909957174","https://openalex.org/W136674370","https://openalex.org/W4246278799","https://openalex.org/W2105527480","https://openalex.org/W2052387497","https://openalex.org/W2132461435","https://openalex.org/W1992534732"],"abstract_inverted_index":{"Many":[0],"vision":[1],"problems":[2,9,52,186],"have":[3,12,37,66],"been":[4,13,68],"formulated":[5],"as":[6,54,72],"energy":[7,17,23,56,97,136,142],"minimization":[8,18,24],"and":[10,31,61,84,118,138],"there":[11],"significant":[14],"advances":[15],"in":[16,183],"algorithms.":[19],"The":[20],"most":[21,206],"widely-used":[22],"algorithms":[25,113],"include":[26,77],"graph":[27],"cuts,":[28],"belief":[29],"propagation":[30],"tree-reweighted":[32],"message":[33],"passing.":[34],"Although":[35],"they":[36,41,100,130],"obtained":[38],"good":[39],"results,":[40],"are":[42,92,101,123],"still":[43],"unsatisfactory":[44],"when":[45],"it":[46],"comes":[47],"to":[48,94,134],"more":[49],"difficult":[50,207],"MRF":[51,185,212],"such":[53],"non-submodular":[55],"functions,":[57],"highly":[58],"connected":[59],"MRFs,":[60],"high-order":[62],"clique":[63],"potentials.":[64],"There":[65],"also":[67,195],"other":[69],"approaches,":[70],"known":[71],"stochastic":[73,117],"sampling-based":[74,150],"algorithms,":[75],"which":[76,114,203],"simulated":[78],"annealing,":[79],"Markov":[80,87],"chain":[81,88],"Monte":[82,89],"Carlo":[83],"population":[85],"based":[86],"Carlo.":[90],"They":[91],"applicable":[93],"any":[95],"general":[96],"models":[98],"but":[99],"usually":[102],"slower":[103],"than":[104],"deterministic":[105,119,126,153],"methods.":[106,120],"In":[107,144],"this":[108],"paper,":[109],"we":[110],"propose":[111],"new":[112],"elegantly":[115],"combine":[116],"Sampling-based":[121],"methods":[122,127,154,182],"boosted":[124],"by":[125,187],"so":[128],"that":[129],"can":[131],"rapidly":[132],"move":[133],"lower":[135],"states":[137],"easily":[139],"jump":[140],"over":[141],"barriers.":[143],"different":[145],"point":[146],"of":[147,164,171,179,191],"view,":[148],"the":[149,169,172,180,189,192,200,205,210],"method":[151],"prevents":[152],"from":[155],"getting":[156],"stuck":[157],"at":[158],"local":[159],"minima.":[160],"Consequently,":[161],"a":[162,176],"combination":[163],"both":[165],"approaches":[166],"substantially":[167],"increases":[168],"quality":[170],"solutions.":[173],"We":[174,194],"present":[175],"thorough":[177],"analysis":[178],"proposed":[181],"synthetic":[184],"controlling":[188],"hardness":[190],"problems.":[193,214],"demonstrate":[196],"experimental":[197],"results":[198],"for":[199],"photomontage":[201],"problem":[202],"is":[204],"one":[208],"among":[209],"standard":[211],"benchmark":[213]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}