Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals

DOI10.1109/TSP.2009.2016891zbMath1391.94461OpenAlexW2101317465MaRDI QIDQ4569762

Kehu Yang, Zhi-Quan Luo, Gang Wang

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2009.2016891

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (4)

On the statistical model of source localization based on range difference measurements ⋮ Efficient iteratively reweighted algorithms for robust hyperbolic localization ⋮ Source localization and denoising: a perspective from the TDOA space ⋮ Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization

This page was built for publication: Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals