Noiselets (Q5929150): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/acha.2000.0313 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/acha.2000.0313 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210665207 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56445752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Rudin-Shapiro systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadrature mirror filters, low crest factor arrays, functions achieving optimal uncertainty principle bounds, and complete orthonormal sequences -- a unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthonormal bases of compactly supported wavelets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folds! / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for adapted time-frequency tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320129 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/ACHA.2000.0313 / rank
 
Normal rank

Latest revision as of 11:44, 9 December 2024

scientific article; zbMATH DE number 1588405
Language Label Description Also known as
English
Noiselets
scientific article; zbMATH DE number 1588405

    Statements

    Noiselets (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2004
    0 references
    Noiselets are functions which are totally uncompressible by orthogonal wavelet packet methods. In this paper the authors construct complex-valued noiselets for which all Haar-Walsh wavelet packet coefficients have the same modulus (hence totally uncompressible by Haar-Walsh wavelet packets). Two methods starting with the Haar function are used for the constructions. One is the wavelet packet recursive procedure (with complex coefficients) related to a complexification of the Thue-Morse sequence. The other is carried out with a complexification of the Rudin-Shapiro sequence. Both methods (and their combinations) provide noiselets which give bases for spaces of the Haar multiresolution analysis. They also have fast computational structure, hence will be useful for some applications.
    0 references
    noiselets
    0 references
    wavelet packet
    0 references
    Haar multiresolution analysis
    0 references

    Identifiers