作者: Chengke Wu , Hung-Tat Tsui , Li Tang
DOI:
关键词: Power diagram 、 Blossom algorithm 、 Weighted Voronoi diagram 、 Matching (graph theory) 、 Centroidal Voronoi tessellation 、 Voronoi diagram 、 Artificial intelligence 、 Feature (computer vision) 、 Mathematics 、 Pattern recognition 、 Real image
摘要: A new dense matching algorithm is proposed in this paper. It based on propagation from N seed points, which have been matched reliably by feature tracking. The whole image first divided into cells the Voronoi diagram of points. Then corresponding relations are propagated each cell until all pixels within processed. Modified sum squared differences (SSD) employed as cost function according to a statistic model disparity distribution window. size window adaptive. made inversely proportional texture density inside increase reliability matching. significant merit that it can be applied wide range pairs including those with large disparities, or without rectification. has verified real images and results show both robust accurate.