Lower Bounds for Sparse Coding (Q2805739)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Lower Bounds for Sparse Coding	scientific article

Statements

scholarly article

0 references

Lower Bounds for Sparse Coding (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-21852-6_24

0 references

0 references

Massimiliano Pontil

0 references

Luca Baldassarre

0 references

Measures of Complexity

0 references

publication date

13 May 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-21852-6_24

0 references

0 references

A simple proof of the restricted isometry property for random matrices

0 references

The restricted isometry property and its implications for compressed sensing

0 references

On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them

0 references

Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization

0 references

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

0 references

$K$-Dimensional Coding Schemes in Hilbert Spaces

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2805739

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2805739&oldid=36248938"