PMBP: PatchMatch Belief Propagation for correspondence field estimation

International Journal of Computer Vision

Volumn 110, Issue 1, 2014, Pages 2-13

  Besse, Frederic ^a   Rother, Carsten ^a   Fitzgibbon, Andrew ^a   Kautz, Jan ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Belief propagation; Correspondence fields; PatchMatch

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

BELIEF PROPAGATION; COMPLEX STATE SPACE; CONTINUOUS SPACES; CORRESPONDENCE FIELDS; ORDERS OF MAGNITUDE; PATCHMATCH; STATE-OF-THE-ART TECHNIQUES; STEREO MATCHING ALGORITHM;

IMAGE REGISTRATION;

EID: 84907592692     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-013-0653-9     Document Type: Article

References (20)

1. Barnes, C., Shechtman, E., Finkelstein, A., & Goldman, D. B. (2009). PatchMatch: A randomized correspondence algorithm for structural image editing. ACM Transactions on Graphics (Proceedings of SIGGRAPH), 28(3), 24.
2. Barnes, C., Shechtman, E., Goldman, D. B., & Finkelstein, A. (2010). The generalized PatchMatch correspondence algorithm. In Proceedings of ECCV.
3. Bleyer, M., Rhemann, C., & Rother, C. (2011). PatchMatch Stereo - Stereo matching with slanted support windows. In Proceedings of BMVC.
4. Boltz, S., & Nielsen, F. (2010). Randomized motion estimation. In Proceedings of ICIP (pp. 781-784).
5. HaCohen, Y., Shechtman, E., Goldman, D. B., & Lischinski, D. (2011). Non-rigid dense correspondence with applications for image enhancement. ACM Transactions on Graphics (Proceedings of SIGGRAPH), 30(4), 70:1-70:9.
6. He, K., Rhemann, C., Rother, C., Tang, X., & Sun, J. (2011). A global sampling method for alpha matting. In Proceedings of CVPR (pp. 2049-2056).
7. Ihler, A., & McAllester, D. (2009). Particle belief propagation. In Proceedings of AISTATS (Vol. 5, pp. 256-263).
8. Isard, M., MacCormick, J., & Achan, K. (2008). Continuously-adaptive discretization for message-passing algorithms. In Proceedings of NIPS (pp. 737-744).
9. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568-1583.
10. Korman, S., & Avidan, S. (2011). Coherency sensitive hashing. In Proceedings of ICCV (pp. 1607-1614).
11. Kothapa, R., Pachecho, J., & Sudderth, E. B. (2011). Max-product particle belief propagation. Master's Thesis, Brown University.
12. Mansfield, A., Prasad, M., Rother, C., Sharp, T., Kohli, P., & Van Gool, L. (2011). Transforming image completion. In Proceedings of BMVC.
13. Noorshams, N., & Wainwright, M. J. (2011). Stochastic belief propagation: Low-complexity message-passing with guarantees. In Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference. IEEE (pp. 269-276).
14. Nowozin, S., & Lampert, C. (2011). Structured learning and prediction in computer vision (Vol. 6). Boston: Now publishers Inc.
15. Pal, C., Sutton, C., & McCallum, A. (2006). Sparse forward-backward using minimum divergence beams for fast training of conditional random fields. In Proceedings of ICASSP (Vol. 5).
16. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Francisco: Morgan Kaufmann Publishers Inc.
17. Peng, J., Hazan, T., McAllester, D. A., & Urtasun, R. (2011). Convex max-product algorithms for continuous MRFs with applications to protein folding. In Proceedings of ICML.
18. Sudderth, E. B., Ihler, A. T., Isard, M., Freeman, W. T., & Willsky, A. S. (2010). Nonparametric belief propagation. Communications of the ACM, 53(10), 95-103.
19. Yamaguchi, K., Hazan, T., McAllester, D., & Urtasun, R. (2012). Continuous Markov random fields for robust stereo estimation. In Computer Vision - ECCV 2012 (pp. 45-58). Berlin, Heidelberg: Springer.
20. Yedidia, J., Freeman, W., & Weiss, Y. (2005). Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7), 2282-2312.