scispace - formally typeset
Proceedings ArticleDOI

Knitter: Fast, resilient single-user indoor floor plan construction

Reads0
Chats0
TLDR
Knitter is proposed that can generate accurate floor maps by a single random user's one hour data collection efforts, comparable to the state-of-the-art at more than 20× speed up.
Abstract
Lacking of floor plans is a fundamental obstacle to ubiquitous indoor location-based services. Recent work have made significant progress to accuracy, but they largely rely on slow crowdsensing that may take weeks or even months to collect enough data. In this paper, we propose Knitter that can generate accurate floor maps by a single random user's one hour data collection efforts. Knitter extracts high quality floor layout information from single images, calibrates user trajectories and filters outliers. It uses a multi-hypothesis map fusion framework that updates landmark positions/orientations and accessible areas incrementally according to evidences from each measurement. Our experiments on 3 different large buildings and 30+ users show that Knitter produces correct map topology, and 90-percentile landmark location and orientation errors of 3 ∼ 5m and 4 ∼ 6°, comparable to the state-of-the-art at more than 20× speed up: data collection can finish in about one hour even by a novice user trained just a few minutes.

read more

Citations
More filters
Journal ArticleDOI

Indoor Localization Improved by Spatial Context—A Survey

TL;DR: This survey gives a comprehensive review of state-of-the-art indoor localization methods and localization improvement methods using maps, spatial models, and landmarks.
Proceedings ArticleDOI

Simultaneous Localization and Mapping with Power Network Electromagnetic Field

TL;DR: This paper presents a first systematic study on using the electromagnetic field (EMF) induced by a building's electric power network for simultaneous localization and mapping (SLAM) and designs a SLAM approach that can reliably detect loop closures based on EMF sensing results.
Journal ArticleDOI

P2TA: Privacy-preserving task allocation for edge computing enhanced mobile crowdsensing

TL;DR: This work proposes a framework P2TA to optimize task acceptance rate while protecting users’ privacy, and introduces edge nodes as an anonymous server and a task allocation agent to prevent CS-server from directly obtaining user data and dispersing privacy risks.
Journal ArticleDOI

Resource-efficient and Automated Image-based Indoor Localization

TL;DR: A highly automated (in terms of image confirmation after taking images) image-based localization algorithm (HAIL), distributed in mobile devices, that achieves much higher localization accuracy and computation efficiency as compared with the state-of-the-art approaches.
Journal ArticleDOI

SoundMark: Accurate Indoor Localization via Peer-Assisted Dead Reckoning

TL;DR: An accurate peer-assisted localization system (called SoundMark) on a smartphone with no prior infrastructure or fingerprinting is proposed, which calibrates mobile user’s dead reckoning position by leveraging the location constraints between another stationary user who arrives at a landmark.
References
More filters
Journal ArticleDOI

A Computational Approach to Edge Detection

TL;DR: There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
Proceedings Article

A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

TL;DR: In this paper, a density-based notion of clusters is proposed to discover clusters of arbitrary shape, which can be used for class identification in large spatial databases and is shown to be more efficient than the well-known algorithm CLAR-ANS.
Proceedings ArticleDOI

Object recognition from local scale-invariant features

TL;DR: Experimental results show that robust object recognition can be achieved in cluttered partially occluded images with a computation time of under 2 seconds.
Proceedings Article

A density-based algorithm for discovering clusters in large spatial Databases with Noise

TL;DR: DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it.

Fastslam: a factored solution to the simultaneous localization and mapping problem with unknown data association

TL;DR: This paper presents FastSLAM, an algorithm that recursively estimates the full posterior distribution over robot pose and landmark locations, yet scales logarithmically with the number of landmarks in the map.
Related Papers (5)