Stereo matching using population-based MCMC

International Journal of Computer Vision

Volumn 83, Issue 2, 2009, Pages 195-209

  Kim, Wonsik ^a   Park, Joonyoung ^b   Lee, Kyoung Mu ^a  

^a Department of Aerospace Engineering   (South Korea)

^b LG Electronics Inc   (South Korea)

Author keywords

Energy minimization; Population based MCMC; Stereo

Indexed keywords

COMPUTER VISION; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; MONTE CARLO METHODS; THERMAL EFFECTS;

BELIEF PROPAGATION; EFFECT OF PARAMETERS; ENERGY MINIMIZATION; FASTER CONVERGENCES; HIGH-DIMENSIONAL; LOCAL MOVES; LOWER ENERGIES; MARKOV-CHAIN MONTE CARLO; MCMC METHODS; MIXING RATES; MULTIPLE CHAINS; MULTIPLE SAMPLES; POPULATION-BASED MCMC; SAMPLING-BASED METHODS; STATE SPACES; STEREO; STEREO IMAGES; STEREO MATCHING; STEREO MATCHING METHODS;

SIMULATED ANNEALING;

EID: 63049129272     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-008-0189-6     Document Type: Article

References (31)

1. 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-738.
2. Barbu, A., & Zhu, S. C. (2005). Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1239-1253
3. Birchfield, S., & Tomasi, C. (1998). A pixel dissimilarity measure that is insensitive to image sampling. IEEE Transactions on Pattern Analysis and Machine Intelligence.
4. 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-299).
5. Y. Boykov V. Kolmogorov 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 1137
6. Y. Boykov O. Veksler R. Zabih 2001 Fast approximate energy minimization via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 23 11 1222 1239
7. D. Comanicu P. Meer 2002 Mean shift: A robust approach toward feature space analysis IEEE Transactions on Pattern Analysis and Machine Intelligence 24 603 619
8. Geyer, C. J. (1991). Markov chain Monte Carlo maximum likelihood. Computing Science and Statistics, 156-163.
9. Hong, L., & Chen, G. (2004). Segment-based stereo matching using graph cuts. In Conference on computer vision and pattern recognition (pp. 74-81).
10. K. Hukushima K. Nemoto 1996 Exchange Monte Carlo method and application to spin glass simulations Journal of the Physical Society of Japan 65 1604 1608
11. A. Jasra D. A. Stephens 2007 On population-based simulation for static inference Statistics and Computing 17 3 263 279
12. S. Kirkpatrick C. Gelatt M. Vecchi 1983 Optimization by simulated annealing Science 220 4598 671 680
13. 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-18).
14. V. Kolmogorov 2006 Convergent tree-reweighted message passing for energy minimization IEEE Transactions on Pattern Analysis and Machine Intelligence 28 10 1568 1583
15. Kolmogorov, V., & Zabih, R. (2001). Computing visual correspondence with occlusions using graph cuts. In Proceedings of international conference on computer vision (pp. 508-515).
16. Kolmogorov, V., & Zabih, R. (2002). Multi-camera scene reconstruction via graph cuts. In Proceedings of European conference on computer vision (pp. 82-96).
17. V. Kolmogorov R. Zabih 2004 What energy functions can be minimized via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 26 2 147 159
18. Komodakis, N., Tziritas, G., & Paragios, N. (2007a). Fast, approximately optimal solutions for single and dynamic MRFs. In Conference on computer vision and pattern recognition.
19. Komodakis, N., Paragios, N., & Tziritas, G. (2007b). MRF optimization via dual decomposition: Message-passing revisited. In Proceedings of international conference on computer vision.
20. p model sampling and change point problem Statistica Sinica 10 317 342
21. Liang, F., & Wong, W. H. (2001). Real parameter evolutionary Monte Carlo with applications to Bayesian mixture models. Journal of the American Statistical Association, 653-666.
22. Y. Ohta T. Kanade 1985 Stereo by intra- and inter-scanline search IEEE Transactions on Pattern Analysis and Machine Intelligence 2 449 470
23. Park, J., Kim, W., & Lee, K. M. (2007). Stereo matching using population-based MCMC. In Proceedings of Asian conference on computer vision.
24. D. Scharstein R. Szeliski 2002 A taxonomy and evaluation of dense two-frame stereo correspondence algorithms International Journal of Computer Vision 47 1-3 7 42
25. Spears, W. M. (1992). Crossover or mutation? In Foundations of genetic algorithms (Vol. 2). San Mateo: Morgan Kaufmann.
26. J. Sun N. N. Zheng H. Y. Shum 2003 Stereo matching using belief propagation IEEE Transactions on Pattern Analysis and Machine Intelligence 25 7 787 800
27. Swendsen, R. H., & Wang, J. S. (1987). Nonuniversal critical dynamics in MC simulations. Physical Review Letters, 86-88.
28. 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.
29. 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. 532-539).
30. Veksler, O. (2005). Stereo correspondence by dynamic programming on a tree. In Conference on computer vision and pattern recognition.
31. Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000). Generalized belief propagation. In Proceedings of neural information processing systems (pp. 689-695).