Abstract
The structure of block sparsity in multi-band signals is prevalent. Among the block-sparse signal problems for compressive sensing, the most presenting recovery algorithms require block sparsity as prior information, whereas it may not be available in many practical applications. In this paper, a block sparsity adaptive regularized orthogonal matching pursuit algorithm (BAROMP) for compressive sensing is presented. The proposed algorithm could guarantee the accuracy of recovery by both the adaptive process which chooses the candidate set automatically and the regularization process which decides the atoms in the final support set. The simulation results show that the recovery probability of BAROMP which does not require sparsity as prior information is near to BROMP.
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.
