This paper proposes a disparity refinement method with stability-based tree. By developing stability-based tree to evaluate and reconstruct support regions for error parts, the proposed method achieves effective performance in removing outliers. This approach further improves the quality of raw disparity map in stereo matching, which makes the local methods results comparable to the global ones. Experiments exhibit that the proposed method reduces more than 70% aggregation time compared with traditional tree method without loss of accuracy. It also outperforms existing disparity refinement methods in removing large error parts.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Disparity refinement with stability-based tree for stereo matching


    Contributors:


    Publication date :

    2015-06-01


    Size :

    1162541 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Dense stereo matching in restricted disparity space

    Hattori, H. / Takeda, N. | IEEE | 2005


    Dense Stereo Matching in Restricted Disparity Space

    Hattori, H. / Takeda, N. / Institute of Electrical and Electronics Engineers | British Library Conference Proceedings | 2005



    Intensity and Feature Based Stereo Matching by Disparity Parameterization

    Wei, G.-Q. / Hirzinger, G. / IEEE; Computer Society | British Library Conference Proceedings | 1998


    Unsupervised Occlusion-Aware Stereo Matching With Directed Disparity Smoothing

    Li, Ang / Yuan, Zejian / Ling, Yonggen et al. | IEEE | 2022