General-Purpose Algorithm for Baseline Correction Based on Inscribed Polynomials

Accurate and reliable identification and removal of baseline or systematic drifts has a decisive impact on quantitative analysis. We introduce a robust signal-preserving baseline estimation method using a constrained low-order polynomial approximation with an area-maximization objective. We formulate a mathematical framework and prove the existence and uniqueness of this polynomial under bounded-noise and regularity assumptions, and derive a constructive algorithm. Practical guidance is provided for selecting the polynomial degree a priori, and the noise tolerance is estimated directly from the data. Across representative chromatographic, spectroscopic, and electrochemical datasets, the method yields smooth, stable baselines and robust quantification without manual tuning of parameters. For chromatographic and spectroscopic data, it produces highly linear calibration plots (R2 > 0.999) with near-zero intercepts. For electrochemical traces with exponential-like backgrounds, it achieves consistent baseline corrections with only minor, well characterized artifacts. Compared to AirPLS (adaptive iteratively reweighted penalized least squares), the approach is parameter-light, signal preserving, and resilient to baseline curvature and outliers. It offers a simple, mathematically principled, and broadly applicable solution for automated baseline correction, making it well-suited for high-throughput and unsupervised analytical workflows.

Authors

Institutions

Publication Details

Journal
Analytical Chemistry
Published
2026-11-19
DOI
https://doi.org/10.1021/acs.analchem.6c02451
Primary Topic
Spectroscopy and Chemometric Analyses
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

General-Purpose Algorithm for Baseline Correction Based on Inscribed Polynomials

Renato Zenobi, Mihajlo Cekić, Béla Tuzson, Miloš Selaković et al.
Analytical Chemistry
Spectroscopy and Chemometric Analyses
article

General-Purpose Algorithm for Baseline Correction Based on Inscribed Polynomials

Renato Zenobi, Mihajlo Cekić, Béla Tuzson, Miloš Selaković, Lukas Emmenegger
article en

Abstract

Accurate and reliable identification and removal of baseline or systematic drifts has a decisive impact on quantitative analysis. We introduce a robust signal-preserving baseline estimation method using a constrained low-order polynomial approximation with an area-maximization objective. We formulate a mathematical framework and prove the existence and uniqueness of this polynomial under bounded-noise and regularity assumptions, and derive a constructive algorithm. Practical guidance is provided for selecting the polynomial degree a priori, and the noise tolerance is estimated directly from the data. Across representative chromatographic, spectroscopic, and electrochemical datasets, the method yields smooth, stable baselines and robust quantification without manual tuning of parameters. For chromatographic and spectroscopic data, it produces highly linear calibration plots (R2 > 0.999) with near-zero intercepts. For electrochemical traces with exponential-like backgrounds, it achieves consistent baseline corrections with only minor, well characterized artifacts. Compared to AirPLS (adaptive iteratively reweighted penalized least squares), the approach is parameter-light, signal preserving, and resilient to baseline curvature and outliers. It offers a simple, mathematically principled, and broadly applicable solution for automated baseline correction, making it well-suited for high-throughput and unsupervised analytical workflows.

Analytical Chemistry
Université Paris-Est Créteil (FR), Paris-Est Sup (FR), ETH Zurich (CH), Swiss Federal Laboratories for Materials Science and Technology (CH)
Spectroscopy and Chemometric Analyses
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon