Name
Abstract | ||
|---|---|---|
To cope with the huge expenditure associated with the fast growing sampling rate, compressed sensing (CS) is proposed as an effective technique of signal processing. In this paper, first, we construct a type of CS matrix to process signals based on singular linear spaces over finite fields. Second, we analyze two kinds of attributes of sensing matrices. One is the recovery performance corresponding to compressing and recovering signals. In particular, we apply two types of criteria, error-correcting pooling designs (PD) and restricted isometry property (RIP), to investigate this attribute. Another is the sparsity corresponding to storage and transmission signals. Third, in order to improve the ability associated with our matrices, we use an embedding approach to merge our binary matrices with some other matrices owing low coherence. At last, we compare our matrices with other existing ones via numerical simulations and the results show that ours outperform others. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11042-018-6120-4 | Multimedia Tools Appl. |
Keywords | Field | DocType |
Compressed sensing matrices, Signal processing, Singular linear spaces, Pooling design (PD), Restricted isometry property (RIP), Sparsity | Signal processing,Embedding,Pattern recognition,Matrix (mathematics),Computer science,Sampling (signal processing),Algorithm,Coherence (physics),Artificial intelligence,Restricted isometry property,Compressed sensing,Binary number | Journal |
Volume | Issue | ISSN |
77 | 23 | 1380-7501 |
Citations | PageRank | References |
0 | 0.34 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingmo Jie | 1 | 34 | 3.59 |
| Cheng Guo | 2 | 47 | 9.84 |
| Mingchu Li | 3 | 469 | 78.10 |
| Bin Feng | 4 | 8 | 2.81 |