压缩感知正交匹配追踪的扩展

2011 National Conference on Communications (NCC) Pub Date : 2011-03-17 DOI:10.1109/NCC.2011.5734741

Avishek Majumdar, Nikhil Krishnan, S. R. Pillai, R. Velmurugan

{"title":"压缩感知正交匹配追踪的扩展","authors":"Avishek Majumdar, Nikhil Krishnan, S. R. Pillai, R. Velmurugan","doi":"10.1109/NCC.2011.5734741","DOIUrl":null,"url":null,"abstract":"Compressed Sensing (CS) provides a set of mathematical results showing that sparse signals can be exactly reconstructed from a relatively small number of random linear measurements. A particularly appealing greedy-approach to signal reconstruction from CS measurements is the so called Orthogonal Matching Pursuit (OMP). We propose two modifications to the basic OMP algorithm, which can be handy in different situations.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Extensions to Orthogonal Matching Pursuit for Compressed Sensing\",\"authors\":\"Avishek Majumdar, Nikhil Krishnan, S. R. Pillai, R. Velmurugan\",\"doi\":\"10.1109/NCC.2011.5734741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Compressed Sensing (CS) provides a set of mathematical results showing that sparse signals can be exactly reconstructed from a relatively small number of random linear measurements. A particularly appealing greedy-approach to signal reconstruction from CS measurements is the so called Orthogonal Matching Pursuit (OMP). We propose two modifications to the basic OMP algorithm, which can be handy in different situations.\",\"PeriodicalId\":158295,\"journal\":{\"name\":\"2011 National Conference on Communications (NCC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2011.5734741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2011.5734741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

压缩感知(CS)提供了一组数学结果，表明稀疏信号可以从相对少量的随机线性测量中精确重建。从CS测量中重建信号的一种特别吸引人的贪婪方法是所谓的正交匹配追踪(OMP)。我们对基本的OMP算法提出了两种修改，可以在不同的情况下使用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Extensions to Orthogonal Matching Pursuit for Compressed Sensing

Compressed Sensing (CS) provides a set of mathematical results showing that sparse signals can be exactly reconstructed from a relatively small number of random linear measurements. A particularly appealing greedy-approach to signal reconstruction from CS measurements is the so called Orthogonal Matching Pursuit (OMP). We propose two modifications to the basic OMP algorithm, which can be handy in different situations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 National Conference on Communications (NCC)

自引率

0.00%

发文量