|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Redirect|Best fit|placing ("fitting") variable-sized objects in storage|Fragmentation (computer)}}
| | Roberto is the name Method love to be rang with although it can be not the name forward my [http://thesaurus.com/browse/birth+certificate birth certificate]. I am a cashier. My friends say it's not first-rate for me but the language I love doing has always been to drive but I do have been taking on innovative new things lately. My house is now in Vermont. I've been working on individual website for some period now. Check it competeing here: http://[http://www.Wonderhowto.com/search/circuspartypanama/ circuspartypanama].com<br><br>my page ... clash of clans hack tool; [http://circuspartypanama.com click through the next website page], |
| | |
| [[File:Regression pic assymetrique.gif |thumb|300px|Fitting of a noisy curve by an asymmetrical peak model, with an iterative process ([[Gauss–Newton algorithm]] with variable damping factor α). <br /> Top: raw data and model.<br /> Bottom: evolution of the normalised sum of the squares of the errors.]]
| |
| | |
| '''Curve fitting'''<ref> Sandra Lach Arlinghaus, PHB Practical Handbook of Curve Fitting. CRC Press, 1994.</ref><ref> William M. Kolb. Curve Fitting for Programmable Calculators. Syntec, Incorporated, 1984.</ref> is the process of constructing a [[curve]], or [[function (mathematics)|mathematical function]], that has the best fit to a series of [[data]] points,<ref>S.S. Halli, K.V. Rao. 1992. Advanced Techniques of Population Analysis. isbn 0306439972 Page 165 (''cf''. ... functions are fulfilled if we have a good to moderate fit for the observed data.)</ref> possibly subject to constraints.<ref>[http://books.google.com/books?id=SI-VqAT4_hYC The Signal and the Noise]: Why So Many Predictions Fail-but Some Don't. By Nate Silver</ref><ref>[http://books.google.com/books?id=hhdVr9F-JfAC Data Preparation for Data Mining]: Text. By Dorian Pyle.</ref> Curve fitting can involve either [[interpolation]],<ref>Numerical Methods in Engineering with MATLAB®. By [[Jaan Kiusalaas]]. Page 24.</ref><ref>Numerical Methods in Engineering with Python 3. By Jaan Kiusalaas. Page 21.</ref> where an exact fit to the data is required, or [[smoothing]],<ref>Numerical Methods of Curve Fitting. By P. G. Guest, Philip George Guest. Page 349.</ref><ref>See also: [[Mollifier]]</ref> in which a "smooth" function is constructed that approximately fits the data. A related topic is [[regression analysis]],<ref>Fitting Models to Biological Data Using Linear and Nonlinear Regression. By Harvey Motulsky, Arthur Christopoulos.</ref><ref>Regression Analysis By Rudolf J. Freund, William J. Wilson, Ping Sa. Page 269.</ref> which focuses more on questions of [[statistical inference]] such as how much uncertainty is present in a curve that is fit to data observed with random errors. Fitted curves can be used as an aid for data visualization,<ref>Visual Informatics. Edited by Halimah Badioze Zaman, Peter Robinson, Maria Petrou, Patrick Olivier, Heiko Schröder. Page 689.</ref><ref>Numerical Methods for Nonlinear Engineering Models. By John R. Hauser. Page 227.</ref> to infer values of a function where no data are available,<ref>Methods of Experimental Physics: Spectroscopy, Volume 13, Part 1. By Claire Marton. Page 150.</ref> and to summarize the relationships among two or more variables.<ref>Encyclopedia of Research Design, Volume 1. Edited by Neil J. Salkind. Page 266.</ref> [[Extrapolation]] refers to the use of a fitted curve beyond the [[range (mathematics)|range]] of the observed data,<ref>Community Analysis and Planning Techniques. By Richard E. Klosterman. Page 1.</ref> and is subject to a [[Uncertainty|degree of uncertainty]]<ref>An Introduction to Risk and Uncertainty in the Evaluation of Environmental Investments. DIANE Publishing. [http://books.google.com/books?id=rJ23LWaZAqsC&pg=PA69 Pg 69]</ref> since it may reflect the method used to construct the curve as much as it reflects the observed data.
| |
| | |
| == Different types of curve fitting ==
| |
| | |
| ===Fitting lines and polynomial curves to data points===
| |
| | |
| [[Image:Curve fitting.png|thumb|300px|alt=Polynomial curves fitting a sine function|Polynomial curves fitting points generated with a sine function. <br />
| |
| Red line is a <span style="color:red">first degree polynomial</span>, green line is <span style="color:green">second degree</span>, orange line is <span style="color:orange">third degree</span> and blue is <span style="color:blue">fourth degree</span>]]
| |
| | |
| Starting with a first degree [[polynomial]] equation:
| |
| | |
| :<math>y = ax + b\;.</math>
| |
| | |
| This is a line with [[slope]] ''a''. A line will connect any two points, so a first degree polynomial equation is an exact fit through any two points with distinct x coordinates.
| |
| | |
| If the order of the equation is increased to a second degree polynomial, the following results:
| |
| | |
| :<math>y = ax^2 + bx + c\;.</math>
| |
| | |
| This will exactly fit a simple curve to three points.
| |
| | |
| If the order of the equation is increased to a third degree polynomial, the following is obtained:
| |
| | |
| :<math>y = ax^3 + bx^2 + cx + d\;.</math>
| |
| | |
| This will exactly fit four points.
| |
| | |
| A more general statement would be to say it will exactly fit four '''constraints'''. Each constraint can be a point, [[angle]], or [[curvature]] (which is the reciprocal of the radius of an [[osculating circle]]). Angle and curvature constraints are most often added to the ends of a curve, and in such cases are called '''end conditions'''. Identical end conditions are frequently used to ensure a smooth transition between polynomial curves contained within a single [[spline (mathematics)|spline]]. Higher-order constraints, such as "the change in the rate of curvature", could also be added. This, for example, would be useful in highway [[Cloverleaf interchange|cloverleaf]] design to understand the rate of change of the forces applied to a car (see [[Jerk (physics)|jerk]]), as it follows the cloverleaf, and to set reasonable speed limits, accordingly.
| |
| | |
| The first degree polynomial equation could also be an exact fit for a single point and an angle while the third degree polynomial equation could also be an exact fit for two points, an angle constraint, and a curvature constraint. Many other combinations of constraints are possible for these and for higher order polynomial equations.
| |
| | |
| If there are more than ''n'' + 1 constraints (''n'' being the degree of the polynomial), the polynomial curve can still be run through those constraints. An exact fit to all constraints is not certain (but might happen, for example, in the case of a first degree polynomial exactly fitting three [[collinear points]]). In general, however, some method is then needed to evaluate each approximation. The [[least squares]] method is one way to compare the deviations.
| |
| | |
| There are several reasons given to get an approximate fit when it is possible to simply increase the degree of the polynomial equation and get an exact match.:
| |
| | |
| * Even if an exact match exists, it does not necessarily follow that it can be readily discovered. Depending on the algorithm used there may be a divergent case, where the exact fit cannot be calculated, or it might take too much computer time to find the solution. This situation might require an approximate solution.
| |
| | |
| * The effect of averaging out questionable data points in a sample, rather than distorting the curve to fit them exactly, may be desirable.
| |
| | |
| * [[Runge's phenomenon]]: high order polynomials can be highly oscillatory. If a curve runs through two points ''A'' and ''B'', it would be expected that the curve would run somewhat near the midpoint of ''A'' and ''B'', as well. This may not happen with high-order polynomial curves; they may even have values that are very large in positive or negative [[magnitude (mathematics)|magnitude]]. With low-order polynomials, the curve is more likely to fall near the midpoint (it's even guaranteed to exactly run through the midpoint on a first degree polynomial).
| |
| | |
| * Low-order polynomials tend to be smooth and high order polynomial curves tend to be "lumpy". To define this more precisely, the maximum number of [[inflection point]]s possible in a polynomial curve is ''n-2'', where ''n'' is the order of the polynomial equation. An inflection point is a location on the curve where it switches from a positive radius to negative. We can also say this is where it transitions from "holding water" to "shedding water". Note that it is only "possible" that high order polynomials will be lumpy; they could also be smooth, but there is no guarantee of this, unlike with low order polynomial curves. A fifteenth degree polynomial could have, at most, thirteen inflection points, but could also have twelve, eleven, or any number down to zero.
| |
| | |
| The degree of the polynomial curve being higher than needed for an exact fit is undesirable for all the reasons listed previously for high order polynomials, but also leads to a case where there are an infinite number of solutions. For example, a first degree polynomial (a line) constrained by only a single point, instead of the usual two, would give an infinite number of solutions. This brings up the problem of how to compare and choose just one solution, which can be a problem for software and for humans, as well. For this reason, it is usually best to choose as low a degree as possible for an exact match on all constraints, and perhaps an even lower degree, if an approximate fit is acceptable.
| |
| | |
| {{Details|Polynomial interpolation}}
| |
| | |
| ===Fitting other curves to data points===
| |
| | |
| Other types of curves, such as [[conic sections]] (circular, elliptical, parabolic, and hyperbolic arcs) or [[trigonometric functions]] (such as sine and cosine), may also be used, in certain cases. For example, trajectories of objects under the influence of gravity follow a parabolic path, when air resistance is ignored. Hence, matching trajectory data points to a parabolic curve would make sense. Tides follow sinusoidal patterns, hence tidal data points should be matched to a sine wave, or the sum of two sine waves of different periods, if the effects of the Moon and Sun are both considered.
| |
| | |
| In spectroscopy, curves may be fitted with [[Normal distribution|Gaussian]], [[Cauchy distribution|Lorentzian]], [[Voigt function|Voigt]] and related functions.
| |
| | |
| ===Algebraic fit versus geometric fit for curves===
| |
| | |
| For algebraic analysis of data, "fitting" usually means trying to find the curve that minimizes the vertical (''y''-axis) displacement of a point from the curve (e.g., [[ordinary least squares]]). However for graphical and image applications geometric fitting seeks to provide the best visual fit; which usually means trying to minimize the orthogonal distance to the curve (e.g., [[total least squares]]), or to otherwise include both axes of displacement of a point from the curve. Geometric fits are not popular because they usually require non-linear and/or iterative calculations, although they have the advantage of a more aesthetic and geometrically accurate result.
| |
| | |
| ===Fitting a circle by geometric fit===
| |
| | |
| [[File:Regression circulaire coope arc de cercle.svg|thumb|Circle fitting with the Coope method, the points describing a circle arc, centre (1 ; 1), radius 4.]]
| |
| | |
| [[File:Wp ellfitting.png|thumb|different models of ellipse fitting]]
| |
| | |
| [[File:Regression elliptique distance algebrique donnees gander.svg|thumb|Ellipse fitting minimising the algebraic distance (Fitzgibbon method).]] | |
| | |
| Coope<ref>{{cite journal|author=Coope, I.D.|title=Circle fitting by linear and nonlinear least squares|journal=Journal of Optimization Theory and Applications |volume =76|issue =2|year=1993|doi=10.1007/BF00939613|pages=381}}</ref> approaches the problem of trying to find the best visual fit of circle to a set of 2D data points. The method elegantly transforms the ordinarily non-linear problem into a linear problem that can be solved without using iterative numerical methods, and is hence an order of magnitude faster than previous techniques.
| |
| | |
| ===Fitting an ellipse by geometric fit===
| |
| | |
| The above technique is extended to general ellipses<ref>Paul Sheer, A software assistant for manual stereo photometrology, M.Sc. thesis, 1997</ref> by adding a non-linear step, resulting in a method that is fast, yet finds visually pleasing ellipses of arbitrary orientation and displacement.
| |
| | |
| ===Application to surfaces===
| |
| | |
| Note that while this discussion was in terms of 2D curves, much of this logic also extends to 3D surfaces, each patch of which is defined by a net of curves in two parametric directions, typically called '''u''' and '''v'''. A surface may be composed of one or more surface patches in each direction.
| |
| | |
| {{Details|Computer representation of surfaces}}
| |
| | |
| ==Software==
| |
| | |
| Many [[List of statistical packages|statistical packages]] such as [[R (programming language)|R]] and [[List of numerical analysis software|numerical software]] such as the [[GNU Scientific Library]], [[SciPy]] and [[OpenOpt]] include commands for doing curve fitting in a variety of scenarios. There are also programs specifically written to do curve fitting; they can be found in the [[List of statistical packages|lists of statistical]] and [[List of numerical analysis software|numerical analysis programs]] as well as in [[:Category:Regression and curve fitting software]].
| |
| | |
| ==See also==
| |
| * [[Levenberg–Marquardt algorithm]]
| |
| * [[Nonlinear regression]]
| |
| * [[Distribution fitting|Probability distribution fitting]]
| |
| * [[Smoothing]]
| |
| * [[Total least squares]]
| |
| * [[Overfitting]]
| |
| * [[Curve-fitting compaction]]
| |
| {{clear}}
| |
| ==References==
| |
| {{Reflist|30em}}
| |
| | |
| [[Category:Numerical analysis]]
| |
| [[Category:Interpolation]]
| |
| [[Category:Regression analysis]]
| |