Abstract

Multiple-prespecified-dictionary sparse representation (MSR) has shown powerful potential in compressive sensing (CS) image reconstruction, which can exploit more sparse structure and prior knowledge of images for minimization. Due to the popular L1 regularization can only achieve the suboptimal solution of L0 regularization, using the nonconvex regularization can often obtain better results in CS reconstruction. This paper proposes a nonconvex adaptive weighted Lp regularization CS framework via MSR strategy. We first proposed a nonconvex MSR based Lp regularization model, then we propose two algorithms for minimizing the resulting nonconvex Lp optimization problem. According to the fact that the sparsity levels of each regularizers are varying with these prespecified-dictionaries, an adaptive scheme is proposed to weight each regularizer for optimization by exploiting the difference of sparsity levels as prior knowledge. Simulated results show that the proposed nonconvex framework can make a significant improvement in CS reconstruction than convex L1 regularization, and the proposed MSR strategy can also outperforms the traditional nonconvex Lp regularization methodology.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.