Code Design for Fast Selective Retrieval of Fusion Stored Sensor-Network/Time-Series Data
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, II-1005-II-1008
Abstract
We consider the problem of storing data from multiple correlated sources in a database, so as to enable efficient future retrieval of data from select subsets of the sources, where only statistical information about queries may be available in advance. This setting poses new challenges in terms of the precise tradeoffs between storage rate, retrieval rate and distortion. We derive a gradient descent algorithm to optimize the joint encoding (storage) procedure, the decoder, and the retrieval procedure via mapping from queries to subsets of the stored data to retrieve and decode, so that the average retrieval rate-distortion cost is minimized, given a pre-specified overall storage capacity (or rate). Experiments conducted on real and synthetic data-sets demonstrate that our selective retrieval procedure is able to achieve significantly better trade-offs than joint compression, with retrieval speed-ups reaching 5X and distortion gains of up to 3.5 dB possible.Keywords
This publication has 4 references indexed in Scilit:
- On the optimal density for real-time data gathering of spatio-temporal processes in sensor networks2005
- Correlated source coding for fusion storage and selective retrieval2005
- Vector Quantization and Signal Compression1992
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976