Title: Geometric Conditions for Subspace-Sparse Recovery
Abstract: Given a dictionary Π and a signal ξ = Πx generated by a few linearly independent columns of Π, classical sparse recovery theory deals with the problem of uniquely recovering the sparse representation x of ξ. In this work, we consider the more general case where ξ lies in a low-dimensional subspace spanned by a few columns of Π, which are possibly linearly dependent. In this case, x may not unique, and the goal is to recover any subset of the columns of Π that spans the subspace containing ξ. We call such a representation x subspace-sparse. We study conditions under which existing pursuit methods recover a subspace-sparse representation. Such conditions reveal important geometric insights and have implications for the theory of classical sparse recovery as well as subspace clustering.
Publication Year: 2015
Publication Date: 2015-07-06
Language: en
Type: article
Access and Citation
Cited By Count: 38
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot