Novel image inpainting algorithm based on quickly searching optimum matching block
Nie Hu · Jisuanji yingyong yanjiu · 2014
In order to solve disadvantages of the Criminisi algorithm,this paper proposed a novel algorithm named QSOMB algorithm,after analyzing the computation complexity was mainly based on the complexity of searching the best matching block and the quality of the repaired image was almost based on the priority levels of the blocks which was waiting for being repaired.QSOMB algorithm reasonably adopted the both the rough searching and the precise searching together to quickly find the optimum matching block in the image for reducing the computation complexity and saving the inpainting time,and effectively employed a novel fashion to determine the priority levels of the blocks which was waiting for being repaired for guaranteeing the quality of the repaired images. The experimental results show that compared with the Criminisi algorithm,the proposed QSOMB algorithm is effective in both guaranteeing the quality of repaired images and saving the much more repairing time.Thus,it's an effective image inplanting algorithm that can be well applied in practice.