Abstract

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.

Original languageEnglish (US)
Article number16
JournalACM Transactions on Sensor Networks
Volume12
Issue number2
DOIs
StatePublished - Apr 1 2016

Fingerprint

Fusion reactions
Geometry
Sensors
Electric fuses
Linear programming
Sensor networks

Keywords

  • Data fusion
  • Extreme points
  • Genericity
  • Linear programming
  • Polytope
  • Sensor network
  • Simplicial complex

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Moran, B., Cohen, F., Wang, Z., Suvorova, S., Cochran, D., Taylor, T., ... Howard, S. (2016). Bounds on multiple sensor fusion. ACM Transactions on Sensor Networks, 12(2), [16]. https://doi.org/10.1145/2903722

Bounds on multiple sensor fusion. / Moran, Bill; Cohen, Fred; Wang, Zengfu; Suvorova, Sofia; Cochran, Douglas; Taylor, Thomas; Farrell, Peter; Howard, Stephen.

In: ACM Transactions on Sensor Networks, Vol. 12, No. 2, 16, 01.04.2016.

Research output: Contribution to journalArticle

Moran, B, Cohen, F, Wang, Z, Suvorova, S, Cochran, D, Taylor, T, Farrell, P & Howard, S 2016, 'Bounds on multiple sensor fusion', ACM Transactions on Sensor Networks, vol. 12, no. 2, 16. https://doi.org/10.1145/2903722
Moran B, Cohen F, Wang Z, Suvorova S, Cochran D, Taylor T et al. Bounds on multiple sensor fusion. ACM Transactions on Sensor Networks. 2016 Apr 1;12(2). 16. https://doi.org/10.1145/2903722
Moran, Bill ; Cohen, Fred ; Wang, Zengfu ; Suvorova, Sofia ; Cochran, Douglas ; Taylor, Thomas ; Farrell, Peter ; Howard, Stephen. / Bounds on multiple sensor fusion. In: ACM Transactions on Sensor Networks. 2016 ; Vol. 12, No. 2.
@article{c08cab2c5dc14933b0d1e1b99bdf1b64,
title = "Bounds on multiple sensor fusion",
abstract = "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.",
keywords = "Data fusion, Extreme points, Genericity, Linear programming, Polytope, Sensor network, Simplicial complex",
author = "Bill Moran and Fred Cohen and Zengfu Wang and Sofia Suvorova and Douglas Cochran and Thomas Taylor and Peter Farrell and Stephen Howard",
year = "2016",
month = "4",
day = "1",
doi = "10.1145/2903722",
language = "English (US)",
volume = "12",
journal = "ACM Transactions on Sensor Networks",
issn = "1550-4859",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Bounds on multiple sensor fusion

AU - Moran, Bill

AU - Cohen, Fred

AU - Wang, Zengfu

AU - Suvorova, Sofia

AU - Cochran, Douglas

AU - Taylor, Thomas

AU - Farrell, Peter

AU - Howard, Stephen

PY - 2016/4/1

Y1 - 2016/4/1

N2 - 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.

AB - 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.

KW - Data fusion

KW - Extreme points

KW - Genericity

KW - Linear programming

KW - Polytope

KW - Sensor network

KW - Simplicial complex

UR - http://www.scopus.com/inward/record.url?scp=84970024878&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84970024878&partnerID=8YFLogxK

U2 - 10.1145/2903722

DO - 10.1145/2903722

M3 - Article

VL - 12

JO - ACM Transactions on Sensor Networks

JF - ACM Transactions on Sensor Networks

SN - 1550-4859

IS - 2

M1 - 16

ER -