Abstract
Stereo correspondence is one of the most promising research areas in stereo vision. In order to solve the problem that there are large areas of similar gray-scale region and the time-consuming of the dense reconstruction, the contour of stereo pairs was extracted to reconstruct the scene. To reduce the noise which may lead to incorrect results during the stereo matching, a stereo matching algorithm based on the dynamic programming is proposed in the paper. Based on the reasonable and commonly assumption that the disparity of the scene is always smooth, the stereo matching algorithm puts a restraint on the disparity map and applies the dynamic algorithm on the disparity space image (DSI) to obtain the optimal disparity of the contour. Since the sum of points needed to be computed is greatly reduced, the algorithm could implement the stereo correspondence with high speed and matching rate than dense reconstruction could.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.