DCM_MCCKF:基于CS散度的自适应核大小的非高斯状态估计器

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neurocomputing Pub Date : 2024-11-23 DOI:10.1016/j.neucom.2024.128809
Xuefei Bai , Quanbo Ge , Pingliang(Peter) Zeng
{"title":"DCM_MCCKF:基于CS散度的自适应核大小的非高斯状态估计器","authors":"Xuefei Bai ,&nbsp;Quanbo Ge ,&nbsp;Pingliang(Peter) Zeng","doi":"10.1016/j.neucom.2024.128809","DOIUrl":null,"url":null,"abstract":"<div><div>In practical industrial system models, noise is better characterized by heavy-tailed non-Gaussian distributions. For state estimation in systems with heavy-tailed non-Gaussian noise, the maximum correntropy criterion (MCC) based on information theoretic learning (ITL) is widely adopted, achieving good filtering performance. The performance of MCC-based filtering depends on the selection of the kernel function and its parameters. To overcome the sensitivity of the Gaussian kernel to its parameters and the limitation of a single kernel function in comprehensively reflecting the characteristics of complex heterogeneous data, a double-Cauchy mixture-based MCC Kalman Filtering (DCM_MCCKF) algorithm is proposed. This selection uses a mixture of two Cauchy kernel functions, using their heavy-tailed properties to better handle large errors and reduce sensitivity to kernel size variations. As a result, it improves the robustness and flexibility of MCC-based filtering. The kernel size should adapt to changes in signal distribution. To address the limitation of fixed kernel size, an adaptive kernel size update rule is designed by comprehensively considering system models, accessible measurements, CS divergence between noise distributions, and covariance propagation. Simulation examples of target tracking validate that the proposed DCM_MCCKF algorithm, under the adaptive kernel size updating rule, effectively handles complex data and achieves superior filtering performance in heavy-tailed non-Gaussian noise scenarios. This algorithm outperforms traditional Kalman filters (KF) based on the mean square error (MSE) criterion, Gaussian sum filtering (GSF), particle filtering (PF), and Maximum Correntropy Criterion Kalman filters (MCCKF) with a single Gaussian kernel (G_MCCKF), a double-Gaussian mixture kernel (DGM_MCCKF), and a Gaussian-Cauchy mixture kernel (GCM_MCCKF). Consequently, the DCM_MCCKF algorithm significantly enhances the applicability and robustness of MCC-based filtering methods.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"617 ","pages":"Article 128809"},"PeriodicalIF":5.5000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DCM_MCCKF: A non-Gaussian state estimator with adaptive kernel size based on CS divergence\",\"authors\":\"Xuefei Bai ,&nbsp;Quanbo Ge ,&nbsp;Pingliang(Peter) Zeng\",\"doi\":\"10.1016/j.neucom.2024.128809\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In practical industrial system models, noise is better characterized by heavy-tailed non-Gaussian distributions. For state estimation in systems with heavy-tailed non-Gaussian noise, the maximum correntropy criterion (MCC) based on information theoretic learning (ITL) is widely adopted, achieving good filtering performance. The performance of MCC-based filtering depends on the selection of the kernel function and its parameters. To overcome the sensitivity of the Gaussian kernel to its parameters and the limitation of a single kernel function in comprehensively reflecting the characteristics of complex heterogeneous data, a double-Cauchy mixture-based MCC Kalman Filtering (DCM_MCCKF) algorithm is proposed. This selection uses a mixture of two Cauchy kernel functions, using their heavy-tailed properties to better handle large errors and reduce sensitivity to kernel size variations. As a result, it improves the robustness and flexibility of MCC-based filtering. The kernel size should adapt to changes in signal distribution. To address the limitation of fixed kernel size, an adaptive kernel size update rule is designed by comprehensively considering system models, accessible measurements, CS divergence between noise distributions, and covariance propagation. Simulation examples of target tracking validate that the proposed DCM_MCCKF algorithm, under the adaptive kernel size updating rule, effectively handles complex data and achieves superior filtering performance in heavy-tailed non-Gaussian noise scenarios. This algorithm outperforms traditional Kalman filters (KF) based on the mean square error (MSE) criterion, Gaussian sum filtering (GSF), particle filtering (PF), and Maximum Correntropy Criterion Kalman filters (MCCKF) with a single Gaussian kernel (G_MCCKF), a double-Gaussian mixture kernel (DGM_MCCKF), and a Gaussian-Cauchy mixture kernel (GCM_MCCKF). Consequently, the DCM_MCCKF algorithm significantly enhances the applicability and robustness of MCC-based filtering methods.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"617 \",\"pages\":\"Article 128809\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2024-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231224015807\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231224015807","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在实际工业系统模型中,用重尾非高斯分布更好地表征噪声。对于重尾非高斯噪声系统的状态估计,基于信息理论学习(ITL)的最大熵准则(MCC)被广泛采用,具有良好的滤波性能。基于mcc的过滤性能取决于核函数及其参数的选择。为了克服高斯核对高斯核参数的敏感性和单一核函数不能全面反映复杂异构数据特征的局限性,提出了一种基于双柯西混合的MCC卡尔曼滤波(DCM_MCCKF)算法。这个选择使用两个柯西核函数的混合,使用它们的重尾属性来更好地处理大错误并降低对核大小变化的敏感性。从而提高了基于mcc的滤波的鲁棒性和灵活性。内核大小应适应信号分布的变化。针对固定核大小的局限性,综合考虑系统模型、可达测量值、噪声分布间CS散度和协方差传播等因素,设计了自适应核大小更新规则。目标跟踪仿真实例验证了所提出的DCM_MCCKF算法在自适应核大小更新规则下能够有效处理复杂数据,并在重尾非高斯噪声场景下取得了较好的滤波性能。该算法优于传统的基于均方误差(MSE)准则、高斯和滤波(GSF)、粒子滤波(PF)和最大相关系数准则的单高斯核(G_MCCKF)、双高斯混合核(DGM_MCCKF)和高斯-柯西混合核(GCM_MCCKF)卡尔曼滤波器(MCCKF)。因此,DCM_MCCKF算法显著提高了基于mcc的滤波方法的适用性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DCM_MCCKF: A non-Gaussian state estimator with adaptive kernel size based on CS divergence
In practical industrial system models, noise is better characterized by heavy-tailed non-Gaussian distributions. For state estimation in systems with heavy-tailed non-Gaussian noise, the maximum correntropy criterion (MCC) based on information theoretic learning (ITL) is widely adopted, achieving good filtering performance. The performance of MCC-based filtering depends on the selection of the kernel function and its parameters. To overcome the sensitivity of the Gaussian kernel to its parameters and the limitation of a single kernel function in comprehensively reflecting the characteristics of complex heterogeneous data, a double-Cauchy mixture-based MCC Kalman Filtering (DCM_MCCKF) algorithm is proposed. This selection uses a mixture of two Cauchy kernel functions, using their heavy-tailed properties to better handle large errors and reduce sensitivity to kernel size variations. As a result, it improves the robustness and flexibility of MCC-based filtering. The kernel size should adapt to changes in signal distribution. To address the limitation of fixed kernel size, an adaptive kernel size update rule is designed by comprehensively considering system models, accessible measurements, CS divergence between noise distributions, and covariance propagation. Simulation examples of target tracking validate that the proposed DCM_MCCKF algorithm, under the adaptive kernel size updating rule, effectively handles complex data and achieves superior filtering performance in heavy-tailed non-Gaussian noise scenarios. This algorithm outperforms traditional Kalman filters (KF) based on the mean square error (MSE) criterion, Gaussian sum filtering (GSF), particle filtering (PF), and Maximum Correntropy Criterion Kalman filters (MCCKF) with a single Gaussian kernel (G_MCCKF), a double-Gaussian mixture kernel (DGM_MCCKF), and a Gaussian-Cauchy mixture kernel (GCM_MCCKF). Consequently, the DCM_MCCKF algorithm significantly enhances the applicability and robustness of MCC-based filtering methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
期刊最新文献
Monocular thermal SLAM with neural radiance fields for 3D scene reconstruction Learning a more compact representation for low-rank tensor completion An HVS-derived network for assessing the quality of camouflaged targets with feature fusion Global Span Semantic Dependency Awareness and Filtering Network for nested named entity recognition A user behavior-aware multi-task learning model for enhanced short video recommendation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1