Robust TDOA localization based on maximum correntropy criterion with variable center

被引:12
|
作者
Wang, Wei [1 ]
Wang, Gang [1 ]
Ho, K. C. [2 ]
Huang, Lei [3 ]
机构
[1] Ningbo Univ, Fac Elect Engn & Comp Sci, Ningbo 315211, Peoples R China
[2] Univ Missouri, Elect Engn & Comp Sci Dept, Columbia, MO 65211 USA
[3] Shenzhen Univ, Coll Elect & Informat Engn, Shenzhen 518060, Peoples R China
来源
SIGNAL PROCESSING | 2023年 / 205卷
关键词
Source localization; Time -difference -of -arrival (TDOA); Non -line -of -sight (NLOS); Maximum correntropy criterion with; variable center (MCC -VC);
D O I
10.1016/j.sigpro.2022.108860
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a new robust method for the time-difference-of-arrival (TDOA) localization of a source under non-line-of-sight (NLOS) conditions. According to the maximum correntropy criterion with variable center (MCC-VC), the method jointly estimates the source position together with the kernel cen-ter and bandwidth using the TDOA measurements. In particular, we formulate two optimization problems based on MCC-VC, one estimating the kernel center and bandwidth, and the other the source position. The first problem is solved by dividing it into two subproblems, which are further approximated by con-vex problems that can be easily solved by a convex optimization package. The second problem is also divided into two subproblems by invoking the property of the convex conjugate function, which is then solved iteratively by solving the two subproblems in an alternating manner for each iteration. The pro-posed method does not require any prior information on the NLOS errors, making it easy to apply. Both simulation and real experimental results show that the proposed method performs well in both sparse and dense NLOS environments.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] Maximum Correntropy Criterion With Variable Center for Robust Passive Multistatic Localization
    Hu, Keyuan
    Xiong, Wenxin
    He, Jiajun
    Leung, Chi-Sing
    So, Hing Cheung
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2023, 30 : 1407 - 1411
  • [2] Robust Ellipse Fitting Based on Maximum Correntropy Criterion With Variable Center
    Wang, Wei
    Wang, Gang
    Hu, Chenlong
    Ho, K. C.
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2023, 32 : 2520 - 2535
  • [3] Maximum Correntropy Criterion With Variable Center
    Chen, Badong
    Wang, Xin
    Li, Yingsong
    Principe, Jose C.
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2019, 26 (08) : 1212 - 1216
  • [4] Robust Maximum Mixture Correntropy Criterion-Based Semi-Supervised ELM With Variable Center
    Yang, Jie
    Cao, Jiuwen
    Xue, Anke
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2020, 67 (12) : 3572 - 3576
  • [5] Maximum Correntropy Criterion for Robust TOA-Based Localization in NLOS Environments
    Xiong, Wenxin
    Schindelhauer, Christian
    So, Hing Cheung
    Wang, Zhi
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2021, 40 (12) : 6325 - 6339
  • [6] Maximum Correntropy Criterion for Robust TOA-Based Localization in NLOS Environments
    Wenxin Xiong
    Christian Schindelhauer
    Hing Cheung So
    Zhi Wang
    [J]. Circuits, Systems, and Signal Processing, 2021, 40 : 6325 - 6339
  • [7] Robust variable kernel width for maximum correntropy criterion algorithm
    Huang, Wei
    Shan, Haojie
    Xu, Jinshan
    Yao, Xinwei
    [J]. SIGNAL PROCESSING, 2021, 182
  • [8] Adaptive Filtering Under the Maximum Correntropy Criterion With Variable Center
    Zhu, Lingfei
    Song, Chengtian
    Pan, Lizhi
    Li, Jili
    [J]. IEEE ACCESS, 2019, 7 : 105902 - 105908
  • [9] Maximum Correntropy Criterion Based Robust Kalman Filter
    Wang, Liansheng
    Gao, XingWei
    Yin, Lijian
    [J]. CHINA SATELLITE NAVIGATION CONFERENCE (CSNC) 2018 PROCEEDINGS, VOL III, 2018, 499 : 491 - 500
  • [10] Robust Information Filter Based on Maximum Correntropy Criterion
    Wang, Yidi
    Zheng, Wei
    Sun, Shouming
    Li, Li
    [J]. JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2016, 39 (05) : 1124 - +