Block-sparse recovery via redundant block OMP

Recently, it has been found that the redundant blocks problem existed in many fields, such as face recognition and motion segmentation. In this paper, taking the redundant blocks into account, we propose some greedy type algorithms that exploit the subspace information of the redundant blocks to solve the redundant blocks problem. The exact recovery conditions of these algorithms are presented via block restricted isometry property (RIP). Numerical experiments demonstrate the validity of these algorithms in solving the problems with both non-redundant and redundant blocks.