Data smoothing using a least squares fit C++ class
暂无分享,去创建一个
Abstract Two types of data smoothing algorithms are presented which reduce unwanted noise from raw data collected by means of a data acquisition system. One algorithm (moving average) averages the magnitude of a specific data point with a preset number of neighboring data points. A second algorithm presented employs a least squares fit criterion to smooth data. The least squares fit algorithm presented employs tables of convolution integers and normalization factors to calculate smoothed data points. A brief introduction to C++ class structure is included along with source listing of a data smoothing class.
[1] M. Kendall,et al. The advanced theory of statistics , 1945 .
[2] A. Savitzky,et al. Smoothing and Differentiation of Data by Simplified Least Squares Procedures. , 1964 .
[3] Maurice G. Kendall,et al. The advanced theory of statistics , 1945 .
[4] R. Anderson,et al. Tables of orthogonal polynomial values extended to N=104 , 1942 .
[5] P. G. Guest. Numerical Methods of Curve Fitting , 1961 .