A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
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.
Unable to display preview. Download preview PDF.
- 3.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)Google Scholar
- 4.Cox, I., Hingorani, S., Rao, S., Maggs, B.: A maximum likelyhood stereo algorithm. Computer Vision, Graphics and Image Processing 25(8), 993–1008 (2003)Google Scholar
- 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, vol. 2, pp. 399–406 (2005)Google Scholar
- 6.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)Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar
- 11.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)Google Scholar
- 12.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)Google Scholar
- 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, Beijing, China, vol. II, pp. 1316–1322 (2005)Google Scholar
- 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, pp. 750–755 (1997)Google Scholar
- 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, vol. 1, pp. 261–268 (2004)Google Scholar
- 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, vol. II, pp. 366–369 (1995)Google Scholar