메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1881-1888

Scale invariant cosegmentation for image groups

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

EID: 80052910929     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995420     Document Type: Conference Paper
Times cited : (119)

References (17)
  • 2
    • 0014976008 scopus 로고
    • Graph-theoretical methods for detecting and describing gestalt clusters
    • C. T. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computing, 20(1):68-86, 1971.
    • (1971) IEEE Transactions on Computing , vol.20 , Issue.1 , pp. 68-86
    • Zahn, C.T.1
  • 6
    • 33845587625 scopus 로고    scopus 로고
    • Cosegmentation of image pairs by histogram matching: Incorporating a global constraint into MRFs
    • C. Rother, T. Minka, A. Blake, and V. Kolmogorov. Cosegmentation of image pairs by histogram matching: Incorporating a global constraint into MRFs. In Comp. Vision and Pattern Recog., 2006.
    • (2006) Comp. Vision and Pattern Recog.
    • Rother, C.1    Minka, T.2    Blake, A.3    Kolmogorov, V.4
  • 9
    • 84859090889 scopus 로고    scopus 로고
    • MOMI-cosegmentation: Simultaneous segmentation of multiple objects among multiple images
    • W. S. Chu, C. P. Chen, and C. S. Chen. MOMI-cosegmentation: Simultaneous segmentation of multiple objects among multiple images. In Asian Conf. on Comp. Vision, 2010.
    • (2010) Asian Conf. on Comp. Vision
    • Chu, W.S.1    Chen, C.P.2    Chen, C.S.3
  • 13
    • 0344077921 scopus 로고    scopus 로고
    • Interactive graph cuts segmentation of objects in n-d images
    • Y. Boykov and M. Jolly. Interactive graph cuts segmentation of objects in n-d images. In Intl. Conf. on Comp. Vis, 2001.
    • (2001) Intl. Conf. on Comp. Vis
    • Boykov, Y.1    Jolly, M.2
  • 14
    • 31244435415 scopus 로고    scopus 로고
    • Pseudo-boolean optimization
    • E. Boros and P. Hammer. Pseudo-Boolean optimization. Disc. Appl. Math., 123:155-225, 2002.
    • (2002) Disc. Appl. Math. , vol.123 , pp. 155-225
    • Boros, E.1    Hammer, P.2
  • 17
    • 20444476106 scopus 로고    scopus 로고
    • Fast monte-carlo algorithms for finding low-rank approximations
    • A. M. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. Journal of ACM, 51(6):1025-1041, 1998.
    • (1998) Journal of ACM , vol.51 , Issue.6 , pp. 1025-1041
    • Frieze, A.M.1    Kannan, R.2    Vempala, S.3


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