The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Distributed Compressive Sensing
Open accessAbstract
Compressive sensing is a signal acquisition framework based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable recovery. In this paper we introduce a new theory for distributed compressive sensing (DCS) that enables new distributed coding algorithms for multi-signal ensembles that exploit both intra- and inter-signal correlation structures. The DCS theory rests on a new concept that we term the joint sparsity of a signal ensemble. Our theoretical contribution is to characterize the fundamental performance limits of DCS recovery for jointly sparse signal ensembles in the noiseless measurement setting; our result connects single-signal, joint, and distributed (multi-encoder) compressive sensing. To demonstrate the efficacy of our framework and to show that additional challenges such as computational tractability can be addressed, we study in detail three example models for jointly sparse signals. For these models, we develop practical algorithms for joint recovery of multiple signals from incoherent projections. In two of our three models, the results are asymptotically best-possible, meaning that both the upper and lower bounds match the performance of our practical algorithms. Moreover, simulations indicate that the asymptotics take effect with just a moderate number of signals. DCS is immediately applicable to a range of problems in sensor arrays and networks.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Donoho, D. L. (2004) · Cited by 16,703
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Stable 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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Embedded image coding using zerotrees of wavelet coefficients
Shapiro, J. M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258085 · Cited by 4,815
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
JPEG2000: Image Compression Fundamentals, Standards and Practice
Taubman, D. S. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1469618 · Cited by 3,159
JPEG: Still Image Data Compression Standard
Pennebaker, W. B., & Mitchell, J. L. (1992) · Medical Entomology and Zoology · Cited by 2,390
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Self-citationSparse solutions to linear inverse problems with multiple measurement vectors
Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849172 · Cited by 1,393
Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges
Candès, E. J., & Donoho, D. L. (2000) · Cited by 1,330
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Extensions of compressed sensing
Tsaig, Y., & Donoho, D. L. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.029 · Cited by 947
Image compression through wavelet transform coding
DeVore, R. A., Jawerth, B., & Lucier, B. J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119733 · Cited by 910
Connecting the physical world with pervasive networks
Estrin, D., Culler, D., Pister, K., & Sukhatme, G. (2002) · IEEE Pervasive Computing · doi:10.1109/mprv.2002.993145 · Cited by 836
Compression via channel coding - Distributed source coding for sensor networks
Xiong, Z., Liveris, A. D., & Cheng, S. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1328091 · Cited by 739
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Tropp, J. A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.031 · Cited by 691
Signal Reconstruction From Noisy Random Projections
Haupt, J., & Nowak, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880031 · Cited by 608
Distributed Compressed Sensing of Jointly Sparse Signals
Duarte, M. F., Sarvotham, S., Baron, D., Wakin, M. B., & Baraniuk, R. G. (2006) · Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. · doi:10.1109/acssc.2005.1600024 · Cited by 530
Self-citationQuantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Candes, E. J., & Romberg, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0162-x · Cited by 504
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Donoho, D. L. (2006) · Discrete & Computational Geometry · doi:10.1007/s00454-005-1220-0 · Cited by 370
Space-frequency quantization for wavelet image coding
Xiong, Z., Ramchandran, K., & Orchard, M. T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.568925 · Cited by 366
On network correlated data gathering
Cristescu, R., Beferull-Lozano, B., & Vetterli, M. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354677 · Cited by 334
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
Practical Signal Recovery from Random Projections
Romberg, J. (2005) · Cited by 281
Error correction via linear programming
Candes, E., Rudelson, M., Tao, T., & Vershynin, R. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.5464411 · Cited by 251
Gribonval, R., Rauhut, H., Schnass, K., & Vandergheynst, P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9044-y · Cited by 234
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
Fornasier, M., & Rauhut, H. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/0606668909 · Cited by 233
An evaluation of multi-resolution storage for sensor networks
Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., & Heidemann, J. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958502 · Cited by 202
Decentralized compression and predistribution via randomized gossiping
Rabbat, M., Haupt, J., Singh, A., & Nowak, R. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127789 · Cited by 165
Distributed image compression for sensor networks using correspondence analysis and super-resolution
Wagner, R. S., Nowak, R. M., & Baraniuk, R. G. (2004) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2003.1247032 · Cited by 109
Self-citationSignal reconstruction using sparse tree representations
La, C., & Do, M. N. (2005) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.621064 · Cited by 97
Recovery of Jointly Sparse Signals from Few Random Projections
Wakin, M. B., Duarte, M. F., Sarvotham, S., Baron, D., & Baraniuk, R. G. (2005) · Cited by 69
Self-citationDistributed wavelet transform for irregular sensor network grids
Wagner, R. S., Choi, H., Baraniuk, R. G., & Delouille, V. (2005) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2005.1628777 · Cited by 62
Self-citationA compressed sensing camera : New theory and an implementation using digital micromirrors
Takhar, D. (2006) · Medical Entomology and Zoology · Cited by 36
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Luo, H., & Pottie, G. J. (2005) · Lecture notes in computer science · doi:10.1007/11502593_9 · Cited by 16
Cited by
Distributed Compressive CSIT Estimation and Feedback for FDD Multi-User Massive MIMO Systems
(2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2324991 · Cited by 685
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Self-citationRank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
A Proximal Gradient Algorithm for Decentralized Composite Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2461520 · Cited by 307
Distributed Compressed Sensing
Coluccia, G., Ravazzi, C., & Magli, E. (2015) · SpringerBriefs in Electrical and Computer Engineering · doi:10.1007/978-981-287-390-3_2 · Cited by 323
Metadata
- Authors
- Baron, D., Duarte, M. F., Wakin, M. B., Sarvotham, S., & Baraniuk, R. G.
- Publisher
- Defense Technical Information Center
- Published
- 2009-01-01
- OpenAlex
- W1848264314
- Cited by
- 346
- References
- 46
- Type
- report
- 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.