2013
DOI: 10.1109/tsp.2012.2231076
|View full text |Cite
|
Sign up to set email alerts
|

Compressive Sensing With Prior Information: Requirements and Probabilities of Reconstruction in 𝓁1- Minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0
1

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(19 citation statements)
references
References 25 publications
0
18
0
1
Order By: Relevance
“…The error of the reconstructed image is higher than the reconstruction errors reported in [MvBP13] and [MvBP09]; however, the result in Figure 8 was obtained under more restrictive conditions. To limit the computation time needed for image reconstruction, we have to limit the size of the images and the number of measurements used in the reconstruction.…”
Section: A Amentioning
confidence: 55%
“…The error of the reconstructed image is higher than the reconstruction errors reported in [MvBP13] and [MvBP09]; however, the result in Figure 8 was obtained under more restrictive conditions. To limit the computation time needed for image reconstruction, we have to limit the size of the images and the number of measurements used in the reconstruction.…”
Section: A Amentioning
confidence: 55%
“…This problem is an ordinary sparse coding problem and many algorithms have been proposed [17]. However, the recent CS researches reveal that the use of the additional prior information about the sparse representation's support is shown to have advantages in terms of number of required measurements, convergence time and number of iterations [18,19]. Nonetheless, in DFPL applications this information is not easy to be obtained, since the target to be tracked is generally uncooperative.…”
Section: Cs Reconstruction Algorithm With Prior Informationmentioning
confidence: 99%
“…The idea of this method is to introduce weights dependent on the prior information on the positions of nonzero coefficients in the sparse domain into the traditional basis pursuit (BP) algorithm, so that nonzero coefficients in the prior region are favored. Motivated by iteratively reweighted idea in [18,19], the sparse vector x t can then be reconstructed from the measurements ∆R t by solving…”
Section: Cs Reconstruction Algorithm With Prior Informationmentioning
confidence: 99%
“…This formulation encourages a solution with more zeros outside , and thus it may recover the signal more accurately than traditional CS does for signals whose support includes . Based on sufficient condition [19,22,23] for CS-PKS, the number of measurements required for CS-PKS is less than that required for traditional CS, and the more the support is known, the fewer the measurements needed are. The robustness of truncated minimization in noisy case has been discussed in [20][21][22].…”
Section: Compressed Spectrum Reconstruction With Partiallymentioning
confidence: 99%