Abstract
This paper addresses the sparse recovery problem by l0 minimization, which is of central importance in the compressed sensing theory. We model the problem as a combinatorial optimization problem and present a novel algorithm termed SASR based on simulated annealing (SA) and some greedy pursuit (GP) algorithms. In SASR, the initial solution is designed using the simple thresholding algorithm, and the generating mechanism is designed using the strategies existed in the subspace pursuit algorithm and the compressed sampling matching pursuit algorithm. On both the random Gaussian data and the face recognition task, the numerical simulation results illustrate the efficiency of SASR. Compared with the existing sparse recovery algorithms, SASR is more efficient in finding global optimums and performs relatively fast in some good cases. That is, SASR inherits the advantage of SA in finding global optimums and the advantage of GP in fast speed to some extent.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
