Optimization algorithm of K-means fingerprint location

K-means fingerprint localization can reduce the complexity of localization, and improving the real-time of location has become a hot-spot of current localization algorithm. However, the randomness of clustering has resulted in great instability to the localization. In this paper, two-step clustering...

Full description

Bibliographic Details
Main Authors: Yu Chengbo, Li Caihong, Zeng Liang
Format: Article
Language:zho
Published: National Computer System Engineering Research Institute of China 2018-02-01
Series:Dianzi Jishu Yingyong
Subjects:
Online Access:http://www.chinaaet.com/article/3000077862
Description
Summary:K-means fingerprint localization can reduce the complexity of localization, and improving the real-time of location has become a hot-spot of current localization algorithm. However, the randomness of clustering has resulted in great instability to the localization. In this paper, two-step clustering algorithm is proposed to optimize the clustering number according to the AIC criterion. Considering the nearest neighbor algorithm would result in great error, correlation coefficient method is used to determine the highest similarity of the sub-library, and estimate the final position. The experimental results show that the optimized algorithm improves not only the positioning accuracy, but also the real-time and stability of localization.
ISSN:0258-7998