Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ(1) minimization
Given a dictionary D = {d(k)} of vectors d(k), we seek to represent a signal S as a linear combination S = ∑(k) γ(k)d(k), with scalar coefficients γ(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work consi...
Uloženo v:
| Vydáno v: | Proc Natl Acad Sci U S A |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
National Academy of Sciences
2003
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC153464/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16576749/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.0437847100 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|