In this paper we describe a new stereo correspondence method. This method was proposed for a mobile robot navigation context. The proposed method is based on the work of Oliveira and Wazlavick originally presented in [1]. The original method has a low computational complexity (O(n)), where n is the number of pixels in the image. Despite the low computation time, this method achieves only an average score in the Middlebury evaluation [2], [3] concerning the obtained disparity map. In order to improve this score, we propose a new algorithm based on the original approach combined to a segmentation procedure called Color Structure Code [4]. This new algorithm is able to improve the results without adding significant processing time, and keeping the computational complexity of O(n). The proposed approach is able to calculate 10+ stereo frames per second in a single threaded CPU.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Linear-Time Computation of Segment-Based Stereo Correspondence


    Beteiligte:


    Erscheinungsdatum :

    01.03.2013


    Format / Umfang :

    522695 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Geometry of Contour-Based Correspondence for Stereo

    Zucker, S. / Li, G. | British Library Conference Proceedings | 2002


    Segment-based stereo matching using graph cuts

    Li Hong, / Chen, G. | IEEE | 2004


    Segment-Based Stereo Matching Using Graph Cuts

    Hong, L. / Chen, G. / IEEE Computer Society | British Library Conference Proceedings | 2004


    Contextual Inference in Contour-Based Stereo Correspondence

    Li, G. / Zucker, S. W. | British Library Online Contents | 2006


    Adaptive Search Region Fast Area-Based Stereo Correspondence

    Guo, Longyuan / Xia, Yongquan / Yang, Jingyu | IEEE | 2008