To check out this repository please hg clone the following URL, or open the URL using EasyMercurial or your preferred Mercurial client.
root / PeakInterpolator.cpp @ 43:53260757fc9f
History | View | Annotate | Download (2.39 KB)
| 1 |
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
|---|---|
| 2 |
/*
|
| 3 |
This file is Copyright (c) 2012 Chris Cannam
|
| 4 |
|
| 5 |
Permission is hereby granted, free of charge, to any person
|
| 6 |
obtaining a copy of this software and associated documentation
|
| 7 |
files (the "Software"), to deal in the Software without
|
| 8 |
restriction, including without limitation the rights to use, copy,
|
| 9 |
modify, merge, publish, distribute, sublicense, and/or sell copies
|
| 10 |
of the Software, and to permit persons to whom the Software is
|
| 11 |
furnished to do so, subject to the following conditions:
|
| 12 |
|
| 13 |
The above copyright notice and this permission notice shall be
|
| 14 |
included in all copies or substantial portions of the Software.
|
| 15 |
|
| 16 |
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 17 |
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 18 |
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
| 19 |
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
|
| 20 |
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
|
| 21 |
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
| 22 |
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
| 23 |
*/
|
| 24 |
|
| 25 |
#include "PeakInterpolator.h" |
| 26 |
|
| 27 |
#include <iostream> |
| 28 |
|
| 29 |
static double cubicInterpolate(const double y[4], double x) |
| 30 |
{
|
| 31 |
double a0 = y[3] - y[2] - y[0] + y[1]; |
| 32 |
double a1 = y[0] - y[1] - a0; |
| 33 |
double a2 = y[2] - y[0]; |
| 34 |
double a3 = y[1]; |
| 35 |
return
|
| 36 |
a0 * x * x * x + |
| 37 |
a1 * x * x + |
| 38 |
a2 * x + |
| 39 |
a3; |
| 40 |
} |
| 41 |
|
| 42 |
double
|
| 43 |
PeakInterpolator::findPeakLocation(const double *data, int size) |
| 44 |
{
|
| 45 |
double maxval;
|
| 46 |
int maxidx = 0; |
| 47 |
int i;
|
| 48 |
for (i = 0; i < size; ++i) { |
| 49 |
if (i == 0 || data[i] > maxval) { |
| 50 |
maxval = data[i]; |
| 51 |
maxidx = i; |
| 52 |
} |
| 53 |
} |
| 54 |
return findPeakLocation(data, size, maxidx);
|
| 55 |
} |
| 56 |
|
| 57 |
double
|
| 58 |
PeakInterpolator::findPeakLocation(const double *data, int size, int peakIndex) |
| 59 |
{
|
| 60 |
// after jos,
|
| 61 |
// https://ccrma.stanford.edu/~jos/sasp/Quadratic_Interpolation_Spectral_Peaks.html
|
| 62 |
|
| 63 |
if (peakIndex < 1 || peakIndex > size - 2) { |
| 64 |
return peakIndex;
|
| 65 |
} |
| 66 |
|
| 67 |
double alpha = data[peakIndex-1]; |
| 68 |
double beta = data[peakIndex];
|
| 69 |
double gamma = data[peakIndex+1]; |
| 70 |
|
| 71 |
double denom = (alpha - 2*beta + gamma); |
| 72 |
|
| 73 |
if (denom == 0) { |
| 74 |
// flat
|
| 75 |
return peakIndex;
|
| 76 |
} |
| 77 |
|
| 78 |
double p = ((alpha - gamma) / denom) / 2.0; |
| 79 |
|
| 80 |
return double(peakIndex) + p; |
| 81 |
} |
| 82 |
|