메뉴 건너뛰기




Volumn 2015 International Conference on Computer Vision, ICCV 2015, Issue , 2015, Pages 221-2227

MAP disparity estimation using hidden markov trees

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER VISION; CONTROL SYSTEM ANALYSIS; MESSAGE PASSING; PIXELS; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

EID: 84973860966     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2015.256     Document Type: Conference Paper
Times cited : (28)

References (28)
  • 1
    • 84973862494 scopus 로고    scopus 로고
    • A global stereo model with mesh alignment regularization for view interpolation
    • 6 Anonymous
    • Anonymous. A global stereo model with mesh alignment regularization for view interpolation. Listed on the Middlebury stereo benchmark, 2015. 6
    • (2015) Listed on the Middlebury Stereo Benchmark
  • 2
    • 84973880011 scopus 로고    scopus 로고
    • Using local cues to improve dense stereo matching
    • 6 Anonymous
    • Anonymous. Using local cues to improve dense stereo matching. Listed on the Middlebury stereo benchmark, 2015. 6
    • (2015) Listed on the Middlebury Stereo Benchmark
  • 3
    • 57549092581 scopus 로고    scopus 로고
    • Simple but effective tree structures for dynamic programming-based stereo matching
    • 1, 2, 4, 7, 8
    • M. Bleyer and M. Gelautz. Simple but effective tree structures for dynamic programming-based stereo matching. In In VISAPP, pages 415-422, 2008. 1, 2, 4, 7, 8
    • (2008) VISAPP , pp. 415-422
    • Bleyer, M.1    Gelautz, M.2
  • 5
    • 84884591215 scopus 로고    scopus 로고
    • Information permeability for stereo matching
    • 6, Oct.
    • C. Cigla and A. A. Alatan. Information permeability for stereo matching. Signal Processing: Image Communication, 28 (9): 1072-1088, Oct. 2013. 6
    • (2013) Signal Processing: Image Communication , vol.28 , Issue.9 , pp. 1072-1088
    • Cigla, C.1    Alatan, A.A.2
  • 6
    • 4344665182 scopus 로고    scopus 로고
    • Computational methods for hidden Markov tree models-an application to wavelet trees
    • 2, 3, Sept.
    • J.-B. Durand, P. Goncalves, and Y. Guedon. Computational methods for hidden Markov tree models-an application to wavelet trees. IEEE Transactions on Signal Processing, 52 (9): 2551-2560, Sept. 2004. 2, 3
    • (2004) IEEE Transactions on Signal Processing , vol.52 , Issue.9 , pp. 2551-2560
    • Durand, J.-B.1    Goncalves, P.2    Guedon, Y.3
  • 8
    • 0015600423 scopus 로고
    • The viterbi algorithm
    • 2, Mar
    • J. Forney, G. D. The viterbi algorithm. Proceedings of the IEEE, 61 (3): 268-278, Mar. 1973. 2
    • (1973) Proceedings of the IEEE , vol.61 , Issue.3 , pp. 268-278
    • Forney, J.G.D.1
  • 9
    • 37549015676 scopus 로고    scopus 로고
    • Stereo processing by semiglobal matching and mutual information
    • 1, 2, 4, 6, 7, 8, Feb.
    • H. Hirschmuller. Stereo Processing by Semiglobal Matching and Mutual Information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30 (2): 328-341, Feb. 2008. 1, 2, 4, 6, 7, 8
    • (2008) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.30 , Issue.2 , pp. 328-341
    • Hirschmuller, H.1
  • 12
    • 33750129298 scopus 로고    scopus 로고
    • Convergent tree-reweighted message passing for energy minimization
    • 2, Oct.
    • V. Kolmogorov. Convergent Tree-Reweighted Message Passing for Energy Minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28 (10): 1568-1583, Oct. 2006. 2
    • (2006) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.28 , Issue.10 , pp. 1568-1583
    • Kolmogorov, V.1
  • 13
    • 84872319772 scopus 로고    scopus 로고
    • Real-time stereo matching on CUDA using an iterative refinement method for adaptive support-weight correspondences
    • 6, Jan.
    • J. Kowalczuk, E. Psota, and L. Perez. Real-Time Stereo Matching on CUDA Using an Iterative Refinement Method for Adaptive Support-Weight Correspondences. IEEE Transactions on Circuits and Systems for Video Technology, 23 (1): 94-104, Jan. 2013. 6
    • (2013) IEEE Transactions on Circuits and Systems for Video Technology , vol.23 , Issue.1 , pp. 94-104
    • Kowalczuk, J.1    Psota, E.2    Perez, L.3
  • 14
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • 3, Feb.
    • J. B. Kruskal, Jr. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society, 7 (1): 48-50, Feb. 1956. 3
    • (1956) Proceedings of the American Mathematical Society , vol.7 , Issue.1 , pp. 48-50
    • Kruskal, J.B.1
  • 15
    • 7044232895 scopus 로고
    • The minimum spanning tree problem on a planar graph
    • 6, Mar.
    • T. Matsui. The minimum spanning tree problem on a planar graph. Discrete Applied Mathematics, 58 (1): 91-94, Mar. 1995. 6
    • (1995) Discrete Applied Mathematics , vol.58 , Issue.1 , pp. 91-94
    • Matsui, T.1
  • 20
    • 0036537472 scopus 로고    scopus 로고
    • A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
    • 1, 5, Apr.
    • D. Scharstein and R. Szeliski. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. International Journal of Computer Vision, 47 (1-3): 7-42, Apr. 2002. 1, 5
    • (2002) International Journal of Computer Vision , vol.47 , Issue.1-3 , pp. 7-42
    • Scharstein, D.1    Szeliski, R.2
  • 26
    • 84867863845 scopus 로고    scopus 로고
    • Recursive bilateral filtering
    • 7, 8 A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato, and C. Schmid, editors,. Springer Berlin Heidelberg
    • Q. Yang. Recursive Bilateral Filtering. In A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato, and C. Schmid, editors, Computer Vision-ECCV 2012, number 7572 in Lecture Notes in Computer Science, pages 399-413. Springer Berlin Heidelberg, 2012. 7, 8
    • (2012) Computer Vision-ECCV 2012, Number 7572 in Lecture Notes in Computer Science , pp. 399-413
    • Yang, Q.1
  • 28
    • 85010188314 scopus 로고
    • Non-parametric local transforms for computing visual correspondence
    • 5 J.-O. Eklundh, editor. Springer Berlin Heidelberg
    • R. Zabih and J. Woodfill. Non-parametric local transforms for computing visual correspondence. In J.-O. Eklundh, editor, Computer Vision-ECCV '94, number 801 in Lecture Notes in Computer Science, pages 151-158. Springer Berlin Heidelberg, 1994. 5
    • (1994) Computer Vision-ECCV '94, Number 801 in Lecture Notes in Computer Science , pp. 151-158
    • Zabih, R.1    Woodfill, J.2


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