On some deterministic dictionaries supporting sparsity (Q734953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00041-008-9043-z / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147950556 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0808.1368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Painless nonorthogonal expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized uncertainty principle and sparse representation in pairs of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Kurlberg-Rudnick rate conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite harmonic oscillator and its associated sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite Heisenberg-Weyl groups in radar and communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nice error bases, mutually unbiased bases, induced representations, the Heisenberg group and finite geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4126536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmannian frames with applications to coding and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur certains groupes d'opérateurs unitaires / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00041-008-9043-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:30, 10 December 2024

scientific article
Language Label Description Also known as
English
On some deterministic dictionaries supporting sparsity
scientific article

    Statements

    On some deterministic dictionaries supporting sparsity (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2009
    0 references
    The paper presents an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups. The work is structured in two sections and two appendixes. As a suggestive model example the authors describe first the Heisenberg dictionary based on the Heisenberg group. There are also presented the Heisenberg and Weil representations. The oscillator dictionary is characterized in terms of commutative families of unitary operators which are associated with commutative subgroup in a symplectic group via Weil representation. The first appendix contains a detailed mathematical description of group representation theory used in the two sections. The second appendix contains an explicit algorithm for generating a large portion of the oscillator dictionary. The results from this paper are stated for the basic finite field \(\mathbb{F}_p\). Because of this, the paper can be considered a starting point for constructing dictionaries for any field extension.
    0 references
    sparsity
    0 references
    deterministic dictionaries
    0 references
    low coherence
    0 references
    weil representation
    0 references
    commutative subgroups
    0 references
    eigenfunctions
    0 references
    explicit algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references