Resolution enhancement for binocular stereo

Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information at a higher resolution (HR). We draw on the image formation model from the motion super-resolution domain to relate HR disparity and the observations. This approach estimates both the HR disparity and HR intensity. We minimize a suitably constructed cost function using graph cuts and iterated conditional modes (ICM) for disparity and intensity, respectively.

[1]  Stan Z. Li,et al.  Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.

[2]  Richard Szeliski,et al.  Handling occlusions in dense multi-view stereo , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[3]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Heung-Yeung Shum,et al.  Fundamental limits of reconstruction-based superresolution algorithms under local translation , 2004 .

[5]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[6]  Long Quan,et al.  Asymmetrical occlusion handling using graph cut for multi-view stereo , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[7]  J. Nagy,et al.  Numerical methods for coupled super-resolution , 2006 .

[8]  A. Rajagopalan,et al.  Robust space-variant super-resolution , 2006 .

[9]  Liangpei Zhang,et al.  A MAP Approach for Joint Motion Estimation, Segmentation, and Super Resolution , 2007, IEEE Transactions on Image Processing.

[10]  Sébastien Roy,et al.  Non-Uniform Hierarchical Geo-consistency for Multi-baseline Stereo , 2007, Fourth Canadian Conference on Computer and Robot Vision (CRV '07).