International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 74 - Number 6 |
Year of Publication: 2013 |
Authors: C. Ramya, S. Subha Rani |
10.5120/12891-9930 |
C. Ramya, S. Subha Rani . A Novel Inpainting Algorithm based on Sparse Representation. International Journal of Computer Applications. 74, 6 ( July 2013), 31-37. DOI=10.5120/12891-9930
Recent studies in sparse representations show a variety of applications in the field of image processing. Such as in image denoising, inpainting, compression and more. But always the size of the dictionary has a trade off between the approximation speed and accuracy. In this paper, a moving k-means based dictionary pruning algorithm is applied to the patches of the dictionary to discover an optimum number of dictionary elements for a given data set. This optimized dictionary size feature, will improve the convergence speed of the decomposition algorithm without compromising its approximation accuracy. It also increases the performance of the decomposition algorithm. Simulation results show that the proposed optimized dictionary selection with KSVD (K-means singular value decomposition) yield better image inpainting than traditional KSVD.