We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Image compressed sensing based on non-convex low-rank approximation.
- Authors
Zhang, Yan; Guo, Jichang; Li, Chongyi
- Abstract
Nonlocal sparsity and structured sparsity have been evidenced to improve the reconstruction of image details in various compressed sensing (CS) studies. The nonlocal processing is achieved by grouping similar patches of the image into the groups. To exploit these nonlocal self-similarities in natural images, a non-convex low-rank approximation is proposed to regularize the CS recovery in this paper. The nuclear norm minimization, as a convex relaxation of rank function minimization, ignores the prior knowledge of the matrix singular values. This greatly restricts its capability and flexibility in dealing with many practical problems. In order to make a better approximation of the rank function, the non-convex low-rank regularization namely weighted Schatten p-norm minimization (WSNM) is proposed. In this way, both the local sparsity and nonlocal sparsity are integrated into a recovery framework. The experimental results show that our method outperforms the state-of-the-art CS recovery algorithms not only in PSNR index, but also in local structure preservation.
- Subjects
IMAGE compression; APPROXIMATION algorithms; COMPRESSED sensing; MATRIX effect; FLEXIBILITY testing (Physiology)
- Publication
Multimedia Tools & Applications, 2018, Vol 77, Issue 10, p12853
- ISSN
1380-7501
- Publication type
Article
- DOI
10.1007/s11042-017-4919-z