PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Stereo Matching Using Population-Based MCMC
International Journal of Computer Vision
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
International Journal of Computer Vision
A stereo algorithm using edge-based orthogonal dynamic programming
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
A convex optimization approach for depth estimation under illumination variation
IEEE Transactions on Image Processing
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Stereo matching using population-based MCMC
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Dense disparity MAP representations for stereo image coding
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A fast stereo matching algorithm suitable for embedded real-time systems
Computer Vision and Image Understanding
Comparison of two algorithms for 3D skin reconstruction
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Stereo matching using scanline disparity discontinuity optimization
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Graph-based multi-resolution temporal-based face reconstruction
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
A fast line segment based dense stereo algorithm using tree dynamic programming
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
PMA: Pixel-based multi-anchor algorithm for image recognition on multi-core systems
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
Two stages stereo dense matching algorithm for 3d skin micro-surface reconstruction
MMM'10 Proceedings of the 16th international conference on Advances in Multimedia Modeling
Stereo matching using weighted dynamic programming on a single-direction four-connected tree
Computer Vision and Image Understanding
An optimal time---space algorithm for dense stereo matching
Journal of Real-Time Image Processing
Analytical dynamic programming matching
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
A segmentation-free method for image classification based on pixel-wise matching
Journal of Computer and System Sciences
A hybrid genetic approach for stereo matching
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Information permeability for stereo matching
Image Communication
Hi-index | 0.00 |
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art because the vertical consistency between the scanlines is not enforced. We re-examine the use of dynamic programming for stereo correspondence by applying it to a tree structure, as opposed to the individual scanlines. The nodes of this tree are all the image pixels, but only the "most important" edges of the 4 connected neighbourhood system are included. Thus our algorithm is truly a global optimization method because disparity estimate at one pixel depends on the disparity estimates at all the other pixels, unlike the scanline based methods. We evaluate our algorithm on the benchmark Middlebury database. The algorithm is very fast, it takes only a fraction of a second for a typical image. The results are considerably better than that of the scanline based methods. While the results are not the state of the art, our algorithm offers a good trade off in terms of accuracy and computational efficiency.