摘要
An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a multi-extrema optimization problem such that finding the fittest solution from a set of potential disparity maps. Among a wide variety of optimization techniques, GAs are proven to be potentially effective methods for the global optimization problems with large search space. With this idea, each disparity map is viewed as an individual and the disparity values are encoded as chromosomes, so each individual has lots of chromosomes in the approach. Then, several matching constraints are formulated into an objective function, and GAs are used to search the global optimal solution for the problem. Furthermore, the coarse-to-fine strategy has been embedded in the approach so as to reduce the matching ambiguity and the time consumption. Finally, experimental results on synthetic and real images show the performance of the work.
提出了一种利用遗传算法解决立体匹配问题的方法以获得稠密的视差图。与以往方法不同 ,本文将立体匹配问题看作一种多极值的优化问题——从一组可能的视差图中找到最合适的一个。在大量的优化算法中 ,已经证明对于具有广阔搜索空间的全局优化问题 ,遗传算法是一种潜在的有效方法。从这个思想出发 ,本文把每一个视差图看作是一个进化个体 ,并把视差值作为染色体进行编码 ,因此该算法中 ,一个个体将会包含大量的染色体。然后 ,把一些匹配约束转化形成目标函数 ,利用遗传算法去搜索待解决问题的全局最优解。另外 ,为了减少匹配上的不确定性以及时间消耗 ,文中还采用了从粗糙到细致的层次化匹配策略 ( coarse-to-fine strategy)。最后给出合成图与真实图的匹配实验结果 。
