Abstract
This letter provides a tractable bound for a perfect recovery condition in compressed sensing matrices using the spherical section property in the presence of side information. In particular, when the signal of interest is provided with side-information, we derive an equivalent semidefinite relaxation bound by introducing the related prior knowledge as an additional constraint to the semidefinite programming (SDP) problem. We recast a linear program (LP) cone to this problem and found the dual-SDP to be less complex to handle. Numerical evaluations on the proposed dual-SDP, validates the existence of sparse solutions with high- cardinalities.
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.
