匹配算法与的适应加权的立体声多,水平和双向动态编程基于地面控制点(GCP ) 被介绍。到没有失去匹配的精确的减少时间复杂性,使用一多铺平搜索计划,粗糙的匹配在典型不同空间图象被处理,当好匹配在不同偏移量空间被处理时,想象。在上面的水平, GCP 被强制相互的限制和阀值限制的提高的容量的反复的算法获得。在高度可靠的 GCP 的管理下面,双向动态编程框架被采用在优化路径解决矛盾。在底层,到运用时间的还原剂,不同偏移量空间被建议高效地完成稠密的不同图象。另外,适应双支持重量策略被介绍聚集匹配的费用,它考虑光度计、几何的信息。进一步, processing 以后算法能改善在有深度断绝的区域的不同结果并且由用双阀值算法的吸藏相关,在错过立体声的地方,信息从包围区域被代替。表明算法的有效性,我们在场四的二组试验性的结果广泛地使用了标准立体声数据集合包括有另外的方法的性能和比较的讨论,它证明算法有快速度不仅,而且显著地改进整体的优化的效率。
An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points (GCPs) is presented. To decrease time complexity without losing matching precision, using a multilevel search scheme, the coarse matching is processed in typical disparity space image, while the fine matching is processed in disparity-offset space image. In the upper level, GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint. Under the supervision of the highly reliable GCPs, bidirectional dynamic programming framework is employed to solve the inconsistency in the optimization path. In the lower level, to reduce running time, disparity-offset space is proposed to efficiently achieve the dense disparity image. In addition, an adaptive dual support-weight strategy is presented to aggregate matching cost, which considers photometric and geometric information. Further, post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm, where missing stereo information is substituted from surrounding regions. To demonstrate the effectiveness of the algorithm, we present the two groups of experimental results for four widely used standard stereo data sets, including discussion on performance and comparison with other methods, which show that the algorithm has not only a fast speed, but also significantly improves the efficiency of holistic optimization.