Greedy Algorithms promoting Group Sparsity V3: demo.m - File Exchange

Code covered by the BSD License

Highlights from
Greedy Algorithms promoting Group Sparsity V3

A=matrix_normalizer(B)
BMP(A, y, group, err) Block Matching Pursuit
BOLS(A, y, group, err) Block Orthogonal Least Squares - selection of group based on highest
BOMP(A, y, group, err) Block Orthogonal Matching Pursuit - selection of group based on highest
GMP(A, y, group, err) Group Matching Pursuit
GOLS(A, y, group, err) Group Orthogonal Least Squares - selection of group based on highest
GOMP(A, y, group, err) Group orthogonal Matching Pursuit - selection of group based on highest
GenGroupSparseProblem(m, n, n... Initialize random number generator
ReGOMP(A, y, group, sparsity,... Regularized Group Orthogonal Matching Pursuit - Combining ideas from [1]
StGOMP(A, y, group, steps, er... Stagewise Group Orthogonal Matching Pursuit - Combining Ideas from [1]
[s, err_mse, iter_time]=block... block_gp: Block Gradient Pursuit algorithm (modification from [1])
[s, err_mse, iter_time]=block... group_nomp: Block Nearly Orthogonal Matching Pursuit algorithm
[s, err_mse, iter_time]=block... group_pcgp: Block Partial Conjugate Gradient Pursuit algorithm
[s, err_mse, iter_time]=group... group_gp: Group Gradient Pursuit algorithm (modification from [1])
[s, err_mse, iter_time]=group... group_nomp: Group Nearly Orthogonal Matching Pursuit algorithm
[s, err_mse, iter_time]=group... group_pcgp: Group Partial Conjugate Gradient Pursuit algorithm
fdrthresh(z,q)
demo.m
View all files

from Greedy Algorithms promoting Group Sparsity V3 by Angshul Majumdar
Approximate Greedy Solutions to the problem min||x(k)||_2,0 such that Ax = b

demo.m

% DEMO

% Copyright (c) Angshul Majumdar 2009

[A, y, group, x0] = GenGroupSparseProblem(100, 150, 25, 3);
[sGOMP, residual] = GOMP(A, y, group, 3);
stem(x0), hold on, stem(sGOMP,'r+')
close
[sBOMP, residual] = BOMP(A, y, group, 3);
stem(x0), hold on, stem(sBOMP,'r+')
close
[sStGOMP, residual] = StGOMP(A, y, group, 5);
stem(x0), hold on, stem(sStGOMP,'r+')
close
[sReGOMP, residual] = ReGOMP(A, y, group, 3);
stem(x0), hold on, stem(sReGOMP,'r+')
close
[sGMP, residual] = GMP(A, y, group);
stem(x0), hold on, stem(sGMP,'r+')
close
[sBMP, residual] = BMP(A, y, group);
stem(x0), hold on, stem(sBMP,'r+')
close
[sBGP, err_mse, iter_time] = block_gp(y,A,group);
stem(x0), hold on, stem(sBGP,'r+')
close
[sGGP, err_mse, iter_time] = group_gp(y,A,group);
stem(x0), hold on, stem(sGGP,'r+')
close
[sBNOMP, err_mse, iter_time] = block_nomp(y,A,group);
stem(x0), hold on, stem(sBNOMP,'r+')
close
[sGNOMP, err_mse, iter_time] = group_nomp(y,A,group);
stem(x0), hold on, stem(sGNOMP,'r+')
close
[sBPCGP, err_mse, iter_time] = block_pcgp(y,A,group);
stem(x0), hold on, stem(sBPCGP,'r+')
close
[sPCGP, err_mse, iter_time] = group_pcgp(y,A,group);
stem(x0), hold on, stem(sPCGP,'r+')
close
[sBOLS, residual] = BOLS(A, y, group);
stem(x0), hold on, stem(sBOLS,'r+')
close
[sGOLS, residual] = GOLS(A, y, group);
stem(x0), hold on, stem(sGOLS,'r+')
close

Highlights from Greedy Algorithms promoting Group Sparsity V3

Highlights from
Greedy Algorithms promoting Group Sparsity V3