annotate dsp/onsets/PeakPicking.cpp @ 309:d5014ab8b0e5

* Add GPL and README; some tidying
author Chris Cannam <c.cannam@qmul.ac.uk>
date Mon, 13 Dec 2010 14:55:28 +0000
parents 5e125f030287
children 88f3cfcff55f
rev   line source
c@225 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
c@225 2
c@225 3 /*
c@225 4 QM DSP Library
c@225 5
c@225 6 Centre for Digital Music, Queen Mary, University of London.
c@309 7 This file 2005-2006 Christian Landone.
c@309 8
c@309 9 This program is free software; you can redistribute it and/or
c@309 10 modify it under the terms of the GNU General Public License as
c@309 11 published by the Free Software Foundation; either version 2 of the
c@309 12 License, or (at your option) any later version. See the file
c@309 13 COPYING included with this distribution for more information.
c@225 14 */
c@225 15
c@225 16 #include "PeakPicking.h"
c@241 17 #include "maths/Polyfit.h"
c@225 18
c@237 19 #include <iostream>
c@272 20 #include <cstring>
c@272 21
c@225 22
c@225 23 //////////////////////////////////////////////////////////////////////
c@225 24 // Construction/Destruction
c@225 25 //////////////////////////////////////////////////////////////////////
c@225 26
c@225 27 PeakPicking::PeakPicking( PPickParams Config )
c@225 28 {
c@225 29 m_workBuffer = NULL;
c@225 30 initialise( Config );
c@225 31 }
c@225 32
c@225 33 PeakPicking::~PeakPicking()
c@225 34 {
c@225 35 deInitialise();
c@225 36 }
c@225 37
c@225 38 void PeakPicking::initialise( PPickParams Config )
c@225 39 {
c@225 40 m_DFLength = Config.length ;
c@225 41 Qfilta = Config.QuadThresh.a ;
c@225 42 Qfiltb = Config.QuadThresh.b ;
c@225 43 Qfiltc = Config.QuadThresh.c ;
c@225 44
c@225 45 m_DFProcessingParams.length = m_DFLength;
c@225 46 m_DFProcessingParams.LPOrd = Config.LPOrd;
c@225 47 m_DFProcessingParams.LPACoeffs = Config.LPACoeffs;
c@225 48 m_DFProcessingParams.LPBCoeffs = Config.LPBCoeffs;
c@225 49 m_DFProcessingParams.winPre = Config.WinT.pre;
c@225 50 m_DFProcessingParams.winPost = Config.WinT.post;
c@225 51 m_DFProcessingParams.AlphaNormParam = Config.alpha;
c@225 52 m_DFProcessingParams.isMedianPositive = false;
c@225 53
c@225 54 m_DFSmoothing = new DFProcess( m_DFProcessingParams );
c@225 55
c@225 56 m_workBuffer = new double[ m_DFLength ];
c@225 57 memset( m_workBuffer, 0, sizeof(double)*m_DFLength);
c@225 58 }
c@225 59
c@225 60 void PeakPicking::deInitialise()
c@225 61 {
c@225 62 delete [] m_workBuffer;
c@225 63 delete m_DFSmoothing;
c@225 64 m_workBuffer = NULL;
c@225 65 }
c@225 66
c@225 67 void PeakPicking::process( double* src, unsigned int len, vector<int> &onsets )
c@225 68 {
c@283 69 if (len < 4) return;
c@283 70
c@225 71 vector <double> m_maxima;
c@225 72
c@225 73 // Signal conditioning
c@225 74 m_DFSmoothing->process( src, m_workBuffer );
c@225 75
c@225 76 for( unsigned int u = 0; u < len; u++)
c@225 77 {
c@225 78 m_maxima.push_back( m_workBuffer[ u ] );
c@225 79 }
c@225 80
c@225 81 quadEval( m_maxima, onsets );
c@225 82
c@225 83 for( int b = 0; b < m_maxima.size(); b++)
c@225 84 {
c@225 85 src[ b ] = m_maxima[ b ];
c@225 86 }
c@225 87 }
c@225 88
c@225 89 int PeakPicking::quadEval( vector<double> &src, vector<int> &idx )
c@225 90 {
c@225 91 unsigned int maxLength;
c@225 92
c@225 93 vector <int> m_maxIndex;
c@225 94 vector <int> m_onsetPosition;
c@225 95
c@225 96 vector <double> m_maxFit;
c@225 97 vector <double> m_poly;
c@225 98 vector <double> m_err;
c@225 99
c@225 100 double p;
c@225 101
c@225 102 m_poly.push_back(0);
c@225 103 m_poly.push_back(0);
c@225 104 m_poly.push_back(0);
c@225 105
c@225 106 for( int t = -2; t < 3; t++)
c@225 107 {
c@225 108 m_err.push_back( (double)t );
c@225 109 }
c@225 110 for( unsigned int i = 2; i < src.size() - 2; i++)
c@225 111 {
c@237 112 if( (src[i] > src[i-1]) && (src[i] > src[i+1]) && (src[i] > 0) )
c@225 113 {
c@237 114 // m_maxIndex.push_back( i + 1 );
c@237 115 m_maxIndex.push_back(i);
c@225 116 }
c@225 117 }
c@225 118
c@225 119 maxLength = m_maxIndex.size();
c@225 120
c@225 121 double selMax = 0;
c@225 122
c@225 123 for( unsigned int j = 0; j < maxLength ; j++)
c@225 124 {
c@237 125 for (int k = -2; k <= 2; ++k)
c@225 126 {
c@225 127 selMax = src[ m_maxIndex[j] + k ] ;
c@225 128 m_maxFit.push_back(selMax);
c@225 129 }
c@225 130
c@225 131 p = TPolyFit::PolyFit2( m_err, m_maxFit, m_poly);
c@225 132
c@225 133 double f = m_poly[0];
c@225 134 double g = m_poly[1];
c@225 135 double h = m_poly[2];
c@225 136
c@225 137 int kk = m_poly.size();
c@237 138
c@237 139 if (h < -Qfilta || f > Qfiltc)
c@237 140 {
c@237 141 idx.push_back(m_maxIndex[j]);
c@237 142 }
c@225 143
c@237 144 m_maxFit.clear();
c@225 145 }
c@225 146
c@225 147 return 1;
c@225 148 }