Source localization and denoising: a perspective from the TDOA space

In this manuscript, we formulate the problem of denoising Time Differences of Arrival (TDOAs) in the TDOA space, i.e. the Euclidean space spanned by TDOA measurements. The method consists of pre-processing the TDOAs with the purpose of reducing the measurement noise. The complete set of TDOAs (i.e., TDOAs computed at all microphone pairs) is known to form a redundant set, which lies on a linear subspace in the TDOA space. Noise, however, prevents TDOAs from lying exactly on this subspace. We therefore show that TDOA denoising can be seen as a projection operation that suppresses the component of the noise that is orthogonal to that linear subspace. We then generalize the projection operator also to the cases where the set of TDOAs is incomplete. We analytically show that this operator improves the localization accuracy, and we further confirm that via simulation.Comment: 25 pages, 9 figure

RSSI-Based Self-Localization with Perturbed Anchor Positions

We consider the problem of self-localization by a resource-constrained mobile node given perturbed anchor position information and distance estimates from the anchor nodes. We consider normally-distributed noise in anchor position information. The distance estimates are based on the log-normal shadowing path-loss model for the RSSI measurements. The available solutions to this problem are based on complex and iterative optimization techniques such as semidefinite programming or second-order cone programming, which are not suitable for resource-constrained environments. In this paper, we propose a closed-form weighted least-squares solution. We calculate the weights by taking into account the statistical properties of the perturbations in both RSSI and anchor position information. We also estimate the bias of the proposed solution and subtract it from the proposed solution. We evaluate the performance of the proposed algorithm considering a set of arbitrary network topologies in comparison to an existing algorithm that is based on a similar approach but only accounts for perturbations in the RSSI measurements. We also compare the results with the corresponding Cramer-Rao lower bound. Our experimental evaluation shows that the proposed algorithm can substantially improve the localization performance in terms of both root mean square error and bias.Comment: Accepted for publication in 28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2017

Emitter Location Finding using Particle Swarm Optimization

Using several spatially separated receivers, nowadays positioning techniques, which are implemented to determine the location of the transmitter, are often required for several important disciplines such as military, security, medical, and commercial applications. In this study, localization is carried out by particle swarm optimization using time difference of arrival. In order to increase the positioning accuracy, time difference of arrival averaging based two new methods are proposed. Results are compared with classical algorithms and Cramer-Rao lower bound which is the theoretical limit of the estimation error

TDOA--based localization in two dimensions: the bifurcation curve

In this paper, we complete the study of the geometry of the TDOA map that encodes the noiseless model for the localization of a source from the range differences between three receivers in a plane, by computing the Cartesian equation of the bifurcation curve in terms of the positions of the receivers. From that equation, we can compute its real asymptotic lines. The present manuscript completes the analysis of [Inverse Problems, Vol. 30, Number 3, Pages 035004]. Our result is useful to check if a source belongs or is closed to the bifurcation curve, where the localization in a noisy scenario is ambiguous.Comment: 11 pages, 3 figures, to appear in Fundamenta Informatica