Abstract

Dynamic data-driven applications systems (DDDAS) operate on a sensing infrastructure for multi-modal measurement, communications, and computation, through which they perceive and control the evolution of physical dynamic processes. Sensors of different modalities are subject to contextually variable performance under varying operational conditions. Unsupervised learning algorithms have been recently developed to extract the operational context set from multi-modal sensor data. A context set represents the set of all natural or man-made factors, which along with the state of the system, completely condition the measurements from sensors observing the system. The desirable property of conditional independence of observations given the state-context pair enables tractable fusion of disparate information sources. In this chapter, we address a crucial problem associated with unsupervised context learning of reducing the cardinality of the context set. Since, the machine-derived context set can have a large number of elements, we propose a graph-theoretic approach and a subset selection approach for the controlled reduction of contexts to obtain a context set of lower cardinality. We also derive an upper bound on the error introduced by the compression. These proposed approaches are validated with data collected in field experiments with unattended ground sensors for border-crossing target classification.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.