Sensing lena-massively distributed compression of sensor images
- 21 June 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15224880), 613
- https://doi.org/10.1109/icip.2003.1247036
Abstract
The sensor broadcast problem: in our setup, sensors measure each one pixel of an image that unfolds over a field, and broadcast a rate constrained encoding of their measurements to every other sensor-the goal is for all sensors to form an estimate of the entire image is considered. In recent work, we proposed a protocol that uses wavelets to decorrelate sensor data, taking advantage of the compact support of the basis functions to keep costly inter-sensor communication at a minimum. In this paper, we prove an asymptotic optimally result for these protocols: the rate of growth for the traffic they generate is /spl Theta/(log(n/D)) (n nodes, total distortion D), matching exactly the rate of growth of the rate/distortion function. We thus close the gap between theory and practice for this new form of massively distributed (one pixel/sensor) image compression, by providing the first efficient and provably optimal algorithms to solve the sensor broadcast problem.Keywords
This publication has 4 references indexed in Scilit:
- On the capacity of the reachback channel in wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- On the maximum stable throughput problem in random networks with directional antennasPublished by Association for Computing Machinery (ACM) ,2003
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- QuantizationIEEE Transactions on Information Theory, 1998