Least-squares spectral analysis

From Wikipedia, the free encyclopedia

Least-squares spectral analysis (LSSA) is a method of estimating a frequency spectrum, based on a least squares fit of sinusoids to data samples, similar to Fourier analysis.[1][2] Fourier analysis, the most used spectral method in science, generally boosts long-periodic noise in long gapped records; LSSA mitigates such problems.[3]

LSSA is also known as the Vaníček method[4] after Petr Vaníček, and as the Lomb method[3] (or the Lomb periodogram[5]) and the Lomb–Scargle method[6] (or Lomb–Scargle periodogram[2][7]), based on the contributions of Nicholas R. Lomb[8] and, independently, Jeffrey D. Scargle.[9] Closely related methods have been developed by Michael Korenberg and by Scott Chen and David Donoho.

Historical background

The close connections between Fourier analysis, the periodogram, and least-squares fitting of sinusoids have long been known.[10] Most developments, however, are restricted to complete data sets of equally spaced samples. In 1963, J. F. M. Barning of Mathematisch Centrum, Amsterdam, handled unequally spaced data by similar techniques,[11] including both a periodogram analysis equivalent to what is now referred to the Lomb method, and least-squares fitting of selected frequencies of sinusoids determined from such periodograms, connected by a procedure that is now known as matching pursuit with post-backfitting[12] or orthogonal matching pursuit.[13]

Petr Vaníček, a Canadian geodesist of the University of New Brunswick, also proposed the matching-pursuit approach, which he called "successive spectral analysis" and the result a "least-squares periodogram", with equally and unequally spaced data, in 1969.[14] He generalized this method to account for systematic components beyond a simple mean, such as a "predicted linear (quadratic, exponential, ...) secular trend of unknown magnitude", and applied it to a variety of samples, in 1971.[15]

The Vaníček method was then simplified in 1976 by Nicholas R. Lomb of the University of Sydney, who pointed out its close connection to periodogram analysis.[8] The definition of a periodogram of unequally spaced data was subsequently further modified and analyzed by Jeffrey D. Scargle of NASA Ames Research Center,[9] who showed that with minor changes it could be made identical to Lomb's least-squares formula for fitting individual sinusoid frequencies.

Scargle states that his paper "does not introduce a new detection technique, but instead studies the reliability and efficiency of detection with the most commonly used technique, the periodogram, in the case where the observation times are unevenly spaced," and further points out in reference to least-squares fitting of sinusoids compared to periodogram analysis, that his paper "establishes, apparently for the first time, that (with the proposed modifications) these two methods are exactly equivalent."[9]

Press[3] summarizes the development this way:

A completely different method of spectral analysis for unevenly sampled data, one that mitigates these difficulties and has some other very desirable properties, was developed by Lomb, based in part on earlier work by Barning and Vanicek, and additionally elaborated by Scargle.

Michael Korenberg of Queen's University in 1989 developed the "fast orthogonal search" method of more quickly finding a near-optimal decomposition of spectra or other problems,[16] similar to the technique that later became known as orthogonal matching pursuit. In 1994, Scott Chen and David Donoho of Stanford University have developed the "basis pursuit" method using minimization of the L1 norm of coefficients to cast the problem as a linear programming problem, for which efficient solutions are available.[17]

The Vaníček method

In the Vaníček method, a discrete data set is approximated by a weighted sum of sinusoids of progressively determined frequencies, using a standard linear regression, or least-squares fit.[18] The frequencies are chosen using a method similar to Barning's, but going further in optimizing the choice of each successive new frequency by picking the frequency that minimizes the residual after least-squares fitting (equivalent to the fitting technique now known as matching pursuit with pre-backfitting[12]). The number of sinusoids must be less than or equal to the number of data samples (counting sines and cosines of the same frequency as separate sinusoids).

A data vector Φ is represented as a weighted sum of sinusoidal basis functions, tabulated in a matrix A by evaluating each function at the sample times, with weight vector x:

\phi \approx {\textbf {A}}x

where the weight vector x is chosen to minimize the sum of squared errors in approximating Φ. The solution for x is closed-form, using standard linear regression:[19]

x=({\textbf {A}}^{{{\mathrm {T}}}}{\textbf {A}})^{{-1}}{\textbf {A}}^{{{\mathrm {T}}}}\phi .

Here the matrix A can be based on any set of functions that are mutually independent (not necessarily orthogonal) when evaluated at the sample times; for spectral analysis, the functions used are typically sines and cosines evenly distributed over the frequency range of interest. If too many frequencies are chosen in a too-narrow frequency range, the functions will not be sufficiently independent, the matrix will be badly conditioned, and the resulting spectrum will not be meaningful.[19]

When the basis functions in A are orthogonal (that is, not correlated, meaning the columns have zero pair-wise dot products), the matrix ATA is a diagonal matrix; when the columns all have the same power (sum of squares of elements), then that matrix is an identity matrix times a constant, so the inversion is trivial. The latter is the case when the sample times are equally spaced and the sinusoids are chosen to be sines and cosines equally spaced in pairs on the frequency interval 0 to a half cycle per sample (spaced by 1/N cycle per sample, omitting the sine phases at 0 and maximum frequency where they are identically zero). This particular case is known as the discrete Fourier transform, slightly rewritten in terms of real data and coefficients.[19]

x={\textbf {A}}^{{{\mathrm {T}}}}\phi     (DFT case for N equally spaced samples and frequencies, within a scalar factor)

Lomb proposed using this simplification in general, except for pair-wise correlations between sine and cosine bases of the same frequency, since the correlations between pairs of sinusoids are often small, at least when they are not too closely spaced. This is essentially the traditional periodogram formulation, but now adopted for use with unevenly spaced samples. The vector x is a good estimate of an underlying spectrum, but since correlations are ignored, Ax is no longer a good approximation to the signal, and the method is no longer a least-squares method – yet it has continued to be referred to as such.

The Lomb–Scargle periodogram

Rather than just taking dot products of the data with sine and cosine waveforms directly, Scargle modified the standard periodogram formula to first find a time delay τ such that this pair of sinusoids would be mutually orthogonal at sample times tj, and also adjusted for the potentially unequal powers of these two basis functions, to obtain a better estimate of the power at a frequency,[3][9] which made his modified periodogram method exactly equivalent to Lomb's least-squares method. The time delay τ is defined by the formula

\tan {2\omega \tau }={\frac {\sum _{j}\sin 2\omega t_{j}}{\sum _{j}\cos 2\omega t_{j}}}.

The periodogram at frequency ω is then estimated as:

P_{x}(\omega )={\frac {1}{2}}\left({\frac {\left[\sum _{j}X_{j}\cos \omega (t_{j}-\tau )\right]^{2}}{\sum _{j}\cos ^{2}\omega (t_{j}-\tau )}}+{\frac {\left[\sum _{j}X_{j}\sin \omega (t_{j}-\tau )\right]^{2}}{\sum _{j}\sin ^{2}\omega (t_{j}-\tau )}}\right)

which Scargle reports then has the same statistical distribution as the periodogram in the evenly-sampled case.[9]

At any individual frequency ω, this method gives the same power as does a least-squares fit to sinusoids of that frequency, of the form

\phi (t)\approx A\sin \omega t+B\cos \omega t.[20]

Korenberg's "fast orthogonal search" method

Michael Korenberg of Queens University in Kingston, Ontario, developed a method for choosing a sparse set of components from an over-complete set, such as sinusoidal components for spectral analysis, called fast orthogonal search (FOS). Mathematically, FOS uses a slightly modified Cholesky decomposition in a mean-square error reduction (MSER) process, implemented as a sparse matrix inversion.[16][21] As with the other LSSA methods, FOS avoids the major shortcoming of discrete Fourier analysis, and can achieve highly accurate identifications of embedded periodicities and excels with unequally-spaced data; the fast orthogonal search method has also been applied to other problems such as nonlinear system identification.

Chen and Donoho's "basis pursuit" method

Chen and Donoho have developed a procedure called basis pursuit for fitting a sparse set of sinusoids or other functions from an over-complete set. The method defines an optimal solution as the one that minimizes the L1 norm of the coefficients, so that the problem can be cast as a linear programming problem, for which efficient solution methods are available.[17]

Palmer's Chi-squared method

Palmer has developed a method for finding the best-fit function to any chosen number of harmonics, allowing more freedom to find non-sinusoidal harmonic functions.[22] This method is a fast technique (FFT-based) for doing weighted least-squares analysis on arbitrarily-spaced data with non-uniform standard errors. Source code that implements this technique is available.[23] Because data are often not sampled at uniformly spaced discrete times, this method "grids" the data by sparsely filling a time series array at the sample times. All intervening grid points receive zero statistical weight, equivalent to having infinite error bars at times between samples.

Applications

The most useful feature of the LSSA method is enabling incomplete records to be spectrally analyzed, without the need to manipulate the record or to invent otherwise non-existent data.

Magnitudes in the LSSA spectrum depict the contribution of a frequency or period to the variance of the time series.[14] Generally, spectral magnitudes defined in the above manner enable the output's straightforward significance level regime.[24] Alternatively, magnitudes in the Vanícek spectrum can also be expressed in dB.[25] Note that magnitudes in the Vaníček spectrum follow β-distribution.[26]

Inverse transformation of Vaníček's LSSA is possible, as is most easily seen by writing the forward transform as a matrix; the matrix inverse (when the matrix is not singular) or pseudo-inverse will then be an inverse transformation; the inverse will exactly match the original data if the chosen sinusoids are mutually independent at the sample points and their number is equal to the number of data points.[19] No such inverse procedure is known for the periodogram method.

Implementation

The LSSA can be implemented in less than a page of MATLAB code.[27] In essence:[18]

"to compute the least-squares spectrum we must compute m spectral values ... which involves performing the least-squares approximation m times, each time to get [the spectral power] for a different frequency"

I.e., for each frequency in a desired set of frequencies, sine and cosine functions are evaluated at the times corresponding to the data samples, and dot products of the data vector with the sinusoid vectors are taken and appropriately normalized; following the method known as Lomb/Scargle periodogram, a time shift is calculated for each frequency to orthogonalize the sine and cosine components before the dot product, as described by Craymer;[19] finally, a power is computed from those two amplitude components. This same process implements a discrete Fourier transform when the data are uniformly spaced in time and the frequencies chosen correspond to integer numbers of cycles over the finite data record.

This method treats each sinusoidal component independently, or out of context, even though they may not be orthogonal on the data points; it is Vaníček's original method. In contrast, as Craymer explains, it is also possible to perform a full simultaneous or in-context least-squares fit by solving a matrix equation, partitioning the total data variance between the specified sinusoid frequencies.[19] Such a matrix least-squares solution is natively available in MATLAB as the backslash operator.[28]

Craymer explains that the simultanous or in-context method, as opposed to the independent or out-of-context version (as well as the periodogram version due to Lomb), cannot fit more components (sines and cosines) than there are data samples, and further that:[19]

"...serious repercussions can also arise if the selected frequencies result in some of the Fourier components (trig functions) becoming nearly linearly dependent with each other, thereby producing an ill-conditioned or near singular N. To avoid such ill conditioning it becomes necessary to either select a different set of frequencies to be estimated (e.g., equally spaced frequencies) or simply neglect the correlations in N (i.e., the off-diagonal blocks) and estimate the inverse least squares transform separately for the individual frequencies..."

Lomb's periodogram method, on the other hand, can use an arbitrarily high number of, or density of, frequency components, as in a standard periodogram; that is, the frequency domain can be over-sampled by an arbitrary factor.[3]

In Fourier analysis, such as the Fourier transform or the discrete Fourier transform, the sinusoids being fitted to the data are all mutually orthogonal, so there is no distinction between the simple out-of-context dot-product-based projection onto basis functions versus an in-context simultaneous least-squares fit; that is, no matrix inversion is required to least-squares partition the variance between orthogonal sinusoids of different frequencies.[29] This method is usually preferred for its efficient fast Fourier transform implementation, when complete data records with equally spaced samples are available.

See also

References

  1. ↑ Cafer Ibanoglu (2000). Variable Stars As Essential Astrophysical Tools. Springer. ISBN 0-7923-6084-2. 
  2. ↑ 2.0 2.1 D. Scott Birney, David Oesper, and Guillermo Gonzalez (2006). Observational Astronomy. Cambridge University Press. ISBN 0-521-85370-2. 
  3. ↑ 3.0 3.1 3.2 3.3 3.4 Press (2007). Numerical Recipes (3rd ed.). Cambridge University Press. ISBN 0-521-88068-8. 
  4. ↑ J. Taylor and S. Hamilton (1972-03-20). "Some tests of the Vaníček Method of spectral analysis". Astrophysics and Space Science 17 (2): 357–367. Bibcode:1972Ap&SS..17..357T. doi:10.1007/BF00642907. 
  5. ↑ Alistair I. Mees (2001). Nonlinear Dynamics and Statistics. Springer. ISBN 0-8176-4163-7. 
  6. ↑ Frank Chambers (2002). Climate Change: Critical Concepts in the Environment. Routledge. ISBN 0-415-27858-9. 
  7. ↑ Hans P. A. Van Dongen (1999). "Searching for Biological Rhythms: Peak Detection in the Periodogram of Unequally Spaced Data". Journal of Biological Rhythms 14 (6): 617–620. doi:10.1177/074873099129000984. PMID 10643760. 
  8. ↑ 8.0 8.1 Lomb, N. R. (1976). "Least-squares frequency analysis of unequally spaced data". Astrophysics and Space Science 39 (2): 447–462. doi:10.1007/BF00648343. 
  9. ↑ 9.0 9.1 9.2 9.3 9.4 Scargle, J. D. (1982). "Studies in astronomical time series analysis. II - Statistical aspects of spectral analysis of unevenly spaced data". Astrophysical Journal 263: 835. Bibcode:1982ApJ...263..835S. doi:10.1086/160554. 
  10. ↑ David Brunt (1931). The Combination of Observations (2nd ed.). Cambridge University Press. 
  11. ↑ Barning, F. J. M. (1963). "The numerical analysis of the light-curve of 12 Lacertae". Bulletin of the Astronomical Institutes of the Netherlands 17: 22. Bibcode:1963BAN....17...22B. 
  12. ↑ 12.0 12.1 Pascal Vincent and Yoshua Bengio (2002). "Kernel Matching Pursuit". Machine Learning 48: 165–187. doi:10.1023/A:1013955821559. 
  13. ↑ Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conference on Signals, Systems and Computers, A. Singh, ed., Los Alamitos, CA, USA, IEEE Computer Society Press, 1993.
  14. ↑ 14.0 14.1 Vaníček, P. (1969). "Approximate spectral analysis by least-squares fit". Astrophysics and Space Science 4 (4): 387–391. doi:10.1007/BF00651344. 
  15. ↑ Vaníček, P. (1971). "Further development and properties of the spectral analysis by least-squares". Astrophysics and Space Science 12: 10–33. doi:10.1007/BF00656134. 
  16. ↑ 16.0 16.1 Korenberg, M. J. (1989). "A robust orthogonal algorithm for system identification and time-series analysis". Biological Cybernetics 60 (4): 267–276. doi:10.1007/BF00204124. PMID 2706281. 
  17. ↑ 17.0 17.1 S. Chen and D.L. Donoho (1994), "Basis Pursuit." Technical Report, Department of Statistics, Stanford University, Available at
  18. ↑ 18.0 18.1 Wells, D.E., P. Vaníček, S. Pagiatakis, 1985. Least-squares spectral analysis revisited. Department of Surveying Engineering Technical Report 84, University of New Brunswick, Fredericton, 68 pages, Available at .
  19. ↑ 19.0 19.1 19.2 19.3 19.4 19.5 19.6 Craymer, M.R., The Least Squares Spectrum, Its Inverse Transform and Autocorrelation Function: Theory and Some Applications in Geodesy, Ph.D. Dissertation, University of Toronto, Canada (1998).
  20. ↑ William J. Emery, Richard E. Thomson (2001). Data Analysis Methods in Physical Oceanography. Elsevier. ISBN 0-444-50756-6. 
  21. ↑ Korenberg, Michael J.; Brenan, Colin J. H.; Hunter, Ian W. (1997). "Raman Spectral Estimation via Fast Orthogonal Search". The Analyst 122 (9): 879–882. Bibcode:1997Ana...122..879K. doi:10.1039/a700902j. 
  22. ↑ Palmer, David M.. "A Fast Chi-squared Technique For Period Search of Irregularly Sampled Data". arXiv:0901.1913.
  23. ↑ "David Palmer: The Fast Chi-squared Period Search". 
  24. ↑ Beard, A.G., Williams, P.J.S., Mitchell, N.J. & Muller, H.G. A special climatology of planetary waves and tidal variability, J Atm. Solar-Ter. Phys. 63 (09), p.801–811 (2001).
  25. ↑ Pagiatakis, S. Stochastic significance of peaks in the least-squares spectrum, J of Geodesy 73, p.67-78 (1999).
  26. ↑ Steeves, R.R. A statistical test for significance of peaks in the least squares spectrum, Collected Papers of the Geodetic Survey, Department of Energy, Mines and Resources, Surveys and Mapping, Ottawa, Canada, p.149-166 (1981)
  27. ↑ Richard A. Muller and Gordon J. MacDonald (2000). Ice Ages and Astronomical Causes: Data, Spectral Analysis, and Mechanisms. Springer. ISBN 3-540-43779-7. 
  28. ↑ Timothy A. Davis and Kermit Sigmon (2005). MATLAB Primer. CRC Press. ISBN 1-58488-523-8. 
  29. ↑ Darrell Williamson (1999). Discrete-Time Signal Processing: An Algebraic Approach. Springer. ISBN 1-85233-161-5. 

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.