|
|
Active Information Fusion |
Efficient Sensor Selection for Active
Information Fusion
In the proposed sensor selection algorithm, the first step is to construct a synergy graph for all the sensors. The synergy graph is G=(S, E), where S are nodes, representing the set of available sensors, and E are edges, representing the set of pairwise synergetic links weighted by synergy coefficients between the corresponding pairwise sensors. If all sensors in a subset on G are serially linked, this subset of sensors is referred to as a sensor synergy chain. Initially, the synergy graph is a completely connected network. Rules are then developed to prune the synergy graph such that unpromising sensor combinations are removed from the graph. Search is then conducted in the pruned graph to identify the optimal sensor combination. |
Introduction
|
|
Summary
|
|
Demos
|
|
Publications
|
|
BN Resources
|
|
|