Peak detection approach

Question

What are the peak detection algorithms in existence? I have noisy data, and I would like to implement peak detection for this data. Data is in reverse, actually I am trying to determine the bottom.

Here is a snapshot of the data in Excel. I like to detect both bottoms. I thought about passing the data through a low-pass filter and subsequently do a moving average where I determine the peaks and within the moving average I do another search. I have zero DSP background; this is just a common sense approach. I would like to hear what the experts recommend.

Answer 1

Ktuncer, there are a number of methods you can use here. One method that I would recommend is to use a Discrete Wavelet Transform, (DWT), and in particular, look at the Daubechies Wavelet. I would pick, say, Daub-14 / Daub-Tetra.

Basically what you really need to do is 'trend' your signal, and then from there, do a min or max pick. That will get rid of your outliers. A daub-14/daub-tetra wavelet transform can help you do this, and this helps especially since you do not know the nature of your signal. (Using daub-14, you can accurately represent polynomial signals of degree 14/2 = 7, and it looks like you wont need more than that).

The computation of this wavelet transform essentially 'compresses' your energy into a few indicies. Those indicies represent weights on basis vectors. The rest of the weights will (ideally) be near zero. When you have noise in your signal (as you do), those weights that were normally zero have some weights now, but you can simply zero them out and 'denoise' your signal. Once that is complete, you can then do a simple max/min detect.

There are more details involved, you may send me an email if you like to discuss how to implement it. I have done similar work on this before.

EDIT: Here are some images illustrating Daub-Tetra Denoiser:

Answer 2

I am far from being an expert, but here is what I would do:

You seem to have a slowly varying signal superimposed with fluctuations. The peaks you search are some stronger fluctuations, so I would detect them using that.

1. Let $X(T)$ be your raw signal. Take a moving average over a suitable number of samples to create $Y(t)$ a smooth carrier.

2. If you succeed $X-Y$ must should have a zero mean. Compute the standard deviation $\sigma$ of $X-Y$.

3. You can detect your peaks when $|(X-Y)(t)| > \alpha \times \sigma$, with $\alpha$ being typically 2, 3, 4.

An overshoot or an undershoot can be specifically detected by removing the absolute value and using proper test. Is that what you are looking for?

Answer 3

Peak detection has quite a few applications, for 1D or multidimensional signals. Here are a few examples showing how varied these signals and their interpretations of a peak can be:

• The original poster's 1D data;

• Hough transform of an image, each peak corresponds to a line in the original image;

• autocorrelation of an image, each peak corresponds to a frequency revealing a "periodic pattern";

• "generalized" cross-correlation of an image and a template, each peak corresponds to an occurrence of the template in the image (we may be interested in detecting only the best peak or several peaks);

• result of filtering an image for Harris corners, each peak corresponds to a corner in the original image.

These are definitions and detection techniques of peaks I have encountered--certainly there are others that I either forgot or don't know, and hopefully other answers will cover them.

Preprocessing techniques includes smoothing and denoising. @Mohammad's answer is about wavelets, and you can see various usages of them in the documentation of Mathematica's WaveletThreshold (where I also took my examples from, by the way).

Then you search for maxima. Depending on your application, you need only the global maxima (e.g., image registration), a few local maxima (e.g. line detection), or many local maxima (keypoints detection): This can done iteratively, looking for the highest value in the data then erasing a region around the selected peak, etc. until the highest remaining value is below a threshold. Alternatively, you can look for the local maxima within a certain neighborhood size, and keep only those local maxima whose values are above a threshold -- some recommend to keep the local maxima based on their distance to the rest of the local maxima (the further the better). The arsenal also features morphological operations: Extended maxima and top-hat transform can both be suitable.

See the results of three of these techniques on an image filtered for Harris corners:

Moreover, some applications attempt to find peaks at sub-pixel resolution. Interpolation, which can be application-specific, comes handy.

As far as I know, there is no silver bullet, and the data will tell which techniques work best.

It will be really nice to have more answers, esp. coming from other disciplines.

Answer 4

I think one typical peak detection algorithm is like this where ref is peak(bottom).

for i=1,N   {
       if i=1   {  ref＝data(i)　｝
       else ｛ if　data(i)＜＝ref　｛ref ＝data(i) ｝｝
}