2018
DOI: 10.1016/j.aeue.2018.10.005
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian compressive sensing using reweighted laplace priors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…Specifically, the sensed signals are measured by Gaussian random matrices Φ j ∈ R M x ×400 in each time instant τ = 31 s, and the sink received the measured signals. The simulation results are reported from the obtained mean results of 100 frames with different x j s. The performance of the proposed reconstruction algorithm is compared with gradient-CS [11], SFAR-2D [12], reweightedlaplace [13], sequential-CS [20], modified-CS [29] and regularized modified-BPDN [30]. During the simulation, several parameters of the algorithms have been carefully tuned to perform an impartial comparison between the algorithms.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Specifically, the sensed signals are measured by Gaussian random matrices Φ j ∈ R M x ×400 in each time instant τ = 31 s, and the sink received the measured signals. The simulation results are reported from the obtained mean results of 100 frames with different x j s. The performance of the proposed reconstruction algorithm is compared with gradient-CS [11], SFAR-2D [12], reweightedlaplace [13], sequential-CS [20], modified-CS [29] and regularized modified-BPDN [30]. During the simulation, several parameters of the algorithms have been carefully tuned to perform an impartial comparison between the algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…And as the number of measurements increases, the performance of the methods gradually approaches that of the proposed algorithm. The reconstruction times versus different measurement numbers for gradient-CS [11], SFAR-2D [12], reweighted-laplace [13], sequential-CS [20], modified-CS [29], regularized modified-BPDN [30] and the proposed algorithm is depicted in Fig. 2.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In Ref. [26], the reweighted Laplace priors are developed to improve the sparsity representation. However, in this work, the calculation of matrix inversion will cause significant time consuming.…”
Section: Introductionmentioning
confidence: 99%
“…Research on high performance CS image reconstruction methods is a hot topic in CS field. Traditional methods [8][9][10][11][12][13] to solve CS reconstruction problem are mostly based on physical-driven approaches, such as convex optimization [8,11], greedy algorithm [12,13], and non-convex algorithm [9,10]. However, these methods commonly adopt iterative optimization strategies to solve the problem of image signal reconstruction.…”
Section: Introductionmentioning
confidence: 99%