In the existing patch sparsity based image inpainting algorithms

the exemplar-size and neighborhood-consistence weight are fixed

and the best match patches of the patch to be filled are searched in the whole source region.However

it decreases the connectivity of structure and clearness of texture while increases the time complexity of this algorithm.To address these problems

an adaptive image inpainting algorithm is proposed based on patch structure sparsity

in the light of the relationship between the characteristics of damage region and patch structure sparsity.According to patch structure sparsity value of the point which has the maximal prority value

the size of patch to be filled

the neighborhood consistence weight and the part-search region size are adaptively confirmed through setting some parameters

then these parameters are analysed and discussed by some experiments.Experimental results show that the PSNR is increased by 0.3~1.2dB and the speed is improved by 3~7 times compared with the existing algorithms.