基于omp算法的改进方法使用融合策略

Yi Xu, Guiling Sun, Tianyu Geng, Zhouzhou Li
{"title":"基于omp算法的改进方法使用融合策略","authors":"Yi Xu, Guiling Sun, Tianyu Geng, Zhouzhou Li","doi":"10.1109/CSPA.2017.8064951","DOIUrl":null,"url":null,"abstract":"The Orthogonal Matching Pursuit (OMP) algorithm has been intensively applied for its simple structure and reconstruction efficiency. However, the reconstruction accuracy of OMP algorithm still needs to be improved. Though the OMP-based algorithms, LAOMP algorithm and KOMP algorithm proposed in recent years have significantly improved reconstruction performance while it can lead to fairly high computational complexity. In this paper, we propose an improved method for OMP-based algorithms using fusing strategy and demonstrate its superiority. We use the double intersection method to fuse the estimated support set from algorithms with low computational complexity to get an atomic set with high accuracy. This is used as an initial support set to improve the LAOMP algorithm and KOMP algorithm. According to the simulation results, compared with the original algorithms, the reconstruction accuracy of the improved algorithms increases to some extent while the reconstruction time sharply decreases and the performance is more remarkable as the computational amount of the original algorithms increases.","PeriodicalId":445522,"journal":{"name":"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An improved method for OMP-based algorithm; using fusing strategy\",\"authors\":\"Yi Xu, Guiling Sun, Tianyu Geng, Zhouzhou Li\",\"doi\":\"10.1109/CSPA.2017.8064951\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Orthogonal Matching Pursuit (OMP) algorithm has been intensively applied for its simple structure and reconstruction efficiency. However, the reconstruction accuracy of OMP algorithm still needs to be improved. Though the OMP-based algorithms, LAOMP algorithm and KOMP algorithm proposed in recent years have significantly improved reconstruction performance while it can lead to fairly high computational complexity. In this paper, we propose an improved method for OMP-based algorithms using fusing strategy and demonstrate its superiority. We use the double intersection method to fuse the estimated support set from algorithms with low computational complexity to get an atomic set with high accuracy. This is used as an initial support set to improve the LAOMP algorithm and KOMP algorithm. According to the simulation results, compared with the original algorithms, the reconstruction accuracy of the improved algorithms increases to some extent while the reconstruction time sharply decreases and the performance is more remarkable as the computational amount of the original algorithms increases.\",\"PeriodicalId\":445522,\"journal\":{\"name\":\"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSPA.2017.8064951\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSPA.2017.8064951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

正交匹配追踪(OMP)算法以其结构简单、重构效率高等优点得到了广泛的应用。然而,OMP算法的重建精度仍有待提高。虽然基于omp的算法,但近年来提出的LAOMP算法和KOMP算法都显著提高了重建性能,但也会导致较高的计算复杂度。本文提出了一种基于omp算法的融合改进方法,并证明了其优越性。我们采用双相交方法将计算复杂度较低的算法估计的支持集进行融合,得到精度较高的原子集。这被用作改进LAOMP算法和KOMP算法的初始支持集。仿真结果表明,与原算法相比,随着原算法计算量的增加,改进算法的重建精度有所提高,但重建时间急剧缩短,性能更加显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved method for OMP-based algorithm; using fusing strategy
The Orthogonal Matching Pursuit (OMP) algorithm has been intensively applied for its simple structure and reconstruction efficiency. However, the reconstruction accuracy of OMP algorithm still needs to be improved. Though the OMP-based algorithms, LAOMP algorithm and KOMP algorithm proposed in recent years have significantly improved reconstruction performance while it can lead to fairly high computational complexity. In this paper, we propose an improved method for OMP-based algorithms using fusing strategy and demonstrate its superiority. We use the double intersection method to fuse the estimated support set from algorithms with low computational complexity to get an atomic set with high accuracy. This is used as an initial support set to improve the LAOMP algorithm and KOMP algorithm. According to the simulation results, compared with the original algorithms, the reconstruction accuracy of the improved algorithms increases to some extent while the reconstruction time sharply decreases and the performance is more remarkable as the computational amount of the original algorithms increases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信