Local Stereo Matching Using Adaptive Local Segmentation

    Research output: Contribution to journalArticleAcademicpeer-review

    81 Downloads (Pure)

    Abstract

    We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The preprocessing step smoothes low textured areas and sharpens texture edges, whereas the postprocessing step detects and recovers occluded and unreliable disparities. The algorithm achieves high stereo reconstruction quality in regions with uniform intensities as well as in textured regions. The algorithm is robust against local radiometrical differences; and successfully recovers disparities around the objects edges, disparities of thin objects, and the disparities of the occluded region. Moreover, our algorithm intrinsically prevents errors caused by occlusion to propagate into nonoccluded regions. It has only a small number of parameters. The performance of our algorithm is evaluated on the Middlebury test bed stereo images. It ranks highly on the evaluation list outperforming many local and global stereo algorithms using color images. Among the local algorithms relying on the fronto-parallel assumption, our algorithm is the best ranked algorithm. We also demonstrate that our algorithm is working well on practical examples as for disparity estimation of a tomato seedling and a 3D reconstruction of a face.
    Original languageUndefined
    Article number163285
    Pages (from-to)163285
    Number of pages15
    JournalISRN machine vision
    Volume2012
    Issue number163285
    DOIs
    Publication statusPublished - Mar 2012

    Keywords

    • EWI-22043
    • SCS-Safety
    • Image Processing
    • IR-80857
    • stereo matching
    • METIS-291841
    • Segmentation

    Cite this