Fast integral wavelet transform on a dense set of the time-scale domain (Q1893491): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s002110050120 / 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.1007/s002110050120 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082540292 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S002110050120 / rank
 
Normal rank

Latest revision as of 12:21, 16 December 2024

scientific article
Language Label Description Also known as
English
Fast integral wavelet transform on a dense set of the time-scale domain
scientific article

    Statements

    Fast integral wavelet transform on a dense set of the time-scale domain (English)
    0 references
    0 references
    0 references
    0 references
    4 July 1995
    0 references
    The authors introduce a very efficient algorithm, based on real-time optimal-order spline interpolation for computing the integral wavelet transform on a dense subset of the time-scale domain with a compactly supported spline-wavelet as the analyzing wavelet. We remark that in this work the semi-orthogonality property of the spline-wavelet is essential, and the computational complexity of their fast integral wavelet transform (FIWT) algorithm does not increase with the increasing number of values of the scale parameter. In the last section they present a few examples to elucidate the applications of their FIWT algorithm.
    0 references
    algorithm
    0 references
    real-time optimal-order spline interpolation
    0 references
    integral wavelet transform
    0 references
    semi-orthogonality
    0 references
    spline-wavelet
    0 references
    computational complexity
    0 references

    Identifiers