基于GMC稀疏正则化的BTT参数识别加速算法

Yuda Zhu, Baijie Qiao, Yanan Wang, Bo Pan, Lin Chen, Xuefeng Chen
{"title":"基于GMC稀疏正则化的BTT参数识别加速算法","authors":"Yuda Zhu, Baijie Qiao, Yanan Wang, Bo Pan, Lin Chen, Xuefeng Chen","doi":"10.1109/ICSMD57530.2022.10058283","DOIUrl":null,"url":null,"abstract":"Accurate identification of vibration parameters from blade tip timing (BTT) undersampled signals is essential for rotating blade vibration monitoring. However, the traditional parameter identification method of BTT signal depends on the prior. The existing sparse regularization method underestimates the reconstructed signal amplitude and has low computational efficiency. This paper resorts to an accelerated algorithm for BTT identification parameters based on generalized minimax-concave (GMC) sparse regularization to accurately and quickly identify amplitude and frequency parameters from undersampled signals. For amplitude underestimation, the non-convex GMC penalty is introduced so that the sparsity of the estimation is improved, and the convexity of the cost function is preserved. Moreover, Nesterov's accelerated iterative computation strategy is resorted to rapidly improving the convergence performance of obtaining the global optimum. The simulation results show that by reconstructing the BTT signal, the presented parameter identification algorithm based on accelerated generalized minimax-concave (AGMC) improves the computational rate with the inherited merits of accuracy.","PeriodicalId":396735,"journal":{"name":"2022 International Conference on Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Accelerated algorithm for BTT identification parameter with GMC sparse regularization\",\"authors\":\"Yuda Zhu, Baijie Qiao, Yanan Wang, Bo Pan, Lin Chen, Xuefeng Chen\",\"doi\":\"10.1109/ICSMD57530.2022.10058283\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Accurate identification of vibration parameters from blade tip timing (BTT) undersampled signals is essential for rotating blade vibration monitoring. However, the traditional parameter identification method of BTT signal depends on the prior. The existing sparse regularization method underestimates the reconstructed signal amplitude and has low computational efficiency. This paper resorts to an accelerated algorithm for BTT identification parameters based on generalized minimax-concave (GMC) sparse regularization to accurately and quickly identify amplitude and frequency parameters from undersampled signals. For amplitude underestimation, the non-convex GMC penalty is introduced so that the sparsity of the estimation is improved, and the convexity of the cost function is preserved. Moreover, Nesterov's accelerated iterative computation strategy is resorted to rapidly improving the convergence performance of obtaining the global optimum. The simulation results show that by reconstructing the BTT signal, the presented parameter identification algorithm based on accelerated generalized minimax-concave (AGMC) improves the computational rate with the inherited merits of accuracy.\",\"PeriodicalId\":396735,\"journal\":{\"name\":\"2022 International Conference on Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD)\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSMD57530.2022.10058283\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSMD57530.2022.10058283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

从叶尖定时欠采样信号中准确识别振动参数对叶片振动监测至关重要。然而,传统的BTT信号参数辨识方法依赖于先验。现有的稀疏正则化方法低估了重构信号的幅值,计算效率较低。本文采用基于广义极小极大凹(GMC)稀疏正则化的BTT识别参数加速算法,从欠采样信号中准确快速地识别振幅和频率参数。对于幅度估计不足,引入非凸GMC惩罚,提高了估计的稀疏性,同时保持了代价函数的凸性。采用Nesterov加速迭代计算策略,快速提高全局最优解的收敛性能。仿真结果表明,基于加速广义极小极大凹(AGMC)的参数识别算法通过对BTT信号进行重构,在继承精度优点的同时提高了计算率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerated algorithm for BTT identification parameter with GMC sparse regularization
Accurate identification of vibration parameters from blade tip timing (BTT) undersampled signals is essential for rotating blade vibration monitoring. However, the traditional parameter identification method of BTT signal depends on the prior. The existing sparse regularization method underestimates the reconstructed signal amplitude and has low computational efficiency. This paper resorts to an accelerated algorithm for BTT identification parameters based on generalized minimax-concave (GMC) sparse regularization to accurately and quickly identify amplitude and frequency parameters from undersampled signals. For amplitude underestimation, the non-convex GMC penalty is introduced so that the sparsity of the estimation is improved, and the convexity of the cost function is preserved. Moreover, Nesterov's accelerated iterative computation strategy is resorted to rapidly improving the convergence performance of obtaining the global optimum. The simulation results show that by reconstructing the BTT signal, the presented parameter identification algorithm based on accelerated generalized minimax-concave (AGMC) improves the computational rate with the inherited merits of accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信