메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Joint affinity propagation for multiple view segmentation

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; COMPUTER VISION; GRAPH THEORY; IMAGE ENHANCEMENT; IMAGE PROCESSING; LABELING;

EID: 50649123946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4408928     Document Type: Conference Paper
Times cited : (56)

References (19)
  • 1
    • 33847172327 scopus 로고    scopus 로고
    • Clustering by Passing Messages Between Data Points
    • February
    • B. J. Frey and D. Dueck. Clustering by Passing Messages Between Data Points. Science, 315:972-976, February 2007.
    • (2007) Science , vol.315 , pp. 972-976
    • Frey, B.J.1    Dueck, D.2
  • 3
    • 33745842499 scopus 로고    scopus 로고
    • Convergent Tree-Reweighted Message Passing for Energy Minimization
    • V. Kolmogorov. Convergent Tree-Reweighted Message Passing for Energy Minimization. In AISTATS, 2005.
    • (2005) AISTATS
    • Kolmogorov, V.1
  • 4
    • 24644521179 scopus 로고    scopus 로고
    • Bi-Layer Segmentation of Binocular Stereo Video
    • V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother. Bi-Layer Segmentation of Binocular Stereo Video. In CVPR (2), pages 407-414, 2005.
    • (2005) CVPR , vol.2 , pp. 407-414
    • Kolmogorov, V.1    Criminisi, A.2    Blake, A.3    Cross, G.4    Rother, C.5
  • 5
    • 84949969441 scopus 로고    scopus 로고
    • What Energy Functions Can Be Minimized via Graph Cuts?
    • V. Kolmogorov and R. Zabih. What Energy Functions Can Be Minimized via Graph Cuts? In ECCV (3), pages 65-81, 2002.
    • (2002) ECCV , vol.3 , pp. 65-81
    • Kolmogorov, V.1    Zabih, R.2
  • 6
    • 15044345802 scopus 로고    scopus 로고
    • M. Lhuillier and L. Quan. A Quasi-Dense Approach to Surface Reconstruction from Uncalibrated Images. IEEE Trans. Pattern Anal. Mach. Intell., 27(3):418-433, 2005.
    • M. Lhuillier and L. Quan. A Quasi-Dense Approach to Surface Reconstruction from Uncalibrated Images. IEEE Trans. Pattern Anal. Mach. Intell., 27(3):418-433, 2005.
  • 12
    • 33744933693 scopus 로고    scopus 로고
    • Inducing Semantic Segmentation from an Example
    • Y. Schnitman, Y. Caspi, D. Cohen-Or, and D. Lischinski. Inducing Semantic Segmentation from an Example. In ACCV (2), pages 373-384, 2006.
    • (2006) ACCV , vol.2 , pp. 373-384
    • Schnitman, Y.1    Caspi, Y.2    Cohen-Or, D.3    Lischinski, D.4
  • 15
    • 0036566199 scopus 로고    scopus 로고
    • Image Segmentation by Data-Driven Markov Chain Monte Carlo
    • Z. Tu and S. C. Zhu. Image Segmentation by Data-Driven Markov Chain Monte Carlo. IEEE Trans. Pattern Anal. Mach. Intell., 24(5):657-673, 2002.
    • (2002) IEEE Trans. Pattern Anal. Mach. Intell , vol.24 , Issue.5 , pp. 657-673
    • Tu, Z.1    Zhu, S.C.2
  • 17
  • 18
    • 5044228111 scopus 로고    scopus 로고
    • Motion Layer Extraction in the Presence of Occlusion Using Graph Cut
    • J. Xiao and M. Shah. Motion Layer Extraction in the Presence of Occlusion Using Graph Cut. In CVPR (2), pages 972-979, 2004.
    • (2004) CVPR , vol.2 , pp. 972-979
    • Xiao, J.1    Shah, M.2
  • 19
    • 26444592207 scopus 로고    scopus 로고
    • Learning from Labeled and Unlabeled Data with Label Propagation
    • CMU-CALD-02-107, 2002
    • X. Zhu and Z. Ghahramani. Learning from Labeled and Unlabeled Data with Label Propagation. Technical Report tech report CMU-CALD-02-107, 2002.
    • Technical Report tech report
    • Zhu, X.1    Ghahramani, Z.2


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