Chromatogram baseline estimation and denoising using sparsity (BEADS)

Xiaoran Ning, Ivan Selesnick, Laurent Duval

Research output: Contribution to journalArticle

Abstract

This paper jointly addresses the problems of chromatogram baseline correction and noise reduction. The proposed approach is based on modeling the series of chromatogram peaks as sparse with sparse derivatives, and on modeling the baseline as a low-pass signal. A convex optimization problem is formulated so as to encapsulate these non-parametric models. To account for the positivity of chromatogram peaks, an asymmetric penalty function is utilized. A robust, computationally efficient, iterative algorithm is developed that is guaranteed to converge to the unique optimal solution. The approach, termed Baseline Estimation and Denoising With Sparsity (BEADS), is evaluated and compared with two state-of-the-art methods using both simulated and real chromatogram data.

Original languageEnglish (US)
Pages (from-to)156-167
Number of pages12
JournalChemometrics and Intelligent Laboratory Systems
Volume139
DOIs
StatePublished - Dec 5 2014

Fingerprint

Convex optimization
Noise abatement
Derivatives

Keywords

  • Asymmetric penalty
  • Baseline correction
  • Baseline drift
  • Convex optimization
  • Low-pass filtering
  • Sparse derivative

ASJC Scopus subject areas

  • Analytical Chemistry
  • Computer Science Applications
  • Software
  • Process Chemistry and Technology
  • Spectroscopy

Cite this

Chromatogram baseline estimation and denoising using sparsity (BEADS). / Ning, Xiaoran; Selesnick, Ivan; Duval, Laurent.

In: Chemometrics and Intelligent Laboratory Systems, Vol. 139, 05.12.2014, p. 156-167.

Research output: Contribution to journalArticle

@article{0a7b0bbea5174f2ea73de24d0a629e8c,
title = "Chromatogram baseline estimation and denoising using sparsity (BEADS)",
abstract = "This paper jointly addresses the problems of chromatogram baseline correction and noise reduction. The proposed approach is based on modeling the series of chromatogram peaks as sparse with sparse derivatives, and on modeling the baseline as a low-pass signal. A convex optimization problem is formulated so as to encapsulate these non-parametric models. To account for the positivity of chromatogram peaks, an asymmetric penalty function is utilized. A robust, computationally efficient, iterative algorithm is developed that is guaranteed to converge to the unique optimal solution. The approach, termed Baseline Estimation and Denoising With Sparsity (BEADS), is evaluated and compared with two state-of-the-art methods using both simulated and real chromatogram data.",
keywords = "Asymmetric penalty, Baseline correction, Baseline drift, Convex optimization, Low-pass filtering, Sparse derivative",
author = "Xiaoran Ning and Ivan Selesnick and Laurent Duval",
year = "2014",
month = "12",
day = "5",
doi = "10.1016/j.chemolab.2014.09.014",
language = "English (US)",
volume = "139",
pages = "156--167",
journal = "Chemometrics and Intelligent Laboratory Systems",
issn = "0169-7439",
publisher = "Elsevier",

}

TY - JOUR

T1 - Chromatogram baseline estimation and denoising using sparsity (BEADS)

AU - Ning, Xiaoran

AU - Selesnick, Ivan

AU - Duval, Laurent

PY - 2014/12/5

Y1 - 2014/12/5

N2 - This paper jointly addresses the problems of chromatogram baseline correction and noise reduction. The proposed approach is based on modeling the series of chromatogram peaks as sparse with sparse derivatives, and on modeling the baseline as a low-pass signal. A convex optimization problem is formulated so as to encapsulate these non-parametric models. To account for the positivity of chromatogram peaks, an asymmetric penalty function is utilized. A robust, computationally efficient, iterative algorithm is developed that is guaranteed to converge to the unique optimal solution. The approach, termed Baseline Estimation and Denoising With Sparsity (BEADS), is evaluated and compared with two state-of-the-art methods using both simulated and real chromatogram data.

AB - This paper jointly addresses the problems of chromatogram baseline correction and noise reduction. The proposed approach is based on modeling the series of chromatogram peaks as sparse with sparse derivatives, and on modeling the baseline as a low-pass signal. A convex optimization problem is formulated so as to encapsulate these non-parametric models. To account for the positivity of chromatogram peaks, an asymmetric penalty function is utilized. A robust, computationally efficient, iterative algorithm is developed that is guaranteed to converge to the unique optimal solution. The approach, termed Baseline Estimation and Denoising With Sparsity (BEADS), is evaluated and compared with two state-of-the-art methods using both simulated and real chromatogram data.

KW - Asymmetric penalty

KW - Baseline correction

KW - Baseline drift

KW - Convex optimization

KW - Low-pass filtering

KW - Sparse derivative

UR - http://www.scopus.com/inward/record.url?scp=84910601014&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910601014&partnerID=8YFLogxK

U2 - 10.1016/j.chemolab.2014.09.014

DO - 10.1016/j.chemolab.2014.09.014

M3 - Article

VL - 139

SP - 156

EP - 167

JO - Chemometrics and Intelligent Laboratory Systems

JF - Chemometrics and Intelligent Laboratory Systems

SN - 0169-7439

ER -