onebitcompressedsensingbygreedyalgorithms

	onebitcompressedsensingbygreedyalgorithms
	Liu Wenhui; Gong Da; Xu Zhiqiang
	2016
发表期刊	numericalmathematicstheorymethodsandapplications
ISSN	1004-8979
卷号	9 期号:2 页码:169
摘要	Sign 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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/46026
专题	计算数学与科学工程计算研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 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.