By Topic

Time difference of arrival based source localization within a sparse representation framework

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ciprian R. Comsa ; CWCSPR Lab, ECE Dept, New Jersey Institute of Technology, Newark, USA ; Alexander M. Haimovich ; Stuart C. Schwartz ; York H. Dobyns
more authors

The problem addressed is source localization from time differences of arrival (TDOA). This problem is also referred to as hyperbolic localization and it is non-convex in general. Traditional solutions proposed in the literature have generally poor robustness to errors in the TDOA estimates. More recent methods, which relax the non-convex problem to a convex optimization by applying a semi-definite relaxation (SDR) method, were found to be more robust to TDOA errors than the traditional methods. However, the SDR methods are not optimal in general. In this paper, three convex optimization methods with different computational costs are proposed to improve the hyperbolic localization accuracy. The first method takes an SDR approach to relax the hyperbolic localization to a convex optimization. The second method follows a linearized formulation of the problem and seeks for a biased estimate of improved accuracy. The first two methods perform comparably when the source is inside the convex hull of the sensors. When the source is located outside, the second approach performs better, at the cost of higher computation. A third method is proposed by exploiting the source sparsity. With this, the hyperbolic localization is formulated as an ℓ1-regularization problem, where the ℓ1-norm is used as source sparsity constraint. Computer simulations show that the ℓ1-regularization can offer further improved accuracy, but at the cost of additional computational effort.

Published in:

Information Sciences and Systems (CISS), 2011 45th Annual Conference on

Date of Conference:

23-25 March 2011