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...
Na minha lista:
| Publicado no: | Proc Natl Acad Sci U S A |
|---|---|
| Principais autores: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
National Academy of Sciences
2003
|
| Assuntos: | |
| Acesso em linha: | 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 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|