An Efficient Fingerprint Database Construction Approach Based on Matrix Completion for Indoor Localization

The Received Signal Strength (RSS) fingerprint-based indoor localization method in Wireless Local Area Network (WLAN) environment has been widely used due to its low hardware requirements and high positioning accuracy. However, the positioning system requires enormous effort to collect fingerprint a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2020-01, Vol.8, p.1-1
Main Authors: Tan, Teng, Zhang, Lingwen, Li, QiuMei
Format: Article
Language:English
Subjects:
Accuracy
Algorithms
Correlation
Estimation
Fingerprint Collection
Fingerprint recognition
Fingerprinting
Fingerprints
Gaussian noise
Indoor environments
Indoor Localization
Local area networks
Localization method
Matrix Completion
Optimization
Outlier
Outliers (statistics)
Random noise
Signal strength
Spatial databases
Wireless LAN
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Received Signal Strength (RSS) fingerprint-based indoor localization method in Wireless Local Area Network (WLAN) environment has been widely used due to its low hardware requirements and high positioning accuracy. However, the positioning system requires enormous effort to collect fingerprint at each reference point in positioning area, which is time-consuming and laborious. For the practicability of the method, it is essential to reduce the workload of fingerprint collection in the offline phase and construct a fingerprint database efficiently and accurately. Utilizing the high spatial correlation of RSS, in this paper, an efficient fingerprint database construction method is proposed based on low-rank matrix completion. In the meanwhile, different from the traditional matrix completion model, we propose an improved optimization model by converting to the weighted nuclear norm and introducing ℓ1-norm and Frobenius norm to recover unknown data accurately and reduce the influence of outliers and Gaussian noise simultaneously. Furthermore, we combine the K-Nearest Neighbor (KNN) method to solve the problem that matrix completion cannot deal with all unknown rows or columns in the matrix. The experiment results indicate that the proposed algorithm can recover the fingerprint database completely through a few RSS information and has higher accuracy than other algorithms in various scenarios.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.3009441