Wei Wang
Minos Garofalakis
ABSTRACT
Consider a large-scale wireless sensor network measuring compressible data, where n distributed data values can be well-approximated using only k « n coefficients of some known transform. We address the problem of recovering an approximation of the n data values by querying any L sensors, so that the reconstruction error is comparable to the optimal k-term approximation. To solve this problem, we present a novel distributed algorithm based on sparse random projections, which requires no global coordination or knowledge. The key idea is that the sparsity of the random projections greatly reduces the communication cost of pre-processing the data. Our algorithm allows the collector to choose the number of sensors to query according to the desired approximation error. The reconstruction quality depends only on the number of sensors queried, enabling robust refinable approximation.
- E. Candes and T. Tao. Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies. IEEE Transactions on Information Theory, 52(12), pp. 5406--5425, December 2006. Google Scholar
Digital Library
- D. Donoho. Compressed Sensing. IEEE Transactions on Information Theory, 52(4), pp. 1289--1306, April 2006. Google ScholarDigital Library
- http://www.dsp.ece.rice.edu/CS/Google Scholar
- M. Rabbat, J. Haupt, A. Singh, and R. Nowak. Decentralized Compression and Predistribution via Randomized Gossiping. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006. Google ScholarDigital Library
- W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak. Compressive Wireless Sensing. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006. Google ScholarDigital Library
- D. Baron, M.F. Duarte, S. Sarvotham, M.B. Wakin, and R. Baraniuk. An Information-Theoretic Approach to Distributed Compressed Sensing. Proceedings of the 43rd Allerton Conference on Communication, Control, and Computing, 2005.Google Scholar
- N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proceedings of the ACM Symposium on Theory of Computing (STOC), 1996. Google ScholarDigital Library
- A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss. One-Pass Wavelet Decompositions of Data Streams. IEEE Transactions on Knowledge and Data Engineering, 15(3), pp. 541--554, May 2003. Google ScholarDigital Library
- G. Cormode, M. Garofalakis, and D. Sacharidis. Fast Approximate Wavelet Tracking on Streams. Proceedings of the International Conference on Extending Database Technology (EDBT), 2006. Google ScholarDigital Library
- W.B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Proceedings of the Conference in Modern Analysis and Probability, 1984.Google ScholarCross Ref
- D. Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4), pp. 671--687, 2003. Google ScholarDigital Library
- P. Li, T.J. Hastie, and K.W. Church. Very Sparse Random Projections. Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD), 2006. Google ScholarDigital Library
- N. Ailon and B. Chazelle. Approximate Nearest Neighbors and the Fast Johnson-Lindenstrauss Transform. Proceedings of the ACM Symposium on Theory of Computing (STOC), 2006. Google ScholarDigital Library
- R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, NY, 1985. Google ScholarDigital Library
- M. Vetterli and J. KovačeviĆ. Wavelets and Subband Coding. Prentice Hall, Englewood Cliffs, NJ, 1995. Google ScholarDigital Library
- S. Mallat. A Wavelet Tour of Signal Processing. Academic Press, San Diego, CA, 1999.Google ScholarDigital Library
- M. Penrose. Random Geometric Graphs. Oxford University Press, UK, 2003.Google Scholar
- W. Wang and K. Ramchandran. Random Distributed Multiresolution Representations with Significance Querying. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006. Google ScholarDigital Library
- A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous Access to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2005. Google ScholarDigital Library
- R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.Google ScholarCross Ref
- M. Luby. LT Codes. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002. Google ScholarDigital Library
Index Terms
- Distributed sparse random projections for refinable approximation
Recommendations
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large under-determined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least absolute shrinkage and selection operator (LASSO), wavelet-based ...
Random Projections of Smooth Manifolds
We propose a new approach for nonadaptive dimensionality reduction of manifold-modeled data, demonstrating that a small number of random linear projections can preserve key information about a manifold-modeled signal. We center our analysis on the ...
Sparse Approximation via Penalty Decomposition Methods
In this paper we consider sparse approximation problems, that is, general $l_0$ minimization problems with the $l_0$-``norm” of a vector being a part of constraints or objective function. In particular, we first study the first-order optimality conditions ...
Comments