2015 IEEE Globecom Workshops (GC Wkshps) 2015
DOI: 10.1109/glocomw.2015.7414026
|View full text |Cite
|
Sign up to set email alerts
|

K-Means Fingerprint Clustering for Low-Complexity Floor Estimation in Indoor Mobile Localization

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 68 publications
(50 citation statements)
references
References 25 publications
0
50
0
Order By: Relevance
“…The weighted centroid algorithm described in [18]: This is one of the lowest complexity algorithms for estimating the indoor position, and it relies only on the estimated AP positions. The position estimate is the weighted centroid of the AP positions, where the weights are derived from the observed RSSs.…”
Section: Benchmark Indoor Positioning Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The weighted centroid algorithm described in [18]: This is one of the lowest complexity algorithms for estimating the indoor position, and it relies only on the estimated AP positions. The position estimate is the weighted centroid of the AP positions, where the weights are derived from the observed RSSs.…”
Section: Benchmark Indoor Positioning Resultsmentioning
confidence: 99%
“…• shows examples of power maps in 2D and 3D views • shows examples of position estimation via two basic algorithms: weighted centroid estimator [18,19] and the log-Gaussian likelihood estimator [19,20].…”
Section: Supporting Softwarementioning
confidence: 99%
“…The algorithm partitions a set of observations into k clusters and aims to minimize each withincluster sum-of-square. In [15], Razavi et al introduced a kmeans algorithm for fingerprint clustering in floor estimation. This method reduced the fingerprinting data size by storing and transmitting the cluster heads and related floor labels.…”
Section: Introductionmentioning
confidence: 99%
“…When the accuracy demand is high but the positioning area is huge, the database may be so large that the computational complexity of the matching algorithm is very high, which will bring more resource consumption and high power dissipation. Therefore, in order to reduce the computational complexity of the whole system, clustering methods are always necessary in the off-line training stage [18,19]. …”
Section: Introductionmentioning
confidence: 99%