博文
- Sparse Representation (Cont.)
-
1. Uniqueness Theorem 2.1. For an arbitrary pair of orthogonal bases Ψ , Φ with mutual-coherence μ (A), and for an arbitrary non-zero vector b ∈ IR n with representations α and β correspondingly,the following inequality holds ...
- An introduction to Sparse Representation
- 热度 1
-
Preliminaries A full-rank matrix A ∈ Rn×m with n m generates an underdetermined system of linearequations Ax = b having infinitely many solutions.Suppose we seek the sparsest solution,i.e., the one with the fewest nonzero entries. Can it ever be unique? If so, when? As optimizat ...
12
