A novel algorithm is proposed for solving the overlapped marker matching issues and satisfying speed requirement in a 3D video motion capture system. Firstly, the mean markers' longitudinal coordination difference in two parallel cameras is calculated to reduce 3D matching error. Secondly, the epipolar geometry restriction is used to make the corresponding marker be restricted in a line. Finally, integrating the mean vertical coordination difference and the epipolar geometry restriction, the searching region of the corresponding marker is reduced to the neighborhood of one estimated point. Consequently, the matching speed is improved greatly due to the reduced searching region. The clustering algorithm and the minimum of the weighted distance are used to obtain the accurate matching points. Several experiments results verify the effectiveness of our algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Fast and Accurate Stereo Matching Algorithm Based on Epipolar lLne Restriction


    Contributors:
    Han, Wei (author) / Zheng, Jiang-bin (author) / Li, Xiu-xiu (author)


    Publication date :

    2008-05-01


    Size :

    614976 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Stereo Matching for Binocular Underwater Images Using SURF Operator and Epipolar Restriction

    Wang, N. / Peng, B.b. / Zhu, D. et al. | British Library Conference Proceedings | 2014


    Stereo Matching for Binocular Underwater Images Using SURF Operator and Epipolar Restriction

    Wang, Nengjun / Peng, Bin bin / Zhu, Daqi et al. | Springer Verlag | 2014


    Feature-based Stereo Matching via Coevolution of Epipolar Subproblems

    Goulermas, J. Y. / Liatsis, P. / Institution of Electrical Engineers et al. | British Library Conference Proceedings | 1999



    Stereo Without Epipolar Lines: A Maximum-Flow Formulation

    Roy, S. | British Library Online Contents | 1999