A Small-Window Moving Average-Based Fully Automated Baseline Estimation Method for Raman Spectra
Bibliographic record
Abstract
A fully automated and model-free baseline-correction method for vibrational spectra is presented. It iteratively applies a small, but increasing, moving average window in conjunction with peak stripping to estimate spectral baselines. Peak stripping causes the area stripped from the spectrum to initially increase and then diminish as peak stripping proceeds to completion; a subsequent increase is generally indicative of the commencement of baseline stripping. Consequently, this local minimum is used as a stopping criterion. A backup is provided by a second stopping criterion based on the area under a third-order polynomial fitted to the first derivative of the current estimate of the baseline-free spectrum and also indicates whether baseline is being stripped. When the second stopping criterion is triggered instead of the first one, a proportionally scaled simulated Gaussian baseline is added to the current estimate of the baseline-free spectrum to act as an internal standard to facilitate subsequent processing and termination via the first stopping criterion. The method is conceptually simple, easy to implement, and fully automated. Good and consistent results were obtained on simulated and real Raman spectra, making it suitable for the fully automated baseline correction of large numbers of spectra.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".