Abstract

Compressive sensing (CS) is an effective approach for compressive recovery, such as the imaging problems. It aims at recovering sparse signal or image from a small number of under-sampled data by taking advantage of the sparse signal structure. $L_{1/2}$ -norm regularization in CS framework has been considered as a typical nonconvex relaxation approach to approximate the optimal sparse solution, and can obtain stronger sparse solution than $L_{1}$ -norm regularization. However, it is very difficult to solve the nonconvex optimization problem efficiently resulted by $L_{1/2}$ -norm. In order to improve the performance of $L_{1/2}$ -norm regularization and extend the application, we propose a multiple sub-wavelet dictionaries-based adaptively-weighted iterative half thresholding algorithm (MUSAI- $L_{1/2}$ ) for sparse signal recovery. In particular, we propose an adaptive-weighting scheme for the regularization parameter to control the tradeoff between the fidelity term and the multiple sub-regularization terms. Numerical experiments are conducted on some typical compressive imaging problems to demonstrate that the proposed MUSAI- $L_{1/2}$ algorithm can yield significantly improved the recovery performance compared with the prior work.

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.