.png){kind=icon}
.png){kind=icon}
Return
Efficient contrast invariant stereo correspondence using dynamic programming with vertical constraint
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-007-0177-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a dense stereo algorithm based on the census transform and improved dynamic programming (DP). Traditional scanline-based DP algorithms are the most efficient ones among global algorithms, but are well-known to be affected by the streak effect. To solve this problem, we improve the traditional three-state DP algorithm by taking advantage of an extended version of sequential vertical consistency constraint. Using this method, we increase the accuracy of the disparity map greatly. Optimizations have been made so that the computational cost is only increased by about 20%, and the additional memory needed for the improvement is negligible. Experimental results show that our algorithm outperforms many state-of-the-art algorithms with similar efficiency on Middlebury College's stereo Web site. Besides, the algorithm is robust enough for image pairs with utterly different contrasts by using of census transform as the basic match metric.
Keywords:
stereo correspondence
dynamic programming
vertical constraint
computer vision
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
Organization
No organization information available