Answers are grounded in this paper and cite their sources.
This paper presents a method of detecting periodicities in data that exploits a series of projections onto "periodic subspaces". The algorithm finds its own set of nonorthogonal basis elements (based on the data), rather than assuming a fixed predetermined basis as in the Fourier, Gabor, and wavelet transforms. A major strength of the approach is that it is linear-in-period rather than linear-in-frequency or linear-in-scale. The algorithm is derived and analyzed, and its output is compared to that of the Fourier transform in a number of examples. One application is the finding and grouping of rhythms in a musical score, another is the separation of periodic waveforms with overlapping spectra, and a third is the finding of patterns in astronomical data. Examples demonstrate both the strengths and weaknesses of the method.
No takes yet. Share an insight, caveat, or question.
Sethares et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: