K-Means Fingerprint Clustering for Low-Complexity Floor Estimation in Indoor Mobile Localization
Alireza Razavi, Mikko Valkama, Elena-Simona Lohan

TL;DR
This paper introduces a K-means clustering approach for indoor floor estimation that reduces data complexity and improves speed while maintaining accuracy close to traditional fingerprinting methods.
Contribution
A novel K-means-based clustering method for indoor floor estimation that minimizes data storage and computational requirements, enabling faster and more efficient localization.
Findings
Achieves near-Nearest Neighbour accuracy in floor estimation.
Significantly reduces fingerprint database size and complexity.
Improves speed of floor detection in indoor localization.
Abstract
Indoor localization in multi-floor buildings is an important research problem. Finding the correct floor, in a fast and efficient manner, in a shopping mall or an unknown university building can save the users' search time and can enable a myriad of Location Based Services in the future. One of the most widely spread techniques for floor estimation in multi-floor buildings is the fingerprinting-based localization using Received Signal Strength (RSS) measurements coming from indoor networks, such as WLAN and BLE. The clear advantage of RSS-based floor estimation is its ease of implementation on a multitude of mobile devices at the Application Programming Interface (API) level, because RSS values are directly accessible through API interface. However, the downside of a fingerprinting approach, especially for large-scale floor estimation and positioning solutions, is their need to store…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
