annotate dsp/onsets/PeakPicking.cpp @ 84:e5907ae6de17

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