{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:38:46Z","timestamp":1742989126146,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886853"},{"type":"electronic","value":"9783540886884"}],"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-88688-4_23","type":"book-chapter","created":{"date-parts":[[2008,10,13]],"date-time":"2008-10-13T10:20:43Z","timestamp":1223893243000},"page":"307-320","source":"Crossref","is-referenced-by-count":4,"title":["Window Annealing over Square Lattice Markov Random Field"],"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":"23_CR1","doi-asserted-by":"crossref","unstructured":"Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. PAMI\u00a025 (2003)","DOI":"10.1109\/TPAMI.2003.1206509"},{"key":"23_CR2","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":"23_CR3","doi-asserted-by":"crossref","unstructured":"Potetz, B.: Efficient belief propagation for vision using linear constraint nodes. CVPR (2007)","DOI":"10.1109\/CVPR.2007.383094"},{"key":"23_CR4","unstructured":"Rother, C., Kolmogorov, V., Minka, T., Blake, A.: Cosegmenation of image pairs by histogram matching- incorporating a global constraint into mrfs. CVPR (2006)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lepistsky, V., Szummer, M.: Optimizing binary mrfs via extended roof duality. CVPR (2007)","DOI":"10.1109\/CVPR.2007.383203"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Kohli, P., Mudigonda, P., Torr, P.: p\n                  3 and beyond: Solving energies with higher order cliques. CVPR (2007)","DOI":"10.1109\/CVPR.2007.383204"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Lan, X., Roth, S., Huttenlocher, D., Black, M.J.: Efficient belief propagation with learned higher-order markov random fields. In: ECCV (2006)","DOI":"10.1007\/11744047_21"},{"key":"23_CR8","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":"23_CR9","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":"23_CR10","doi-asserted-by":"crossref","unstructured":"Tu, Z., Zhu, S.C.: Image segmentation by data-driven markov chain monte carlo. PAMI\u00a024 (May 2002)","DOI":"10.1109\/34.1000239"},{"key":"23_CR11","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":"23_CR12","volume-title":"Monte carlo strategies in scientific computing","author":"J.S. Liu","year":"2001","unstructured":"Liu, J.S.: Monte carlo strategies in scientific computing. Springer, Heidelberg (2001)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Moral, P.D., Doucet, A., Jasra, A.: Sequential monte carlo for bayesian computation. Bayesian Statics (2006)","DOI":"10.1002\/0471667196.ess5089"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N.: Equations of state calculations by fast computing machines. Journal of Chemical Physics\u00a021 (1953)","DOI":"10.2172\/4390578"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Hasting, W.K.: Monte carlo sampling methods using markov chains and their applications. Biometrika\u00a057 (1970)","DOI":"10.2307\/2334940"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vechi, M.P.: Optimization by simulated annealing. Science\u00a0220 (1983)","DOI":"10.1126\/science.220.4598.671"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Jasra, A., Stephens, D.A., Holmes, C.C.: On population-based simulation for static inference. Statistics and Computing\u00a017 (2007)","DOI":"10.1007\/s11222-007-9028-9"},{"key":"23_CR18","unstructured":"Neal, R.M.: Annealed importance sampling. Technical Report 9805, University of Toronto (1998)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Andrieu, C., Freitas, N., Doucet, A., Jordan, M.: An introduction to mcmc for machine learning. Machine Learning\u00a050 (2003)","DOI":"10.1023\/A:1020281327116"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Crow, F.: Summed-area tables for texture mapping. SIGGRAPH (1984)","DOI":"10.1145\/800031.808600"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Tappen, M., Freeman, W.: Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In: ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"23_CR22","doi-asserted-by":"crossref","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: ECCV (2006)","DOI":"10.1007\/11744047_2"},{"key":"23_CR23","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV (2002)"},{"key":"23_CR24","unstructured":"http:\/\/vision.middlebury.edu\/stereo\/"},{"key":"23_CR25","unstructured":"Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. CVPR (2003)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? PAMI\u00a026 (2004)","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. PAMI\u00a026 (2004)","DOI":"10.1109\/TPAMI.2004.60"},{"key":"23_CR28","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\u00a051(11) (2005)","DOI":"10.1109\/TIT.2005.856938"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI\u00a028 (2006)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"23_CR30","unstructured":"Sudderth, E.B., Ihler, A.T., Freeman, W.T., Willsky, A.S.: Nonparametric belief propagation. MIT LIDS Technical Report P-2551 (2002)"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensiitive to image samplin. PAMI\u00a020 (1998)","DOI":"10.1109\/34.677269"},{"key":"23_CR32","unstructured":"Rother, C., Kolmogorov, V., Minka, T., Blake, A.: Cosegmentation of image pairs by histogram matchin- incorporating a global constraint into mrfs. CVPR (2006)"}],"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-88688-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:41:02Z","timestamp":1575279662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88688-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886853","9783540886884"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88688-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}