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...
Sábháilte in:
| Foilsithe in: | Proc Natl Acad Sci U S A |
|---|---|
| Príomhchruthaitheoirí: | , |
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
National Academy of Sciences
2003
|
| Ábhair: | |
| Rochtain ar líne: | 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 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|