On some deterministic dictionaries supporting sparsity

DOI10.1007/s00041-008-9043-zzbMath1183.94010arXiv0808.1368OpenAlexW2147950556MaRDI QIDQ734953

Ronny Hadani, Shamgar Gurevich, Nir Sochen

Publication date: 14 October 2009

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

eigenfunctionssparsitycommutative subgroupsexplicit algorithmdeterministic dictionarieslow coherenceweil representation

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Theta series; Weil representation; theta correspondences (11F27) Subgroups of abelian groups (20K27)

Related Items (3)

On the Construction of Finite Oscillator Dictionary ⋮ On the diagonalization of the discrete Fourier transform ⋮ A note on the diagonalization of the discrete Fourier transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nice error bases, mutually unbiased bases, induced representations, the Heisenberg group and finite geometries
• The finite Heisenberg-Weyl groups in radar and communications
• Grassmannian frames with applications to coding and communication
• Sur certains groupes d'opérateurs unitaires
• The finite harmonic oscillator and its associated sequences
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Painless nonorthogonal expansions
• A generalized uncertainty principle and sparse representation in pairs of bases
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Proof of the Kurlberg-Rudnick rate conjecture

This page was built for publication: On some deterministic dictionaries supporting sparsity