2017
DOI: 10.1016/j.sigpro.2017.04.005
|View full text |Cite
|
Sign up to set email alerts
|

A gradient-based approach to optimization of compressed sensing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 22 publications
0
13
0
Order By: Relevance
“…From then on, several works have been published for jointly optimizing sensing matrix and dictionary. For example, [24] extended the work of [23] to tensor compressive sensing and the experiments on multi-dimensional signals verified its superiority; [25] mainly concerned the normalization of the incoherent dictionary and the equivalent dictionary for clear physical meaning when optimizing these two matrices. Although these works have tried to optimize the sensing matrix and dictionary of CS system in a joint way, it should be pointed out that the model of (12) is still far away from simultaneously optimizing and .…”
Section: Preliminaries and Related Workmentioning
confidence: 99%
“…From then on, several works have been published for jointly optimizing sensing matrix and dictionary. For example, [24] extended the work of [23] to tensor compressive sensing and the experiments on multi-dimensional signals verified its superiority; [25] mainly concerned the normalization of the incoherent dictionary and the equivalent dictionary for clear physical meaning when optimizing these two matrices. Although these works have tried to optimize the sensing matrix and dictionary of CS system in a joint way, it should be pointed out that the model of (12) is still far away from simultaneously optimizing and .…”
Section: Preliminaries and Related Workmentioning
confidence: 99%
“…The following result establishes that the sequence generated by Algorithm 1 is a Cauchy sequence and thus the sequence itself is convergent and converges to a stationary point of ρ. Clearly, if the step size is chosen to satisfy (18), the convergence still holds. Thus, we suggest a backtracking method in Appendix D to practically choose η.…”
Section: Convergence Analysismentioning
confidence: 99%
“…Towards that end, it is important to develop a quantized (even 1-bit) sparse sensing matrix. We finally note that it remains an open problem to certify certain properties (such as the RIP) for the optimized sensing matrices [9][10][11][12][13][14][15][16][17][18][19], which empirically outperforms a random one that satisfies the RIP. Works in these directions are ongoing.…”
Section: Lenamentioning
confidence: 99%
See 1 more Smart Citation
“…Also, Duarte-Carvajalino et al [19] took the advantage of an eigenvalue decomposition process followed by a KSVD-based algorithm to optimise the measurement matrix and learn dictionary, respectively. Li et al [ 20] proposed a gradient descent-based algorithm derived for solving the optimal sensing matrix problem. Cleju [21] proposed a novel formulation in the form of a rank-constrained nearest correlation matrix problem.…”
Section: Introductionmentioning
confidence: 99%