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 Gaussian signal has fast decaying property.</div>

Mathematical Problems in Engineering

fig1

Figure 1

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

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