{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:20:33Z","timestamp":1742995233540,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886921"},{"type":"electronic","value":"9783540886938"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88693-8_22","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T20:49:12Z","timestamp":1223671752000},"page":"298-311","source":"Crossref","is-referenced-by-count":7,"title":["Toward Global Minimum through Combined Local Minima"],"prefix":"10.1007","author":[{"given":"Ho Yub","family":"Jung","sequence":"first","affiliation":[]},{"given":"Kyoung Mu","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sang Uk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Roth, S., Black, M.J.: Steerable random fields. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408981"},{"key":"22_CR2","unstructured":"Roth, S., Black, M.J.: Field of experts: A framework for learning image priors. In: CVPR (2005)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Potetz, B.: Efficient belief propagation for vision using linear constraint nodes. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383094"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Kohli, P., Mudigonda, P., Torr, P.: p\n                  3 and beyond: Solving energies with higher order cliques. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383204"},{"key":"22_CR5","unstructured":"Rother, C., Kolmogorov, V., Minka, T., Blake, A.: Cosegmenation of image pairs by histogram matching- incorporating a global constraint into mrfs. In: CVPR (2006)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/11744047_21","volume-title":"Computer Vision \u2013 ECCV 2006","author":"X. Lan","year":"2006","unstructured":"Lan, X., Roth, S., Huttenlocher, D., Black, M.J.: Efficient belief propagation with learned higher-order markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 269\u2013282. Springer, Heidelberg (2006)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. PAMI\u00a06 (1984)","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Zhu, S.C., Liu, X.W., Wu, Y.N.: Exploring texture ensembles by efficent markov chain monte carlo: Toward a trichromacy theory of texture. PAMI\u00a022(6) (2000)","DOI":"10.1109\/34.862195"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Tu, Z., Zhu, S.C.: Image segmentation by data-driven markov chain monte carlo. PAMI\u00a024 (2002)","DOI":"10.1109\/34.1000239"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Barbu, A., Zhu, S.C.: Generalizing swendsen-wang cut to sampling arbitrary posterior probabilities. PAMI\u00a027 (2005)","DOI":"10.1109\/TPAMI.2005.161"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11744047_2","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 16\u201329. Springer, Heidelberg (2006)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Woodford, O.J., Reid, I.D., Torr, P.H.S., Fitzgibbon, A.W.: Field of experts for image-based rendering. BMVC (2006)","DOI":"10.5244\/C.20.113"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Jung, H.Y., Lee, K.M., Lee, S.U.: Window annealing over square lattice markov random field. ECCV (2008)","DOI":"10.1007\/978-3-540-88688-4_23"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Besag, J.: On the statistical analysis of dirty pictures (with discussion). Journal of the Royal Statistical Society Series B 48 (1986)","DOI":"10.1111\/j.2517-6161.1986.tb01412.x"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Mignotte, M.: Nonparametric multiscale energy-based model and its application in some imagery problems. PAMI\u00a026 (2004)","DOI":"10.1109\/TPAMI.2004.1262180"},{"key":"22_CR16","unstructured":"http:\/\/vision.middlebury.edu\/stereo\/"},{"key":"22_CR17","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. In: IJCV (2002)"},{"key":"22_CR18","unstructured":"Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. In: CVPR (2003)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Hirshmuller, H., Szeliski, R.: Evaluation of cost functions for stereo matching. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383248"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Scharstein, D., Pal, C.: Learning conditional random fields for stereo. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383191"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. PAMI\u00a023 (2001)","DOI":"10.1109\/34.969114"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI 28 (2006)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Rother, C., Blake, A.: Logcut - efficient graph cut optimization for markov random fields. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408907"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Crow, F.: Summed-area tables for texture mapping. SIGGRAPH (1984)","DOI":"10.1145\/800031.808600"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Tappen, M.F., Freeman, W.T.: Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In: ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensiitive to image samplin. PAMI 20 (1998)","DOI":"10.1109\/34.677269"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? PAMI 26 (2004)","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. PAMI 26 (2004)","DOI":"10.1109\/TPAMI.2004.60"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on trees: Message-passing and linear-programming approaches. IEEE Trans. Information Theory 51(11) (2005)","DOI":"10.1109\/TIT.2005.856938"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88693-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T06:36:59Z","timestamp":1576651019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88693-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886921","9783540886938"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88693-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}