A fast line segment based dense stereo algorithm using tree dynamic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3953 LNCS, Issue , 2006, Pages 201-212

  Deng, Yi ^a   Lin, Xueyin ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SYSTEMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INFORMATION THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

BELIEVE-PROPAGATION METHODS; COMPUTATION SPEED; GRID-BASED ALGORITHMS; INTER-EPIPOLAR LINES;

IMAGE SEGMENTATION;

EID: 33745823173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11744078_16     Document Type: Conference Paper

References (19)

1. Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int'l J. Comput. Vision 47(1) (2002) 7-42 http://cat.middlebury.edu/stereo/.
2. Brown, M.Z., Burschka, D., Hager, G.D.: Advances in computational stereo. IEEE Trans. Pattern Anal. Machine Intell. 25(8) (2003) 993-1008
3. Baker, H., Binford, T.: Depth from edge and intensity based stereo. In: Int'l Joint Conf. on Artificial Intell. Volume 2 of 20-26. (1981) 384-390
4. Cox, I., Hingorani, S., Rao, S., Maggs, B.: A maximum likelyhood stereo algorithm. Computer Vision, Graphics and Image Processing 25(8) (2003) 993-1008
5. Sun, J., Li, Y., Kang, S.B., Shum, H.Y.: Symmetric stereo matching for occlusion handling. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition. Volume 2, (2005) 399-406
6. Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: Proc. IEEE Int'l Conf. on Computer Vision. Volume 2. (2001) 508-515
7. Roy, S.: Stereo without epipolar lines: A maximum-flow formulation. Int'l J. Comput. Vision 24(2/3) (1999) 147-161
8. Geman, S., Geman, D.: Gibbs distributions, and the baysian restoration of images. IEEE Trans. Pattern Anal. Machine Intell. 6 (1984) 721-741
9. Veksler, O.: Stereo correspondenc by dynamic programming on a tree. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition. Volume 2 of 20-26. (2005) 384-390
10. Tao, H., Sawhney, H.S., Kumar, R.: A global matching framework for stereo computation. In: Proc. IEEE Int'l Conf. on Computer Vision. Volume 1. (2001) 532-539
11. Wei, Y., Quan, L.: Region-based progressive stereo matching. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition. Volume 1. (2004) 106-113
12. Hong, L., Chen, G.: Segment-based stereo matching using graph cuts. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition. Volume 1. (2004) 74-81
13. Deng, Y., Yang, Q., Lin, X., Tang, X.: A symmetric patch-based correspondence model for occlusion handling. In: Proc. IEEE Int'l Conf. on Computer Vision. Volume II., Beijing, China, 2005 (2005) 1316-1322
14. Comaniciu, D., Meer, P.: Robust analysis of feature spaces: Color image segmentation. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition, Puerto Rico (1997) 750-755
15. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell. 22(8) (2000) 888-905
16. Stewart, C.V.: Robust parameter estimation in computer vision. SIAM Reviews 41(3) (1999) 513-537
17. Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: Proc. IEEE Int'l Conf. on Computer Vision and Pattern Recognition. Volume 1. (2004) 261-268
18. Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensitive to image sampling. IEEE Trans. Pattern Anal. Machine Intell. 20(4) (1998) 401-406
19. Cox, I.J., Roy, S., Hingorani, S.L.: Dynamic histogram warping of image pairs for constant image brightness. In: Proc. Int'l Conf. on Image Processing. Volume II. (1995) 366-369