Abstract
Greedy sparse recovery algorithms are studied in the structured sparsity (sparsity in levels) framework. Recovery guarantees are provided for Normalized Iterative Hard Thresholding and Conjugate Gradient Iterative Hard Thresholding in the form of restricted isometry properties for sparsity in levels. Empirical results indicate that CGIHT is comparable to CoSaMP in recovery capability in the structured setting, while maintaining the computational complexity of NIHT. While exploiting structured sparsity improves recovery performance, pessimistic theoretical guarantees mask when practitioners should use these algorithms; the empirical results offer guidance for using the original greedy algorithms over CGIHT in Levels.
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.
