Name
Abstract | ||
|---|---|---|
Sparse signals can be reconstructed from far fewer samples than those that were required by the Shannon sampling theorem, if compressed sensing (CS) is employed. Traditionally, a random Gaussian (rGauss) matrix is used as a projection matrix in CS. Alternatively, optimization of the projection matrix is considered in this paper to enhance the quality of the reconstruction in CS. Bringing the multiplication of the projection matrix and the sparsifying basis to be near an equiangular tight frame (ETF) is a good idea proposed by some previous works. Here, a low-rank Gram matrix model is introduced to realize this idea. Also, an algorithm is presented via a computational method of the low-rank matrix nearness problem. Simulations show that the proposed method is better than some other methods in optimizing the projection matrix in terms of image denoising via sparse representation. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00034-013-9706-0 | CSSP |
Keywords | Field | DocType |
Projection matrix, Matrix nearness problem, Equiangular tight frame (ETF), Unit-sphere manifold | Mathematical optimization,Generator matrix,Single-entry matrix,Hollow matrix,Eigendecomposition of a matrix,Cuthill–McKee algorithm,Band matrix,Sparse matrix,Mathematics,Block matrix | Journal |
Volume | Issue | ISSN |
33 | 5 | 1531-5878 |
Citations | PageRank | References |
1 | 0.37 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiheng Zhang | 1 | 21 | 3.87 |
| Yuli Fu | 2 | 200 | 29.90 |
| Haifeng Li | 3 | 25 | 7.92 |
| Rong Rong | 4 | 12 | 3.66 |