2015
DOI: 10.3390/s151127692
|View full text |Cite
|
Sign up to set email alerts
|

A Mixed Approach to Similarity Metric Selection in Affinity Propagation-Based WiFi Fingerprinting Indoor Positioning

Abstract: The weighted k-nearest neighbors (WkNN) algorithm is by far the most popular choice in the design of fingerprinting indoor positioning systems based on WiFi received signal strength (RSS). WkNN estimates the position of a target device by selecting k reference points (RPs) based on the similarity of their fingerprints with the measured RSS values. The position of the target device is then obtained as a weighted sum of the positions of the k RPs. Two-step WkNN positioning algorithms were recently proposed, in w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 40 publications
(48 citation statements)
references
References 30 publications
0
47
0
1
Order By: Relevance
“…(7) Typical orders are o = 1 (inverse Manhattan distance) and o = 2 (inverse Euclidean distance, used in ViFi). Similarity metrics using modified versions of the inner product between RSS vectors have also been proposed [38], [39].…”
Section: Online Phasementioning
confidence: 99%
See 1 more Smart Citation
“…(7) Typical orders are o = 1 (inverse Manhattan distance) and o = 2 (inverse Euclidean distance, used in ViFi). Similarity metrics using modified versions of the inner product between RSS vectors have also been proposed [38], [39].…”
Section: Online Phasementioning
confidence: 99%
“…Previous work addressed the impact of k on positioning accuracy of deterministic WkNN algorithms in real fingerprinting systems, and two approaches emerged: a) a dynamic k selection i.e. that, however, increases complexity without guaranteeing the optimal performance in all cases [39], [40], and b) a static k selection, that minimizes the average positioning error over a set of Test Points. The parameter k that minimizes the average error is referred to as k opt .…”
Section: Online Phase Implementation Optionsmentioning
confidence: 99%
“…Dynamic k schemes typically rely on the introduction of a variable threshold in order to determine the value of k depending on the specific positioning request [19,23,24]. • Similarity metric: Different similarity metrics have been proposed [20]. A popular choice is the use of the inverse Minkowski distance with order o ≥ 1 (orders typically used are o = 1, i.e., the Manhattan distance, and o = 2, i.e., the Euclidean distance).…”
Section: Rss-based Wifi Fingerprintingmentioning
confidence: 99%
“…Several choices are possible for the data to be collected: in the case of UWB, channel impulse response (CIR) location-dependent features have been proposed as fingerprints, because of the possibility of the accurate temporal resolution of multipath components typically forming the CIR [15]. In parallel, in the view of the cost-effective reuse of pre-existing communication infrastructure, fingerprinting emerges as one of the most appealing solutions in the case of WiFi-based IPSs [5]; in this case, the use of WiFi access points (APs) as ANs and the collection of RSS values in the RN positions have been widely proposed and analyzed [16][17][18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%
“…To achieve the affinity propagation clustering [40,41], we first define ϕ i = aoa i toa i T as the vector of the i -th joint AOA and TOA measurement, where the notation "T" denotes the transpose operation. The matrix of the joint AOA and TOA measurements is shown below.…”
Section: Signal Path Identificationmentioning
confidence: 99%