{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T13:49:59Z","timestamp":1776347399440,"version":"3.51.2"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Machine Intell."],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1109\/tpami.2007.1031","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T20:00:40Z","timestamp":1180728040000},"page":"1274-1279","source":"Crossref","is-referenced-by-count":260,"title":["Minimizing Nonsubmodular Functions with Graph Cuts-A Review"],"prefix":"10.1109","volume":"29","author":[{"given":"Vladimir","family":"Kolmogorov","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Rother","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015718"},{"key":"ref2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.133"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.161"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1974.tb00999.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1986.tb01412.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90043-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref10","article-title":"Network Flows and Minimization of Quadratic Pseudo-Boolean Functions","author":"Boros","year":"1991"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"ref13","volume-title":"Probabilistic Networks and Expert Systems","author":"Cowell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11744078_21"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/34.544081"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1989.tb01764.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.388"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612354"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2007.1031"},{"key":"ref23","article-title":"On the Optimality of Tree-Reweighted Max-Product Message Passing","volume-title":"Proc. Conf. Uncertainty in Artificial Intelligence","author":"Kolmogorov"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref25","first-page":"149","article-title":"Two-Dimensional Programming in Image Analysis Problems","volume":"8","author":"Koval","year":"1976","journal-title":"USSR Academy of Science, Automatics and Telemechanics"},{"key":"ref26","article-title":"Image Segmentation Based on Sufficient Conditions of Optimality in NP-Complete Classes of Structural Labelling Problems","author":"Kovtun","year":"2004"},{"key":"ref27","article-title":"Discriminative Fields for Modeling Spatial Dependencies in Natural Images","volume-title":"Proc. 18th Ann. Conf. Neural Information Processing Systems","author":"Kumar"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1201775.882264"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-4-431-66933-3","volume-title":"Markov Random Field Modeling in Computer Vision","author":"Li","year":"1995"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/11612704_39"},{"key":"ref31","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.130"},{"key":"ref33","article-title":"Efficient Graph-Based Energy Minimization Methods in Computer Vision","author":"Veksler","year":"1999"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000021412.33763.d5"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2007.1036"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/34.632983"},{"key":"ref38","first-page":"1","article-title":"FRAME: Filters, Random Fields and Maximum Entropy\u2014Towards a Unified Theory for Texture Modeling","volume":"27","author":"Zhu","year":"1998","journal-title":"Int\u2019l J. Computer Vision"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/34\/4204153\/04204169.pdf?arnumber=4204169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T04:02:13Z","timestamp":1742097733000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4204169\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":38,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2007.1031","relation":{},"ISSN":["0162-8828"],"issn-type":[{"value":"0162-8828","type":"print"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}