{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T13:27:35Z","timestamp":1774877255014,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338369","type":"print"},{"value":"9783540338376","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11744078_21","type":"book-chapter","created":{"date-parts":[[2006,7,23]],"date-time":"2006-07-23T22:45:17Z","timestamp":1153694717000},"page":"263-274","source":"Crossref","is-referenced-by-count":14,"title":["Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Cremers","sequence":"first","affiliation":[]},{"given":"Leo","family":"Grady","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TIT.1965.1053827","volume":"11","author":"K. Abend","year":"1965","unstructured":"Abend, K., Harley, T., Kanal, L.N.: Classification of binary random patterns. IEEE Transactions on Information Theory\u00a011, 538\u2013544 (1965)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1109\/TPAMI.2005.161","volume":"27","author":"A. Barbu","year":"2005","unstructured":"Barbu, A., Zhu, S.-C.: Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a027(8), 1239\u20131253 (2005)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"3","key":"21_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statistical analysis of dirty pictures. J. Roy. Statist. Soc, Ser. B.\u00a048(3), 259\u2013302 (1986)","journal-title":"J. Roy. Statist. Soc., Ser. B."},{"key":"21_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","volume-title":"Visual Reconstruction","author":"A. Blake","year":"1987","unstructured":"Blake, A., Zisserman, A.: Visual Reconstruction. MIT Press, Cambridge (1987)"},{"issue":"9","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"11","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TPAMI.1983.4767341","volume":"5","author":"G.R. Cross","year":"1983","unstructured":"Cross, G.R., Jain, A.K.: Markov random fields texture models. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a05(1), 25\u201339 (1983)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TPAMI.1987.4767871","volume":"9","author":"H. Derin","year":"1987","unstructured":"Derin, H., Elliott, H.: Modeling and segmentation of noisy and textured images using Gibbs random fields. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a09(1), 39\u201355 (1987)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"21_CR9","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1023\/A:1026501619075","volume":"40","author":"W.T. Freeman","year":"2000","unstructured":"Freeman, W.T., Pasztor, E.C., Carmichael, O.T.: Learning low-level vision. Int. J. of Computer Vision\u00a040(1), 24\u201357 (2000)","journal-title":"Int. J. of Computer Vision"},{"issue":"6","key":"21_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a06(6), 721\u2013741 (1984)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"11","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1109\/34.544081","volume":"18","author":"G. Gimelfarb","year":"1993","unstructured":"Gimelfarb, G.: Texture modeling by multiple pairwise pixel interaction. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a018(11), 1110\u20131114 (1993)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"2","key":"21_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D.M. Greig","year":"1989","unstructured":"Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc., Ser. B\u00a051(2), 271\u2013279 (1989)","journal-title":"J. Roy. Statist. Soc., Ser. B"},{"issue":"10","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H. Ishikawa","year":"2003","unstructured":"Ishikawa, H.: Exact optimization for Markov random fields with convex priors. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a025(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02980577","volume":"23","author":"E. Ising","year":"1925","unstructured":"Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Zeitschrift f\u00fcr Physik\u00a023, 253\u2013258 (1925)","journal-title":"Zeitschrift f\u00fcr Physik"},{"issue":"4598","key":"21_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"5","key":"21_CR17","first-page":"657","volume":"24","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a024(5), 657\u2013673 (2004)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"21_CR18","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2006","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Heidelberg (2006)","edition":"3"},{"key":"21_CR19","unstructured":"Kumar, S., Hebert, M.: Approximate parameter learning in discriminative fields. In: Snowbird Learning Workshop, Utah (2004)"},{"issue":"5","key":"21_CR20","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/34.134046","volume":"13","author":"B.S. Manjunath","year":"1991","unstructured":"Manjunath, B.S., Chellappa, R.: Unsupervised texture segmentation using Markov random field models. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a013(5), 478\u2013482 (1991)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Physics\u00a021, 1087\u20131092 (1953)","journal-title":"J. Chem. Physics"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"J.C. Picard","year":"1975","unstructured":"Picard, J.C., Ratliff, H.D.: Minimum cuts and related problems. Networks\u00a05, 357\u2013370 (1975)","journal-title":"Networks"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Pieczynski, W., Benboudjema, D., Lanchantin, P.: Statistical image segmentation using triplet Markov fields. In: SPIE Int. Symposium on Image and Signal Processing for Remote Sensing VIII, March, vol.\u00a04885, pp. 92\u2013101. SPIE (2003)","DOI":"10.1117\/12.463182"},{"key":"21_CR24","series-title":"Appl. of Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-55760-6","volume-title":"Image Analysis, Random Fields and Markov Chain Monte Carlo Methods","author":"G. Winkler","year":"2003","unstructured":"Winkler, G.: Image Analysis, Random Fields and Markov Chain Monte Carlo Methods. Appl. of Mathematics, vol.\u00a027. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11744078_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T01:29:55Z","timestamp":1736472595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11744078_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338369","9783540338376"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11744078_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}