A Greedy Multistage Convex Relaxation Algorithm Applied to Structured Group Sparse Reconstruction Problems Based on Iterative Support Detection

<div>The sorted groups’ magnitude of our tested nonoverlapping group sparse Bernoulli signal does not have fast decaying property.</div>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: A Greedy Multistage Convex Relaxation Algorithm Applied to Structured Group Sparse Reconstruction Problems Based on Iterative Support Detection 

Figure 7 | A Greedy Multistage Convex Relaxation Algorithm Applied to Structured Group Sparse Reconstruction Problems Based on Iterative Support Detection 