scholarly journals Indoor Localization Method Based on Regional Division with IFCM

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 559 ◽  
Author(s):  
Junhuai Li ◽  
Xixi Gao ◽  
Zhiyong Hu ◽  
Huaijun Wang ◽  
Ting Cao ◽  
...  
Keyword(s):  
Nearest Neighbor ◽  
Indoor Localization ◽  
Pearson Correlation ◽  
Computation Time ◽  
Access Point ◽  
Target Point ◽  
Localization Algorithm ◽  
K Nearest Neighbor ◽  
Localization Method ◽  
Regional Division

With the development of wireless technology, indoor localization has gained wide attention. The fingerprint localization method is proposed in this paper, which is divided into two phases: offline training and online positioning. In offline training phase, the Improved Fuzzy C-means (IFCM) algorithm is proposed for regional division. The Between-Within Proportion (BWP) index is selected to divide fingerprint database, which can ensure the result of regional division consistent with the building plane structure. Moreover, the Agglomerative Nesting (AGNES) algorithm is applied to accomplish Access Point (AP) optimization. In the online positioning phase, sub-region selection is performed by nearest neighbor algorithm, then the Weighted K-nearest Neighbor (WKNN) algorithm based on Pearson Correlation Coefficient (PCC) is utilized to locate the target point. After the evaluation on the effect of regional division and AP optimization of location precision and time, the experiments show that the average positioning error is 2.53 m and the average computation time of the localization algorithm based on PCC reduced by 94.13%.

scholarly journals Implementing Deep Learning Techniques in 5G IoT Networks for 3D Indoor Positioning: DELTA (DeEp Learning-Based Co-operaTive Architecture)

Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5495
Author(s):  
Brahim El Boudani ◽  
Loizos Kanaris ◽  
Akis Kokkinis ◽  
Michalis Kyriacou ◽  
Christos Chrysoulas ◽  
...  
Keyword(s):  
Deep Learning ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Mobile Station ◽  
Access Point ◽  
Indoor Navigation ◽  
Raspberry Pi ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Smart Factories

In the near future, the fifth-generation wireless technology is expected to be rolled out, offering low latency, high bandwidth and multiple antennas deployed in a single access point. This ecosystem will help further enhance various location-based scenarios such as assets tracking in smart factories, precise smart management of hydroponic indoor vertical farms and indoor way-finding in smart hospitals. Such a system will also integrate existing technologies like the Internet of Things (IoT), WiFi and other network infrastructures. In this respect, 5G precise indoor localization using heterogeneous IoT technologies (Zigbee, Raspberry Pi, Arduino, BLE, etc.) is a challenging research area. In this work, an experimental 5G testbed has been designed integrating C-RAN and IoT networks. This testbed is used to improve both vertical and horizontal localization (3D Localization) in a 5G IoT environment. To achieve this, we propose the DEep Learning-based co-operaTive Architecture (DELTA) machine learning model implemented on a 3D multi-layered fingerprint radiomap. The DELTA begins by estimating the 2D location. Then, the output is recursively used to predict the 3D location of a mobile station. This approach is going to benefit use cases such as 3D indoor navigation in multi-floor smart factories or in large complex buildings. Finally, we have observed that the proposed model has outperformed traditional algorithms such as Support Vector Machine (SVM) and K-Nearest Neighbor (KNN).

scholarly journals RSS Indoor Localization Based on a Single Access Point

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3711 ◽  
Author(s):  
Akis Kokkinis ◽  
Loizos Kanaris ◽  
Antonio Liotta ◽  
Stavros Stavrou
Keyword(s):  
Nearest Neighbor ◽  
Indoor Localization ◽  
Minimum Mean Square Error ◽  
Research Work ◽  
Access Point ◽  
Probabilistic Algorithms ◽  
K Nearest Neighbor ◽  
Localization Accuracy ◽  
Area Of Interest ◽  
Normal Probability Distribution

This research work investigates how RSS information fusion from a single, multi-antenna access point (AP) can be used to perform device localization in indoor RSS based localization systems. The proposed approach demonstrates that different RSS values can be obtained by carefully modifying each AP antenna orientation and polarization, allowing the generation of unique, low correlation fingerprints, for the area of interest. Each AP antenna can be used to generate a set of fingerprint radiomaps for different antenna orientations and/or polarization. The RSS fingerprints generated from all antennas of the single AP can be then combined to create a multi-layer fingerprint radiomap. In order to select the optimum fingerprint layers in the multilayer radiomap the proposed methodology evaluates the obtained localization accuracy, for each fingerprint radio map combination, for various well-known deterministic and probabilistic algorithms (Weighted k-Nearest-Neighbor—WKNN and Minimum Mean Square Error—MMSE). The optimum candidate multi-layer radiomap is then examined by calculating the correlation level of each fingerprint pair by using the “Tolerance Based—Normal Probability Distribution (TBNPD)” algorithm. Both steps take place during the offline phase, and it is demonstrated that this approach results in selecting the optimum multi-layer fingerprint radiomap combination. The proposed approach can be used to provide localisation services in areas served only by a single AP.

Weighted K-nearest Neighbor Fast Localization Algorithm Based on RSSI for Wireless Sensor Systems

2020 ◽  
Vol 13 (2) ◽  
pp. 295-301
Author(s):  
Lu Bai ◽  
Chenglie Du ◽  
Jinchao Chen
Keyword(s):  
Nearest Neighbor ◽  
Simulation Analysis ◽  
Computation Time ◽  
Wireless Sensor ◽  
Sensor Systems ◽  
Localization Algorithm ◽  
K Nearest Neighbor ◽  
Positioning Accuracy ◽  
Wireless Positioning ◽  
Computationally Intensive

Background: Wireless positioning is one of the most important technologies for realtime applications in wireless sensor systems. This paper mainly studies the indoor wireless positioning algorithm of robots. Methods: The application of the K-nearest neighbor algorithm in Wi-Fi positioning is studied by analyzing the Wi-Fi fingerprint location algorithm based on Received Signal Strength Indication (RSSI) and K-Nearest Neighbor (KNN) algorithm in Wi-Fi positioning. The KNN algorithm is computationally intensive and time-consuming. Results: In order to improve the positioning efficiency, improve the positioning accuracy and reduce the computation time, a fast weighted K-neighbor correlation algorithm based on RSSI is proposed based on the K-Means algorithm. Thereby achieving the purpose of reducing the calculation time, quickly estimating the position distance, and improving the positioning accuracy. Conclusion: Simulation analysis shows that the algorithm can effectively shorten the positioning time and improve the positioning efficiency in robot Wi-Fi positioning.

scholarly journals Indoor Localization Based on Fingerprint Clustering

2020 ◽  
Vol 5 (2) ◽  
pp. 40
Author(s):  
Shi Chen
Keyword(s):  
Nearest Neighbor ◽  
Indoor Localization ◽  
Rapid Development ◽  
Computational Cost ◽  
Gaussian Model ◽  
Location Based Services ◽  
Indoor Environments ◽  
Localization Error ◽  
Localization Algorithm ◽  
K Nearest Neighbor

With the rapid development of the huge promotion of the Internet and artificial intelligence, the demand for location-based services in indoor environments has grown rapidly. At present, for the localization of the indoor environment, researchers from all walks of life have proposed many indoor localization solutions based on different technologies. Fingerprint localization technology, as a commonly used indoor localization technology, has led to continuous research and improvement due to its low accuracy and complex calculations. An indoor localization system based on fingerprint clustering is proposed by this paper. The system includes offline phase and online phase. We collect the RSS signal in the offline phase. We preprocess it with the Gaussian model to build a fingerprint database, and then we use the K-Means++ algorithm to cluster the fingerprints and group the fingerprints with similar signal strengths into a clustering subset. In the online phase, we classify the measured received signal strength (RSS), and then use the weighted K-Nearest neighbor (WKNN) algorithm to calculate the localization error. The experimental results show that we can reduce the localization error and effectively reduce the computational cost of the localization algorithm in the online phase, and effectively improve the efficiency of real-time localization in the online phase.

scholarly journals BLE Fingerprint Indoor Localization Algorithm Based on Eight-Neighborhood Template Matching

Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 4859 ◽  
Author(s):  
Mingfeng Li ◽  
Lichen Zhao ◽  
Ding Tan ◽  
Xiaozhe Tong
Keyword(s):  
Template Matching ◽  
Indoor Environment ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Signal Strength ◽  
Reference Points ◽  
Localization Algorithm ◽  
K Nearest Neighbor ◽  
Coverage Area ◽  
Fingerprint Database

Aiming at the problem of indoor environment, signal non-line-of-sight propagation and other factors affect the accuracy of indoor locating, an algorithm of indoor fingerprint localization based on the eight-neighborhood template is proposed. Based on the analysis of the signal strength of adjacent reference points in the fingerprint database, the methods for the eight-neighborhood template matching and generation were studied. In this study, the indoor environment was divided into four quadrants for each access point and the expected values of the received signal strength indication (RSSI) difference between the center points and their eight-neighborhoods in different quadrants were chosen as the generation parameters. Then different templates were generated for different access points, and the unknown point was located by the Euclidean distance for the correlation of RSSI between each template and its coverage area in the fingerprint database. With the spatial correlation of fingerprint data taken into account, the influence of abnormal fingerprint on locating accuracy is reduced. The experimental results show that the locating error is 1.0 m, which is about 0.2 m less than both K-nearest neighbor (KNN) and weighted K-nearest neighbor (WKNN) algorithms.

scholarly journals An Improved K-Nearest-Neighbor Indoor Localization Method Based on Spearman Distance

2016 ◽  
Vol 23 (3) ◽  
pp. 351-355 ◽  
Author(s):  
Yaqin Xie ◽  
Yan Wang ◽  
Arumugam Nallanathan ◽  
Lina Wang
Keyword(s):  
Nearest Neighbor ◽  
Indoor Localization ◽  
K Nearest Neighbor ◽  
Localization Method

scholarly journals A GROSS ERROR ELIMINATION METHOD FOR POINT CLOUD DATA BASED ON KD-TREE

2018 ◽  
Vol XLII-3 ◽  
pp. 719-722 ◽  
Author(s):  
Q. Kang ◽  
G. Huang ◽  
S. Yang
Keyword(s):  
Point Cloud ◽  
Nearest Neighbor ◽  
Target Point ◽  
Point Cloud Data ◽  
K Nearest Neighbor ◽  
Cloud Data ◽  
Gross Error ◽  
Error Elimination ◽  
K Nearest Neighbor Algorithm ◽  
Key Steps

Point cloud data has been one type of widely used data sources in the field of remote sensing. Key steps of point cloud data’s pro-processing focus on gross error elimination and quality control. Owing to the volume feature of point could data, existed gross error elimination methods need spend massive memory both in space and time. This paper employed a new method which based on Kd-tree algorithm to construct, k-nearest neighbor algorithm to search, settled appropriate threshold to determine with result turns out a judgement that whether target point is or not an outlier. Experimental results show that, our proposed algorithm will help to delete gross error in point cloud data and facilitate to decrease memory consumption, improve efficiency.

Improving the Performance of kNN in the MapReduce Framework Using Locality Sensitive Hashing

2019 ◽  
Vol 10 (4) ◽  
pp. 1-16
Author(s):  
Sikha Bagui ◽  
Arup Kumar Mondal ◽  
Subhash Bagui
Keyword(s):  
Nearest Neighbor ◽  
Parallel Implementation ◽  
Block Size ◽  
Computation Time ◽  
Locality Sensitive Hashing ◽  
K Nearest Neighbor ◽  
Mapreduce Framework ◽  
Data Set ◽  
Data Object ◽  
Very Large Datasets

In this work the authors present a parallel k nearest neighbor (kNN) algorithm using locality sensitive hashing to preprocess the data before it is classified using kNN in Hadoop's MapReduce framework. This is compared with the sequential (conventional) implementation. Using locality sensitive hashing's similarity measure with kNN, the iterative procedure to classify a data object is performed within a hash bucket rather than the whole data set, greatly reducing the computation time needed for classification. Several experiments were run that showed that the parallel implementation performed better than the sequential implementation on very large datasets. The study also experimented with a few map and reduce side optimization features for the parallel implementation and presented some optimum map and reduce side parameters. Among the map side parameters, the block size and input split size were varied, and among the reduce side parameters, the number of planes were varied, and their effects were studied.

scholarly journals Application of Deep Convolutional Neural Networks and Smartphone Sensors for Indoor Localization

2019 ◽  
Vol 9 (11) ◽  
pp. 2337 ◽  
Author(s):  
Imran Ashraf ◽  
Soojung Hur ◽  
Yongwan Park
Keyword(s):  
Magnetic Field ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Scene Recognition ◽  
Localization Error ◽  
K Nearest Neighbor ◽  
Current Location ◽  
Smartphone Sensors ◽  
The Impact ◽  
Localization Systems

Indoor localization systems are susceptible to higher errors and do not meet the current standards of indoor localization. Moreover, the performance of such approaches is limited by device dependence. The use of Wi-Fi makes the localization process vulnerable to dynamic factors and energy hungry. A multi-sensor fusion based indoor localization approach is proposed to overcome these issues. The proposed approach predicts pedestrians’ current location with smartphone sensors data alone. The proposed approach aims at mitigating the impact of device dependency on the localization accuracy and lowering the localization error in the magnetic field based localization systems. We trained a deep learning based convolutional neural network to recognize the indoor scene which helps to lower the localization error. The recognized scene is used to identify a specific floor and narrow the search space. The database built of magnetic field patterns helps to lower the device dependence. A modified K nearest neighbor (mKNN) is presented to calculate the pedestrian’s current location. The data from pedestrian dead reckoning further refines this location and an extended Kalman filter is implemented to this end. The performance of the proposed approach is tested with experiments on Galaxy S8 and LG G6 smartphones. The experimental results demonstrate that the proposed approach can achieve an accuracy of 1.04 m at 50 percent, regardless of the smartphone used for localization. The proposed mKNN outperforms K nearest neighbor approach, and mean, variance, and maximum errors are lower than those of KNN. Moreover, the proposed approach does not use Wi-Fi for localization and is more energy efficient than those of Wi-Fi based approaches. Experiments reveal that localization without scene recognition leads to higher errors.

scholarly journals SDR Based Indoor Beacon Localization Using 3D Probabilistic Multipath Exploitation and Deep Learning

Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1323 ◽  
Author(s):  
Donald L. Hall ◽  
Ram M. Narayanan ◽  
David M. Jenkins
Keyword(s):  
Deep Learning ◽  
Software Defined Radio ◽  
High Performance ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Signal Propagation ◽  
Multipath Channel ◽  
K Nearest Neighbor ◽  
Positioning Systems ◽  
Channel Characteristics

Wireless indoor positioning systems (IPS) are ever-growing as traditional global positioning systems (GPS) are ineffective due to non-line-of-sight (NLoS) signal propagation. In this paper, we present a novel approach to learning three-dimensional (3D) multipath channel characteristics in a probabilistic manner for providing high performance indoor localization of wireless beacons. The proposed system employs a single triad dipole vector sensor (TDVS) for polarization diversity, a deep learning model deemed the denoising autoencoder to extract unique fingerprints from 3D multipath channel information, and a probabilistic k-nearest-neighbor (PkNN) to exploit the 3D multipath characteristics. The proposed system is the first to exploit 3D multipath channel characteristics for indoor wireless beacon localization via vector sensing methodologies, a software defined radio (SDR) platform, and multipath channel estimation.

Sign in / Sign up

Export Citation Format

Share Document