Grassmannian fusion frames and its use in block sparse recovery

Sriram, N Mukund and Adiga, BS and Hari, KVS (2014) Grassmannian fusion frames and its use in block sparse recovery. In: SIGNAL PROCESSING, 94 . pp. 498-502.

PDF sig_pro_94_498_2014.pdf - Published Version Restricted to Registered users only Download (234kB) | Request a copy

Abstract

Tight fusion frames which form optimal packings in Grassmannian manifolds are of interest in signal processing and communication applications. In this paper, we study optimal packings and fusion frames having a specific structure for use in block sparse recovery problems. The paper starts with a sufficient condition for a set of subspaces to be an optimal packing. Further, a method of using optimal Grassmannian frames to construct tight fusion frames which form optimal packings is given. Then, we derive a lower bound on the block coherence of dictionaries used in block sparse recovery. From this result, we conclude that the Grassmannian fusion frames considered in this paper are optimal from the block coherence point of view. (C) 2013 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	SIGNAL PROCESSING
Publisher:	ELSEVIER SCIENCE BV
Additional Information:	copyright for this article belongs to ELSEVIER SCIENCE BV,NETHERLANDS
Keywords:	Fusion frame; Optimal Grassmannian packing; Grassmannian fusion frame; Block sparsity; Block coherence; Simplex bound
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	16 Jan 2014 11:15
Last Modified:	16 Jan 2014 11:15
URI:	http://eprints.iisc.ac.in/id/eprint/48047

Actions (login required)

View Item