Automated Gaussian Smoothing and Peak Detection Based on Repeated Averaging and Properties of a Spectrum's Curvature

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we address the two problems of automated smoothing and peak detection in spectral data analysis. We introduce the concept of triplet significance, and propose a repeated averaging approach, which is able to find a balance between noise reduction and signal preservation based on properties of a spectrum's curvature. For evaluation purposes, multiple spectra are simulated at different levels of resolution and different distances between peaks for varying amplitudes of uniformly distributed noise. The results empirically show that the proposed methodology outperforms existing approaches based on local maximum detection or the lag-one autocorrelation coefficient. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Koh, H. W., & Hildebrand, L. (2010). Automated Gaussian Smoothing and Peak Detection Based on Repeated Averaging and Properties of a Spectrum’s Curvature. In Communications in Computer and Information Science (Vol. 80 PART 1, pp. 376–385). https://doi.org/10.1007/978-3-642-14055-6_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free