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

Figure 17

Comparison results of ADM1, and GM-ADM1 on the joint sparsity problem (, , and ) from Cognitive Radio. The -axes represent the number of nonzero rows, and the -axes represent the recoverability, respectively. The success thresholds of the first column and the second column are and , respectively. The results are average of 100 runs.