Dense Stereo Matching with Application to Augmented Reality

This work presents two techniques for computing dense disparity maps from two or more images. These methods are exploited in an application of augmented reality in order to add a virtual object with proper occlusions in the real scene. The proposed stereo matching techniques are based on area matching. We first present an implementation of the dynamic programming which produces a high quality of dense disparity map. Furthermore, in order to improve both the time computing and the map quality, we propose a hierarchical approach which combines the multi-resolution and the dynamic programming. The disparity maps thus obtained are applied in augmented reality in order to integrate in a realistic way the virtual objects. The applicability of the method is shown on many sequences of images.

[1]  Hai Tao,et al.  Global matching criterion and color segmentation based stereo , 2000, Proceedings Fifth IEEE Workshop on Applications of Computer Vision.

[2]  Frederic Devernay.  A Non-Maxima Suppression Method for Edge Detection with Sub-Pixel Accuracy , 1995 .

[3]  Reinhard Männer,et al.  Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation , 2004, International Journal of Computer Vision.

[4]  Emanuele Trucco,et al.  A compact algorithm for rectification of stereo pairs , 2000, Machine Vision and Applications.

[5]  Walter G. Kropatsch.  Properties of Pyramidal Representations , 1994, Theoretical Foundations of Computer Vision.

[6]  Oliver Schreer,et al.  Fast Hybrid Block- and Pixel- Recursive Disparity Analysis for Real-Time Applications in Immersive Tele-Conference Scenarios , 2001, WSCG.

[7]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Theodosios Pavlidis,et al.  A hierarchical data structure for picture processing , 1975 .

[9]  QU GeorgesM.  IMAGE MATCHING USING DYNAMIC PROGRAMMING APPLICATION TO STEREOVISION AND IMAGE INTERPOLATION , 1996 .

[10]  Aaron F. Bobick,et al.  Large Occlusion Stereo , 1999, International Journal of Computer Vision.

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[13]  D. Scharstein,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).