Robust Recovery of Signals From a Structured Union of Subspaces

Abstract

Traditional sampling theories consider the problem of reconstructing an unknown signal x from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that x lies in a known subspace. Recently, there has been growing interest in nonlinear but structured signal models, in which x lies in a union of subspaces. In this paper we develop a general framework for robust and efficient recovery of such signals from a given set of samples. More specifically, we treat the case in which x lies in a sum of k subspaces, chosen from a larger set of m possibilities. The samples are modelled as inner products with an arbitrary set of sampling functions. To derive an efficient and robust recovery algorithm, we show that our problem can be formulated as that of recovering a block-sparse vector whose non-zero elements appear in fixed blocks. We then propose a mixed ℓ 2 /ℓ 1 program for block sparse recovery. Our main result is an equivalence condition under which the proposed convex algorithm is guaranteed to recover the original signal. This result relies on the notion of block restricted isometry property (RIP), which is a generalization of the standard RIP used extensively in the context of compressed sensing. Based on RIP we also prove stability of our approach in the presence of noise and modelling errors. A special case of our framework is that of recovering multiple measurement vectors (MMV) that share a joint sparsity pattern. Adapting our results to this context leads to new MMV recovery methods as well as equivalence conditions under which the entire set can be determined efficiently.

Uniform recovery of fusion frame structured sparse signals

“…The following result is essentially [20,Theorem 2]. It also follows from the proof of [6, Theorem 4.4] (simply replace A I by Φ there).…”

Symmetric low-rank representation for subspace clustering

“…Four artificial pixel corruption levels (10%, 20%, 30%, and 40%) were selected for the face images, and the locations of corrupted pixels were chosen randomly. To corrupt any chosen location, its observed value was replaced by a random number in the range [0,1]. Some examples with 20% pixel occlusions and their corrections are shown in Figures 2(b) and 2(c), respectively.…”

“…Subspace clustering is one of the fundamental topics in machine learning, computer vision, and pattern recognition, e.g., image representation [1,2], face clustering [2][3][4], and motion segmentation [5][6][7][8][9]. The importance of subspace clustering is evident in the vast amount of literature thereon, because it is a crucial step in inferring structure information of data from subspaces through data analysis [10][11][12].…”

Network Dynamics as an Inverse Problem

“…Recent efforts on solving systems (3.8) subjected to solutions (3.9) in blocks have been mainly focused on block sparse 1 solutions on under-determined systems (N d M ) [95][96][97][98][99] , cf. Fig.…”