2016
DOI: 10.1016/j.chroma.2016.04.054
|View full text |Cite
|
Sign up to set email alerts
|

Simple automatic strategy for background drift correction in chromatographic data analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 32 publications
(19 citation statements)
references
References 40 publications
0
19
0
Order By: Relevance
“…Another approach to baseline correction is by utilizing the concept of local minimum values (LMVs) [46]. The approach consists of three stages, namely: (i) initialization, (ii) iterative optimization, and (iii) an estimation of background drift.…”
Section: Local Minimum Value Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…Another approach to baseline correction is by utilizing the concept of local minimum values (LMVs) [46]. The approach consists of three stages, namely: (i) initialization, (ii) iterative optimization, and (iii) an estimation of background drift.…”
Section: Local Minimum Value Approachmentioning
confidence: 99%
“…7a and 7b, (B) The resulting minimum vector, (C) removal of outliers by a moving-window strategy, with m the respective iteration, and (D) the original signal, the baseline, and the signal corrected for background. Reproduced with permission from [46] projection" (BD-OSP) method, which was utilized for the LC-QTOF-MS data [41]. In this case, the differences were only assessed qualitatively.…”
Section: Local Minimum Value Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…In the present work, we introduced our recently developed method, namely, local minimum values-robust statistical analysis (LMV-RSA) 32 , to eliminate baseline drift prior to data analysis. First, LMVs in the chromatogram were extracted, and the corresponding positions were marked.…”
Section: Theorymentioning
confidence: 99%
“…18 Algorithms that do not use a model of the baseline or signal shape and that have anti-noise capability are preferred. Many iterative algorithms [19][20][21] and Difference-of-Gaussian (DoG) functions can meet this requirement. Adaptive iteratively reweighted penalized least squares (airPLS) is a wellknown iterative algorithm, because it is flexible and valid; however, it needs further optimization.…”
Section: Introductionmentioning
confidence: 99%