Suppr超能文献

基于双重聚类的贝叶斯优化室内定位算法

Bayesian optimized indoor positioning algorithm based on dual clustering.

作者信息

Chen Min, Pu Qiaolin

机构信息

School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China.

Department of Electronic Information and Communication Engineering, Chongqing Aerospace Vocational and Technical College, Chongqing, China.

出版信息

Sci Rep. 2025 Mar 18;15(1):9272. doi: 10.1038/s41598-024-79647-x.

Abstract

Wi-Fi indoor positioning provides a simple, convenient, ubiquitous and cost-effective solution by matching a pre-established Wi-Fi Received Signal Strength Indication (RSSI) fingerprint database with the RSSI values received from mobile terminals. However, due to the influence of the complex indoor environment on the signal, its accuracy can only reach the meter scale, and the huge fingerprint database leads to inefficient positioning. To solve this problem, the Canopy algorithm is used for coarse clustering, and then the K-means algorithm is used for fine clustering to determine the number of clusters and the initial clustering center to form multiple clustering sub-bases, which improves the positioning efficiency by about 95.05%. In the real-time matching stage, the sub-banks with the highest similarity are selected for matching by the correlation coefficient method, and combined with the Weighted K-Nearest Neighbors (WKNN) algorithm, this paper proposes an improved Bayesian probabilistic optimization algorithm, and the final experimental results show that the average positioning accuracy is improved by about 38.64%, the average runtime is shrunk by about 93.51%, and the stability of the system is slightly improved, which effectively improves the positioning accuracy, real-time performance, and stability.

摘要

Wi-Fi室内定位通过将预先建立的Wi-Fi接收信号强度指示(RSSI)指纹数据库与从移动终端接收到的RSSI值进行匹配,提供了一种简单、便捷、普遍且经济高效的解决方案。然而,由于复杂室内环境对信号的影响,其精度只能达到米级,并且巨大的指纹数据库导致定位效率低下。为了解决这个问题,使用Canopy算法进行粗聚类,然后使用K均值算法进行细聚类,以确定聚类数量和初始聚类中心,形成多个聚类子库,这将定位效率提高了约95.05%。在实时匹配阶段,通过相关系数法选择相似度最高的子库进行匹配,并结合加权K近邻(WKNN)算法,本文提出了一种改进的贝叶斯概率优化算法,最终实验结果表明,平均定位精度提高了约38.64%,平均运行时间缩短了约93.51%,系统稳定性略有提高,有效提高了定位精度、实时性能和稳定性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1b89/11920591/a94012e84984/41598_2024_79647_Fig1_HTML.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验