Image inpainting based on low-rank and joint-sparse matrix recovery
暂无分享,去创建一个
Image inpainting is a classical inverse problem of image science and has many applications. In the previous works, most of the variational inpainting methods can be considered as special cases of the restoration model where the linear operator is just the project to the known indexes. In this reported work, the variational inpainting model is established from the view of image decomposition. Then the unknown component can be recovered by the known component under the low-rank and joint-sparse constraints. Numerical experiments demonstrate that the proposed algorithm outperforms most of the current state-of-the-art methods with respect to the peak-signal-to-noise ratio value.
[1] Gilad Lerman,et al. Robust Locally Linear Analysis with Applications to Image Denoising and Blind Inpainting , 2013, SIAM J. Imaging Sci..
[2] David B. Dunson,et al. Nonparametric Bayesian Dictionary Learning for Analysis of Noisy and Incomplete Images , 2012, IEEE Transactions on Image Processing.
[3] Tony F. Chan,et al. Mathematical Models for Local Nontexture Inpaintings , 2002, SIAM J. Appl. Math..