一种用于视图合成的空洞填充算法

Hole filling algorithm for view synthesis

针对较小的空洞提出了一种新的空洞填充算法。该算法总是先填充那些4邻域像素集中不空的像素大于等于本轮域值的空洞点,并且每填完一遍空洞点之后都重新搜索4邻域像素集中所有像素都不空的空洞点以开始下一轮填充。实验表明,该算法能较好地填充较小的空洞,特别是对纹理单一区域中的空洞能产生良好的填充效果。该算法适用于经过平滑深度图处理后剩余空洞的填充。

This paper proposed a new hole filling algorithm for small holes. The algorithm guaranteed that the holes which satisfied the following condition could be filled first： the number of non-holes in 4-neighborhood-pixels set was larger than or equal to the threshold of the current iteration. After each iteration, the algorithm researched the holes whose 4-neighborhoodpixels were all non-holes for the next iteration. Experiment results show that the algorithm can be employed efficiently for the small holes, especially for the holes at lowly-textured area. The results suggest that the algorithm adapts to the hole filling after depth map smoothing during the view synthesis procedure.