A 3D Reconstruction Method Based on Images Dense Stereo Matching

A new 3D reconstruction method based on image dense stereo matching is proposed in this paper. Firstly, the feature-points of stereo images must be extracted by SIFT algorithm and they are matched through similarity constraints. The second step is to select seed points which determine the performance of the algorithm and then we can do dense matching with these seed points. Afterward, the false matches can be eliminated by Symmetrical epipolar distance algorithm and the 3D points coordinates can be calculated in virtue of camera matrix. Finally, the 3D model can be established by Delauny triangulation and texture mapping. Experimental results show that the new method based on dense stereo matching can optimize existing 3D reconstruction method. Moreover, the efficiency and accuracy of the method are both better than those traditional methods based on dense matching.

[1]  Rachid Deriche,et al.  A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry , 1995, Artif. Intell..

[2]  Andrew Blake,et al.  Efficient Dense Stereo with Occlusions for New View-Synthesis by Four-State Dynamic Programming , 2006, International Journal of Computer Vision.

[3]  Luc Van Gool,et al.  Dense matching of multiple wide-baseline views , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

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

[5]  Matthijs C. Dorst Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[6]  Takeo Kanade,et al.  A Cooperative Algorithm for Stereo Matching and Occlusion Detection , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Ingemar J. Cox,et al.  A maximum-flow formulation of the N-camera stereo correspondence problem , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

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

[9]  Zezhi Chen,et al.  Image dense matching based on region growth with adaptive window , 2002, Pattern Recognit. Lett..