localization algorithms
Recently Published Documents


TOTAL DOCUMENTS

457
(FIVE YEARS 133)

H-INDEX

28
(FIVE YEARS 5)

Author(s):  
Shixun Wu ◽  
Min Li ◽  
Miao Zhang ◽  
Kai Xu ◽  
Juan Cao

AbstractMobile station (MS) localization in a cellular network is appealing to both industrial community and academia, due to the wide applications of location-based services. The main challenge is the unknown one-bound (OB) and multiple-bound (MB) scattering environment in dense multipath environment. Moreover, multiple base stations (BSs) are required to be involved in the localization process, and the precise time synchronization between MS and BSs is assumed. In order to address these problems, hybrid time of arrival (TOA), angle of departure (AOD), and angle of arrival (AOA) measurement model from the serving BS with the synchronization error is investigated in this paper. In OB scattering environment, four linear least square (LLS), one quadratic programming and data fusion-based localization algorithms are proposed to eliminate the effect of the synchronization error. In addition, the Cramer-Rao lower bound (CRLB) of our localization model on the root mean-square error (RMSE) is derived. In hybrid OB and MB scattering environment, a novel double identification algorithm (DIA) is proposed to identify the MB path. Simulation results demonstrate that the proposed algorithms are capable to deal with the synchronization error, and LLS-based localization algorithms show better localization accuracy. Furthermore, the DIA can correctly identify the MB path, and the RMSE comparison of different algorithms further prove the effectiveness of the DIA.


2022 ◽  
pp. 1-1
Author(s):  
Shubo Huang ◽  
Bo Wang ◽  
Yanping Zhao ◽  
Mingan Luan

Author(s):  
Soumya J. Bhat ◽  
K. V. Santhosh

AbstractInternet of Things (IoT) has changed the way people live by transforming everything into smart systems. Wireless Sensor Network (WSN) forms an important part of IoT. This is a network of sensor nodes that is used in a vast range of applications. WSN is formed by the random deployment of sensor nodes in various fields of interest. The practical fields of deployment can be 2D or 3D, isotropic or anisotropic depending on the application. The localization algorithms must provide accurate localization irrespective of the type of field. In this paper, we have reported a localization algorithm called Range Reduction Based Localization (RRBL). This algorithm utilizes the properties of hop-based and centroid methods to improve the localization accuracy in various types of fields. In this algorithm, the location unknown nodes identify the close-by neighboring nodes within a predefined threshold and localize themselves by identifying and reducing the probable range of existence from these neighboring nodes. The nodes which do not have enough neighbors are localized using the least squares method. The algorithm is tested in various irregular and heterogeneous conditions. The results are compared with a few state-of-the-art hop-based and centroid-based localization techniques. RRBL has shown an improvement in localization accuracy of 28% at 10% reference node ratio and 26% at 20% reference node ratio when compared with other localization algorithms.


2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Xiaoxiang Cao ◽  
Yuan Zhuang ◽  
Xiansheng Yang ◽  
Xiao Sun ◽  
Xuan Wang

AbstractWi-Fi technology has become an important candidate for localization due to its low cost and no need of additional installation. The Wi-Fi fingerprint-based positioning is widely used because of its ready hardware and acceptable accuracy, especially with the current fingerprint localization algorithms based on Machine Learning (ML) and Deep Learning (DL). However, there exists two challenges. Firstly, the traditional ML methods train a specific classification model for each scene; therefore, it is hard to deploy and manage it on the cloud. Secondly, it is difficult to train an effective multi-classification model by using a small number of fingerprint samples. To solve these two problems, a novel binary classification model based on the samples’ differences is proposed in this paper. We divide the raw fingerprint pairs into positive and negative samples based on each pair’s distance. New relative features (e.g., sort features) are introduced to replace the traditional pair features which use the Media Access Control (MAC) address and Received Signal Strength (RSS). Finally, the boosting algorithm is used to train the classification model. The UJIndoorLoc dataset including the data from three different buildings is used to evaluate our proposed method. The preliminary results show that the floor success detection rate of the proposed method can reach 99.54% (eXtreme Gradient Boosting, XGBoost) and 99.22% (Gradient Boosting Decision Tree, GBDT), and the positioning error can reach 3.460 m (XGBoost) and 4.022 m (GBDT). Another important advantage of the proposed algorithm is that the model trained by one building’s data can be well applied to another building, which shows strong generalizable ability.


2021 ◽  
Author(s):  
Yu Zheng ◽  
Ali Sayghe ◽  
Olugbenga Anubi

<div>This paper presents a suite of algorithms for detecting and localizing attacks in cyber-physical systems, and performing improved resilient state estimation through a pruning algorithm. High performance rates for the underlying detection and localization algorithms are achieved by generating training data that cover large region of the attack space. An unsupervised generative model trained by physics-based discriminators is designed to generate successful false data injection attacks. Then the generated adversarial examples are used to train a multi-class deep neural network which detects and localizes the attacks on measurements. Next, a pruning algorithm is included to improve the precision of localization result and provide performance guarantees for the resulting resilient observer. The performance of the proposed method is validated using the numerical simulation of a water distribution cyber-physical system.</div>


2021 ◽  
Author(s):  
Yu Zheng ◽  
Ali Sayghe ◽  
Olugbenga Anubi

<div>This paper presents a suite of algorithms for detecting and localizing attacks in cyber-physical systems, and performing improved resilient state estimation through a pruning algorithm. High performance rates for the underlying detection and localization algorithms are achieved by generating training data that cover large region of the attack space. An unsupervised generative model trained by physics-based discriminators is designed to generate successful false data injection attacks. Then the generated adversarial examples are used to train a multi-class deep neural network which detects and localizes the attacks on measurements. Next, a pruning algorithm is included to improve the precision of localization result and provide performance guarantees for the resulting resilient observer. The performance of the proposed method is validated using the numerical simulation of a water distribution cyber-physical system.</div>


Energies ◽  
2021 ◽  
Vol 14 (23) ◽  
pp. 7873
Author(s):  
Iago Búa-Núñez ◽  
Julio E. Posada-Román ◽  
José A. García-Souto

The detection of acoustic emissions with multiple channels and different kinds of sensors (external ultrasound electronic sensors and internal optical fiber sensors) for monitoring power transformers is presented. The source localization based on the times of arrival was previously studied, comparing different strategies for solving the location equations and the most efficient strategy in terms of computational and complexity costs versus performance was selected for analyzing the error propagation. The errors of the acoustic emission source location (localization process) are evaluated from the errors of the times of arrival (detection process). A hybrid programming architecture is proposed to optimize both stages of detection and location. It is formed by a virtual instrumentation system for the acquisition, detection and noise reduction of multiple acoustic channels and an algorithms-oriented programming system for the implementation of the localization techniques (back-propagation and multiple-source separation algorithms could also be implemented in this system). The communication between both systems is performed by a packet transfer protocol that allows continuous operation (e.g., on-line monitoring) and remote operation (e.g., a local monitoring and a remote analysis and diagnosis). For the first time, delay errors are modeled and error propagation is applied with this error source and localization algorithms. The 1% mean delay error propagation gives an accuracy of 9.5 mm (dispersion) and a maximum offset of 4 mm (<1% in both cases) in the AE source localization process. This increases proportionally for more severe errors (up to 5% reported). In the case of a multi-channel internal fiber-optic detection system, the resulting location error with a delay error of 2% is negligible when selecting the most repeated calculated position. These aim at determining the PD area of activity with a precision of better than 1% (<10 mm in 110 cm).


Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7626
Author(s):  
Rafaela Villalpando-Hernandez ◽  
Cesar Vargas-Rosales ◽  
David Munoz-Rodriguez

Location-based applications for security and assisted living, such as human location tracking, pet tracking and others, have increased considerably in the last few years, enabled by the fast growth of sensor networks. Sensor location information is essential for several network protocols and applications such as routing and energy harvesting, among others. Therefore, there is a need for developing new alternative localization algorithms suitable for rough, changing environments. In this paper, we formulate the Recursive Localization (RL) algorithm, based on the recursive coordinate data fusion using at least three anchor nodes (ANs), combined with a multiplane location estimation, suitable for 3D ad hoc environments. The novelty of the proposed algorithm is the recursive fusion technique to obtain a reliable location estimation of a node by combining noisy information from several nodes. The feasibility of the RL algorithm under several network environments was examined through analytic formulation and simulation processes. The proposed algorithm improved the location accuracy for all the scenarios analyzed. Comparing with other 3D range-based positioning algorithms, we observe that the proposed RL algorithm presents several advantages, such as a smaller number of required ANs and a better position accuracy for the worst cases analyzed. On the other hand, compared to other 3D range-free positioning algorithms, we can see an improvement by around 15.6% in terms of positioning accuracy.


2021 ◽  
Author(s):  
Anatolii V. Kashchuk ◽  
Oleksandr Perederiy ◽  
Chiara Caldini ◽  
Lucia Gardini ◽  
Francesco Saverio Pavone ◽  
...  

Accurate localization of single particles plays an increasingly important role in a range of biological techniques, including single molecule tracking and localization-based superresolution microscopy. Such techniques require fast and accurate particle localization algorithms as well as nanometer-scale stability of the microscope. Here, we present a universal method for three-dimensional localization of single labeled and unlabeled particles based on local gradient calculation of microscopy images. The method outperforms current techniques in high noise conditions, and it is capable of nanometer accuracy localization of nano- and micro-particles with sub-ms calculation time. By localizing a fixed particle as fiducial mark and running a feedback loop, we demonstrate its applicability for active drift correction in sensitive nanomechanical measurements such as optical trapping and superresolution imaging. A multiplatform open software package comprising a set of tools for local gradient calculation in brightfield and fluorescence microscopy is shared to the scientific community.


Sign in / Sign up

Export Citation Format

Share Document