Ordinal Measures for Image Correspondence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multipass hierarchical stereo matching for generation of digital terrain models form aerial images
Machine Vision and Applications
Depth Discontinuities by Pixel-to-Pixel Stereo
International Journal of Computer Vision
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-resolution real-time stereo on commodity graphics hardware
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast block matching algorithm based on the winner-update strategy
IEEE Transactions on Image Processing
Cost Aggregation and Occlusion Handling With WLS in Stereo Matching
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
We propose a new stereo matching framework based on image bit-plane slicing. A pair of image sequences with various intensity quantization levels constructed by taking different bit-rate of the images is used for hierarchical stereo matching. The basic idea is to use the low bit-rate image pairs to compute rough disparity maps. The hierarchical matching strategy is then performed iteratively to update the low confident disparities with the information provided by extra image bit-planes. Since the disparity computation is carried out on a need-to-know basis, the proposed technique is suitable for remote processing of the images acquired by a mobile camera. Our method provides a hierarchical matching framework and can be combined with the existing stereo matching algorithms. Experiments on Middlebury datasets show that our technique gives good results compared to the conventional full bit-rate matching.