RBF NN-Enabled Adaptive Filter for Any Type of Noise

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE transactions on neural networks and learning systems Pub Date : 2024-12-30 DOI:10.1109/TNNLS.2024.3518592
Min Li;Yunlong Zhao;Qizhen Wang;Hanlin Gao;Gang Wang
{"title":"RBF NN-Enabled Adaptive Filter for Any Type of Noise","authors":"Min Li;Yunlong Zhao;Qizhen Wang;Hanlin Gao;Gang Wang","doi":"10.1109/TNNLS.2024.3518592","DOIUrl":null,"url":null,"abstract":"The brief proposes a radial basis function (RBF) neural network (NN)-enabled adaptive filter (AF) algorithm, which consists of two stages. The first stage is a data-driven (DD) preprocessing part, and the RBF NN is to fit the probability density function (pdf) of the noise. The second stage is a model-driven filtering part, the RBF NN works as the cost function of the adaptive filtering, and an adaptive gradient ascent algorithm is obtained by maximizing the RBF NN. Since the RBF NN can fit any pdf of the noise, the proposed algorithm can work well in Gaussian, sub-Gaussian or light-tailed (uniform), and super-Gaussian or heavy-tailed (multipeak, pulse, and skewness) noises. Theoretical analysis shows the mean-value stability and mean square performance. Simulations verify the effectiveness of the proposed algorithm.","PeriodicalId":13303,"journal":{"name":"IEEE transactions on neural networks and learning systems","volume":"36 8","pages":"15542-15546"},"PeriodicalIF":8.9000,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on neural networks and learning systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10817790/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The brief proposes a radial basis function (RBF) neural network (NN)-enabled adaptive filter (AF) algorithm, which consists of two stages. The first stage is a data-driven (DD) preprocessing part, and the RBF NN is to fit the probability density function (pdf) of the noise. The second stage is a model-driven filtering part, the RBF NN works as the cost function of the adaptive filtering, and an adaptive gradient ascent algorithm is obtained by maximizing the RBF NN. Since the RBF NN can fit any pdf of the noise, the proposed algorithm can work well in Gaussian, sub-Gaussian or light-tailed (uniform), and super-Gaussian or heavy-tailed (multipeak, pulse, and skewness) noises. Theoretical analysis shows the mean-value stability and mean square performance. Simulations verify the effectiveness of the proposed algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
任意类型噪声的RBF神经网络自适应滤波器
摘要提出了一种径向基函数(RBF)神经网络自适应滤波(AF)算法,该算法分为两个阶段。第一阶段是数据驱动预处理,RBF神经网络拟合噪声的概率密度函数(pdf)。第二阶段是模型驱动滤波部分,RBF神经网络作为自适应滤波的代价函数,通过最大化RBF神经网络得到自适应梯度上升算法。由于RBF神经网络可以拟合任何类型的噪声,因此该算法可以很好地处理高斯、亚高斯或轻尾(均匀)以及超高斯或重尾(多峰、脉冲和偏态)噪声。理论分析表明了该算法的均值稳定性和均方性能。仿真结果验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE transactions on neural networks and learning systems
IEEE transactions on neural networks and learning systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
CiteScore
23.80
自引率
9.60%
发文量
2102
审稿时长
3-8 weeks
期刊介绍: The focus of IEEE Transactions on Neural Networks and Learning Systems is to present scholarly articles discussing the theory, design, and applications of neural networks as well as other learning systems. The journal primarily highlights technical and scientific research in this domain.
期刊最新文献
Seeing What Few-Shot Learners See: Contrastive Cross-Class Attribution for Explainability. Accelerated Reinforcement Learning With Verifiable Excitation for Cubic Convergence. Learning Optimal Policies With Local Observations for Cooperative Multiagent Reinforcement Learning. Learning From M-Tuple One-vs-All Confidence Comparison Data. Sparse Variational Student-t Processes for Heavy-Tailed Modeling.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1