Digital Image Inpainting Based on Group Marching Method
基于分组行进算法的图像修补方法

Image inpainting is an important research topic in the area of image restoration.Its objective is to restore the lost information according to around image information.Although the inpainting basics are straightforward,most inpainting techniques published in the literature are complex to understand and implement.Fast marching method(FMM) is an efficient algorithm for level set applications whose total computation cost is O(NlbN)).Kim presented a more efficient algorithm called group marching method(GMM) with the complexity of O(N).Motivated by his work,we propose a new technique for image inpainting based on GMM.Examples of experiment using Bertalmio's algorithm,Telea's algorithm,and our algorithm are illustrated.The result shows that the technique we proposed is faster than the other inpainting methods while preserving almost the same inpainting result.