个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职:Director of Academic Committee at Kaifa District
其他任职:开发区校区学术分委员会主任(Director of Academic Committee at Kaifa Campus)
性别:男
毕业院校:多伦多大学
学位:博士
所在单位:软件学院、国际信息与软件学院
学科:软件工程. 运筹学与控制论
办公地点:开发区(Kaifa District Campus)
联系方式:mingchul@dlut.edu.cn
电子邮箱:mingchul@dlut.edu.cn
A new construction of compressed sensing matrices for signal processing via vector spaces over finite fields
点击次数:
论文类型:期刊论文
发表时间:2019-11-01
发表刊物:MULTIMEDIA TOOLS AND APPLICATIONS
收录刊物:EI、SCIE
卷号:78
期号:22
页面范围:31137-31161
ISSN号:1380-7501
关键字:Compressed sensing matrices; Vector spaces; Coherence; Restricted isometry property; Signal processing
摘要:As an emerging sampling technique, Compressed Sensing provides a quite masterly approach to data acquisition. Compared with the traditional method, how to conquer the Shannon/Nyquist sampling theorem has been fundamentally resolved. In this paper, first, we provide deterministic constructions of sensing matrices based on vector spaces over finite fields. Second, we analyze two kinds of attributes of sensing matrices. One is the recovery performance with respect to compressing and recovering signals in terms of restricted isometry property. In particular, we obtain a series of binary sensing matrices with sparsity level that are quite better than some existing ones. In order to save the storage space and accelerate the recovery process of signals, another character sparsity of matrices has been taken into account. Third, we merge our binary matrices with some matrices owning low coherence in terms of an embedding manipulation to obtain the improved matrices still having low coherence. Finally, compared with the quintessential binary matrices, the improved matrices possess better character of compressing and recovering signals. The favorable performance of our binary and improved matrices have been demonstrated by numerical simulations.