Bluetooth positioning based on weighted K-nearest neighbors and adaptive bandwidth mean shift
Bluetooth positioning is an important and challenging topic in indoor positioning. Although a lot of algorithms have been proposed for this problem, it is still not solved perfectly because of the instable signal strengths of Bluetooth. To improve the performance of Bluetooth positioning, this artic...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717706681 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Bluetooth positioning is an important and challenging topic in indoor positioning. Although a lot of algorithms have been proposed for this problem, it is still not solved perfectly because of the instable signal strengths of Bluetooth. To improve the performance of Bluetooth positioning, this article proposes a coarse-to-fine positioning method based on weighted K-nearest neighbors and adaptive bandwidth mean shift. The method first employs weighted K-nearest neighbors to generate multi-candidate locations. Then, the testing position is obtained by applying adaptive bandwidth mean shift to the multi-candidate locations, which is used to search for the maximum density of the candidate locations. Experimental result indicates that the proposed method improves the performance of Bluetooth positioning. |
|---|---|
| ISSN: | 1550-1477 |