Grassmannian fusion frames and its use in block sparse recovery
We highlight the use of Grassmannian fusion frames in block sparse signal processing. We present a method of construction of Grassmannian fusion frames from optimal Grassmannian frames. A lower bound on the block coherence of dictionaries is derived. The Grassmannian fusion frames constructed satisfy this bound and are hence optimal dictionaries for block sparse recovery.
grassmannian fusion frame fusion frame block coherence optimal grassmannian packing block sparsity simplex bound