메뉴 건너뛰기




Volumn 37, Issue 4, 2015, Pages 834-846

Stereo matching using tree filtering

Author keywords

bilateral filtering; edge preserving smoothing; minimum spanning tree; Stereo matching

Indexed keywords

AGGREGATES; COSTS; IMAGE MATCHING; IMAGE SEGMENTATION; MEDIAN FILTERS; PIXELS; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

EID: 84924611154     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2014.2353642     Document Type: Article
Times cited : (202)

References (35)
  • 1
    • 84924536259 scopus 로고    scopus 로고
    • [Online]. Available:
    • The Book Arrival data set [Online]. Available: http://sp.cs.tut.fi/mobile3dtv/stereo-video/, 2009.
    • (2009) The Book Arrival Data Set
  • 2
    • 23744452484 scopus 로고    scopus 로고
    • A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPS)
    • D. Bader and G. Cong, "A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPS), " J. Parallel Distrib. Comput., vol. 65, pp. 994-1006, 2005.
    • (2005) J. Parallel Distrib. Comput. , vol.65 , pp. 994-1006
    • Bader, D.1    Cong, G.2
  • 3
    • 57549092581 scopus 로고    scopus 로고
    • Simple but effective tree structures for dynamic programming-based stereo matching
    • M. Bleyer and M. Gelautz, "Simple but effective tree structures for dynamic programming-based stereo matching, " in Proc. Int. Conf. Comput. Vis. Theory Appl., 2008, pp. 415-422.
    • (2008) Proc. Int. Conf. Comput. Vis. Theory Appl. , pp. 415-422
    • Bleyer, M.1    Gelautz, M.2
  • 5
    • 0035509961 scopus 로고    scopus 로고
    • Fast approximate energy minimization via graph cuts
    • Nov.
    • Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
    • (2001) IEEE Trans. Pattern Anal. Mach. Intell. , vol.23 , Issue.11 , pp. 1222-1239
    • Boykov, Y.1    Veksler, O.2    Zabih, R.3
  • 6
    • 0000428085 scopus 로고
    • Finding minimum spanning trees
    • D. Cheriton and R. E. Tarjan, "Finding minimum spanning trees, " SIAM J. Comput., vol. 5, pp. 724-742, 1976.
    • (1976) SIAM J. Comput. , vol.5 , pp. 724-742
    • Cheriton, D.1    Tarjan, R.E.2
  • 8
    • 80455165740 scopus 로고    scopus 로고
    • Optimizing software in C++: An optimization guide for Windows
    • Agner Fog, Optimizing software in C++: An optimization guide for Windows, Linux and Mac platforms, 2011.
    • (2011) Linux and Mac Platforms
    • Fog, A.1
  • 12
    • 37549015676 scopus 로고    scopus 로고
    • Stereo processing by semi-global matching and mutual information
    • Feb.
    • H. Hirschmueller, "Stereo processing by semi-global matching and mutual information, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 2, pp. 328-341, Feb. 2008.
    • (2008) IEEE Trans. Pattern Anal. Mach. Intell. , vol.30 , Issue.2 , pp. 328-341
    • Hirschmueller, H.1
  • 15
    • 84887322636 scopus 로고    scopus 로고
    • Patchmatch filter: Efficient edge-aware filtering meets randomized search for fast correspondence field estimation
    • J. Lu, H. Yang, D. Min, L. Lin, and M. Do, "Patchmatch filter: Efficient edge-aware filtering meets randomized search for fast correspondence field estimation, " in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2013, pp. 1854-1861.
    • (2013) Proc. IEEE Conf. Comput. Vis. Pattern Recog. , pp. 1854-1861
    • Lu, J.1    Yang, H.2    Min, D.3    Lin, L.4    Do, M.5
  • 16
    • 7044232895 scopus 로고
    • The minimum spanning tree problem on a planar graph
    • T. Matsui, "The minimum spanning tree problem on a planar graph, " Discrete Appl. Math., vol. 58, pp. 91-94, 1995.
    • (1995) Discrete Appl. Math. , vol.58 , pp. 91-94
    • Matsui, T.1
  • 17
    • 84883146246 scopus 로고    scopus 로고
    • Joint histogram-based cost aggregation for stereo matching
    • Oct.
    • D. Min, J. Lu, and M. Do, "Joint histogram-based cost aggregation for stereo matching, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 10, pp. 2539-2545, Oct. 2013.
    • (2013) IEEE Trans. Pattern Anal. Mach. Intell. , vol.35 , Issue.10 , pp. 2539-2545
    • Min, D.1    Lu, J.2    Do, M.3
  • 18
    • 84863142594 scopus 로고    scopus 로고
    • Depth video enhancement based on weighted mode filtering
    • Mar.
    • D. Min, J. Lu, and M. N. Do, "Depth video enhancement based on weighted mode filtering, " IEEE Trans. Image Process., vol. 21, no. 10, pp. 1176-1190, Mar. 2012.
    • (2012) IEEE Trans. Image Process. , vol.21 , Issue.10 , pp. 1176-1190
    • Min, D.1    Lu, J.2    Do, M.N.3
  • 19
    • 58049134708 scopus 로고    scopus 로고
    • A fast approximation of the bilateral filter using a signal processing approach
    • Jan.
    • S. Paris and F. Durand, "A fast approximation of the bilateral filter using a signal processing approach, " Int. J. Comput. Vis., vol. 81, pp. 24-52, Jan. 2009.
    • (2009) Int. J. Comput. Vis. , vol.81 , pp. 24-52
    • Paris, S.1    Durand, F.2
  • 20
    • 34548228971 scopus 로고    scopus 로고
    • Median filtering in constant time
    • Sep.
    • S. Perreault and P. Hebert, "Median filtering in constant time, " IEEE Trans. Image Process., vol. 16, no. 9, pp. 2389-2394, Sep. 2007.
    • (2007) IEEE Trans. Image Process. , vol.16 , Issue.9 , pp. 2389-2394
    • Perreault, S.1    Hebert, P.2
  • 24
    • 0036537472 scopus 로고    scopus 로고
    • A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
    • D. Scharstein, and R. Szeliski, "A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, " Int. J. Comput. Vis., vol. 47, pp. 7-42, 2002.
    • (2002) Int. J. Comput. Vis. , vol.47 , pp. 7-42
    • Scharstein, D.1    Szeliski, R.2
  • 27
    • 24644500353 scopus 로고    scopus 로고
    • Stereo correspondence by dynamic programming on a tree
    • O. Veksler, "Stereo correspondence by dynamic programming on a tree, " in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2005, pp. 384-390.
    • (2005) Proc. IEEE Conf. Comput. Vis. Pattern Recog. , pp. 384-390
    • Veksler, O.1
  • 28
    • 2142812371 scopus 로고    scopus 로고
    • Robust real-time face detection
    • P. Viola and M. Jones, "Robust real-time face detection, " Int. J. Comput. Vis., vol. 57, no. 2, pp. 137-154, 2003.
    • (2003) Int. J. Comput. Vis. , vol.57 , Issue.2 , pp. 137-154
    • Viola, P.1    Jones, M.2
  • 29
    • 84866709607 scopus 로고    scopus 로고
    • A non-local cost aggregation method for stereo matching
    • Q. Yang, "A non-local cost aggregation method for stereo matching, " in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2012, pp. 1402-1409.
    • (2012) Proc. IEEE Conf. Comput. Vis. Pattern Recog. , pp. 1402-1409
    • Yang, Q.1
  • 31
    • 84900547861 scopus 로고    scopus 로고
    • Hardware-efficient bilateral filtering for stereo matching
    • May
    • Q. Yang, "Hardware-efficient bilateral filtering for stereo matching, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 36, no. 5, pp. 1026-1032, May 2014.
    • (2014) IEEE Trans. Pattern Anal. Mach. Intell. , vol.36 , Issue.5 , pp. 1026-1032
    • Yang, Q.1
  • 34
  • 35
    • 33144482417 scopus 로고    scopus 로고
    • Adaptive support-weight approach for correspondence search
    • Apr.
    • K.-J. Yoon and I.-S. Kweon, "Adaptive support-weight approach for correspondence search, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 4, pp. 650-656, Apr. 2006.
    • (2006) IEEE Trans. Pattern Anal. Mach. Intell. , vol.28 , Issue.4 , pp. 650-656
    • Yoon, K.-J.1    Kweon, I.-S.2


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