The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Recovering Compressively Sampled Signals Using Partial Support Information
Open accessAbstract
We study recovery conditions of weightedl1minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50% of the (partial) support information is accurate, then weightedl1minimization is stable and robust under weaker sufficient conditions than the analogous conditions for standardl1minimization. Moreover, weightedl1minimization provides better upper bounds on the reconstruction error in terms of the measurement noise and the compressibility of the signal to be recovered. We illustrate our results with extensive numerical experiments on synthetic data and real audio and video signals.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 1×
“Finally, the weighted minimization problem is related to the “adaptive lasso” described the statistics literature and studied by Zou in [12]; it is defined by”
MethodStable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Self-citationModified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Vaswani, N., & Lu, W. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2051150 · Cited by 517
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
Bah, B., & Tanner, J. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100788884 · Cited by 78
Compressed Sensing Using Prior Information
von Borries, R. F., Miosso, C. J., & Potes, C. (2007) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2007.4497980 · Cited by 77
Cited by
Zhang, C. D., & Xu, Y. L. (2016) · Structural Control and Health Monitoring · doi:10.1002/stc.1785 · Cited by 106
“Basing on this, reweighted l1-norm minimization was proposed to enhance the sparsity in reference recently [26,29].”
MethodCompressed CSI Acquisition in FDD Massive MIMO: How Much Training is Needed?
Shen, J.-C., Zhang, J., Alsusa, E., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2535310 · Cited by 99
Metadata
- Authors
- Friedlander, M. P., Mansour, H., Saab, R., & Yilmaz, Ö.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-02
- Volume
- 58
- Issue
- 2
- Pages
- 1122-1134
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2111394763
- Cited by
- 261
- References
- 11
- FWCI
- 15.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.