메뉴 건너뛰기




Volumn , Issue , 2013, Pages 22-28

Saliency cut in stereo images

Author keywords

Optimization; Saliency; Segmentation; Stereo images

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ELECTRICAL ENGINEERING; IMAGE SEGMENTATION;

EID: 84897536356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCVW.2013.10     Document Type: Conference Paper
Times cited : (15)

References (19)
  • 2
    • 62649143331 scopus 로고    scopus 로고
    • Saliency, attention, and visual search: An information theoretic approach
    • N. D. B. Bruce and J. K. Tsotsos. Saliency, attention, and visual search: an information theoretic approach. Journal of Vision, 9(3):1-24, 2009.
    • (2009) Journal of Vision , vol.9 , Issue.3 , pp. 1-24
    • Bruce, N.D.B.1    Tsotsos, J.K.2
  • 3
    • 73849085669 scopus 로고    scopus 로고
    • Grabcut-interactive foreground extraction using iterated graph cuts
    • A. B. C. Rother and V. Kolmogorov. Grabcut-interactive foreground extraction using iterated graph cuts. ACM Transactions on Graphics, 23.
    • ACM Transactions on Graphics , pp. 23
    • Rother, A.B.C.1    Kolmogorov, V.2
  • 6
    • 80052900725 scopus 로고    scopus 로고
    • Inference for order reduction in markov random fields
    • A. C. Gallagher, D. Batra, and D. Parikh. Inference for order reduction in markov random fields. In Proceedings of IEEE CVPR, pages 1857-1864, 2011.
    • (2011) Proceedings of IEEE CVPR , pp. 1857-1864
    • Gallagher, A.C.1    Batra, D.2    Parikh, D.3
  • 7
    • 77951295401 scopus 로고    scopus 로고
    • Dinkelbach ncut: An efficient framework for solving normalized cuts problems with priors and convex constraints
    • B. Ghanem and N. Ahuja. Dinkelbach ncut: an efficient framework for solving normalized cuts problems with priors and convex constraints. International Journal of Computer Vision, 89(1):40-55, 2010.
    • (2010) International Journal of Computer Vision , vol.89 , Issue.1 , pp. 40-55
    • Ghanem, B.1    Ahuja, N.2
  • 8
    • 70450161205 scopus 로고    scopus 로고
    • Higher-order clique reduction in binary graph cut
    • I. Hiroshi. Higher-order clique reduction in binary graph cut. In Proceedings of IEEE CVPR, pages 2993-3000, 2009.
    • (2009) Proceedings of IEEE CVPR , pp. 2993-3000
    • Hiroshi, I.1
  • 9
    • 84863014339 scopus 로고    scopus 로고
    • Fusing generic objectness and visual saliency for salient object detection
    • H. C. K. Chang, T. Liu and S. Lai. Fusing generic objectness and visual saliency for salient object detection. In Proceedings of IEEE ICCV, pages 914-921, 2011.
    • (2011) Proceedings of IEEE ICCV , pp. 914-921
    • Chang, H.C.K.1    Liu, T.2    Lai, S.3
  • 10
    • 61349174704 scopus 로고    scopus 로고
    • Robust higher order potentials for enforcing label consistency
    • P. Kohli, L. Ladicky, and P. Torr. Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision, 82(3):302-324, 2009.
    • (2009) International Journal of Computer Vision , vol.82 , Issue.3 , pp. 302-324
    • Kohli, P.1    Ladicky, L.2    Torr, P.3
  • 12
  • 13
    • 84856635475 scopus 로고    scopus 로고
    • Stereocut: Consistent interactive object selection in stereo image pairs
    • B. L. Price and S. Cohen. Stereocut: consistent interactive object selection in stereo image pairs. In Proceedings of IEEE ICCV, pages 1148-1155, 2011.
    • (2011) Proceedings of IEEE ICCV , pp. 1148-1155
    • Price, B.L.1    Cohen, S.2
  • 15
    • 84866672748 scopus 로고    scopus 로고
    • A unified approach to salient object detection via low rank matrix recovery
    • X. Shen and Y. Wu. A unified approach to salient object detection via low rank matrix recovery. In Proceedings of IEEE CVPR, pages 853-860, 2012.
    • (2012) Proceedings of IEEE CVPR , pp. 853-860
    • Shen, X.1    Wu, Y.2
  • 17
    • 84889245941 scopus 로고    scopus 로고
    • Bayesian saliency via low and mid level cues
    • Y. Xie, H. Lu, and M. H. Yang. Bayesian saliency via low and mid level cues. IEEE Trans. on Image Processing, 22(5):1689-1698, 2013.
    • (2013) IEEE Trans. on Image Processing , vol.22 , Issue.5 , pp. 1689-1698
    • Xie, Y.1    Lu, H.2    Yang, M.H.3
  • 19
    • 84866709607 scopus 로고    scopus 로고
    • A non-local cost aggregation method for stereo matching
    • Q. Yang. A non-local cost aggregation method for stereo matching. In Proceedings of IEEE CVPR, pages 1402-1409, 2012.
    • (2012) Proceedings of IEEE CVPR , pp. 1402-1409
    • Yang, Q.1


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