A Note on Guaranteed Stable Recovery of Sparse Signal in Compressed Sensing via the RIP of Orders
Journal of Advances in Mathematics and Computer Science · pp. 1–9 · Published 7 Jul 2015
10.9734/BJMCS/2015/18237Abstract
In this paper, we shall continue a study of the CS-recovery of signals studied in [1]. Under the assumption that a m × n matrix A obeys the RIP of order s we decompose the space of unknown vectors into sets M0; M1; · · · ;M7 de ned by a bias function px on a good location T0 = {1; 2; · · · ; s} and research a good condition of CS-recovery.
Cited by 0
No indexed citations yet.
Related research
- Stable Recovery of Sparse Signal in Compressed Sensing via the RIP of Order less than s — shares topic coverage
- Enhancing Compressed Sensing with Graph Structural Constraints: A Novel Approach to Active Learning in Measurement Matrices — shares topic coverage
- New Bounds for Restricted Isometry Constant for the s-sparse Recovery via Compressed Sensing — shares topic coverage
- Weak RIP and Its Application to Compressed Sensing — shares topic coverage
- Sufficient Conditions for CS-recovery — shares topic coverage
Article metrics
Real usage data collected on this platform.
6
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.