Comparing LR, GP, BPN, RBF and SVR for Self-Learning Pattern Matching in WSN Indoor Localization

2012 ◽  
Vol 3 (3) ◽  
pp. 49-62
Author(s):  
Ray-I Chang ◽  
Chi-Cheng Chuang
Keyword(s):  
Pattern Matching ◽  
Indoor Localization ◽  
Noise Signal ◽  
Divide And Conquer ◽  
Support Vector ◽  
Bayesian Filtering ◽  
Training Methods ◽  
Localization Accuracy ◽  
Backpropagation Network ◽  
Self Learning

It is a challenging issue to apply WSN (Wireless Sensor Network) to achieve accurate location information. PM (Pattern Matching), known as one of the most famous localization methods, has the drawback of requiring high initialization effort to predict/train MF (Matching Function). In this paper, the authors propose SPM (Self-learning PM) to improve not only the localization accuracy but also the initialization effort of PM. SPM applies a divide-and-conquer self-learning scheme to reduce the number of training patterns in training. Additionally, it introduces a Bayesian filtering scheme to remove the noise signal caused by multipath effects so as to enhance localization accuracy accordingly. This paper applies different training methods (linear regression, Gaussian process, backpropagation network, radial basis function, and support vector regression) to evaluate the performances of SPM and PM in a complicated indoor environment. Experiments show that SPM is better than PM for all training methods applied. SPM can use up to 72% fewer training patterns than PM to achieve the same localization accuracy. If the same number of training patterns is utilized, SPM can achieve up to 58% higher localization accuracy than PM.

scholarly journals A Survey of Recent Indoor Localization Scenarios and Methodologies

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 8086
Author(s):  
Tian Yang ◽  
Adnane Cabani ◽  
Houcine Chafouk
Keyword(s):  
Indoor Localization ◽  
Measurement Data ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
Bayesian Filtering ◽  
K Nearest Neighbors ◽  
Localization Accuracy ◽  
Trip Time ◽  
Network Methods ◽  
Received Signal Strength Indication

Recently, various novel scenarios have been studied for indoor localization. The trilateration is known as a classic theoretical model of geometric-based indoor localization, with uniform RSSI data that can be transferred directly into distance ranges. Then, a trilateration solution can be algebraically acquired from theses ranges, in order to fix user’s actual location. However, the collected RSSI or other measurement data should be further processed and classified to lower the localization error rate, instead of using the raw data influenced by multi-path effect, multiple nonlinear interference and noises. In this survey, a large number of existing techniques are presented for different indoor network structures and channel conditions, divided as LOS (light-of-sight) and NLOS (non light-of-sight). Besides, the input measurement data such as RSSI (received signal strength indication), TDOA (time difference of arrival), DOA (distance of arrival), and RTT (round trip time) are studied towards different application scenarios. The key localization techniques like RSSI-based fingerprinting technique are presented using supervised machine learning methods, namely SVM (support vector machine), KNN (K nearest neighbors) and NN (neural network) methods, especially in an offline training phase. Other unsupervised methods as isolation forest, k-means, and expectation maximization methods are utilized to further improve the localization accuracy in online testing phase. For Bayesian filtering methods, apart from the basic linear Kalman filter (LKF) methods, nonlinear stochastic filters such as extended KF, cubature KF, unscented KF and particle filters are introduced. These nonlinear methods are more suitable for dynamic localization models. In addition to the localization accuracy, the other important performance features and evaluation aspects are presented in our paper: scalability, stability, reliability, and the complexity of proposed algorithms is compared in this survey. Our paper provides a comprehensive perspective to compare the existing techniques and related practical localization models, with the aim of improving localization accuracy and reducing the complexity of the system.

scholarly journals A Two-Level WiFi Fingerprint-Based Indoor Localization Method for Dangerous Area Monitoring

Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4243 ◽  
Author(s):  
Fei Li ◽  
Min Liu ◽  
Yue Zhang ◽  
Weiming Shen
Keyword(s):  
Indoor Localization ◽  
Search Space ◽  
High Accuracy ◽  
Cluster Center ◽  
Support Vector ◽  
Localization Accuracy ◽  
Localization Method ◽  
Fingerprint Database ◽  
Positioning Algorithm ◽  
Area Monitoring

Localization technologies play an important role in disaster management and emergence response. In areas where the environment does not change much after an accident or in the case of dangerous areas monitoring, indoor fingerprint-based localization can be used. In such scenarios, a positioning system needs to have both a high accuracy and a rapid response. However, these two requirements are usually conflicting since a fingerprint-based indoor localization system with high accuracy usually has complex algorithms and needs to process a large amount of data, and therefore has a slow response. This problem becomes even worse when both the size of monitoring area and the number of reference nodes increase. To address this challenging problem, this paper proposes a two-level positioning algorithm in order to improve both the accuracy and the response time. In the off-line stage, a fingerprint database is divided into several sub databases by using an affinity propagation clustering (APC) algorithm based on Shepard similarity. The online stage has two steps: (1) a coarse positioning algorithm is adopted to find the most similar sub database by matching the cluster center with the fingerprint of the node tested, which will narrow the search space and consequently save time; (2) in the sub database area, a support vector regression (SVR) algorithm with its parameters being optimized by particle swarm optimization (PSO) is used for fine positioning, thus improving the online positioning accuracy. Both experiment results and actual implementations proved that the proposed two-level localization method is more suitable than other methods in term of algorithm complexity, storage requirements and localization accuracy in dangerous area monitoring.

An Indoor Localization of WiFi Based on Support Vector Machines

2014 ◽  
Vol 926-930 ◽  
pp. 2438-2441 ◽  
Author(s):  
Feng Yu ◽  
Ming Hua Jiang ◽  
Jing Liang ◽  
Xiao Qin ◽  
Ming Hu ◽  
...  
Keyword(s):  
Support Vector Machines ◽  
Basis Function ◽  
Indoor Localization ◽  
Signal Strength ◽  
Kernel Functions ◽  
Support Vector ◽  
Localization Accuracy ◽  
Svm Algorithm ◽  
Vector Machines ◽  
Wifi Signal

The recent growing interest for indoor localization-based services has created a need for more accurate and real-time indoor localization solutions. Indoor localization based on existing WiFi signal strength is becoming increasingly prevalent and ubiquity. In this paper, we utilize the information of the signal strength received from the surrounding access points (APs) to determine the user localization. The propose algorithm based on support vector machines (SVM) algorithm, and comparing with three kernel functions, radial basis function (RBF) performs best of all. Experimental results indicate that the proposed algorithm leads to improvement on localization accuracy.

scholarly journals An Indoor Localization System Using Residual Learning with Channel State Information

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 574
Author(s):  
Chendong Xu ◽  
Weigang Wang ◽  
Yunwei Zhang ◽  
Jie Qin ◽  
Shujuan Yu ◽  
...  
Keyword(s):  
Channel State Information ◽  
Indoor Environment ◽  
Indoor Localization ◽  
Location Based Services ◽  
Channel State ◽  
State Information ◽  
Localization Accuracy ◽  
Localization System ◽  
Increasing Demand ◽  
Degradation Problem

With the increasing demand of location-based services, neural network (NN)-based intelligent indoor localization has attracted great interest due to its high localization accuracy. However, deep NNs are usually affected by degradation and gradient vanishing. To fill this gap, we propose a novel indoor localization system, including denoising NN and residual network (ResNet), to predict the location of moving object by the channel state information (CSI). In the ResNet, to prevent overfitting, we replace all the residual blocks by the stochastic residual blocks. Specially, we explore the long-range stochastic shortcut connection (LRSSC) to solve the degradation problem and gradient vanishing. To obtain a large receptive field without losing information, we leverage the dilated convolution at the rear of the ResNet. Experimental results are presented to confirm that our system outperforms state-of-the-art methods in a representative indoor environment.

Method of Optimization for Target Localization Model Parameters Based on LSSVR

2011 ◽  
Vol 268-270 ◽  
pp. 934-939
Author(s):  
Xue Wen He ◽  
Gui Xiong Liu ◽  
Hai Bing Zhu ◽  
Xiao Ping Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Fitness Function ◽  
Particle Swarm ◽  
Parameters Optimization ◽  
Target Localization ◽  
Likelihood Method ◽  
Support Vector ◽  
Swarm Optimization ◽  
Localization Accuracy ◽  
Localization Method

Aiming at improving localization accuracy in Wireless Sensor Networks (WSN) based on Least Square Support Vector Regression (LSSVR), making LSSVR localization method more practicable, the mechanism of effects of the kernel function for target localization based on LSSVR is discussed based on the mathematical solution process of LSSVR localization method. A novel method of modeling parameters optimization for LSSVR model using particle swarm optimization is proposed. Construction method of fitness function for modeling parameters optimization is researched. In addition, the characteristics of particle swarm parameters optimization are analyzed. The computational complexity of parameters optimization is taken into consideration comprehensively. Experiments of target localization based on CC2430 show that localization accuracy using LSSVR method with modeling parameters optimization increased by 23%~36% in compare with the maximum likelihood method(MLE) and the localization error is close to the minimum with different LSSVR modeling parameters. Experimental results show that adapting a reasonable fitness function for modeling parameters optimization using particle swarm optimization could enhance the anti-noise ability significantly and improve the LSSVR localization performance.

DAFI

2021 ◽  
Vol 5 (4) ◽  
pp. 1-21
Author(s):  
Hang Li ◽  
Xi Chen ◽  
Ju Wang ◽  
Di Wu ◽  
Xue Liu
Keyword(s):  
Indoor Localization ◽  
Domain Adaptation ◽  
Target Domain ◽  
Localization Accuracy ◽  
Source Domain ◽  
Fine Grained ◽  
Time Signals ◽  
Environmental Variations ◽  
Device Free ◽  
Localization Approach

WiFi-based Device-free Passive (DfP) indoor localization systems liberate their users from carrying dedicated sensors or smartphones, and thus provide a non-intrusive and pleasant experience. Although existing fingerprint-based systems achieve sub-meter-level localization accuracy by training location classifiers/regressors on WiFi signal fingerprints, they are usually vulnerable to small variations in an environment. A daily change, e.g., displacement of a chair, may cause a big inconsistency between the recorded fingerprints and the real-time signals, leading to significant localization errors. In this paper, we introduce a Domain Adaptation WiFi (DAFI) localization approach to address the problem. DAFI formulates this fingerprint inconsistency issue as a domain adaptation problem, where the original environment is the source domain and the changed environment is the target domain. Directly applying existing domain adaptation methods to our specific problem is challenging, since it is generally hard to distinguish the variations in the different WiFi domains (i.e., signal changes caused by different environmental variations). DAFI embraces the following techniques to tackle this challenge. 1) DAFI aligns both marginal and conditional distributions of features in different domains. 2) Inside the target domain, DAFI squeezes the marginal distribution of every class to be more concentrated at its center. 3) Between two domains, DAFI conducts fine-grained alignment by forcing every target-domain class to better align with its source-domain counterpart. By doing these, DAFI outperforms the state of the art by up to 14.2% in real-world experiments.

scholarly journals DSCP: Depthwise Separable Convolution-Based Passive Indoor Localization Using CSI Fingerprint

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Chong Han ◽  
Wenjing Xun ◽  
Lijuan Sun ◽  
Zhaoxiao Lin ◽  
Jian Guo
Keyword(s):  
Indoor Localization ◽  
Wireless Sensing ◽  
Training Phase ◽  
Training Time ◽  
Localization Accuracy ◽  
Localization System ◽  
Complex Models ◽  
Indoor Scenarios ◽  
Trained Network ◽  
Localization Systems

Wi-Fi-based indoor localization has received extensive attention in wireless sensing. However, most Wi-Fi-based indoor localization systems have complex models and high localization delays, which limit the universality of these localization methods. To solve these problems, a depthwise separable convolution-based passive indoor localization system (DSCP) is proposed. DSCP is a lightweight fingerprint-based localization system that includes an offline training phase and an online localization phase. In the offline training phase, the indoor scenario is first divided into different areas to set training locations for collecting CSI. Then, the amplitude differences of these CSI subcarriers are extracted to construct location fingerprints, thereby training the convolutional neural network (CNN). In the online localization phase, CSI data are first collected at the test locations, and then, the location fingerprint is extracted and finally fed to the trained network to obtain the predicted location. The experimental results show that DSCP has a short training time and a low localization delay. DSCP achieves a high localization accuracy, above 97%, and a small median localization distance error of 0.69 m in typical indoor scenarios.

scholarly journals Improved GbLN-PSO Algorithm for Indoor Localization in Wireless Sensor Network

2021 ◽  
pp. 242-249
Author(s):  
M.Shahkhir Mozamir ◽  
◽  
Rohani Binti Abu Bakar ◽  
Wan Isni Soffiah Wan Din ◽  
Zalili Binti Musa
Keyword(s):  
Particle Swarm Optimization ◽  
Indoor Localization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computational Time ◽  
Swarm Optimization ◽  
Localization Accuracy ◽  
Local Neighborhood

Localization is one of the important matters for Wireless Sensor Networks (WSN) because various applications are depending on exact sensor nodes position. The problem in localization is the gained low accuracy in estimation process. Thus, this research is intended to increase the accuracy by overcome the problem in the Global best Local Neighborhood Particle Swarm Optimization (GbLN-PSO) to gain high accuracy. To compass this problem, an Improved Global best Local Neighborhood Particle Swarm Optimization (IGbLN-PSO) algorithm has been proposed. In IGbLN-PSO algorithm, there are consists of two phases: Exploration phase and Exploitation phase. The neighbor particles population that scattered around the main particles, help in the searching process to estimate the node location more accurately and gained lesser computational time. Simulation results demonstrated that the proposed algorithm have competence result compared to PSO, GbLN-PSO and TLBO algorithms in terms of localization accuracy at 0.02%, 0.01% and 59.16%. Computational time result shows the proposed algorithm less computational time at 80.07%, 17.73% and 0.3% compared others.

A rate-of-change-of-current based fault classification technique for thyristor-controlled series-compensated transmission lines

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nishant H. Kothari ◽  
Bhavesh R. Bhalja ◽  
Vivek Pandya ◽  
Pushkar Tripathi
Keyword(s):  
Transmission Lines ◽  
Noise Signal ◽  
Current Transformer ◽  
Rate Of Change ◽  
Fault Classification ◽  
Support Vector ◽  
Svm Classifier ◽  
Classification Technique ◽  
Suggested Technique ◽  
Zero Sequence

Abstract This paper presents a new fault classification technique for Thyristor-Controlled Series-Compensated (TCSC) transmission lines using Support Vector Machine (SVM). The proposed technique is based on the utilization of post-fault magnitude of Rate-of-Change-of-Current (ROCC). Fault classification has been carried out by giving ROCC of three-phases and zero sequence current as inputs to SVM classifier. The performance of SVM as a binary-class, and multi-class classifier has been evaluated for the proposed feature. The validity of the suggested technique has been tested by modeling a TCSC based 400 kV, 300 km long transmission line using PSCAD/EMTDC software package. Based on the above model, a large number of diversified fault cases (41,220 cases) have been generated by varying fault and system parameters. The effect of window length, current transformer (CT) saturation, noise-signal, and sampling frequency have also been studied. It has been found that the proposed technique provides an accuracy of 99.98% for 37,620 test cases. Moreover, the performance of the suggested technique has also been found to be consistent upon evaluating in a 12-bus power system model consisting of a 365 kV, 60 Hz, 300 km long TCSC line. Comparative evaluation of the proposed SVM based technique with other recent techniques clearly indicates its superiority in terms of fault classification accuracy.

Sign in / Sign up

Export Citation Format

Share Document