{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:20:34Z","timestamp":1742390434418,"version":"3.33.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/iccv.2007.4408907","type":"proceedings-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T20:34:53Z","timestamp":1199478893000},"page":"1-8","source":"Crossref","is-referenced-by-count":67,"title":["LogCut - Efficient Graph Cut Optimization for Markov Random Fields"],"prefix":"10.1109","author":[{"given":"Victor","family":"Lempitsky","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Rother","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Blake","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TPAMI.2006.200"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"ref12","article-title":"On the optimality of tree-reweighted max-product message passing","author":"kolmogorov","year":"2005","journal-title":"Conf on Uncertainty in AI"},{"key":"ref13","first-page":"65","article-title":"What energy functions can be minimized via graph cuts?","author":"kolmogorov","year":"2002","journal-title":"In ECCV"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/CVPR.2007.383095"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1093\/comjnl\/7.4.308"},{"year":"1988","author":"pearl","article-title":"Probabilistic Reasoning in Intelligent Systems","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/CVPR.2005.130"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/CVPR.2007.383191"},{"key":"ref19","article-title":"A comparative study of energy minimization algorithms for highly connected graphs","author":"szeliski","year":"2006","journal-title":"In ECCV"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TPAMI.2004.60"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/34.969114"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/CVPR.2004.1315041"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","article-title":"Exact MAP estimation for binary images","volume":"51","author":"greig","year":"1989","journal-title":"J Royal Statistical Society"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/BF02612354"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TPAMI.1984.4767596"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ICCV.2001.937505"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","article-title":"Visual Reconstruction","author":"blake","year":"1987"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TPAMI.2003.1233908"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/CVPR.2007.383249"}],"event":{"name":"2007 IEEE 11th International Conference on Computer Vision","start":{"date-parts":[[2007,10,14]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2007,10,21]]}},"container-title":["2007 IEEE 11th International Conference on Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4408818\/4408819\/04408907.pdf?arnumber=4408907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T09:42:01Z","timestamp":1737798121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4408907\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/iccv.2007.4408907","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}