最小最大ODIF鲁棒堆栈滤波器的高效设计

B. Dumitrescu, I. Tabus, S. Peltonen, J. Astola, E. Dougherty
{"title":"最小最大ODIF鲁棒堆栈滤波器的高效设计","authors":"B. Dumitrescu, I. Tabus, S. Peltonen, J. Astola, E. Dougherty","doi":"10.1109/ISSPA.2001.949771","DOIUrl":null,"url":null,"abstract":"The design of an optimal stack filter may be reduced to a linear programming problem, where the criterion is the mean absolute error between a clean signal and noisy version of it. We introduce robustness considerations in the optimization problem. Our approach is to minimize the maximum value of the output distributional influence function (ODIF) associated with the signal and the additive noise. This leads to a new linear programming problem, solved with interior-point methods. We also present a heuristic that allows a significant reduction of the problem size, without sacrificing the quality of the resulting filter.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient design of minmax ODIF robust stack filters\",\"authors\":\"B. Dumitrescu, I. Tabus, S. Peltonen, J. Astola, E. Dougherty\",\"doi\":\"10.1109/ISSPA.2001.949771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of an optimal stack filter may be reduced to a linear programming problem, where the criterion is the mean absolute error between a clean signal and noisy version of it. We introduce robustness considerations in the optimization problem. Our approach is to minimize the maximum value of the output distributional influence function (ODIF) associated with the signal and the additive noise. This leads to a new linear programming problem, solved with interior-point methods. We also present a heuristic that allows a significant reduction of the problem size, without sacrificing the quality of the resulting filter.\",\"PeriodicalId\":236050,\"journal\":{\"name\":\"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.2001.949771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2001.949771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

最优堆栈滤波器的设计可以简化为一个线性规划问题,其中准则是干净信号和带噪信号之间的平均绝对误差。在优化问题中引入鲁棒性考虑。我们的方法是最小化与信号和加性噪声相关的输出分布影响函数(ODIF)的最大值。这导致了一个新的线性规划问题,用内点法求解。我们还提出了一种启发式方法,可以在不牺牲最终过滤器质量的情况下显著减少问题的大小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient design of minmax ODIF robust stack filters
The design of an optimal stack filter may be reduced to a linear programming problem, where the criterion is the mean absolute error between a clean signal and noisy version of it. We introduce robustness considerations in the optimization problem. Our approach is to minimize the maximum value of the output distributional influence function (ODIF) associated with the signal and the additive noise. This leads to a new linear programming problem, solved with interior-point methods. We also present a heuristic that allows a significant reduction of the problem size, without sacrificing the quality of the resulting filter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信