메뉴 건너뛰기




Volumn , Issue , 2010, Pages 767-774

Exploiting data-independence for fast belief-propagation

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL LIKELIHOOD; DEPENDENT FACTORS; FIRST-ORDER; GRAPHICAL MODEL; LABELINGS; LATENT VARIABLE; MAXIMUM A POSTERIORI; NUMBER OF STATE; STRUCTURED MODEL;

EID: 77956514708     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (17)
  • 3
    • 0031125393 scopus 로고    scopus 로고
    • On the Exponent of the All Pairs Shortest Path Problem
    • Alon, Noga, Galil, Zvi, and Margalit, Oded. On the exponent of the all pairs shortest path problem. Journal of Computer and System Sciences, 54(2):255-262, 1997. (Pubitemid 127433373)
    • (1997) Journal of Computer and System Sciences , vol.54 , Issue.2 , pp. 255-262
    • Alon, N.1    Galil, Z.2    Margalit, O.3
  • 4
    • 14544286925 scopus 로고    scopus 로고
    • Representation and detection of deformable shapes
    • Felzenszwalb, Pedro F. Representation and detection of deformable shapes. IEEE Trans, on PAMI, 27(2): 208-220, 2005.
    • (2005) IEEE Trans, on PAMI , vol.27 , Issue.2 , pp. 208-220
    • Felzenszwalb, P.F.1
  • 5
    • 33744951081 scopus 로고    scopus 로고
    • Efficient belief propagation for early vision
    • Felzenszwalb, Pedro F. and Huttenlocher, Daniel P. Efficient belief propagation for early vision. IJCV, 70(1):41-54, 2006.
    • (2006) IJCV , vol.70 , Issue.1 , pp. 41-54
    • Felzenszwalb, P.F.1    Huttenlocher, D.P.2
  • 8
    • 70249084986 scopus 로고    scopus 로고
    • New algorithms for the dual of the convex cost network flow problem with application to computer vision
    • Kolmogorov, Vladimir and Shioura, Akiyoshi. New algorithms for the dual of the convex cost network flow problem with application to computer vision. Technical report, University College London, 2007.
    • (2007) Technical Report, University College London
    • Kolmogorov, V.1    Shioura, A.2
  • 10
    • 84890535394 scopus 로고    scopus 로고
    • Fast memory-efficient generalized belief propagation
    • Kumar, M. Pawan and Torr, Philip. Fast memory-efficient generalized belief propagation. In ECCV, 2006.
    • (2006) ECCV
    • Kumar, M.P.1    Torr, P.2
  • 11
    • 34547217558 scopus 로고    scopus 로고
    • Efficient belief propagation with learned higher-order markov random fields
    • Lan, Xiang-Yang, Roth, Stefan, Huttenlocher, Daniel P., and Black, Michael J. Efficient belief propagation with learned higher-order markov random fields. In ECCV, 2006.
    • (2006) ECCV
    • Lan, X.-Y.1    Roth, S.2    Huttenlocher, D.P.3    Black, M.J.4
  • 12
    • 0019647180 scopus 로고
    • An iterative image registration technique with an application to stereo vision
    • Lucas, Bruce D. and Kanade, Takeo. An iterative image registration technique with an application to stereo vision. In IJCAI, 1981.
    • (1981) IJCAI
    • Lucas, B.D.1    Kanade, T.2
  • 14
    • 77956521442 scopus 로고    scopus 로고
    • Exploiting within-clique factorizations in junction-tree algorithms
    • McAuley, Julian J. and Caetano, Tiberio S. Exploiting within-clique factorizations in junction-tree algorithms. AISTATS, 2010.
    • (2010) AISTATS
    • McAuley, J.J.1    Caetano, T.S.2
  • 15
    • 79251535085 scopus 로고    scopus 로고
    • Fast generalized belief propagation for MAP estimation on 2D and 3D grid-like markov random fields
    • Petersen, K., Fehr, J., and Burkhardt, H. Fast generalized belief propagation for MAP estimation on 2D and 3D grid-like markov random fields. In DAGM, 2008.
    • (2008) DAGM
    • Petersen, K.1    Fehr, J.2    Burkhardt, H.3
  • 17
    • 0042850432 scopus 로고    scopus 로고
    • Stereo matching using belief propagation
    • Sun, Jian, Zheng, Nan-Ning, and Shum, Heung-Yeung. Stereo matching using belief propagation. IEEE Trans, on PAMI, 25(7):787-800, 2003.
    • (2003) IEEE Trans, on PAMI , vol.25 , Issue.7 , pp. 787-800
    • Sun, J.1    Zheng, N.-N.2    Shum, H.-Y.3


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