Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Baseline Correction Based on a Search Algorithm from Artificial Intelligence

Not Accessible

Your library or personal account may give you access

Abstract

Many spectra have a polynomial-like baseline. Iterative polynomial fitting is one of the most popular methods for baseline correction of these spectra. However, the baseline estimated by iterative polynomial fitting may have a substantial error when the spectrum contains significantly strong peaks or have strong peaks located at the endpoints. First, iterative polynomial fitting uses temporary baseline estimated from the current spectrum to identify peak data points. If the current spectrum contains strong peaks, then the temporary baseline substantially deviates from the true baseline. Some good baseline data points of the spectrum might be mistakenly identified as peak data points and are artificially re-assigned with a low value. Second, if a strong peak is located at the endpoint of the spectrum, then the endpoint region of the estimated baseline might have a significant error due to overfitting. This study proposes a search algorithm-based baseline correction method (SA) that aims to compress sample the raw spectrum to a dataset with small number of data points and then convert the peak removal process into solving a search problem in artificial intelligence to minimize an objective function by deleting peak data points. First, the raw spectrum is smoothened out by the moving average method to reduce noise and then divided into dozens of unequally spaced sections on the basis of Chebyshev nodes. Finally, the minimal points of each section are collected to form a dataset for peak removal through search algorithm. SA selects the mean absolute error as the objective function because of its sensitivity to overfitting and rapid calculation. The baseline correction performance of SA is compared with those of three baseline correction methods, the Lieber and Mahadevan-Jansen method, adaptive iteratively reweighted penalized least squares method, and improved asymmetric least squares method. Simulated and real Fourier transform infrared and Raman spectra with polynomial-like baselines are employed in the experiments. Results show that for these spectra the baseline estimated by SA has fewer error than those by the three other methods.

© 2021 The Author(s)

PDF Article
More Like This
Baseline correction for Raman spectra using a spectral estimation-based asymmetrically reweighted penalized least squares method

Yixin Guo, Weiqi Jin, Weilin Wang, Yuqing He, and Su Qiu
Appl. Opt. 62(18) 4766-4776 (2023)

Baseline correction method based on doubly reweighted penalized least squares

Degang Xu, Song Liu, Yaoyi Cai, and Chunhua Yang
Appl. Opt. 58(14) 3913-3920 (2019)

Baseline correction method based on improved asymmetrically reweighted penalized least squares for the Raman spectrum

Jianfeng Ye, Ziyang Tian, Haoyun Wei, and Yan Li
Appl. Opt. 59(34) 10933-10943 (2020)

Supplementary Material (1)

NameDescription
Supplement 1       sj-pdf-1-asp-10.1177_0003702820977512 - Supplemental material for Baseline Correction Based on a Search Algorithm from Artificial Intelligence

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.