2014 IEEE Global Communications Conference 2014
DOI: 10.1109/glocom.2014.7036847
|View full text |Cite
|
Sign up to set email alerts
|

A feature scaling based k-nearest neighbor algorithm for indoor positioning system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
58
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 69 publications
(58 citation statements)
references
References 8 publications
0
58
0
Order By: Relevance
“…As described in the above section, having constructed the RSS fingerprint maps, the most important step of the SSFM-based localization method is the online localization, which is a problem of matching the observed RSS measurement to the database of RSS fingerprint maps. To solve this issue, many matching methods are proposed, including the KNN method [7,8,9], the Sparse Representation (SR)-based method [10] and the compressed sensing-based method [11,15]. The KNN method is a simple algorithm that selects the K closest RSS strengths from the fingerprint maps according to the similarity of the signal strength and computes the location by a specific weighted sum of the coordinates of the K RSS strengths.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…As described in the above section, having constructed the RSS fingerprint maps, the most important step of the SSFM-based localization method is the online localization, which is a problem of matching the observed RSS measurement to the database of RSS fingerprint maps. To solve this issue, many matching methods are proposed, including the KNN method [7,8,9], the Sparse Representation (SR)-based method [10] and the compressed sensing-based method [11,15]. The KNN method is a simple algorithm that selects the K closest RSS strengths from the fingerprint maps according to the similarity of the signal strength and computes the location by a specific weighted sum of the coordinates of the K RSS strengths.…”
Section: Related Workmentioning
confidence: 99%
“…The key problem of the above localization is how to effectively find the matched or approximated RSS strengths in the fingerprint maps and estimate the position of the measurement with high precision. To overcome this problem, many researchers have proposed various localization algorithms, such as the KNN method [7,8,9], the Sparse Representation (SR)-based method [10], the Compressed Sensing (CS)-based method [11,12,13,14,15], etc. Although these fingerprint-based localization methods obtain acceptable positioning performance, most of the current localization methods do not explore and utilize the spatial correlation properties among fingerprint maps, as well as the temporal continuity of the measurements when the user is moving in his/her path.…”
Section: Introductionmentioning
confidence: 99%
“…One popular way to position the Erob in indoor environment is that to use reference fingerprints based on signals [14]. In general, there are two stages for a fingerprint-based positioning algorithm: (1) offline stage and (2) online stage.…”
Section: Positioning Principle By Using Wifi and Rfid Fingerprintmentioning
confidence: 99%
“…Presently, the KNN algorithm and the weighted -nearest neighbour (WKNN) algorithm [13] are the most commonly used matching algorithms. In [28], Li et al proposed a KNN algorithm based on feature scaling. Although their algorithm does consider the fact that the distance between RSSI vectors in the fingerprint database and the actual distance are not perfectly matched, their algorithm does not completely overcome the disadvantage that the RSSI can easily attenuate.…”
Section: Related Workmentioning
confidence: 99%