In Search of Indoor Dense Regions: An Approach Using Indoor Positioning Data

HUAN LI, Hua Lu, Lidan Shou, Gang Chen, Ke Chen

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

2 Citationer (Scopus)
15 Downloads (Pure)

Resumé

As people spend significant parts of daily lives indoors, it is useful and important to measure indoor densities and find the dense regions in many indoor scenarios like space management and security control. In this paper, we propose a data-driven approach that finds top-k indoor dense regions by using indoor positioning data. Such data is obtained by indoor positioning systems working at a relatively low frequency, and the reported locations in the data are discrete, from a preselected location set that does not continuously cover the entire indoor space. When a search is triggered, the object positioning information is already out-of-date and thus object locations are uncertain. To this end, we first integrate object location uncertainty into the definitions for counting objects in an indoor region and computing its density. Subsequently, we conduct a thorough analysis of the location uncertainty in the context of complex indoor topology, deriving upper and lower bounds of indoor region densities and introducing distance decaying effect into computing concrete indoor densities. Enabled by the uncertainty analysis outcomes, we design efficient search algorithms for solving the problem. Finally, we conduct extensive experimental studies on our proposals using synthetic and real data. The experimental results verify that the proposed search approach is efficient, scalable, and effective. The top-k indoor dense regions returned by our search are considerably consistent with ground truth, despite that the search uses neither historical data nor extra knowledge about objects.
OriginalsprogEngelsk
TidsskriftI E E E Transactions on Knowledge & Data Engineering
Vol/bind30
Udgave nummer8
Sider (fra-til)1481-1495
Antal sider15
ISSN1041-4347
DOI
StatusUdgivet - 1 aug. 2018

Fingerprint

Uncertainty analysis
Topology
Concretes
Uncertainty
Indoor positioning systems

Citer dette

@article{31f0cbb6be5e4fae8e6cf7e00e1627df,
title = "In Search of Indoor Dense Regions: An Approach Using Indoor Positioning Data",
abstract = "As people spend significant parts of daily lives indoors, it is useful and important to measure indoor densities and find the dense regions in many indoor scenarios like space management and security control. In this paper, we propose a data-driven approach that finds top-k indoor dense regions by using indoor positioning data. Such data is obtained by indoor positioning systems working at a relatively low frequency, and the reported locations in the data are discrete, from a preselected location set that does not continuously cover the entire indoor space. When a search is triggered, the object positioning information is already out-of-date and thus object locations are uncertain. To this end, we first integrate object location uncertainty into the definitions for counting objects in an indoor region and computing its density. Subsequently, we conduct a thorough analysis of the location uncertainty in the context of complex indoor topology, deriving upper and lower bounds of indoor region densities and introducing distance decaying effect into computing concrete indoor densities. Enabled by the uncertainty analysis outcomes, we design efficient search algorithms for solving the problem. Finally, we conduct extensive experimental studies on our proposals using synthetic and real data. The experimental results verify that the proposed search approach is efficient, scalable, and effective. The top-k indoor dense regions returned by our search are considerably consistent with ground truth, despite that the search uses neither historical data nor extra knowledge about objects.",
keywords = "Indoor space, density queries, indoor positioning data",
author = "HUAN LI and Hua Lu and Lidan Shou and Gang Chen and Ke Chen",
year = "2018",
month = "8",
day = "1",
doi = "10.1109/TKDE.2018.2799215",
language = "English",
volume = "30",
pages = "1481--1495",
journal = "I E E E Transactions on Knowledge & Data Engineering",
issn = "1041-4347",
publisher = "IEEE",
number = "8",

}

In Search of Indoor Dense Regions : An Approach Using Indoor Positioning Data. / LI, HUAN; Lu, Hua; Shou, Lidan; Chen, Gang; Chen, Ke.

I: I E E E Transactions on Knowledge & Data Engineering, Bind 30, Nr. 8, 01.08.2018, s. 1481-1495.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - In Search of Indoor Dense Regions

T2 - An Approach Using Indoor Positioning Data

AU - LI, HUAN

AU - Lu, Hua

AU - Shou, Lidan

AU - Chen, Gang

AU - Chen, Ke

PY - 2018/8/1

Y1 - 2018/8/1

N2 - As people spend significant parts of daily lives indoors, it is useful and important to measure indoor densities and find the dense regions in many indoor scenarios like space management and security control. In this paper, we propose a data-driven approach that finds top-k indoor dense regions by using indoor positioning data. Such data is obtained by indoor positioning systems working at a relatively low frequency, and the reported locations in the data are discrete, from a preselected location set that does not continuously cover the entire indoor space. When a search is triggered, the object positioning information is already out-of-date and thus object locations are uncertain. To this end, we first integrate object location uncertainty into the definitions for counting objects in an indoor region and computing its density. Subsequently, we conduct a thorough analysis of the location uncertainty in the context of complex indoor topology, deriving upper and lower bounds of indoor region densities and introducing distance decaying effect into computing concrete indoor densities. Enabled by the uncertainty analysis outcomes, we design efficient search algorithms for solving the problem. Finally, we conduct extensive experimental studies on our proposals using synthetic and real data. The experimental results verify that the proposed search approach is efficient, scalable, and effective. The top-k indoor dense regions returned by our search are considerably consistent with ground truth, despite that the search uses neither historical data nor extra knowledge about objects.

AB - As people spend significant parts of daily lives indoors, it is useful and important to measure indoor densities and find the dense regions in many indoor scenarios like space management and security control. In this paper, we propose a data-driven approach that finds top-k indoor dense regions by using indoor positioning data. Such data is obtained by indoor positioning systems working at a relatively low frequency, and the reported locations in the data are discrete, from a preselected location set that does not continuously cover the entire indoor space. When a search is triggered, the object positioning information is already out-of-date and thus object locations are uncertain. To this end, we first integrate object location uncertainty into the definitions for counting objects in an indoor region and computing its density. Subsequently, we conduct a thorough analysis of the location uncertainty in the context of complex indoor topology, deriving upper and lower bounds of indoor region densities and introducing distance decaying effect into computing concrete indoor densities. Enabled by the uncertainty analysis outcomes, we design efficient search algorithms for solving the problem. Finally, we conduct extensive experimental studies on our proposals using synthetic and real data. The experimental results verify that the proposed search approach is efficient, scalable, and effective. The top-k indoor dense regions returned by our search are considerably consistent with ground truth, despite that the search uses neither historical data nor extra knowledge about objects.

KW - Indoor space

KW - density queries

KW - indoor positioning data

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

U2 - 10.1109/TKDE.2018.2799215

DO - 10.1109/TKDE.2018.2799215

M3 - Journal article

VL - 30

SP - 1481

EP - 1495

JO - I E E E Transactions on Knowledge & Data Engineering

JF - I E E E Transactions on Knowledge & Data Engineering

SN - 1041-4347

IS - 8

ER -