How to get the best out of your fingerprint database : hierarchical fingerprint indoor positioning for databases with variable density
- Author
- Qiang Chang, Samuel Van de Velde and Heidi Steendam (UGent)
- Organization
- Abstract
- In this paper, we consider wireless positioning using Received Signal Strength (RSS) fingerprinting. To obtain good accuracy, this technique requires a database containing a high density of up-to-date fingerprints. However, as acquiring fingerprints through training is labor intensive and the indoor topology is subject to changes, a high density fingerprint database cannot always be obtained. On the other hand, the time to retrieve data from a database with high density can be too high for real-time positioning. To tackle these issues, we introduce the Hierarchical Positioning Algorithm (HPA). In this algorithm, we divide the database into a number of sub-databases with different densities, each containing a sufficiently small number of fingerprints to reduce the data retrieval time. The algorithm starts with a coarse estimate at the highest level, and gradually improves the accuracy in going to the lowest level. This HPA technique requires the construction of sub-databases containing fingerprints that are properly selected to obtain the wanted level of accuracy. This paper considers two algorithms to construct the database: the Minimum Distance Algorithm (MDA) to select the reference points, and the Local Gaussian Process (LGP) algorithm to determine the RSS values at the selected reference points. Simulation results show that the hierarchical algorithm, combined with MDA and LGP to construct the sub-databases, is a fast algorithm that can achieve high accuracy, even with a database having a variable density of fingerprints.
- Keywords
- Indoor positioning, signal fingerprint, Gaussian process, discrete level, of detail
Downloads
-
How to Get the Best Out of Your Fingerprint Database Hierarchical Fingerprint Indoor Positioning for Databases With Variable Density.pdf
- full text (Published version)
- |
- open access
- |
- |
- 1.69 MB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-01GM2VWJQVHSFF0064S9QFSC67
- MLA
- Chang, Qiang, et al. “How to Get the Best out of Your Fingerprint Database : Hierarchical Fingerprint Indoor Positioning for Databases with Variable Density.” IEEE ACCESS, vol. 10, 2022, pp. 117944–54, doi:10.1109/ACCESS.2019.2939545.
- APA
- Chang, Q., Van de Velde, S., & Steendam, H. (2022). How to get the best out of your fingerprint database : hierarchical fingerprint indoor positioning for databases with variable density. IEEE ACCESS, 10, 117944–117954. https://doi.org/10.1109/ACCESS.2019.2939545
- Chicago author-date
- Chang, Qiang, Samuel Van de Velde, and Heidi Steendam. 2022. “How to Get the Best out of Your Fingerprint Database : Hierarchical Fingerprint Indoor Positioning for Databases with Variable Density.” IEEE ACCESS 10: 117944–54. https://doi.org/10.1109/ACCESS.2019.2939545.
- Chicago author-date (all authors)
- Chang, Qiang, Samuel Van de Velde, and Heidi Steendam. 2022. “How to Get the Best out of Your Fingerprint Database : Hierarchical Fingerprint Indoor Positioning for Databases with Variable Density.” IEEE ACCESS 10: 117944–117954. doi:10.1109/ACCESS.2019.2939545.
- Vancouver
- 1.Chang Q, Van de Velde S, Steendam H. How to get the best out of your fingerprint database : hierarchical fingerprint indoor positioning for databases with variable density. IEEE ACCESS. 2022;10:117944–54.
- IEEE
- [1]Q. Chang, S. Van de Velde, and H. Steendam, “How to get the best out of your fingerprint database : hierarchical fingerprint indoor positioning for databases with variable density,” IEEE ACCESS, vol. 10, pp. 117944–117954, 2022.
@article{01GM2VWJQVHSFF0064S9QFSC67,
abstract = {{In this paper, we consider wireless positioning using Received Signal Strength (RSS) fingerprinting. To obtain good accuracy, this technique requires a database containing a high density of up-to-date fingerprints. However, as acquiring fingerprints through training is labor intensive and the indoor topology is subject to changes, a high density fingerprint database cannot always be obtained. On the other hand, the time to retrieve data from a database with high density can be too high for real-time positioning. To tackle these issues, we introduce the Hierarchical Positioning Algorithm (HPA). In this algorithm, we divide the database into a number of sub-databases with different densities, each containing a sufficiently small number of fingerprints to reduce the data retrieval time. The algorithm starts with a coarse estimate at the highest level, and gradually improves the accuracy in going to the lowest level. This HPA technique requires the construction of sub-databases containing fingerprints that are properly selected to obtain the wanted level of accuracy. This paper considers two algorithms to construct the database: the Minimum Distance Algorithm (MDA) to select the reference points, and the Local Gaussian Process (LGP) algorithm to determine the RSS values at the selected reference points. Simulation results show that the hierarchical algorithm, combined with MDA and LGP to construct the sub-databases, is a fast algorithm that can achieve high accuracy, even with a database having a variable density of fingerprints.}},
author = {{Chang, Qiang and Van de Velde, Samuel and Steendam, Heidi}},
issn = {{2169-3536}},
journal = {{IEEE ACCESS}},
keywords = {{Indoor positioning,signal fingerprint,Gaussian process,discrete level,of detail}},
language = {{eng}},
pages = {{117944--117954}},
title = {{How to get the best out of your fingerprint database : hierarchical fingerprint indoor positioning for databases with variable density}},
url = {{http://doi.org/10.1109/ACCESS.2019.2939545}},
volume = {{10}},
year = {{2022}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: