annotate YinUtil.cpp @ 126:292b75059949 v1.1

Update versions in n3 file as well
author Chris Cannam
date Tue, 21 Apr 2015 12:54:31 +0100
parents 1629209f5bf2
children 83978b93aac1 7cbf40306c10
rev   line source
Chris@9 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
Chris@9 2
Chris@9 3 /*
Chris@9 4 pYIN - A fundamental frequency estimator for monophonic audio
Chris@9 5 Centre for Digital Music, Queen Mary, University of London.
Chris@9 6
Chris@9 7 This program is free software; you can redistribute it and/or
Chris@9 8 modify it under the terms of the GNU General Public License as
Chris@9 9 published by the Free Software Foundation; either version 2 of the
Chris@9 10 License, or (at your option) any later version. See the file
Chris@9 11 COPYING included with this distribution for more information.
Chris@9 12 */
Chris@9 13
matthiasm@0 14 #include "YinUtil.h"
matthiasm@0 15
matthiasm@0 16 #include <vector>
matthiasm@0 17
matthiasm@0 18 #include <cstdio>
matthiasm@0 19 #include <cmath>
matthiasm@0 20 #include <algorithm>
matthiasm@0 21
matthiasm@0 22 #include <boost/math/distributions.hpp>
matthiasm@0 23
matthiasm@0 24 void
matthiasm@60 25 YinUtil::slowDifference(const double *in, double *yinBuffer, const size_t yinBufferSize)
matthiasm@60 26 {
matthiasm@60 27 yinBuffer[0] = 0;
matthiasm@60 28 double delta ;
matthiasm@60 29 int startPoint = 0;
matthiasm@60 30 int endPoint = 0;
matthiasm@60 31 for (int i = 1; i < yinBufferSize; ++i) {
matthiasm@60 32 yinBuffer[i] = 0;
matthiasm@60 33 startPoint = yinBufferSize/2 - i/2;
matthiasm@60 34 endPoint = startPoint + yinBufferSize;
matthiasm@60 35 for (int j = startPoint; j < endPoint; ++j) {
matthiasm@60 36 delta = in[i+j] - in[j];
matthiasm@60 37 yinBuffer[i] += delta * delta;
matthiasm@60 38 }
matthiasm@60 39 }
matthiasm@60 40 }
matthiasm@60 41
matthiasm@60 42 void
matthiasm@0 43 YinUtil::fastDifference(const double *in, double *yinBuffer, const size_t yinBufferSize)
matthiasm@0 44 {
matthiasm@0 45
matthiasm@0 46 // DECLARE AND INITIALISE
matthiasm@0 47 // initialisation of most of the arrays here was done in a separate function,
matthiasm@0 48 // with all the arrays as members of the class... moved them back here.
matthiasm@0 49
matthiasm@0 50 size_t frameSize = 2 * yinBufferSize;
matthiasm@0 51
matthiasm@0 52 double *audioTransformedReal = new double[frameSize];
matthiasm@0 53 double *audioTransformedImag = new double[frameSize];
matthiasm@0 54 double *nullImag = new double[frameSize];
matthiasm@0 55 double *kernel = new double[frameSize];
matthiasm@0 56 double *kernelTransformedReal = new double[frameSize];
matthiasm@0 57 double *kernelTransformedImag = new double[frameSize];
matthiasm@0 58 double *yinStyleACFReal = new double[frameSize];
matthiasm@0 59 double *yinStyleACFImag = new double[frameSize];
matthiasm@0 60 double *powerTerms = new double[yinBufferSize];
matthiasm@0 61
matthiasm@0 62 for (size_t j = 0; j < yinBufferSize; ++j)
matthiasm@0 63 {
matthiasm@58 64 yinBuffer[j] = 0.; // set to zero
matthiasm@58 65 powerTerms[j] = 0.; // set to zero
matthiasm@0 66 }
matthiasm@0 67
matthiasm@0 68 for (size_t j = 0; j < frameSize; ++j)
matthiasm@0 69 {
matthiasm@0 70 nullImag[j] = 0.;
matthiasm@0 71 audioTransformedReal[j] = 0.;
matthiasm@0 72 audioTransformedImag[j] = 0.;
matthiasm@0 73 kernel[j] = 0.;
matthiasm@0 74 kernelTransformedReal[j] = 0.;
matthiasm@0 75 kernelTransformedImag[j] = 0.;
matthiasm@0 76 yinStyleACFReal[j] = 0.;
matthiasm@0 77 yinStyleACFImag[j] = 0.;
matthiasm@0 78 }
matthiasm@0 79
matthiasm@0 80 // POWER TERM CALCULATION
matthiasm@0 81 // ... for the power terms in equation (7) in the Yin paper
matthiasm@0 82 powerTerms[0] = 0.0;
matthiasm@0 83 for (size_t j = 0; j < yinBufferSize; ++j) {
matthiasm@0 84 powerTerms[0] += in[j] * in[j];
matthiasm@0 85 }
matthiasm@0 86
matthiasm@0 87 // now iteratively calculate all others (saves a few multiplications)
matthiasm@0 88 for (size_t tau = 1; tau < yinBufferSize; ++tau) {
matthiasm@0 89 powerTerms[tau] = powerTerms[tau-1] - in[tau-1] * in[tau-1] + in[tau+yinBufferSize] * in[tau+yinBufferSize];
matthiasm@0 90 }
matthiasm@0 91
matthiasm@0 92 // YIN-STYLE AUTOCORRELATION via FFT
matthiasm@0 93 // 1. data
matthiasm@0 94 Vamp::FFT::forward(frameSize, in, nullImag, audioTransformedReal, audioTransformedImag);
matthiasm@0 95
matthiasm@0 96 // 2. half of the data, disguised as a convolution kernel
matthiasm@0 97 for (size_t j = 0; j < yinBufferSize; ++j) {
matthiasm@0 98 kernel[j] = in[yinBufferSize-1-j];
matthiasm@0 99 }
matthiasm@0 100 Vamp::FFT::forward(frameSize, kernel, nullImag, kernelTransformedReal, kernelTransformedImag);
matthiasm@0 101
matthiasm@0 102 // 3. convolution via complex multiplication -- written into
matthiasm@0 103 for (size_t j = 0; j < frameSize; ++j) {
matthiasm@0 104 yinStyleACFReal[j] = audioTransformedReal[j]*kernelTransformedReal[j] - audioTransformedImag[j]*kernelTransformedImag[j]; // real
matthiasm@0 105 yinStyleACFImag[j] = audioTransformedReal[j]*kernelTransformedImag[j] + audioTransformedImag[j]*kernelTransformedReal[j]; // imaginary
matthiasm@0 106 }
matthiasm@0 107 Vamp::FFT::inverse(frameSize, yinStyleACFReal, yinStyleACFImag, audioTransformedReal, audioTransformedImag);
matthiasm@0 108
matthiasm@0 109 // CALCULATION OF difference function
matthiasm@0 110 // ... according to (7) in the Yin paper.
matthiasm@0 111 for (size_t j = 0; j < yinBufferSize; ++j) {
matthiasm@0 112 // taking only the real part
matthiasm@0 113 yinBuffer[j] = powerTerms[0] + powerTerms[j] - 2 * audioTransformedReal[j+yinBufferSize-1];
matthiasm@0 114 }
matthiasm@0 115 delete [] audioTransformedReal;
matthiasm@0 116 delete [] audioTransformedImag;
matthiasm@0 117 delete [] nullImag;
matthiasm@0 118 delete [] kernel;
matthiasm@0 119 delete [] kernelTransformedReal;
matthiasm@0 120 delete [] kernelTransformedImag;
matthiasm@0 121 delete [] yinStyleACFReal;
matthiasm@0 122 delete [] yinStyleACFImag;
matthiasm@0 123 delete [] powerTerms;
matthiasm@0 124 }
matthiasm@0 125
matthiasm@0 126 void
matthiasm@0 127 YinUtil::cumulativeDifference(double *yinBuffer, const size_t yinBufferSize)
matthiasm@0 128 {
matthiasm@0 129 size_t tau;
matthiasm@0 130
matthiasm@0 131 yinBuffer[0] = 1;
matthiasm@0 132
matthiasm@0 133 double runningSum = 0;
matthiasm@0 134
matthiasm@0 135 for (tau = 1; tau < yinBufferSize; ++tau) {
matthiasm@0 136 runningSum += yinBuffer[tau];
matthiasm@0 137 if (runningSum == 0)
matthiasm@0 138 {
matthiasm@0 139 yinBuffer[tau] = 1;
matthiasm@0 140 } else {
matthiasm@0 141 yinBuffer[tau] *= tau / runningSum;
matthiasm@0 142 }
matthiasm@0 143 }
matthiasm@0 144 }
matthiasm@0 145
matthiasm@0 146 int
matthiasm@0 147 YinUtil::absoluteThreshold(const double *yinBuffer, const size_t yinBufferSize, const double thresh)
matthiasm@0 148 {
matthiasm@0 149 size_t tau;
matthiasm@0 150 size_t minTau = 0;
matthiasm@0 151 double minVal = 1000.;
matthiasm@0 152
matthiasm@0 153 // using Joren Six's "loop construct" from TarsosDSP
matthiasm@0 154 tau = 2;
matthiasm@0 155 while (tau < yinBufferSize)
matthiasm@0 156 {
matthiasm@0 157 if (yinBuffer[tau] < thresh)
matthiasm@0 158 {
matthiasm@0 159 while (tau+1 < yinBufferSize && yinBuffer[tau+1] < yinBuffer[tau])
matthiasm@0 160 {
matthiasm@0 161 ++tau;
matthiasm@0 162 }
matthiasm@0 163 return tau;
matthiasm@0 164 } else {
matthiasm@0 165 if (yinBuffer[tau] < minVal)
matthiasm@0 166 {
matthiasm@0 167 minVal = yinBuffer[tau];
matthiasm@0 168 minTau = tau;
matthiasm@0 169 }
matthiasm@0 170 }
matthiasm@0 171 ++tau;
matthiasm@0 172 }
matthiasm@0 173 if (minTau > 0)
matthiasm@0 174 {
matthiasm@0 175 return -minTau;
matthiasm@0 176 }
matthiasm@0 177 return 0;
matthiasm@0 178 }
matthiasm@0 179
Chris@61 180 static float uniformDist[100] = {0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000,0.0100000};
Chris@61 181 static float betaDist1[100] = {0.028911,0.048656,0.061306,0.068539,0.071703,0.071877,0.069915,0.066489,0.062117,0.057199,0.052034,0.046844,0.041786,0.036971,0.032470,0.028323,0.024549,0.021153,0.018124,0.015446,0.013096,0.011048,0.009275,0.007750,0.006445,0.005336,0.004397,0.003606,0.002945,0.002394,0.001937,0.001560,0.001250,0.000998,0.000792,0.000626,0.000492,0.000385,0.000300,0.000232,0.000179,0.000137,0.000104,0.000079,0.000060,0.000045,0.000033,0.000024,0.000018,0.000013,0.000009,0.000007,0.000005,0.000003,0.000002,0.000002,0.000001,0.000001,0.000001,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000};
Chris@61 182 static float betaDist2[100] = {0.012614,0.022715,0.030646,0.036712,0.041184,0.044301,0.046277,0.047298,0.047528,0.047110,0.046171,0.044817,0.043144,0.041231,0.039147,0.036950,0.034690,0.032406,0.030133,0.027898,0.025722,0.023624,0.021614,0.019704,0.017900,0.016205,0.014621,0.013148,0.011785,0.010530,0.009377,0.008324,0.007366,0.006497,0.005712,0.005005,0.004372,0.003806,0.003302,0.002855,0.002460,0.002112,0.001806,0.001539,0.001307,0.001105,0.000931,0.000781,0.000652,0.000542,0.000449,0.000370,0.000303,0.000247,0.000201,0.000162,0.000130,0.000104,0.000082,0.000065,0.000051,0.000039,0.000030,0.000023,0.000018,0.000013,0.000010,0.000007,0.000005,0.000004,0.000003,0.000002,0.000001,0.000001,0.000001,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000};
Chris@61 183 static float betaDist3[100] = {0.006715,0.012509,0.017463,0.021655,0.025155,0.028031,0.030344,0.032151,0.033506,0.034458,0.035052,0.035331,0.035332,0.035092,0.034643,0.034015,0.033234,0.032327,0.031314,0.030217,0.029054,0.027841,0.026592,0.025322,0.024042,0.022761,0.021489,0.020234,0.019002,0.017799,0.016630,0.015499,0.014409,0.013362,0.012361,0.011407,0.010500,0.009641,0.008830,0.008067,0.007351,0.006681,0.006056,0.005475,0.004936,0.004437,0.003978,0.003555,0.003168,0.002814,0.002492,0.002199,0.001934,0.001695,0.001481,0.001288,0.001116,0.000963,0.000828,0.000708,0.000603,0.000511,0.000431,0.000361,0.000301,0.000250,0.000206,0.000168,0.000137,0.000110,0.000088,0.000070,0.000055,0.000043,0.000033,0.000025,0.000019,0.000014,0.000010,0.000007,0.000005,0.000004,0.000002,0.000002,0.000001,0.000001,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000};
Chris@61 184 static float betaDist4[100] = {0.003996,0.007596,0.010824,0.013703,0.016255,0.018501,0.020460,0.022153,0.023597,0.024809,0.025807,0.026607,0.027223,0.027671,0.027963,0.028114,0.028135,0.028038,0.027834,0.027535,0.027149,0.026687,0.026157,0.025567,0.024926,0.024240,0.023517,0.022763,0.021983,0.021184,0.020371,0.019548,0.018719,0.017890,0.017062,0.016241,0.015428,0.014627,0.013839,0.013068,0.012315,0.011582,0.010870,0.010181,0.009515,0.008874,0.008258,0.007668,0.007103,0.006565,0.006053,0.005567,0.005107,0.004673,0.004264,0.003880,0.003521,0.003185,0.002872,0.002581,0.002312,0.002064,0.001835,0.001626,0.001434,0.001260,0.001102,0.000959,0.000830,0.000715,0.000612,0.000521,0.000440,0.000369,0.000308,0.000254,0.000208,0.000169,0.000136,0.000108,0.000084,0.000065,0.000050,0.000037,0.000027,0.000019,0.000014,0.000009,0.000006,0.000004,0.000002,0.000001,0.000001,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000,0.000000};
Chris@61 185 static float single10[100] = {0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,1.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000};
Chris@61 186 static float single15[100] = {0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,1.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000};
Chris@61 187 static float single20[100] = {0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,1.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000,0.00000};
Chris@61 188
matthiasm@31 189 std::vector<double>
matthiasm@31 190 YinUtil::yinProb(const double *yinBuffer, const size_t prior, const size_t yinBufferSize, const size_t minTau0, const size_t maxTau0)
matthiasm@31 191 {
matthiasm@31 192 size_t minTau = 2;
matthiasm@31 193 size_t maxTau = yinBufferSize;
matthiasm@0 194
matthiasm@31 195 // adapt period range, if necessary
matthiasm@31 196 if (minTau0 > 0 && minTau0 < maxTau0) minTau = minTau0;
matthiasm@31 197 if (maxTau0 > 0 && maxTau0 < yinBufferSize && maxTau0 > minTau) maxTau = maxTau0;
matthiasm@31 198
matthiasm@0 199 double minWeight = 0.01;
matthiasm@0 200 size_t tau;
matthiasm@0 201 std::vector<float> thresholds;
matthiasm@0 202 std::vector<float> distribution;
matthiasm@0 203 std::vector<double> peakProb = std::vector<double>(yinBufferSize);
matthiasm@0 204
matthiasm@0 205 size_t nThreshold = 100;
matthiasm@0 206 int nThresholdInt = nThreshold;
matthiasm@0 207
matthiasm@0 208 for (int i = 0; i < nThresholdInt; ++i)
matthiasm@0 209 {
matthiasm@0 210 switch (prior) {
matthiasm@0 211 case 0:
matthiasm@0 212 distribution.push_back(uniformDist[i]);
matthiasm@0 213 break;
matthiasm@0 214 case 1:
matthiasm@0 215 distribution.push_back(betaDist1[i]);
matthiasm@0 216 break;
matthiasm@0 217 case 2:
matthiasm@0 218 distribution.push_back(betaDist2[i]);
matthiasm@0 219 break;
matthiasm@0 220 case 3:
matthiasm@0 221 distribution.push_back(betaDist3[i]);
matthiasm@0 222 break;
matthiasm@0 223 case 4:
matthiasm@0 224 distribution.push_back(betaDist4[i]);
matthiasm@0 225 break;
matthiasm@0 226 case 5:
matthiasm@0 227 distribution.push_back(single10[i]);
matthiasm@0 228 break;
matthiasm@0 229 case 6:
matthiasm@0 230 distribution.push_back(single15[i]);
matthiasm@0 231 break;
matthiasm@0 232 case 7:
matthiasm@0 233 distribution.push_back(single20[i]);
matthiasm@0 234 break;
matthiasm@0 235 default:
matthiasm@0 236 distribution.push_back(uniformDist[i]);
matthiasm@0 237 }
matthiasm@0 238 thresholds.push_back(0.01 + i*0.01);
matthiasm@0 239 }
matthiasm@0 240
matthiasm@0 241
matthiasm@0 242 int currThreshInd = nThreshold-1;
matthiasm@31 243 tau = minTau;
matthiasm@0 244
matthiasm@0 245 // double factor = 1.0 / (0.25 * (nThresholdInt+1) * (nThresholdInt + 1)); // factor to scale down triangular weight
matthiasm@0 246 size_t minInd = 0;
matthiasm@0 247 float minVal = 42.f;
matthiasm@46 248 // while (currThreshInd != -1 && tau < maxTau)
matthiasm@46 249 // {
matthiasm@46 250 // if (yinBuffer[tau] < thresholds[currThreshInd])
matthiasm@46 251 // {
matthiasm@46 252 // while (tau + 1 < maxTau && yinBuffer[tau+1] < yinBuffer[tau])
matthiasm@46 253 // {
matthiasm@46 254 // tau++;
matthiasm@46 255 // }
matthiasm@46 256 // // tau is now local minimum
matthiasm@46 257 // // std::cerr << tau << " " << currThreshInd << " "<< thresholds[currThreshInd] << " " << distribution[currThreshInd] << std::endl;
matthiasm@46 258 // if (yinBuffer[tau] < minVal && tau > 2){
matthiasm@46 259 // minVal = yinBuffer[tau];
matthiasm@46 260 // minInd = tau;
matthiasm@46 261 // }
matthiasm@46 262 // peakProb[tau] += distribution[currThreshInd];
matthiasm@46 263 // currThreshInd--;
matthiasm@46 264 // } else {
matthiasm@46 265 // tau++;
matthiasm@46 266 // }
matthiasm@46 267 // }
matthiasm@46 268 // double nonPeakProb = 1;
matthiasm@46 269 // for (size_t i = minTau; i < maxTau; ++i)
matthiasm@46 270 // {
matthiasm@46 271 // nonPeakProb -= peakProb[i];
matthiasm@46 272 // }
matthiasm@46 273 //
matthiasm@46 274 // std::cerr << tau << " " << currThreshInd << " "<< thresholds[currThreshInd] << " " << distribution[currThreshInd] << std::endl;
matthiasm@46 275 float sumProb = 0;
Chris@62 276 while (tau+1 < maxTau)
matthiasm@0 277 {
matthiasm@46 278 if (yinBuffer[tau] < thresholds[thresholds.size()-1] && yinBuffer[tau+1] < yinBuffer[tau])
matthiasm@0 279 {
matthiasm@31 280 while (tau + 1 < maxTau && yinBuffer[tau+1] < yinBuffer[tau])
matthiasm@0 281 {
matthiasm@0 282 tau++;
matthiasm@0 283 }
matthiasm@0 284 // tau is now local minimum
matthiasm@0 285 // std::cerr << tau << " " << currThreshInd << " "<< thresholds[currThreshInd] << " " << distribution[currThreshInd] << std::endl;
matthiasm@0 286 if (yinBuffer[tau] < minVal && tau > 2){
matthiasm@0 287 minVal = yinBuffer[tau];
matthiasm@0 288 minInd = tau;
matthiasm@0 289 }
matthiasm@46 290 currThreshInd = nThresholdInt-1;
matthiasm@116 291 while (thresholds[currThreshInd] > yinBuffer[tau] && currThreshInd > -1) {
matthiasm@116 292 // std::cerr << distribution[currThreshInd] << std::endl;
matthiasm@116 293 peakProb[tau] += distribution[currThreshInd];
matthiasm@116 294 currThreshInd--;
matthiasm@116 295 }
matthiasm@116 296 // peakProb[tau] = 1 - yinBuffer[tau];
matthiasm@46 297 sumProb += peakProb[tau];
matthiasm@46 298 tau++;
matthiasm@0 299 } else {
matthiasm@0 300 tau++;
matthiasm@0 301 }
matthiasm@0 302 }
matthiasm@46 303
matthiasm@58 304 if (peakProb[minInd] > 1) {
matthiasm@58 305 std::cerr << "WARNING: yin has prob > 1 ??? I'm returning all zeros instead." << std::endl;
matthiasm@58 306 return(std::vector<double>(yinBufferSize));
matthiasm@58 307 }
matthiasm@58 308
matthiasm@0 309 double nonPeakProb = 1;
matthiasm@46 310 if (sumProb > 0) {
matthiasm@46 311 for (size_t i = minTau; i < maxTau; ++i)
matthiasm@46 312 {
matthiasm@46 313 peakProb[i] = peakProb[i] / sumProb * peakProb[minInd];
matthiasm@46 314 nonPeakProb -= peakProb[i];
matthiasm@46 315 }
matthiasm@0 316 }
matthiasm@0 317 if (minInd > 0)
matthiasm@0 318 {
matthiasm@0 319 // std::cerr << "min set " << minVal << " " << minInd << " " << nonPeakProb << std::endl;
matthiasm@0 320 peakProb[minInd] += nonPeakProb * minWeight;
matthiasm@0 321 }
matthiasm@0 322
matthiasm@0 323 return peakProb;
matthiasm@0 324 }
matthiasm@0 325
matthiasm@0 326 double
matthiasm@0 327 YinUtil::parabolicInterpolation(const double *yinBuffer, const size_t tau, const size_t yinBufferSize)
matthiasm@0 328 {
matthiasm@0 329 // this is taken almost literally from Joren Six's Java implementation
matthiasm@0 330 if (tau == yinBufferSize) // not valid anyway.
matthiasm@0 331 {
matthiasm@0 332 return static_cast<double>(tau);
matthiasm@0 333 }
matthiasm@0 334
matthiasm@0 335 double betterTau = 0.0;
matthiasm@46 336 if (tau > 0 && tau < yinBufferSize-1) {
matthiasm@0 337 float s0, s1, s2;
matthiasm@46 338 s0 = yinBuffer[tau-1];
matthiasm@0 339 s1 = yinBuffer[tau];
matthiasm@46 340 s2 = yinBuffer[tau+1];
matthiasm@0 341
matthiasm@46 342 double adjustment = (s2 - s0) / (2 * (2 * s1 - s2 - s0));
matthiasm@0 343
matthiasm@46 344 if (abs(adjustment)>1) adjustment = 0;
matthiasm@46 345
matthiasm@46 346 betterTau = tau + adjustment;
matthiasm@46 347 } else {
matthiasm@118 348 // std::cerr << "WARNING: can't do interpolation at the edge (tau = " << tau << "), will return un-interpolated value.\n";
matthiasm@46 349 betterTau = tau;
matthiasm@0 350 }
matthiasm@0 351 return betterTau;
matthiasm@0 352 }
matthiasm@0 353
matthiasm@0 354 double
matthiasm@0 355 YinUtil::sumSquare(const double *in, const size_t start, const size_t end)
matthiasm@0 356 {
matthiasm@0 357 double out = 0;
matthiasm@0 358 for (size_t i = start; i < end; ++i)
matthiasm@0 359 {
matthiasm@0 360 out += in[i] * in[i];
matthiasm@0 361 }
matthiasm@0 362 return out;
matthiasm@0 363 }