In this paper we discuss a modified exemplar-based inpainting method through investigating the sparsity of natural image patches. In the exemplar-based algorithms, with the help of available information the unknown blocks of target region are inpainted by the most similar blocks extracted from the source region. To decide the filling order of missing pixels ensures the connectivity of object boundaries. The priority term shold defined. In the exemplar-based patch sparsity approaches, a sparse representation of missing pixels was considered to define a new priority term. Here, we discuss modification of the priority term and take measures to compute the similarities between fill-front and candidate patches. Image inpainting by patch propogation using patch sparsity shows the effeteness over traditional exemplar based inpainting.