KIT | KIT-Bibliothek | Impressum
Open Access Logo
§
Volltext
URN: urn:nbn:de:swb:90-456004

Deriving Bounds on the Size of Spatial Areas

Buchmann, E.; Bradley, P.E.; Böhm, K.

Abstract:
Many application domains such as surveillance, environmental monitoring or sensor-data processing need upper and lower bounds on areas that are covered by a certain feature. For example, a smart-city infrastructure might need bounds on the size of an area polluted with fine-dust, to re-route combustion-engine traffic. Obtaining such bounds is challenging, because in almost any real-world application, information about the region of interest is incomplete, e.g., the database of sensor data contains only a limited number of samples. Existing approaches cannot provide upper and lower bounds or depend on restrictive assumptions, e.g., the area must be convex. Our approach in turn is based on the natural assumption that it is possible to specify a minimal diameter for the feature in question. Given this assumption, we formally derive bounds on the area size, and we provide algorithms that compute these bounds from a database of sensor data, based on geometrical considerations. We evaluate our algorithms both with a real-world case study and with synthetic data.


Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Zeitschriftenaufsatz
Jahr 2015
Sprache Englisch
Identifikator ISSN: 2199-3459
KITopen ID: 1000045600
Erschienen in Open Journal of Databases
Band 2
Heft 1
Seiten 1-16
Bemerkung zur Veröffentlichung Gefördert durch den KIT-Publikationsfonds
Schlagworte bounds, sensor data, spatial areas
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page