.png){kind=icon}
Return
Robust TDOA Source Localization Based on Lagrange Programming Neural Network
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2021.3082035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We revisit herein the problem of time-difference-of-arrival (TDOA) based localization under the mixed line-of-sight/non-line-of-sight propagation conditions. Adopting the strategy of statistically robustifying the non-outlier-resistant l(2) loss, we formulate it as the minimization of a possibly non-differentiable generalized robust cost function, which is rooted in the analog locally competitive algorithm (LCA) for sparse approximation. We then present a Lagrange programming neural network to address the optimization formulation, with the non-differentiability issues being handled by grafting thereon the LCA concept of internal state dynamics. Compared with the existing algorithms, our approach is computationally less expensive, less reliant on the use of a priori error information, and observed to be capable of producing higher localization accuracy.
Keywords:
Time-difference-of-arrival
Lagrange programming neural network
locally competitive algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more