Batch Look Ahead Orthogonal Matching Pursuit

Muralikrishnna G. Sethuraman, Sooraj K. Ambat, K. Hari
{"title":"Batch Look Ahead Orthogonal Matching Pursuit","authors":"Muralikrishnna G. Sethuraman, Sooraj K. Ambat, K. Hari","doi":"10.1109/NCC.2018.8600087","DOIUrl":null,"url":null,"abstract":"Compressed sensing (CS) is a sampling paradigm that enables sampling signals at sub Nyquist rates by exploiting the sparse nature of signals. One of the main concerns in CS is the reconstruction of the signal after sampling. Many reconstruction algorithms have been proposed in the literature for the recovery of the sparse signals - Basis Pursuit, Orthogonal Matching Pursuit (OMP), Look Ahead Orthogonal Matching Pursuit (LAOMP) are some of the popular reconstruction algorithms. LAOMP, a modification of OMP, improves the reconstruction accuracy of OMP by employing a look ahead procedure. But LAOMP suffers from the drawback of being very expensive in terms of the computational time. In this paper we propose a modified version of the LAOMP algorithm called Batch-LAOMP which has a lesser computational complexity and also gives better performance in terms of reconstruction accuracy as seen from the results of the numerical experiments.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8600087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Compressed sensing (CS) is a sampling paradigm that enables sampling signals at sub Nyquist rates by exploiting the sparse nature of signals. One of the main concerns in CS is the reconstruction of the signal after sampling. Many reconstruction algorithms have been proposed in the literature for the recovery of the sparse signals - Basis Pursuit, Orthogonal Matching Pursuit (OMP), Look Ahead Orthogonal Matching Pursuit (LAOMP) are some of the popular reconstruction algorithms. LAOMP, a modification of OMP, improves the reconstruction accuracy of OMP by employing a look ahead procedure. But LAOMP suffers from the drawback of being very expensive in terms of the computational time. In this paper we propose a modified version of the LAOMP algorithm called Batch-LAOMP which has a lesser computational complexity and also gives better performance in terms of reconstruction accuracy as seen from the results of the numerical experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
批量前瞻正交匹配追踪
压缩感知(CS)是一种采样范例,通过利用信号的稀疏特性,可以以亚奈奎斯特速率采样信号。CS的主要问题之一是采样后信号的重建。文献中提出了许多用于稀疏信号恢复的重构算法,其中基追踪、正交匹配追踪(OMP)、前瞻正交匹配追踪(LAOMP)是比较流行的重构算法。LAOMP是对OMP的一种改进,它采用了一种超前的方法,提高了OMP的重建精度。但是LAOMP的缺点是在计算时间方面非常昂贵。本文提出了一种改进的LAOMP算法,称为Batch-LAOMP,该算法具有较低的计算复杂度,并且从数值实验结果来看,在重建精度方面具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code A Cognitive Opportunistic Fractional Frequency Reuse Scheme for OFDMA Uplinks Caching Policies for Transient Data Grouping Subarray for Robust Estimation of Direction of Arrival Universal Compression of a Piecewise Stationary Source Through Sequential Change Detection
×
引用
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