.png){kind=icon}
返回
A semidefinite programming approach for robust elliptic localization
.png){kind=icon}
OA
AI
DOI：10.1016/j.jfranklin.2024.107237.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This short communication addresses the problem of elliptic localization with outlier measurements. Outliers are prevalent in various location-enabled applications, and can significantly compromise the positioning performance if not adequately handled. Instead of following the common trend of using M-estimation or adjusting the conventional least squares formulation by integrating extra error variables, we take a different path. Specifically, we explore the worst-case robust approximation criterion to bolster resistance of the elliptic location estimator against outliers. From a geometric standpoint, our method boils down to pinpointing the Chebyshev center of a feasible set, which is defined by the available bistatic ranges with bounded measurement errors. For a practical approach to the associated min-max problem, we convert it into the convex optimization framework of semidefinite programming (SDP). Numerical simulations confirm that our SDP-based technique can outperform a number of existing elliptic localization schemes in terms of positioning accuracy in Gaussian mixture noise.
Keyword:
Robust elliptic localization
Worst-case
Min-max optimization
Semidefinite programming
Gaussian mixture noise
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
Weighted least squares algorithm for target localization in distributed MIMO radar.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏lp-norm minimization for outlier-resistant elliptic positioning in-stable α -impulsive interference
PREAI
分享收藏
查看更多内容