Chromatogram baseline estimation and denoising using sparsity (BEADS)

• This paper jointly addresses the problems of chromatogram baseline correction and noise reduction.
• The series of chromatogram peaks are modeled as sparse with sparse derivatives.
• The baseline is modeled as a low-pass signal.
• A convex optimization problem is formulated so as to encapsulate these non-parametric models and a computationally efficient, iterative algorithm is developed.
• The performance is evaluated and compared with two state-of-the-art methods using both simulated and real chromatogram data Preprint

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.