{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:06:40Z","timestamp":1759147600020},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T00:00:00Z","timestamp":1225411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11263-008-0189-6","type":"journal-article","created":{"date-parts":[[2008,10,30]],"date-time":"2008-10-30T13:34:29Z","timestamp":1225373669000},"page":"195-209","source":"Crossref","is-referenced-by-count":16,"title":["Stereo Matching Using Population-Based MCMC"],"prefix":"10.1007","volume":"83","author":[{"given":"Wonsik","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyoung Mu","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,31]]},"reference":[{"key":"189_CR1","doi-asserted-by":"crossref","unstructured":"Barbu, A., & Zhu, S. C. (2004). Multigrid and multi-level Swendsen-Wang cuts for hierarchic graph partition. In Conference on computer vision and pattern recognition, 731\u2013738.","DOI":"10.1109\/CVPR.2004.1315237"},{"key":"189_CR2","doi-asserted-by":"crossref","unstructured":"Barbu, A., & Zhu, S. C. (2005). Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1239\u20131253","DOI":"10.1109\/TPAMI.2005.161"},{"key":"189_CR3","doi-asserted-by":"crossref","unstructured":"Birchfield, S., & Tomasi, C. (1998). A pixel dissimilarity measure that is insensitive to image sampling. IEEE Transactions on Pattern Analysis and Machine Intelligence.","DOI":"10.1109\/34.677269"},{"key":"189_CR4","unstructured":"Bleyer, M., & Gelautz, M. (2005). Graph-based surface reconstruction from stereo pairs using image segmentation. In Proceedings of society of photo-optical instrumentation engineers: Vol. 5665. Videometrics VIII (pp. 288\u2013299)."},{"issue":"9","key":"189_CR5","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9), 1124\u20131137.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"189_CR6","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222\u20131239.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D. Comanicu","year":"2002","unstructured":"Comanicu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 603\u2013619.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR8","unstructured":"Geyer, C. J. (1991). Markov chain Monte Carlo maximum likelihood. Computing Science and Statistics, 156\u2013163."},{"key":"189_CR9","doi-asserted-by":"crossref","unstructured":"Hong, L., & Chen, G. (2004). Segment-based stereo matching using graph cuts. In Conference on computer vision and pattern recognition (pp. 74\u201381).","DOI":"10.1109\/CVPR.2004.1315016"},{"key":"189_CR10","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.1143\/JPSJ.65.1604","volume":"65","author":"K. Hukushima","year":"1996","unstructured":"Hukushima, K., & Nemoto, K. (1996). Exchange Monte Carlo method and application to spin glass simulations. Journal of the Physical Society of Japan, 65, 1604\u20131608.","journal-title":"Journal of the Physical Society of Japan"},{"issue":"3","key":"189_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s11222-007-9028-9","volume":"17","author":"A. Jasra","year":"2007","unstructured":"Jasra, A., & Stephens, D. A. (2007). On population-based simulation for static inference. Statistics and Computing, 17(3), 263\u2013279.","journal-title":"Statistics and Computing"},{"issue":"4598","key":"189_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"189_CR13","doi-asserted-by":"crossref","unstructured":"Klaus, A., Sormann, M., & Karner, K. (2006). Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In International conference on pattern recognition (pp. 15\u201318).","DOI":"10.1109\/ICPR.2006.1033"},{"issue":"10","key":"189_CR14","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568\u20131583.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR15","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., & Zabih, R. (2001). Computing visual correspondence with occlusions using graph cuts. In Proceedings of international conference on computer vision (pp. 508\u2013515).","DOI":"10.1109\/ICCV.2001.937668"},{"key":"189_CR16","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., & Zabih, R. (2002). Multi-camera scene reconstruction via graph cuts. In Proceedings of European conference on computer vision (pp. 82\u201396).","DOI":"10.1007\/3-540-47977-5_6"},{"issue":"2","key":"189_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 147\u2013159.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR18","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G., & Paragios, N. (2007a). Fast, approximately optimal solutions for single and dynamic MRFs. In Conference on computer vision and pattern recognition.","DOI":"10.1109\/CVPR.2007.383095"},{"key":"189_CR19","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N., & Tziritas, G. (2007b). MRF optimization via dual decomposition: Message-passing revisited. In Proceedings of international conference on computer vision.","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"189_CR20","first-page":"317","volume":"10","author":"F. Liang","year":"2000","unstructured":"Liang, F., & Wong, W. H. (2000). Evolutionary Monte Carlo: Applications to C p model sampling and change point problem. Statistica Sinica, 10, 317\u2013342.","journal-title":"Statistica Sinica"},{"key":"189_CR21","doi-asserted-by":"crossref","unstructured":"Liang, F., & Wong, W. H. (2001). Real parameter evolutionary Monte Carlo with applications to Bayesian mixture models. Journal of the American Statistical Association, 653\u2013666.","DOI":"10.1198\/016214501753168325"},{"key":"189_CR22","first-page":"449","volume":"2","author":"Y. Ohta","year":"1985","unstructured":"Ohta, Y., & Kanade, T. (1985). Stereo by intra- and inter-scanline search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 449\u2013470.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR23","doi-asserted-by":"crossref","unstructured":"Park, J., Kim, W., & Lee, K. M. (2007). Stereo matching using population-based MCMC. In Proceedings of Asian conference on computer vision.","DOI":"10.1007\/978-3-540-76390-1_55"},{"issue":"1\u20133","key":"189_CR24","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D. Scharstein","year":"2002","unstructured":"Scharstein, D., & Szeliski, R. (2002). A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47(1\u20133), 7\u201342.","journal-title":"International Journal of Computer Vision"},{"key":"189_CR25","volume-title":"Foundations of genetic algorithms","author":"W. M. Spears","year":"1992","unstructured":"Spears, W. M. (1992). Crossover or mutation? In Foundations of genetic algorithms (Vol. 2). San Mateo: Morgan Kaufmann."},{"issue":"7","key":"189_CR26","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/TPAMI.2003.1206509","volume":"25","author":"J. Sun","year":"2003","unstructured":"Sun, J., Zheng, N. N., & Shum, H. Y. (2003). Stereo matching using belief propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(7), 787\u2013800.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"189_CR27","doi-asserted-by":"crossref","unstructured":"Swendsen, R. H., & Wang, J. S. (1987). Nonuniversal critical dynamics in MC simulations. Physical Review Letters, 86\u201388.","DOI":"10.1103\/PhysRevLett.58.86"},{"key":"189_CR28","doi-asserted-by":"crossref","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006). A comparative study of energy minimization methods for Markov random fields. In Proceedings of European conference on computer vision.","DOI":"10.1007\/11744047_2"},{"key":"189_CR29","doi-asserted-by":"crossref","unstructured":"Tao, H., Sawhney, H. S., & Kumar, R. (2001). A global matching framework for stereo computation. In Proceedings of international conference on computer vision (Vol. 1, pp.\u00a0532\u2013539).","DOI":"10.1109\/ICCV.2001.937562"},{"key":"189_CR30","doi-asserted-by":"crossref","unstructured":"Veksler, O. (2005). Stereo correspondence by dynamic programming on a tree. In Conference on computer vision and pattern recognition.","DOI":"10.1109\/CVPR.2005.334"},{"key":"189_CR31","unstructured":"Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000). Generalized belief propagation. In Proceedings of neural information processing systems (pp. 689\u2013695)."}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-008-0189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-008-0189-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-008-0189-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:16:40Z","timestamp":1559377000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-008-0189-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,31]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s11263-008-0189-6","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,31]]}}}