王心怡,翟东海(西南交通大学信息科学与技术学院, 成都 610031;西南交通大学信息科学与技术学院, 成都 610031;西藏大学工学院, 拉萨 850000)
目的 目前在图像补全领域研究的重点和难点是补全具有复杂结构信息和丰富纹理信息的大破损区域的图像。传统的基于样本块的图像补全算法主要采用规则的模板块和匹配块来进行补全，补全过程中不能充分利用图像的结构或纹理的不规则信息，从而影响算法修复的精度和效率。针对这一问题，本研究提出一种基于不规则块的图像补全算法。方法 在该算法中，首先利用结构稀疏度来区分图像的结构信息和纹理信息并基于结构稀疏度和置信度计算破损区域边界点的优先级，然后选择优先级最高的点构造规则模板块。对处于复杂结构区域的模板块，如果其邻域含有已知的结构信息，则膨胀该规则模板并利用其周围的结构信息来辅助构造不规则模板块。接下来，在图像完好区域内搜索与该模板块对应的匹配块，如果该匹配块的邻域包含有效的结构信息，则膨胀该匹配块并补充其周围的结构信息来完善该不规则匹配块。最后，利用该不规则匹配块补全破损区域。对于补全过程中块间接缝造成的视觉不连通问题，本研究利用图像的纹理信息来进行修饰。结果 将本文算法与4种修复效果较好的算法（3种基于规则块的算法和1种基于局部敏感哈希的修复算法）进行对比，通过8组经典图像进行实例验证，采用客观评价指标峰值信噪比PSNR和主观视觉连通性进行评价，结果表明本文提出的算法峰值信噪比相较4种对比算法均有04 dB的提高，且在补全的精细度和视觉连通性方面有更佳的效果。结论 本文算法在补全含有较复杂结构和丰富纹理的破损自然图像、壁画图像和目标物体移除上有较好的修复效果，普适性较强。
Image completion method with irregular patch
Wang Xinyi,Zhai Donghai(School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China;School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China;School of Engineering, Tibet University, Lhasa 850000, China)
Objective The highlight and difficult point of the current research in terms of image completion is to complete the image of a large damaged region with complex structure and rich texture information. Traditional exemplar-based completion algorithms mainly adapt the regular sample and matching patches to complete the damaged region. During the completion process, the irregular information, especially the local irregular information, of the image structure and texture cannot be fully used. This condition affects the accuracy and efficiency of the algorithm. To solve this problem, an image completion method with irregular patch is proposed in this paper. Method In our approach, the structure sparsity is used to distinguish the structure information and texture information of the input image first. Thus, a patch with a structure sparsity higher than a threshold is marked as a structural patch, and a patch with a structure sparsity lower than a threshold is regarded as a texture patch. Moreover, the patch priority of pixels on the boundary of the damaged region is calculated on the basis of the structure sparsity and confidence terms. Then, the pixel of the highest priority is selected as the center of the sample patch. If the neighborhood of a sample patch, which is in the complex structure area of the image, contains the known structure information, then this regular patch is dilated to construct its corresponding irregular sample patch by using structure information in its neighborhood. Then, the matching patch is being searched in the known part of the image. If the neighborhood of this matching patch contains a valid structure information, then the matching patch is dilated, and the structure information in its neighborhood is supplemented to construct its corresponding irregular matching patch. Finally, this irregular matching patch is used to complete its corresponding damaged region. The steps of constructing irregular patches specifically include transforming the inspection patch into the grayscale patch, using Gaussian blurring to denoise, extracting the structural information by using the Canny operator, integrating the structural information and original image patch to form an irregular mask, and picking the mask into the source image to obtain the irregular patch. In terms of the problem of visual disconnectivity, which is caused by seams during the completion process, the texture information of the image is used for modification in the proposed algorithm. The specific method aims to map the overlapping region of the texture patches into a network, and then, the graph cut algorithm is used to cut the network to generate a new optimal seam. Result Our approach and four other completion algorithms, three of which are based on the regular patch and one is based on sensitive hash, are used to complete eight classic image benchmarks. The efforts of these algorithms are evaluated by objective and subjective evaluation, which are the peak signal-to-noise ratio (PSNR) and visual connectivity. In comparison with these four completion algorithms, the results show that the proposed algorithm can achieve a better result in the fineness of the completion as well as the visual connectivity. Moreover, the PSNR of the proposed algorithm is improved by 0 dB to 4 dB. Conclusion The proposed algorithm improves the traditional exemplar-based completion algorithms, which cannot fully use the image irregularity information, and enhances the accuracy. Simultaneously, the texture information of the image is used to modify the visual disconnectivity so the visual effect of the image is improved. The proposed algorithm has a good application in the restoration of damaged natural images and cultural relics with both geometric structure and rich texture as well as the removal of target objects. Thus, the proposed algorithm is generalizable.