Propagation strategies for stereo image matching based on the dynamic triangle constraint

For the purpose of reliable stereo image matching, this paper discusses a novel propagation strategy of image matching under the dynamic triangle constraint. Firstly, the construction and the dynamic updating method for the corresponding triangulations on the stereo pairs are introduced, which are used as both constraints and carriers during the matching propagation. Then, three propagation strategies: the stochastic propagation, the adjacent propagation based on the topological relationship of triangles, and the self-adaptive propagation, which considers the texture features are proposed. The detailed algorithms of these three propagation strategies are also presented. To compare these strategies, a stereo pair with typic texture features is employed to describe the different propagation manners of these three strategies, and an experimental analysis is illustrated with different aerial stereo pairs. From test results, the following has been found: (1) stochastic propagation gives the worst matching results; (2) self-adaptive propagation performs better than the adjacent propagation by making use of the global “best first” strategy. From these conclusions, the self-adaptive propagation strategy is recommended for reliable stereo image matching under the dynamic triangle constraint.

[1]  J. Gong,et al.  Triangulation of Well-Defined Points as a Constraint for Reliable Image Matching , 2005 .

[2]  Chengke Wu,et al.  Image dense matching based on Delauney triangulation , 1998, Optics & Photonics.

[3]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[4]  Tobias Heuchel Experience in Applying Matching Techniques Using Images from Digital Cameras , 2005 .

[5]  Bo Wu,et al.  A filtering strategy for interest point detecting to improve repeatability and information content , 2007 .

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

[7]  G. P. Otto,et al.  A "Region-Growing" Algorithm for Matching of Terrain Images , 1988, Alvey Vision Conference.

[8]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[10]  M. McCullagh,et al.  Delaunay Triangulation of a Random Data Set for Isarithmic Mapping , 1980 .

[11]  Yi-Ping Hung,et al.  Multipass hierarchical stereo matching for generation of digital terrain models from aerial images , 1998, Machine Vision and Applications.

[12]  Zhengyou Zhang,et al.  A Progressive Scheme for Stereo Matching , 2000, SMILE.

[13]  Maxime Lhuillier,et al.  Efficient Dense Matching for Textured Scenes using Region Growing , 1998, BMVC.

[14]  Long Quan,et al.  Robust dense matching using local and global geometric constraints , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[15]  Qing Zhu,et al.  Digital terrain modeling - principles and methodology , 2004 .

[16]  Digital Photogrammetric Workstations - A review of the state-of-the-art for topographic applications , 2001 .

[17]  Mohan M. Trivedi,et al.  Multi-Primitive Hierarchical (MPH) Stereo Analysis , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  John Rischard Rice,et al.  Mathematical Software , 1971 .

[19]  Qing Zhu,et al.  Seed point selection method for triangle constrained image matching propagation , 2006, IEEE Geoscience and Remote Sensing Letters.

[20]  Chengke Wu,et al.  Dense Stereo Matching Based On Propagation with Voronoi Diagram , 2002, ICVGIP.

[21]  Cordelia Schmid,et al.  Evaluation of Interest Point Detectors , 2000, International Journal of Computer Vision.

[22]  Long Quan,et al.  Match Propagation for Image-Based Modeling and Rendering , 2002, IEEE Trans. Pattern Anal. Mach. Intell..