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

Figure 16

Comparison results of ADM1, GM-ADM1, and IGM-ADM1 on joint sparsity problem (, , and ) from Cognitive Radio. The -axes represent the number of nonzero rows, and the -axes represent the relative error, respectively. The first column corresponds to the noiseless data and the second corresponds to the data with Gaussian noise (noise level ). The results are average of 100 runs.