메뉴 건너뛰기




Volumn , Issue , 2012, Pages

PMBP: PatchMatch belief propagation for correspondence field estimation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 84898414274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5244/C.26.132     Document Type: Conference Paper
Times cited : (48)

References (19)
  • 3
    • 84898409565 scopus 로고    scopus 로고
    • Patch Match Stereo-Stereo matching with slanted support windows
    • M. Bleyer, C. Rhemann, and C. Rother. PatchMatch Stereo-Stereo matching with slanted support windows. In Proc. BMVC, 2011.
    • (2011) Proc. BMVC
    • Bleyer, M.1    Rhemann, C.2    Rother, C.3
  • 4
    • 78651088288 scopus 로고    scopus 로고
    • Randomized motion estimation
    • S. Boltz and F. Nielsen. Randomized motion estimation. In Proc. ICIP, pages 781-784, 2010.
    • (2010) Proc. ICIP , pp. 781-784
    • Boltz, S.1    Nielsen, F.2
  • 6
    • 80052896676 scopus 로고    scopus 로고
    • A global sampling method for alpha matting
    • K. He, C. Rhemann, C. Rother, X. Tang, and J. Sun. A global sampling method for alpha matting. In Proc. CVPR, pages 2049-2056, 2011.
    • (2011) Proc. CVPR , pp. 2049-2056
    • He, K.1    Rhemann, C.2    Rother, C.3    Tang, X.4    Sun, J.5
  • 7
    • 84862275982 scopus 로고    scopus 로고
    • Particle belief propagation
    • A. Ihler and D. McAllester. Particle Belief Propagation. In Proc. AISTATS, volume 5, pages 256-263, 2009.
    • (2009) Proc. AISTATS , vol.5 , pp. 256-263
    • Ihler, A.1    McAllester, D.2
  • 8
    • 84858779894 scopus 로고    scopus 로고
    • Continuously-adaptive discretization for message-passing algorithms
    • M. Isard, J. MacCormick, and K. Achan. Continuously-adaptive discretization for message-passing algorithms. In Proc. NIPS, pages 737-744, 2008.
    • (2008) Proc. NIPS , pp. 737-744
    • Isard, M.1    MacCormick, J.2    Achan, K.3
  • 9
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization
    • October
    • V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell., 28(10):1568-1583, October 2006.
    • (2006) IEEE Trans. Pattern Anal. Mach. Intell. , vol.28 , Issue.10 , pp. 1568-1583
    • Kolmogorov, V.1
  • 10
    • 84856670335 scopus 로고    scopus 로고
    • Coherency sensitive hashing
    • S. Korman and S. Avidan. Coherency sensitive hashing. Proc. ICCV, pages 1607-1614, 2011.
    • (2011) Proc. ICCV , pp. 1607-1614
    • Korman, S.1    Avidan, S.2
  • 13
    • 84898459664 scopus 로고    scopus 로고
    • Stochastic belief propagation: Lowcomplexity message-passing with guarantees
    • arXiv:1111.1020v1 [cs.IT]
    • N. Noorshams and M. J. Wainwright. Stochastic belief propagation: Lowcomplexity message-passing with guarantees. Computing Research Repository, arXiv:1111.1020v1 [cs.IT], 2011.
    • (2011) Computing Research Repository
    • Noorshams, N.1    Wainwright, M.J.2
  • 14
    • 33947697927 scopus 로고    scopus 로고
    • Sparse forward-backward using minimum divergence beams for fast training of conditional random fields
    • C. Pal, C. Sutton, and A. McCallum. Sparse forward-backward using minimum divergence beams for fast training of conditional random fields. In Proc. ICASSP, volume 5, 2006.
    • (2006) Proc. ICASSP , vol.5
    • Pal, C.1    Sutton, C.2    McCallum, A.3
  • 16
    • 80053438176 scopus 로고    scopus 로고
    • Convex max-product algorithms for continuous MRFs with applications to protein folding
    • J. Peng, T. Hazan, D. A. McAllester, and R. Urtasun. Convex max-product algorithms for continuous MRFs with applications to protein folding. In Proc. ICML, 2011.
    • (2011) Proc. ICML
    • Peng, J.1    Hazan, T.2    McAllester, D.A.3    Urtasun, R.4
  • 19
    • 23744513375 scopus 로고    scopus 로고
    • Constructing free-energy approximations and generalized belief propagation algorithms
    • July
    • J. Yedidia, W. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. Info. Theory, 51(7):2282 - 2312, July 2005.
    • (2005) IEEE Trans. Info. Theory , vol.51 , Issue.7 , pp. 2282-2312
    • Yedidia, J.1    Freeman, W.2    Weiss, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.