Sensor Fusion: From Dependence Analysis via Matroid Bases to Online Synthesis
Consider the two related problems of sensor selection and sensor fusion. In the first, given a set of sensors, one wishes to identify a subset of the sensors, which while small in size, captures the essence of the data gathered by the sensors. In the second, one wishes to construct a fused sensor, which utilizes the data from the sensors (possibly after discarding dependent ones) in order to create a single sensor which is more reliable than each of the individual ones.
In this work, we rigorously define the dependence among sensors in terms of joint empirical measures and incremental parsing. We show that these measures adhere to a polymatroid structure, which in turn facilitates the application of efficient algorithms for sensor selection. We suggest both a random and a greedy algorithm for sensor selection. Given an independent set, we then turn to the fusion problem, and suggest a novel variant of the exponential weighting algorithm. In the suggested algorithm, one competes against an augmented set of sensors, which allows it to converge to the best fused sensor in a family of sensors, without having any prior data on the sensors’ performance.
KeywordsSensor Fusion Entropy Estimate Sensor Selection Cumulative Loss Minimum Cycle Base
Unable to display preview. Download preview PDF.
- 2.Blanc, J.L., Schmidt, N., Bonnier, L., Pezard, L., Lesne, A.: Quantifying neural correlations using lempel-ziv complexity. In: Neurocomp (2008)Google Scholar
- 4.Cover, T.M., Thomas, J.: Elements of information theory. Wiley (2006)Google Scholar
- 7.Karger, D.R.: Random sampling in matroids, with applications to graph connectivity and minimum spanning trees. In: Proceedings of 34th Annual Symposium on Foundations of Computer Science, pp. 84–93. IEEE (1993)Google Scholar
- 10.Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research, 177–188 (1978)Google Scholar
- 12.Polikar, R., Parikh, D., Mandayam, S.: Multiple classifier systems for multisensor data fusion. In: Proceedings of the 2006 IEEE Sensors Applications Symposium, pp. 180–184 (2006)Google Scholar
- 16.Shamaiah, M., Banerjee, S., Vikalo, H.: Greedy sensor selection: Leveraging submodularity. In: 49th IEEE Conference on Decision and Control (CDC), pp. 2572–2577 (2010)Google Scholar
- 18.Vovk, V.G.: Aggregating strategies. In: Proc. 3rd Annu. Workshop Computational Learning Theory, San Mateo, CA, pp. 372–383 (1990)Google Scholar
- 19.Waltz, E.: Data fusion for c3i: A tutorial. In: Command, Control, Communications Intelligence (C3I) Handbook, pp. 217–226 (1986)Google Scholar
- 21.Yu, B., Sycara, K.: Learning the quality of sensor data in distributed decision fusion. In: 9th International Conference on Information Fusion, pp. 1–8. IEEE (2006)Google Scholar