2014 IEEE 15th International Conference on Mobile Data Management 2014
DOI: 10.1109/mdm.2014.29
|View full text |Cite
|
Sign up to set email alerts
|

Finding Dense Locations in Indoor Tracking Data

Abstract: Abstract-Finding the dense locations in large indoor spaces is very useful for getting overloaded locations, security, crowd management, indoor navigation, and guidance. Indoor tracking data can be very large and are not readily available for finding dense locations. This paper presents a graph-based model for semi-constrained indoor movement, and then uses this to map raw tracking records into mapping records representing object entry and exit times in particular locations. Then, an efficient indexing structu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3
3
1

Relationship

3
4

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 8 publications
0
17
0
Order By: Relevance
“…We compare our method with two indoor flow computing methods [3], [4], [27] using RFID data. One method [3], [4] is specialized for semi-constrained indoor movement environments (e.g., convey belt systems) where each semantic location features one entry and one exit, both having an RFID reader. Such a strict setting enables to count objects in a location within a past time interval.…”
Section: Top-k Results Effectivenessmentioning
confidence: 99%
See 1 more Smart Citation
“…We compare our method with two indoor flow computing methods [3], [4], [27] using RFID data. One method [3], [4] is specialized for semi-constrained indoor movement environments (e.g., convey belt systems) where each semantic location features one entry and one exit, both having an RFID reader. Such a strict setting enables to count objects in a location within a past time interval.…”
Section: Top-k Results Effectivenessmentioning
confidence: 99%
“…Referring to the example in Figure 1, for a given P-location p 4 , we find p 6 ≡ p 8 in searching c 6 and p 4 ≡ p 9 in searching {c 1 , c 6 }. To eliminate such redundancy, we can merge those equivalent P-locations sharing a common edge in G ISL , and construct a new M -by-M matrix 3 , where M = |E| is the number of edges in G ISL and M ≤ N . By this merge, we can downsize M IL and consequently reduce the scalability of the possible paths to be generated.…”
Section: Indoor Location Matrixmentioning
confidence: 99%
“…Finding the dense locations in large indoor spaces is very useful for getting overloaded locations, security, crowd management, indoor navigation, and guidance. Recently, there have been some researches on this topic such as [78,79].…”
Section: Privacy Protection In Indoor Spacementioning
confidence: 99%
“…RTR-tree and TP 2 R-tree [22] extend the traditional R-tree to index historical trajectories of indoor moving objects that are captured by RFID-type technologies. The Dense Location Time Index (DLT-Index) [2] indexes historical RFID dwelling records of indoor objects in order to support fast finding of dense semantic locations. Hash-based indexes [47], [48] are used to index online indoor moving objects under RFID-type indoor positioning.…”
Section: B Existing Researchmentioning
confidence: 99%