scholarly journals An effective localization algorithm for moving sources

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Hao Wang ◽  
Liping Li
Keyword(s):  
Source Localization ◽  
Weighted Least Squares ◽  
Initial Solution ◽  
Second Step ◽  
Localization Algorithm ◽  
Time Difference Of Arrival ◽  
Moving Sources ◽  
Differential Doppler ◽  
Lagrange Multiplier Technique ◽  
Simulation Results

AbstractBy utilizing the time difference of arrival (TDOA), the frequency difference of arrival (FDOA), and the differential Doppler rate (DDR) measurements from sensors, this paper proposes an effective moving source localization algorithm with closed solutions. Instead of employing the traditional two-step weighted least squares (WLS) process, the Lagrange multiplier technique is employed in the first step to obtain the initial solution. This initial solution yields a better solution than the existing solution because the dependence among the variables are taken into account. The initial solution is further refined in the second step. The simulation results verify the effectiveness of the proposed algorithm when compared with the relevant existing algorithms.

scholarly journals A Time Difference of Arrival-based Localization Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 80 ◽  
Author(s):  
Songbo Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Electromagnetic Wave ◽  
Sensor Networks ◽  
Large Scale ◽  
Time Difference ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Time Difference Of Arrival ◽  
Positioning Accuracy ◽  
Simulation Results

<p class="Abstract"><span lang="EN-US">Aimed at solving the problem of local divergence and low data accuracy, this paper introduces a new Time Difference of Arrival(TDOA)-based localization algorithm (TBL) for the large-scale, high-density wireless sensor networks which are designed for real-time surveillance and unexpected incidents management. In particular, several means to improve the accuracy of distance measurement are investigated, and the TDOA method, based on the sound wave and electromagnetic wave to locate in the large-scale WSN, is discussed. Also, the well-designed circular location process has the advantage of better positioning accuracy and coverage percentage. Simulation results have confirmed the effectiveness of the formed TBL algorithm.</span></p>

A WLS-Based Linearized Auto-Localization Algorithm for Local Positioning Systems

2013 ◽  
Vol 791-793 ◽  
pp. 1368-1372
Author(s):  
Cheng Dong Wu ◽  
Zhao Li ◽  
Yun Zhou Zhang
Keyword(s):  
Mobile Robots ◽  
Weighted Least Squares ◽  
Distance Estimation ◽  
Position Estimation ◽  
Localization Algorithm ◽  
Ultrasonic Signals ◽  
Positioning Systems ◽  
Error Estimations ◽  
Simulation Results ◽  
Improved Accuracy

The Linearized Auto-Localization (LAL) algorithm estimates the position of beacon nodes in Local Positioning Systems (LPSs) which are based on the transmission of ultrasonic signals and proposed for indoor positioning of mobile robots. In this paper we propose an improved auto-localization algorithm based on weighted least squares (WLS). The improved algorithm depends on the different error estimations which caused by the different relative positions of the beacons and the measurements nodes. Simulation results show that our WLS-based Linearized Auto-Localization Algorithm can provide improved accuracy in both distance estimation and position estimation.

scholarly journals Time-of-arrival source localization based on weighted least squares estimator in line-of-sight/non-line-of-sight mixture environments

2016 ◽  
Vol 12 (12) ◽  
pp. 155014771668382 ◽  
Author(s):  
Chee-Hyun Park ◽  
Joon-Hyuk Chang
Keyword(s):  
Least Squares ◽  
Source Localization ◽  
Weighted Least Squares ◽  
Line Of Sight ◽  
Time Of Arrival ◽  
Mean Square ◽  
Localization Algorithm ◽  
Absolute Deviation ◽  
Weighted Least Squares Estimator ◽  
Non Line Of Sight

In this article, we propose a line-of-sight/non-line-of-sight time-of-arrival source localization algorithm that utilizes the weighted least squares. The proposed estimator combines multiple sorted measurements using the spatial sign concept, Mahalanobis distance, and Stahel–Donoho estimator, that is, assigning less weight to the samples as they are far from the center of inlier distribution. Also, the eigendecomposition Kendall’s [Formula: see text] covariance matrix is utilized as the scatter measure instead of the conventional median absolute deviation. Thus, the adverse effects by outliers can be attenuated effectively. To validate the superiority of the proposed methods, the root mean square error performances are compared with that of the existing algorithms via extensive simulation.

scholarly journals Clinical Validation of the Champagne Algorithm for Evoked Response Source Localization in Magnetoencephalography

2021 ◽  
Author(s):  
Abhishek S. Bhutada ◽  
Chang Cai ◽  
Danielle Mizuiri ◽  
Anne Findlay ◽  
Jessie Chen ◽  
...  
Keyword(s):  
Evoked Potentials ◽  
Source Localization ◽  
Clinical Population ◽  
Evoked Responses ◽  
Localization Algorithm ◽  
Equivalent Current Dipole ◽  
Current Dipole ◽  
Tumor Patients ◽  
Equivalent Current ◽  
Sensory Evoked

AbstractMagnetoencephalography (MEG) is a robust method for non-invasive functional brain mapping of sensory cortices due to its exceptional spatial and temporal resolution. The clinical standard for MEG source localization of functional landmarks from sensory evoked responses is the equivalent current dipole (ECD) localization algorithm, known to be sensitive to initialization, noise, and manual choice of the number of dipoles. Recently many automated and robust algorithms have been developed, including the Champagne algorithm, an empirical Bayesian algorithm, with powerful abilities for MEG source reconstruction and time course estimation (Wipf et al. 2010; Owen et al. 2012). Here, we evaluate automated Champagne performance in a clinical population of tumor patients where there was minimal failure in localizing sensory evoked responses using the clinical standard, ECD localization algorithm. MEG data of auditory evoked potentials and somatosensory evoked potentials from 21 brain tumor patients were analyzed using Champagne, and these results were compared with equivalent current dipole (ECD) fit. Across both somatosensory and auditory evoked field localization, we found there was a strong agreement between Champagne and ECD localizations in all cases. Given resolution of 8mm voxel size, peak source localizations from Champagne were below 10mm of ECD peak source localization. The Champagne algorithm provides a robust and automated alternative to manual ECD fits for clinical localization of sensory evoked potentials and can contribute to improved clinical MEG data processing workflows.

scholarly journals Efficient Localization Algorithm for Near-Field Noncircular Sources via Dual-Polarization Sensor Array

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Jiaqi Song ◽  
Haihong Tao
Keyword(s):  
Source Localization ◽  
Near Field ◽  
Nuisance Parameter ◽  
Estimation Accuracy ◽  
Localization Algorithm ◽  
Dual Polarization ◽  
Rank Reduction ◽  
Localization Accuracy ◽  
Noncircular Signals ◽  
Polarization Sensor

Noncircular signals are widely used in the area of radar, sonar, and wireless communication array systems, which can offer more accurate estimates and detect more sources. In this paper, the noncircular signals are employed to improve source localization accuracy and identifiability. Firstly, an extended real-valued covariance matrix is constructed to transform complex-valued computation into real-valued computation. Based on the property of noncircular signals and symmetric uniform linear array (SULA) which consist of dual-polarization sensors, the array steering vectors can be separated into the source position parameters and the nuisance parameter. Therefore, the rank reduction (RARE) estimators are adopted to estimate the source localization parameters in sequence. By utilizing polarization information of sources and real-valued computation, the maximum number of resolvable sources, estimation accuracy, and resolution can be improved. Numerical simulations demonstrate that the proposed method outperforms the existing methods in both resolution and estimation accuracy.

Based on RSSI Ranging Technology for DV-Hop Localization Algorithm of Wireless Sensor Network

2012 ◽  
Vol 442 ◽  
pp. 360-365 ◽  
Author(s):  
Yang Jun Zhong
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Approximate Calculation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Original Algorithm ◽  
Approximate Distance ◽  
Anchor Nodes ◽  
Simulation Results

For the DV-Hop algorithm of wireless sensor networks,there is an error arising problem that anchor nodes and location node hop distance is only an approximate calculation. A method based on the original Algorithm introducing RSSI ranging technique is proposed.Using RSSI ranging technology,we accord that if the anchor nodes is only a hop away from the location node,then decide whether using the DV-Hop algorithm to approach to the approximate distance between them. Simulation results show that the algorithm can effectively improve the error problems of calculating the hop distance between the anchor nodes and the location nodes, meanwhile improve the positioning accuracy of the node.

Sign in / Sign up

Export Citation Format

Share Document