Sparse Representations Are Most Likely to Be the Sparsest Possible
<p/> <p>Given a signal <inline-formula><graphic file="1687-6180-2006-096247-i1.gif"/></inline-formula> and a full-rank matrix <inline-formula><graphic file="1687-6180-2006-096247-i2.gif"/></inline-formula> with <inline-formula>...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2006-01-01
|
| Series: | EURASIP Journal on Advances in Signal Processing |
| Online Access: | http://dx.doi.org/10.1155/ASP/2006/96247 |