A novel region-based progressive stereo matching algorithm is presented. It combines the strengths of previous region-based and progressive approaches. The progressive framework avoids the time consuming global optimization, while the inherent problem, the sensitivity to early wrong decisions, is significantly alleviated via the region-based representation. A growing-like process matches the regions progressively using a global best-first strategy based on a cost function integrating disparity smoothness and visibility constraint. The performance on standard evaluation platform using various real images shows that the algorithm is among the state-of-the-art both in accuracy and efficiency.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Region-based progressive stereo matching


    Beteiligte:
    Yichen Wei, (Autor:in) / Long Quan, (Autor:in)


    Erscheinungsdatum :

    2004-01-01


    Format / Umfang :

    1005963 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Region-Based Progressive Stereo Matching

    Wei, Y. / Quan, L. / IEEE Computer Society | British Library Conference Proceedings | 2004


    A progressive framework for dense stereo matching

    Jia, B. / Liu, S. / Du, Z. | British Library Online Contents | 2016


    Progressive Linear Search for Stereo Matching and Its Application to Interframe Interpolation

    Aguado, A. S. / Montiel, E. | British Library Online Contents | 2001


    Color Motion Stereo Based on Improved Stereo Matching

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


    Deep Progressive Fusion Stereo Network

    Zeng, Kai / Wang, Yaonan / Zhu, Qing et al. | IEEE | 2022