A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Parameter Estimation in Computer Vision
SIAM Review
Stereo Without Epipolar Lines: A Maximum-Flow Formulation
International Journal of Computer Vision - Special issue on computer vision research at NEC Research Institute
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Robust analysis of feature spaces: color image segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Dynamic histogram warping of image pairs for constant image brightness
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Advances in Computational Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo Correspondence by Dynamic Programming on a Tree
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Symmetric Stereo Matching for Occlusion Handling
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Depth from edge and intensity based stereo
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
MSLD: A robust descriptor for line matching
Pattern Recognition
A convex optimization approach for depth estimation under illumination variation
IEEE Transactions on Image Processing
Stereo vision enabling precise border localization within a scanline optimization framework
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Feature vector field and feature matching
Pattern Recognition
Real-time stereo on GPGPU using progressive multi-resolution adaptive windows
Image and Vision Computing
Image content based curve matching using HMCD descriptor
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part III
Stereo matching using weighted dynamic programming on a single-direction four-connected tree
Computer Vision and Image Understanding
A hybrid genetic approach for stereo matching
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
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.