基于区域增长的自适应稠密匹配算法

Adaptive image dense stereo matching based on region growing

针对目前主流方法对图像中纹理单一区域匹配效果不佳的问题,提出了一种自适应的基于区域增长的立体像对稠密匹配算法。该算法利用灰度共生矩阵,在区域增长过程中的匹配窗内计算其纹理数量,然后根据纹理数量的多少自适应调节匹配窗的大小。当匹配窗内纹理数量足够多时,该匹配窗就能够表征该匹配窗中心点的特征,因此可以减少误匹配发生的几率。实验结果证明,该算法具有良好的性能。

For the current mainstream method has a bad result to image low textured areas,an adaptive stereo dense matching algorithm is proposed based on region growing technique. GLCM is used in the regional growth process matching window to calcu- late the number of texture which can be used to adjust the matching window size adaptively. When the nmnber of texture in matching window is enough,the matching window will be able to discriminate the characteristics of the center of the window, which helps reduce the prohability of occurrence of false matches.Experimental results show that the algorithm has good performance.