scholarly journals An Improved WiFi Positioning Method Based on Fingerprint Clustering and Signal Weighted Euclidean Distance

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2300 ◽  
Author(s):  
Boyuan Wang ◽  
Xuelin Liu ◽  
Baoguo Yu ◽  
Ruicai Jia ◽  
Xingli Gan
Keyword(s):  
Euclidean Distance ◽  
Clustering Algorithm ◽  
Distance Measure ◽  
Physical Distance ◽  
Reference Points ◽  
Manhattan Distance ◽  
Position Distribution ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Positioning Method

WiFi fingerprint positioning has been widely used in the indoor positioning field. The weighed K-nearest neighbor (WKNN) algorithm is one of the most widely used deterministic algorithms. The traditional WKNN algorithm uses Euclidean distance or Manhattan distance between the received signal strengths (RSS) as the distance measure to judge the physical distance between points. However, the relationship between the RSS and the physical distance is nonlinear, using the traditional Euclidean distance or Manhattan distance to measure the physical distance will lead to errors in positioning. In addition, the traditional RSS-based clustering algorithm only takes the signal distance between the RSS as the clustering criterion without considering the position distribution of reference points (RPs). Therefore, to improve the positioning accuracy, we propose an improved WiFi positioning method based on fingerprint clustering and signal weighted Euclidean distance (SWED). The proposed algorithm is tested by experiments conducted in two experimental fields. The results indicate that compared with the traditional methods, the proposed position label-assisted (PL-assisted) clustering result can reflect the position distribution of RPs and the proposed SWED-based WKNN (SWED-WKNN) algorithm can significantly improve the positioning accuracy.

scholarly journals DBSCAN and TD Integrated Wi-Fi Positioning Algorithm

2022 ◽  
Vol 14 (2) ◽  
pp. 297
Author(s):  
Jingxue Bi ◽  
Hongji Cao ◽  
Yunjia Wang ◽  
Guoqiang Zheng ◽  
Keqiang Liu ◽  
...  
Keyword(s):  
High Resolution ◽  
Nearest Neighbor ◽  
Reference Points ◽  
Manhattan Distance ◽  
Support Vector ◽  
Indoor Environments ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Positioning Algorithm ◽  
Accuracy And Stability

A density-based spatial clustering of applications with noise (DBSCAN) and three distances (TD) integrated Wi-Fi positioning algorithm was proposed, aiming to enhance the positioning accuracy and stability of fingerprinting by the dynamic selection of signal-domain distance to obtain reliable nearest reference points (RPs). Two stages were included in this algorithm. One was the offline stage, where the offline fingerprint database was constructed and the other was the online positioning stage. Three distances (Euclidean distance, Manhattan distance, and cosine distance), DBSCAN, and high-resolution distance selection principle were combined to obtain more reliable nearest RPs and optimal signal-domain distance in the online stage. Fused distance, the fusion of position-domain and signal-domain distances, was applied for DBSCAN to generate the clustering results, considering both the spatial structure and signal strength of RPs. Based on the principle that the higher resolution the distance, the more clusters will be obtained, the high-resolution distance was used to compute positioning results. The weighted K-nearest neighbor (WKNN) considering signal-domain distance selection was used to estimate positions. Two scenarios were selected as test areas; a complex-layout room (Scenario A) for post-graduates and a typical large indoor environment (Scenario B) covering 3200 m2. In both Scenarios A and B, compared with support vector machine (SVM), Gaussian process regression (GPR) and rank algorithms, the improvement rates of positioning accuracy and stability of the proposed algorithm were up to 60.44 and 60.93%, respectively. Experimental results show that the proposed algorithm has a better positioning performance in complex and large indoor environments.

scholarly journals A novel method of adaptive weighted K-nearest neighbor fingerprint indoor positioning considering user’s orientation

2018 ◽  
Vol 14 (6) ◽  
pp. 155014771878588 ◽  
Author(s):  
Jingxue Bi ◽  
Yunjia Wang ◽  
Xin Li ◽  
Hongji Cao ◽  
Hongxia Qi ◽  
...  
Keyword(s):  
Human Body ◽  
Nearest Neighbor ◽  
Reference Points ◽  
Average Error ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Factors Affecting ◽  
Positioning Method ◽  
Hybrid Distance ◽  
Fingerprint Database

There are many factors affecting Wi-Fi signal in indoor environment, among which the human body has an important impact. And, its characteristic is related to the user’s orientation. To eliminate positioning errors caused by user’s human body and improve positioning accuracy, this study puts forward an adaptive weighted K-nearest neighbor fingerprint positioning method considering the user’s orientation. First, the orientation fingerprint database model is proposed, which includes the position, orientation, and the sequence of mean received signal strength indicator at each reference point. Second, the fuzzy c-means algorithm is used to cluster orientation fingerprint database taking the hybrid distance of the signal domain and position domain as the clustering feature. Finally, the proposed adaptive algorithm is developed to select K-reference points by matching operation, to remove the reference points with larger signal-domain distances, minimum and maximum coordinate values, and calculate the weighted mean coordinates of the remaining reference points for positioning results. The experimental results show that the average error decreases by 0.7 m, and the root mean square error decreases to about 1.3 m by the proposed technique. And, we conclude that the proposed adaptive weighted K-nearest neighbor fingerprint positioning method can improve positioning accuracy.

Linkage analysis using geographical proximity: a test of the efficacy of distance measures

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shumpei Haginoya ◽  
Aiko Hanayama ◽  
Tamae Koike
Keyword(s):  
Environmental Factors ◽  
Euclidean Distance ◽  
Distance Measure ◽  
Distance Measures ◽  
Manhattan Distance ◽  
Geographical Proximity ◽  
Discrimination Accuracy ◽  
Content Type ◽  
Shortest Route ◽  
The Impact

Purpose The purpose of this paper was to compare the accuracy of linking crimes using geographical proximity between three distance measures: Euclidean (distance measured by the length of a straight line between two locations), Manhattan (distance obtained by summing north-south distance and east-west distance) and the shortest route distances. Design/methodology/approach A total of 194 cases committed by 97 serial residential burglars in Aomori Prefecture in Japan between 2004 and 2015 were used in the present study. The Mann–Whitney U test was used to compare linked (two offenses committed by the same offender) and unlinked (two offenses committed by different offenders) pairs for each distance measure. Discrimination accuracy between linked and unlinked crime pairs was evaluated using area under the receiver operating characteristic curve (AUC). Findings The Mann–Whitney U test showed that the distances of the linked pairs were significantly shorter than those of the unlinked pairs for all distance measures. Comparison of the AUCs showed that the shortest route distance achieved significantly higher accuracy compared with the Euclidean distance, whereas there was no significant difference between the Euclidean and the Manhattan distance or between the Manhattan and the shortest route distance. These findings give partial support to the idea that distance measures taking the impact of environmental factors into consideration might be able to identify a crime series more accurately than Euclidean distances. Research limitations/implications Although the results suggested a difference between the Euclidean and the shortest route distance, it was small, and all distance measures resulted in outstanding AUC values, probably because of the ceiling effects. Further investigation that makes the same comparison in a narrower area is needed to avoid this potential inflation of discrimination accuracy. Practical implications The shortest route distance might contribute to improving the accuracy of crime linkage based on geographical proximity. However, further investigation is needed to recommend using the shortest route distance in practice. Given that the targeted area in the present study was relatively large, the findings may contribute especially to improve the accuracy of proactive comparative case analysis for estimating the whole picture of the distribution of serial crimes in the region by selecting more effective distance measure. Social implications Implications to improve the accuracy in linking crimes may contribute to assisting crime investigations and the earlier arrest of offenders. Originality/value The results of the present study provide an initial indication of the efficacy of using distance measures taking environmental factors into account.

scholarly journals An Improved Bluetooth Indoor Positioning Method Using Dynamic Fingerprint Window

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7269
Author(s):  
Ling Ruan ◽  
Ling Zhang ◽  
Tong Zhou ◽  
Yi Long
Keyword(s):  
Large Scale ◽  
Nearest Neighbor ◽  
Indoor Positioning ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Local Clustering ◽  
Positioning Method ◽  
K Nearest Neighbor Algorithm ◽  
Space Range ◽  
Fingerprint Data

The weighted K-nearest neighbor algorithm (WKNN) is easily implemented, and it has been widely applied. In the large-scale positioning regions, using all fingerprint data in matching calculations would lead to high computation expenses, which is not conducive to real-time positioning. Due to signal instability, irrelevant fingerprints reduce the positioning accuracy when performing the matching calculation process. Therefore, selecting the appropriate fingerprint data from the database more quickly and accurately is an urgent problem for improving WKNN. This paper proposes an improved Bluetooth indoor positioning method using a dynamic fingerprint window (DFW-WKNN). The dynamic fingerprint window is a space range for local fingerprint data searching instead of universal searching, and it can be dynamically adjusted according to the indoor pedestrian movement and always covers the maximum possible range of the next positioning. This method was tested and evaluated in two typical scenarios, comparing two existing algorithms, the traditional WKNN and the improved WKNN based on local clustering (LC-WKNN). The experimental results show that the proposed DFW-WKNN algorithm enormously improved both the positioning accuracy and positioning efficiency, significantly, when the fingerprint data increased.

scholarly journals An RSSD-Based Fingerprint Positioning Method for Detection of an Unknown Radio Transmitter Using WLS and Factor Graph

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Liyang Zhang ◽  
Taihang Du ◽  
Chundong Jiang
Keyword(s):  
Nearest Neighbor ◽  
Access Point ◽  
Reference Points ◽  
Least Square ◽  
Factor Graph ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Radio Transmitter ◽  
Error Weight ◽  
The Impact

Realizing accurate detection of an unknown radio transmitter (URT) has become a challenge problem due to its unknown parameter information. A method based on received signal strength difference (RSSD) fingerprint positioning technique and using factor graph (FG) has been successfully developed to achieve the localization of an URT. However, the RSSD-based FG model is not accurate enough to express the relationship between the RSSD and the corresponding location coordinates since the RSSD variances of reference points are different in practice. This paper proposes an enhanced RSSD-based FG algorithm using weighted least square (WLS) to effectively reduce the impact of RSSD measurement variance difference on positioning accuracy. By the use of stochastic RSSD errors between the measured value and the estimated value of the selected reference points, we utilize the error weight matrix to establish a new WLSFG model. Then, the positioning process of proposed RSSD-WLSFG algorithm is derived with the sum-product principle. In addition, the paper also explores the effects of different access point (AP) numbers and grid distances on positioning accuracy. The simulation experiment results show that the proposed algorithm can obtain the best positioning performance compared with the conventional RSSD-based K nearest neighbor (RSSD-KNN) and RSSD-FG algorithms in the case of different AP numbers and grid distances.

scholarly journals Clustering with Euclidean Distance, Manhattan - Distance, Mahalanobis - Euclidean Distance, and Chebyshev Distance with Their Accuracy

2021 ◽  
Vol 5 (2) ◽  
pp. 369-376
Author(s):  
Said Al Afghani ◽  
Widhera Yoza Mahana Putra
Keyword(s):  
Euclidean Distance ◽  
Clustering Algorithm ◽  
Manhattan Distance ◽  
Experiment Data ◽  
Data Grouping

There are several algorithms to solve many problems in grouping data. Grouping data is also known as clusterization, clustering takes advantage to solve some problems especially in business. In this note, we will modify the clustering algorithm based on distance principle which background of K-means algorithm (Euclidean distance). Manhattan, Mahalanobis-Euclidean, and Chebyshev distance will be used to modify the K-means algorithm. We compare the clustered  result related to their accuracy, we got Mahalanobis - Euclidean distance gives the best accuracy on our experiment data, and some results are also given in this note.

scholarly journals A generalized fuzzy k-nearest neighbor regression model based on Minkowski distance

2021 ◽  
Author(s):  
Mahinda Mailagaha Kumbure ◽  
Pasi Luukka
Keyword(s):  
Regression Model ◽  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Weighted Average ◽  
Nearest Neighbors ◽  
Manhattan Distance ◽  
K Nearest Neighbor ◽  
Minkowski Distance ◽  
Regression Methods ◽  
Target Sample

AbstractThe fuzzy k-nearest neighbor (FKNN) algorithm, one of the most well-known and effective supervised learning techniques, has often been used in data classification problems but rarely in regression settings. This paper introduces a new, more general fuzzy k-nearest neighbor regression model. Generalization is based on the usage of the Minkowski distance instead of the usual Euclidean distance. The Euclidean distance is often not the optimal choice for practical problems, and better results can be obtained by generalizing this. Using the Minkowski distance allows the proposed method to obtain more reasonable nearest neighbors to the target sample. Another key advantage of this method is that the nearest neighbors are weighted by fuzzy weights based on their similarity to the target sample, leading to the most accurate prediction through a weighted average. The performance of the proposed method is tested with eight real-world datasets from different fields and benchmarked to the k-nearest neighbor and three other state-of-the-art regression methods. The Manhattan distance- and Euclidean distance-based FKNNreg methods are also implemented, and the results are compared. The empirical results show that the proposed Minkowski distance-based fuzzy regression (Md-FKNNreg) method outperforms the benchmarks and can be a good algorithm for regression problems. In particular, the Md-FKNNreg model gave the significantly lowest overall average root mean square error (0.0769) of all other regression methods used. As a special case of the Minkowski distance, the Manhattan distance yielded the optimal conditions for Md-FKNNreg and achieved the best performance for most of the datasets.

scholarly journals Kernel-Based Robust Bias-Correction Fuzzy Weighted C-Ordered-Means Clustering Algorithm

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 753
Author(s):  
Wenyuan Zhang ◽  
Xijuan Guo ◽  
Tianyu Huang ◽  
Jiale Liu ◽  
Jun Chen
Keyword(s):  
Bias Correction ◽  
Euclidean Distance ◽  
Clustering Algorithm ◽  
Distance Measure ◽  
Similarity Measures ◽  
Distance Measures ◽  
Background Information ◽  
Local Similarity ◽  
Original Algorithm ◽  
Fcm Clustering

The spatial constrained Fuzzy C-means clustering (FCM) is an effective algorithm for image segmentation. Its background information improves the insensitivity to noise to some extent. In addition, the membership degree of Euclidean distance is not suitable for revealing the non-Euclidean structure of input data, since it still lacks enough robustness to noise and outliers. In order to overcome the problem above, this paper proposes a new kernel-based algorithm based on the Kernel-induced Distance Measure, which we call it Kernel-based Robust Bias-correction Fuzzy Weighted C-ordered-means Clustering Algorithm (KBFWCM). In the construction of the objective function, KBFWCM algorithm comprehensively takes into account that the spatial constrained FCM clustering algorithm is insensitive to image noise and involves a highly intensive computation. Aiming at the insensitivity of spatial constrained FCM clustering algorithm to noise and its image detail processing, the KBFWCM algorithm proposes a comprehensive algorithm combining fuzzy local similarity measures (space and grayscale) and the typicality of data attributes. Aiming at the poor robustness of the original algorithm to noise and outliers and its highly intensive computation, a Kernel-based clustering method that includes a class of robust non-Euclidean distance measures is proposed in this paper. The experimental results show that the KBFWCM algorithm has a stronger denoising and robust effect on noise image.

scholarly journals Adaptive Segmentation of Remote Sensing Images Based on Global Spatial Information

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2385 ◽  
Author(s):  
Muqing Li ◽  
Luping Xu ◽  
Shan Gao ◽  
Na Xu ◽  
Bo Yan
Keyword(s):  
Image Segmentation ◽  
Euclidean Distance ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Distance Measure ◽  
Target Function ◽  
Descent Method ◽  
Gradient Descent Method ◽  
Clustering Center ◽  
Membership Information

The problem of image segmentation can be reduced to the clustering of pixels in the intensity space. The traditional fuzzy c-means algorithm only uses pixel membership information and does not make full use of spatial information around the pixel, so it is not ideal for noise reduction. Therefore, this paper proposes a clustering algorithm based on spatial information to improve the anti-noise and accuracy of image segmentation. Firstly, the image is roughly clustered using the improved Lévy grey wolf optimization algorithm (LGWO) to obtain the initial clustering center. Secondly, the neighborhood and non-neighborhood information around the pixel is added into the target function as spatial information, the weight between the pixel information and non-neighborhood spatial information is adjusted by information entropy, and the traditional Euclidean distance is replaced by the improved distance measure. Finally, the objective function is optimized by the gradient descent method to segment the image correctly.

Sign in / Sign up

Export Citation Format

Share Document