2016 International Conference on Indoor Positioning and Indoor Navigation (IPIN) 2016
DOI: 10.1109/ipin.2016.7743694
|View full text |Cite
|
Sign up to set email alerts
|

Smallest enclosing circle-based fingerprint clustering and modified-WKNN matching algorithm for indoor positioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 33 publications
(22 citation statements)
references
References 10 publications
0
21
0
Order By: Relevance
“…Liu et al [36] proposed a strategy using the smallest enclosing circle algorithm (SEC) which is widely used in the field of information security. They directly input the RP's coordinates instead of the RSS, and the smallest enclosing circle is the smallest circle that consists of all points to be positioned.…”
Section: Empirical Modelingmentioning
confidence: 99%
“…Liu et al [36] proposed a strategy using the smallest enclosing circle algorithm (SEC) which is widely used in the field of information security. They directly input the RP's coordinates instead of the RSS, and the smallest enclosing circle is the smallest circle that consists of all points to be positioned.…”
Section: Empirical Modelingmentioning
confidence: 99%
“…Recently works on smartphone-based with Wi-Fi fingerprinting have reached a mean distance error of around 5m [1,6]. For learning techniques, the well-known K-Nearest Neighbors (KNN) and its alternative are among the most popular technique [7,8]. In [9], the authors differ a wide range of KNN parameters to get a set of models.…”
Section: Related Workmentioning
confidence: 99%
“…All of these test points were selected randomly in the experimental scenarios, and the systems’ positioning errors were measured for analysis. Regarding to the matching algorithm of fingerprint positioning system, this paper firstly conducted three matching algorithms, namely K Nearest Neighbor (KNN), Weight K Nearest Neighbor (WKNN) and Modified Weight K Nearest Neighbor (MWKNN) [23], in Test-bed 2 Floor 1 to evaluate the performance of positioning system. The comparison of positioning errors in cumulative distribution function (CDF) for these three matching algorithms has been shown in Figure 11.…”
Section: Measurement Analysismentioning
confidence: 99%
“…We had previously proposed a smallest-enclosing-circle-based clustering algorithm for indoor positioning in [23]. This paper is an extension of the work in [23], and, in this paper, the AP implementation influence is detailed analyzed.…”
Section: Introductionmentioning
confidence: 96%
See 1 more Smart Citation