$\ell _{p}$-ADMM Algorithm for Sparse Image Recovery Under Impulsive Noise

Abstract

The existing compressive sensing recovery algorithm has the problems of poor robustness, low peak signal-to-noise ratio (PSNR) and low applicability in images inpainting polluted by impulsive noise. In this paper, we proposed a robust algorithm for image recovery in the background of impulsive noise, called $\ell _{p}$-ADMM algorithm. The proposed algorithm uses $\ell _{1}$-norm substitute $\ell _{2}$-norm residual term of cost function model to gain more image inpainting capability corrupted by impulsive noise and uses generalized non-convex penalty terms to ensure sparsity. The residual term of $\ell _{1}$-norm is less sensitive to outliers in the observations than $\ell _{1}$-norm. And using the non-convex penalty function can solve the offset problem of the $\ell _{1}$-norm (not differential at zero point), so more accurate recovery can be obtained. The augmented Lagrange method is used to transform the constrained objective function model into an unconstrained model. Meanwhile, the alternating direction method can effectively improve the efficiently of $\ell _p$-ADMM algorithm. Through numerical simulation results show that the proposed algorithm has better image inpainting performance in impulse noise environment by comparing with some state-of-the-art robust algorithms. Meanwhile, the proposed algorithm has flexible scalability for large-scale problem, which has better advantages for image progressing.

Supported by the National Natural Science Foundation of China under Grant 61671168, the Natural Science Foundation of Heilongjiang Province under Grant QC2016085 and the Fundamental Research Funds for the Central Universities (HEUCF160807).