- About this Journal ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
ISRN Applied Mathematics
Volume 2013 (2013), Article ID 346230, 4 pages
An Autocorrelation Term Method for Curve Fitting
The Louisiana Accelerator Center, The University of Louisiana at Lafayette, Lafayette, LA 70504-4210, USA
Received 7 May 2013; Accepted 8 July 2013
Academic Editors: K. Djidjeli, J. Kou, and M. Qatu
Copyright © 2013 Louis M. Houston. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The least-squares method is the most popular method for fitting a polynomial curve to data. It is based on minimizing the total squared error between a polynomial model and the data. In this paper we develop a different approach that exploits the autocorrelation function. In particular, we use the nonzero lag autocorrelation terms to produce a system of quadratic equations that can be solved together with a linear equation derived from summing the data. There is a maximum of solutions when the polynomial is of degree . For the linear case, there are generally two solutions. Each solution is consistent with a total error of zero. Either visual examination or measurement of the total squared error is required to determine which solution fits the data. A comparison between the comparable autocorrelation term solution and linear least squares shows negligible difference.
Curve fitting is the process of fitting a curve, in this case a polynomial, to a set of data points. There are different types of curve fitting, but we will discuss only the most popular method, the method of least squares .
It is assumed that the data consists of fluctuations about an ideal curve. These fluctuations create an error between the polynomial model and the actual data. After computing a total squared error, we can apply calculus to minimize the squared error with respect to the coefficients of the polynomial. This produces a set of linear equations called the normal equations. The coefficients are derived from solving the normal equations .
A different approach to the problem is as follows.
We propose that the data we are considering consists of a deterministic component and a random component with zero mean. The random component does not correlate with the deterministic component and it does not correlate with itself at nonzero lag. We want to extract only the portion of the data that is correlative at nonzero lag. This requires the computation of nonzero lag autocorrelation terms and produces a system of quadratic equations . After substitution based on a linear equation derived from summing the data, the system of quadratic equations consists of equations with unknowns, where is the degree of the polynomial. This results in a maximum of solutions. Each solution is consistent with a total error between the polynomial and the data that is equal to zero. Either visual examination or measurement of the total squared error is required to determine which solution fits the data.
In this paper, we derive the autocorrelation term method and compare it to linear least squares.
2. The Autocorrelation Term Method
Consider a set of data . Characterize the data as the sum of a polynomial function and a discrete, zero-mean random variable  Consequently, we can write Let .
Summation yields since the cross-correlation  and autocorrelation terms with must be zero. The polynomial function of degree can be written as Therefore, (3) becomes the system of equations: Using (1), we can write the average We know that , so which implies or There are a maximum of solutions to the system of equations created by (5) and (9) for the coefficients . Observe that the total error, , is presumed to be zero:
3. The Least-Squares Straight Line
Before examining the autocorrelation method, it is worth becoming familiar with the special case of fitting a straight line in the least-squares sense. We fit to a set of data . We have two parameters and and want to minimize the function of two variables ( and ): This becomes Apply the calculus method Dropping factor 2 and rewriting, we get Solving these equations for and yields
4. The Autocorrelation Term Method for
For , system (5) becomes Suppressing the summation limits, we can write Equation (9) becomes Solving (19) for yields Squaring yields Now substitute (20) and (21) into (18) and organize the terms: This is in the form of a quadratic equation that we can write as where, with reference to (22), is the precursor of , is the precursor of , and is the residual expression.
The solutions are the roots is found using (20).
5. The Autocorrelation Term Method for Higher Values of
The autocorrelation term method for curve fitting with an th degree polynomial requires the solution of one linear equation and quadratic equations with variables which reduces to quadratic equations with variables. This can produce solutions . For example, consider the case. System (5) can be written as Equation (9) can be written as From (26) we can write Substitute (27) into (25): Equations (28) are two quadratic equations in and . This can produce four solutions. In general, these types of systems can be solved on a Grobner basis using Buchberger’s algorithm .
6. A Comparison of the Autocorrelation Term Method to Linear Least Squares
We have constructed synthetic data consisting of the sum of a line and a random variable. The line has an intercept of fifteen and a slope of five. The random variable is Gaussian with a zero mean. The amplitude of the random variable is twenty. There are a total of one hundred equally spaced data points. Figure 1 shows the data, the least squares fit, and the autocorrelation term fit for . Figure 2 shows the data, the least squares fit, and the autocorrelation term fit for . In this example, we find that the quadratic roots are negatives of one another. This occurs because which implies that . This follows from (22) which for implies This becomes which reduces to
We have derived a method for computing polynomial curve fits to data based on terms from the autocorrelation function. The method produces quadratic equations with variables for a polynomial of degree . The solutions of this system maximally produce curves. Each solution is consistent with a total error between the polynomial and the data that is equal to zero. The proper curve can be selected with either visual examination or measurement of the total squared error. We tested this method with a linear curve fit and compared it to linear least squares. There is negligible difference between the comparable solutions.
Discussions with Gwen Houston and Dominique Lueckenhoff are greatly appreciated.
- S. D. Christian, E. H. Lane, and F. Garland, “Linear least-squares analysis: a caveat and a solution,” Journal of Chemical Education, vol. 51, no. 7, p. 475, 1974.
- R. J. O’Dowd, “The Wiener-Levinson algorithm and ill-conditioned normal equations,” Geophysical Journal International, vol. 106, no. 2, pp. 399–406, 1991.
- Y. Kinoshita, T. Asakura, and M. Suzuki, “Autocorrelation of Gaussian-Beam fluctuation caused by a random medium,” Journal of the Optical Society of America, vol. 58, no. 8, pp. 1040–1047, 1968.
- K. Wong and S. Redman, “The recovery of a random variable from a noisy record with application to the study of fluctuations in synaptic potentials,” Journal of Neuroscience Methods, vol. 2, no. 4, pp. 389–409, 1980.
- M. E. Keating, F. Bonnier, and H. J. Byrne, “Spectral cross-correlation as a supervised approach for the analysis of complex Raman datasets: the case of nanoparticles in biological cells,” Analyst, vol. 137, pp. 5792–5802, 2012.
- A. Denis, “A discussion of the cases when two quadratic equations involving two variables can be solved by the method of quadratics,” The American Mathematical Monthly, vol. 10, no. 8-9, pp. 192–199, 1903.
- B. Buchberger, “An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal,” Journal of Symbolic Computation, vol. 41, no. 3-4, pp. 475–511, 2006.