Distributed sparse random projections for refinable approximation (2007)
Cached
Download Links
- [www.eecs.berkeley.edu]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN |
| Citations: | 19 - 3 self |
BibTeX
@INPROCEEDINGS{Wang07distributedsparse,
author = {Wei Wang},
title = {Distributed sparse random projections for refinable approximation},
booktitle = {In IEEE/ACM Int. Symposium on Information Processing in Sensor Networks (IPSN},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
berkeley.edu 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.
