Numerous algorithms for stereo matching have been developed and thousands of papers have been published over the years, some problems exist in stereo matching still. Aiming at some limits of existing algorithms, a novel stereo matching approach is developed based on multi-peak candidate sets combing with their geometric relationship. Gray cross correlation matching technique is adopted to extract multi-peak candidate correspondence sets. Correspondence is determined based on the local geometric relations between the three feature points and the multi-peak candidates. It could not be guaranteed that all valid correspondences were correct by local geometrical relational test alone. The disparity test and global consistency checkout are applied to eliminate the remaining ambiguous matches that are not removed by the local geometric relational test. Experimental results have shown that the proposed algorithm is feasible and accurate.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-peak Candidate Matches Based Geometric Stereo Matching


    Contributors:


    Publication date :

    2008-05-01


    Size :

    504881 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Fast Edge-Based Stereo Matching and Geometric Parameters

    Moallem, P. / Faez, K. | British Library Online Contents | 2003


    Fast Edge-Based Stereo Matching and Geometric Parameters

    Moallem, P. / Faez, K. | British Library Online Contents | 2003


    Recursive resolving algorithm for multiple stereo and motion matches

    Yi, J. W. / Oh, J.-H. | British Library Online Contents | 1997


    Exploiting local linear geometric structure for identifying correct matches

    Pang, S. / Xue, J. / Tian, Q. et al. | British Library Online Contents | 2014


    Color Motion Stereo Based on Improved Stereo Matching

    Mozerov, M. G. / Choi, T. S. / Ovseyevich, I. A. | British Library Online Contents | 2002