By Topic

Tractable Bound for Spherical Section Property in the Presence of Side-Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hosseini, M. S. ; Department of Electrical and Computer Engineering, University of Toronto, Ontario, Canada ; Fazeli-Dehkordy, S. ; Plataniotis, K. N.

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.

Published in:

Signal Processing Letters, IEEE  (Volume:19 ,  Issue: 8 )