On some deterministic dictionaries supporting sparsity
Abstract
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups. The oscillator dictionary consists of order of p^5 unit vectors in a Hilbert space of dimension p, where p is an odd prime, whose pairwise inner products have magnitude of at most 4/sqrt(p). An explicit algorithm to construct a large portion of the oscillator dictionary is presented.
Keywords
Cite
@article{arxiv.0808.1368,
title = {On some deterministic dictionaries supporting sparsity},
author = {Shamgar Gurevich and Ronny Hadani and Nir Sochen},
journal= {arXiv preprint arXiv:0808.1368},
year = {2008}
}
Comments
Accepted for publication in the special issue on sparsity (Editors: Albert Cohen, Ronald DeVore, Michael Elad, Anna Gilbert) of the Journal of Fourier Analysis and Applications (2008). Key words: Sparsity, deterministic dictionaries, low coherence, Weil representation, commutative subgroups, eigenfunctions, explicit algorithm