On the Minimal Overcompleteness Allowing Universal Sparse Representation

DOI10.1109/TIT.2019.2906240zbMath1432.94033arXiv1804.04897OpenAlexW2962942757MaRDI QIDQ5224018

Rotem Mulayoff, Tomer Michaeli

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.04897

zbMATH Keywords

redundancy of dictionaryrepresentation capacitysignal classessparse representation over redundant dictionaries

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

This page was built for publication: On the Minimal Overcompleteness Allowing Universal Sparse Representation