首页 | 本学科首页   官方微博 | 高级检索  
     

基于相似度的K阶临近定位算法
引用本文:马文丽,李世宝,张志刚,杨喜鹏,王升志,张鑫.基于相似度的K阶临近定位算法[J].计算机系统应用,2017,26(9):165-169.
作者姓名:马文丽  李世宝  张志刚  杨喜鹏  王升志  张鑫
作者单位:中国石油大学(华东) 计算机与通信工程学院, 青岛 266580,中国石油大学(华东) 计算机与通信工程学院, 青岛 266580,中国石油大学(华东) 计算机与通信工程学院, 青岛 266580,中国石油大学(华东) 计算机与通信工程学院, 青岛 266580,中国石油大学(华东) 计算机与通信工程学院, 青岛 266580,中国石油大学(华东) 计算机与通信工程学院, 青岛 266580
基金项目:中国自然科学基金青年基金(61402433);山东省自然科学基金面向项目(ZR2014FM017);中央高校基本科研业务费专项资金(15CX05025A)
摘    要:基于WIFI位置指纹的定位系统能实现较高精度的室内定位,其中基于接收信号强度指示(RSSI)的近邻选择算法在进行室内定位时容易引入奇异点,导致定位精度降低.针对该问题,本文提出了一种基于相似度的K阶临近定位算法(SKNN).该算法借鉴二部分网络中求解节点相似性的思想,建立位置指纹与AP之间的二部分网络,并提出一个相似度参数,用该参数去修正K阶临近定位算法.实验结果表明,本文提出的SKNN算法可以有效的降低奇异点对定位结果的影响,提高定位精度,80%的定位误差均在2 m以内,且在大场景中效果明显.

关 键 词:室内定位  位置指纹  近邻选择算法  二部分网络  相似度
收稿时间:2016/12/29 0:00:00

Similarity-Based K-Nearest Neighborhood Location Algorithm
MA Wen-Li,LI Shi-Bao,ZHANG Zhi-Gang,YANG Xi-Peng,WANG Sheng-Zhi and ZHANG Xin.Similarity-Based K-Nearest Neighborhood Location Algorithm[J].Computer Systems& Applications,2017,26(9):165-169.
Authors:MA Wen-Li  LI Shi-Bao  ZHANG Zhi-Gang  YANG Xi-Peng  WANG Sheng-Zhi and ZHANG Xin
Affiliation:Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China,Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China,Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China,Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China,Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China and Department of Computer and Communication Engineering, China University of Petroleum(East China), Qingdao 266580, China
Abstract:The positioning system based on WIFI location fingerprint can achieve high precision indoor location. The neighbor selection algorithm based on Received Signal Strength Indicator (RSSI) is easy to introduce singular points when locating indoors, which leads to the decrease of positioning accuracy. To solve this problem, this paper proposes a Similarity-based K-Nearest Neighborhood Location Algorithm (SKNN). Referring to the idea used to solve the problem of similarity of nodes in bipartite networks, this algorithm builds a bipartite network between the location fingerprint and the AP. It proposes a similarity parameter which can be used to modify the K-Nearest Neighborhood localization algorithm. The experimental results show that the SKNN algorithm proposed in this paper can effectively reduce the influence of singular points on the positioning results and improve the positioning accuracy, with 80% of the positioning errors within 2m, and the effect is obvious in the large scene.
Keywords:indoor localization  location fingerprint  nearest neighbor selection algorithm  bipartite network  similarity
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号