Background Subtraction of Raman Spectra Based on Iterative Polynomial Smoothing.
In this paper, a novel background subtraction algorithm is presented that can automatically recover Raman signal. This algorithm is based on an iterative polynomial smoothing method that highly reduces the need for experience and a priori knowledge. First, a polynomial filter is applied to smooth the input spectrum (the input spectrum is just an original spectrum at the first iteration). The output curve of the filter divides the original spectrum into two parts, top and bottom. Second, a proportion is calculated between the lowest point of the signal in the bottom part and the highest point of the signal in the top part. The proportion is a key index that decides whether to go into a new iteration. If a new iteration is needed, the minimum value between the output curve and the original spectrum forms a new curve that goes into the same filter in the first step and continues as another iteration until no more iteration is needed to finally get the background of the original spectrum. Results from the simulation experiments not only show that the iterative polynomial smoothing algorithm achieves good performance, processing time, cost, and accuracy of recovery, but also prove that the algorithm adapts to different background types and a large signal-to-noise ratio range. Furthermore, real measured Raman spectra of organic mixtures and non-organic samples are used to demonstrate the application of the algorithm.
State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou, China.
Tuo
T
Wang
State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou, China.
Liankui
L
Dai
Raman spectroscopy; background subtraction; iterative smoothing; polynomial filter