Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries
arXiv:1204.4065 · doi:10.1109/ITW.2012.6404757
Abstract
The sparse representation problem of recovering an N dimensional sparse vector x from M < N linear observations y = Dx given dictionary D is considered. The standard approach is to let the elements of the dictionary be independent and identically distributed (IID) zero-mean Gaussian and minimize the l1-norm of x under the constraint y = Dx. In this paper, the performance of l1-reconstruction is analyzed, when the dictionary is bi-orthogonal D = [O1 O2], where O1,O2 are independent and drawn uniformly according to the Haar measure on the group of orthogonal M x M matrices. By an application of the replica method, we obtain the critical conditions under which perfect l1-recovery is possible with bi-orthogonal dictionaries.
arXiv comment5 pages, 2 figures. The main result and numerical examples have been revised
References in corpus (5)
- Message Passing Algorithms for Compressed Sensing
- Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing
- A typical reconstruction limit of compressed sensing based on Lp-norm minimization
- Optimal incorporation of sparsity information by weighted optimization
- Support Recovery with Sparsely Sampled Free Random Matrices