CSpace  > 计算数学与科学工程计算研究所
onebitcompressedsensingbygreedyalgorithms
Liu Wenhui; Gong Da; Xu Zhiqiang
2016
Source Publicationnumericalmathematicstheorymethodsandapplications
ISSN1004-8979
Volume9Issue:2Pages:169
AbstractSign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching pursuit (OMP). The main part of STrMP is as concise as OMP and hence STrMP is simple to implement. In contrast to previous greedy algorithms for one-bit compressed sensing, STrMP only need to solve a convex and unconstrained subproblem at each iteration. Numerical experiments show that STrMP is fast and accurate for one-bit compressed sensing compared with other algorithms.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/46026
Collection计算数学与科学工程计算研究所
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
Liu Wenhui,Gong Da,Xu Zhiqiang. onebitcompressedsensingbygreedyalgorithms[J]. numericalmathematicstheorymethodsandapplications,2016,9(2):169.
APA Liu Wenhui,Gong Da,&Xu Zhiqiang.(2016).onebitcompressedsensingbygreedyalgorithms.numericalmathematicstheorymethodsandapplications,9(2),169.
MLA Liu Wenhui,et al."onebitcompressedsensingbygreedyalgorithms".numericalmathematicstheorymethodsandapplications 9.2(2016):169.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Liu Wenhui]'s Articles
[Gong Da]'s Articles
[Xu Zhiqiang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Liu Wenhui]'s Articles
[Gong Da]'s Articles
[Xu Zhiqiang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liu Wenhui]'s Articles
[Gong Da]'s Articles
[Xu Zhiqiang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.