Abstract

Supervised stereo matching costs need to learn model parameters from public datasets with ground truth disparity maps. However, it is not so easy to obtain the ground truth disparity maps, thus making the supervised stereo matching costs difficult to apply in practice. This paper proposes an unsupervised stereo matching cost based on sparse representation (USMCSR). This method does not rely on the ground truth disparity maps, besides, it also can reduce the effects of the illumination and exposure changes, thus making it suitable for measuring similarity between pixels in stereo matching. In order to achieve higher computational efficiency, we further propose an efficient parallel method for solving sparse representation coefficients. The extended experimental results on three commonly used datasets demonstrate the effectiveness of the proposed method. Finally, the verification results on the monocular video clip show the USMCSR can also work well without ground truth disparity maps.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.