A Variable Window Approach to Early Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Stereo with Multiple Windowing
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
SMBV '01 Proceedings of the IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV'01)
Locally Adaptive Support-Weight Approach for Visual Correspondence Search
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Fast variable window for stereo correspondence using integral images
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
MPEG-4 compatible stereoscopic sequence codec for stereo broadcasting
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
A new area-based stereo matching in hierarchical framework is proposed. Local methods generally measure the similarity between the image pixels using local support window. An appropriate support window, where the pixels have similar disparity, should be selected adaptively for each pixel. Our algorithm consists of the following two steps. In the first step, given an estimated initial disparity map, we obtain an object boundary map for distinction of homogeneous/object boundary region. It is based on the assumption that the depth boundary exists inside of intensity boundary. In the second step for improving accuracy, we choose the size and shape of window using boundary information to acquire the accurate disparity map. Generally, the boundary regions are determined by the disparity information, which should be estimated. Therefore, we propose a hierarchical structure for simultaneous boundary and disparity estimation. Finally, we propose post-processing scheme for removal of outliers. The algorithm does not use a complicate optimization. Instead, it concentrates on the estimation of a optimal window for each pixel in improved hierarchical framework, therefore, it is very efficient in computational complexity. The experimental results on the standard data set demonstrate that the proposed method achieves better performance than the conventional methods in homogeneous regions and object boundaries.