Abstract
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers have already proposed several grid-based algorithms for fully utilizing information embodied in both intra- and inter-epipolar lines. Though their performances are greatly improved, they are very time-consuming. The new graph-cut and believe-propagation methods have made the grid-based algorithms more efficient, but time-consuming still remains a hard problem for many applications. Recently, a tree dynamic programming algorithm is proposed. Though the computation speed is much higher than that of grid-based methods, the performance is degraded apparently. We think that the problem stems from the pixel-based tree construction. Many edges in the original grid are forced to be cut out, and much information embedded in these edges is thus lost. In this paper, a novel line segment based stereo correspondence algorithm using tree dynamic programming (LSTDP) is presented. Each epipolar line of the reference image is segmented into segments first, and a tree is then constructed with these line segments as its vertexes. The tree dynamic programming is adopted to compute the correspondence of each line segment. By using line segments as the vertexes instead of pixels, the connection between neighboring pixels within the same region can be reserved as completely as possible. Experimental results show that our algorithm can obtain comparable performance with state-of-the-art algorithms but is much more time-efficient.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int’l J. Comput. Vision 47(1), 7–42 (2002), http://cat.middlebury.edu/stereo/
Brown, M.Z., Burschka, D., Hager, G.D.: Advances in computational stereo. IEEE Trans. Pattern Anal. Machine Intell. 25(8), 993–1008 (2003)
Baker, H., Binford, T.: Depth from edge and intensity based stereo. In: Int’l Joint Conf. on Artificial Intell., vol. 2, pp. 384–390 (1981)
Cox, I., Hingorani, S., Rao, S., Maggs, B.: A maximum likelyhood stereo algorithm. Computer Vision, Graphics and Image Processing 25(8), 993–1008 (2003)
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, vol. 2, pp. 399–406 (2005)
Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: Proc. IEEE Int’l Conf. on Computer Vision, vol. 2, pp. 508–515 (2001)
Roy, S.: Stereo without epipolar lines: A maximum-flow formulation. Int’l J. Comput. Vision 24(2/3), 147–161 (1999)
Geman, S., Geman, D.: Gibbs distributions, and the baysian restoration of images. IEEE Trans. Pattern Anal. Machine Intell. 6, 721–741 (1984)
Veksler, O.: Stereo correspondenc by dynamic programming on a tree. In: Proc. IEEE Int’l Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 384–390 (2005)
Tao, H., Sawhney, H.S., Kumar, R.: A global matching framework for stereo computation. In: Proc. IEEE Int’l Conf. on Computer Vision, vol. 1, pp. 532–539 (2001)
Wei, Y., Quan, L.: Region-based progressive stereo matching. In: Proc. IEEE Int’l Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 106–113 (2004)
Hong, L., Chen, G.: Segment-based stereo matching using graph cuts. In: Proc. IEEE Int’l Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 74–81 (2004)
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, Beijing, China, vol. II, pp. 1316–1322 (2005)
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, pp. 750–755 (1997)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell. 22(8), 888–905 (2000)
Stewart, C.V.: Robust parameter estimation in computer vision. SIAM Reviews 41(3), 513–537 (1999)
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: Proc. IEEE Int’l Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 261–268 (2004)
Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensitive to image sampling. IEEE Trans. Pattern Anal. Machine Intell. 20(4), 401–406 (1998)
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, vol. II, pp. 366–369 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, Y., Lin, X. (2006). A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming. In: Leonardis, A., Bischof, H., Pinz, A. (eds) Computer Vision – ECCV 2006. ECCV 2006. Lecture Notes in Computer Science, vol 3953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11744078_16
Download citation
DOI: https://doi.org/10.1007/11744078_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33836-9
Online ISBN: 978-3-540-33837-6
eBook Packages: Computer ScienceComputer Science (R0)