Robust range estimation algorithm based on hyper-tangent loss function

Chee-Hyun Park, Joon‐Hyuk Chang
{"title":"Robust range estimation algorithm based on hyper-tangent loss function","authors":"Chee-Hyun Park, Joon‐Hyuk Chang","doi":"10.1049/iet-spr.2019.0343","DOIUrl":null,"url":null,"abstract":"Herein, the authors present a robust estimator of range against the impulsive noise using only the received signal's magnitude. The M estimator has been widely used in robust signal processing. However, the existing M estimator requires statistical testing involving a threshold which has an optimality that varies with time, hence algorithmically challenging and computationally burdensome. The statistical testing is utilised for discerning the inlier and outlier. Further, statistical testing renders the computational burden of the algorithm high since the testing must be performed for each observation. Therefore, they propose the M estimator based on the hyper-tangent loss function, which does not demand statistical testing. Conventional M estimator employing information theoretic learning also does not call for statistical testing, but the mean square error (MSE) performance for the range estimation is inferior to that of the proposed method. Furthermore, they perform an analysis for the MSE for the proposed algorithm. Monte Carlo simulations not only validate their theoretical analysis, but also demonstrate the MSE performance of the proposed method is nearly same as the existing skipped filter although it does not require the statistical testing and optimal threshold selection.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Signal Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/iet-spr.2019.0343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Herein, the authors present a robust estimator of range against the impulsive noise using only the received signal's magnitude. The M estimator has been widely used in robust signal processing. However, the existing M estimator requires statistical testing involving a threshold which has an optimality that varies with time, hence algorithmically challenging and computationally burdensome. The statistical testing is utilised for discerning the inlier and outlier. Further, statistical testing renders the computational burden of the algorithm high since the testing must be performed for each observation. Therefore, they propose the M estimator based on the hyper-tangent loss function, which does not demand statistical testing. Conventional M estimator employing information theoretic learning also does not call for statistical testing, but the mean square error (MSE) performance for the range estimation is inferior to that of the proposed method. Furthermore, they perform an analysis for the MSE for the proposed algorithm. Monte Carlo simulations not only validate their theoretical analysis, but also demonstrate the MSE performance of the proposed method is nearly same as the existing skipped filter although it does not require the statistical testing and optimal threshold selection.
基于超切损失函数的鲁棒距离估计算法
在这里,作者提出了一种鲁棒估计距离对抗脉冲噪声仅使用接收信号的幅度。M估计器在鲁棒信号处理中得到了广泛的应用。然而,现有的M估计器需要涉及一个阈值的统计测试,该阈值具有随时间变化的最优性,因此在算法上具有挑战性和计算负担。统计检验用于识别内值和离群值。此外,统计测试使算法的计算负担很高,因为必须对每个观测值执行测试。因此,他们提出了基于超切损失函数的M估计量,该估计量不需要统计检验。采用信息理论学习的传统M估计方法也不需要进行统计检验,但距离估计的均方误差(MSE)性能不如本文提出的方法。此外,他们还对所提出算法的MSE进行了分析。蒙特卡罗仿真不仅验证了他们的理论分析,而且表明该方法不需要统计检验和最优阈值选择,但MSE性能与现有的跳过滤波器几乎相同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信