We consider the problem of fusing measurements in a sensor network, where the sensing regions overlap and data are nonnegative real numbers, possibly resulting from a count of indistinguishable discrete entities. Because of overlaps, it is generally impossible to fuse this information to arrive at an accurate value of the overall amount or count of material present in the union of the sensing regions. Here we study the computation of the range of overall values consistent with the data and provide several results. Posed as a linear programming problem, this leads to questions associated with the geometry of the sensor regions, specifically the arrangement of their nonempty intersections. We define a computational tool called the fusion polytope, based on the geometry of the sensing regions. Its properties are explored, and in particular, a topological necessary and sufficient condition for this to be in the positive orthant, a property that considerably simplifies calculations, is provided. We show that in two dimensions, inflated tiling schemes based on rectangular regions fail to satisfy this condition, whereas inflated tiling schemes based on hexagons do.
Bounds on Multiple Sensor Fusion
B. Moran,F. Cohen,Zengfu Wang,S. Suvorova,D. Cochran,Tom Taylor,P. Farrell,S. Howard
Published 2014 in ACM Trans. Sens. Networks
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
ACM Trans. Sens. Networks
- Publication date
2014-10-12
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-41 of 41 references · Page 1 of 1
CITED BY
Showing 1-5 of 5 citing papers · Page 1 of 1