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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.