Sparse window local stereo matching

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


    We propose a new local algorithm for dense stereo matching of gray images. This algorithm is a hybrid of the pixel based and the window based matching approach; it uses a subset of pixels from the large window for matching. Our algorithm does not suffer from the common pitfalls of the window based matching. It successfully recovers disparities of the thin objects and preserves disparity discontinuities. The only criterion for pixel selection is the intensity difference with the central pixel. The subset contains only pixels which lay within a fixed threshold from the central gray value. As a consequence of the fixed threshold, a low-textured windows will use a larger percentage of pixels for matching, while textured windows can use just a few. In such manner, this approach also reduces the memory consumption. The cost is calculated as the sum of squared differences normalized to the number of the used pixels. The algorithm performance is demonstrated on the test images from the Middlebury stereo evaluation framework.
    Original languageEnglish
    Title of host publicationProceedings of the International Conference on Computer Vision Theory and Applications (VISAPP-2011)
    Number of pages5
    ISBN (Print)978-989-8425-47-8
    Publication statusPublished - 2011
    Event6th International Conference on Computer Vision Theory and Application, VISAPP 2011 - Vilamoura, Portugal
    Duration: 5 Mar 20117 Mar 2011


    Conference6th International Conference on Computer Vision Theory and Application, VISAPP 2011
    Abbreviated titleVISAPP 2011


    • SCS-Safety
    • Local stereo matching
    • Sparse window matching
    • Sum of squared differences
    • WTA

    Fingerprint Dive into the research topics of 'Sparse window local stereo matching'. Together they form a unique fingerprint.

    Cite this