2017/03/23 by Wen, Fei, Adhikari, Lasith, Pei, Ling +3
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1703.07967
This work addresses the recovery and demixing problem of signals that are sparse in some general dictionary. Involved applications include source separation, image inpainting, super-resolution, and restoration of signals corrupted by clipping, saturation, impulsive noise, or narrowband interference. We employ the ℓq-norm (0 ≤ q < 1) for sparsity inducing and propose a constrained ℓq-minimization formulation for the recovery and demixing problem. This nonconvex formulation is approximately solved by two efficient first-order algorithms based on proximal coordinate descent and alternative direction method of multipliers (ADMM), respectively. The new algorithms are convergent in the nonconvex case under some mild conditions and scale well for high-dimensional problems. A convergence condition of the new ADMM algorithm has been derived. Furthermore, extension of the two algorithms for multi-channels joint recovery has been presented, which can further exploit the joint sparsity pattern among multi-channel signals. Various numerical experiments showed that the new algorithms can achieve considerable performance gain over the ℓ1-regularized algorithms.