2011-03-02 07:37:39 -05:00
|
|
|
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
|
|
|
|
|
|
|
/*
|
|
|
|
QM DSP Library
|
|
|
|
|
|
|
|
Centre for Digital Music, Queen Mary, University of London.
|
|
|
|
This file 2005-2006 Christian Landone.
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public License as
|
|
|
|
published by the Free Software Foundation; either version 2 of the
|
|
|
|
License, or (at your option) any later version. See the file
|
|
|
|
COPYING included with this distribution for more information.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "PeakPicking.h"
|
|
|
|
#include "maths/Polyfit.h"
|
|
|
|
|
|
|
|
#include <iostream>
|
|
|
|
#include <cstring>
|
|
|
|
|
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////
|
|
|
|
// Construction/Destruction
|
|
|
|
//////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
PeakPicking::PeakPicking( PPickParams Config )
|
|
|
|
{
|
|
|
|
m_workBuffer = NULL;
|
|
|
|
initialise( Config );
|
|
|
|
}
|
|
|
|
|
|
|
|
PeakPicking::~PeakPicking()
|
|
|
|
{
|
|
|
|
deInitialise();
|
|
|
|
}
|
|
|
|
|
|
|
|
void PeakPicking::initialise( PPickParams Config )
|
|
|
|
{
|
|
|
|
m_DFLength = Config.length ;
|
|
|
|
Qfilta = Config.QuadThresh.a ;
|
|
|
|
Qfiltb = Config.QuadThresh.b ;
|
|
|
|
Qfiltc = Config.QuadThresh.c ;
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2015-10-04 15:11:15 -04:00
|
|
|
m_DFProcessingParams.length = m_DFLength;
|
|
|
|
m_DFProcessingParams.LPOrd = Config.LPOrd;
|
|
|
|
m_DFProcessingParams.LPACoeffs = Config.LPACoeffs;
|
|
|
|
m_DFProcessingParams.LPBCoeffs = Config.LPBCoeffs;
|
2011-03-02 07:37:39 -05:00
|
|
|
m_DFProcessingParams.winPre = Config.WinT.pre;
|
2015-10-04 15:11:15 -04:00
|
|
|
m_DFProcessingParams.winPost = Config.WinT.post;
|
2011-03-02 07:37:39 -05:00
|
|
|
m_DFProcessingParams.AlphaNormParam = Config.alpha;
|
|
|
|
m_DFProcessingParams.isMedianPositive = false;
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2011-03-02 07:37:39 -05:00
|
|
|
m_DFSmoothing = new DFProcess( m_DFProcessingParams );
|
|
|
|
|
|
|
|
m_workBuffer = new double[ m_DFLength ];
|
|
|
|
memset( m_workBuffer, 0, sizeof(double)*m_DFLength);
|
|
|
|
}
|
|
|
|
|
|
|
|
void PeakPicking::deInitialise()
|
|
|
|
{
|
|
|
|
delete [] m_workBuffer;
|
|
|
|
delete m_DFSmoothing;
|
|
|
|
m_workBuffer = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void PeakPicking::process( double* src, unsigned int len, vector<int> &onsets )
|
|
|
|
{
|
|
|
|
if (len < 4) return;
|
|
|
|
|
2015-10-05 10:17:49 -04:00
|
|
|
vector <double> m_maxima;
|
2011-03-02 07:37:39 -05:00
|
|
|
|
2015-10-04 15:11:15 -04:00
|
|
|
// Signal conditioning
|
2011-03-02 07:37:39 -05:00
|
|
|
m_DFSmoothing->process( src, m_workBuffer );
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2011-03-02 07:37:39 -05:00
|
|
|
for( unsigned int u = 0; u < len; u++)
|
|
|
|
{
|
2015-10-05 10:17:49 -04:00
|
|
|
m_maxima.push_back( m_workBuffer[ u ] );
|
2011-03-02 07:37:39 -05:00
|
|
|
}
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2011-03-02 07:37:39 -05:00
|
|
|
quadEval( m_maxima, onsets );
|
|
|
|
|
2011-09-30 13:55:14 -04:00
|
|
|
for(unsigned int b = 0; b < m_maxima.size(); b++)
|
2011-03-02 07:37:39 -05:00
|
|
|
{
|
|
|
|
src[ b ] = m_maxima[ b ];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int PeakPicking::quadEval( vector<double> &src, vector<int> &idx )
|
|
|
|
{
|
|
|
|
unsigned int maxLength;
|
|
|
|
|
|
|
|
vector <int> m_maxIndex;
|
|
|
|
vector <int> m_onsetPosition;
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2011-03-02 07:37:39 -05:00
|
|
|
vector <double> m_maxFit;
|
|
|
|
vector <double> m_poly;
|
|
|
|
vector <double> m_err;
|
|
|
|
|
|
|
|
m_poly.push_back(0);
|
|
|
|
m_poly.push_back(0);
|
|
|
|
m_poly.push_back(0);
|
|
|
|
|
|
|
|
for( int t = -2; t < 3; t++)
|
|
|
|
{
|
|
|
|
m_err.push_back( (double)t );
|
|
|
|
}
|
|
|
|
for( unsigned int i = 2; i < src.size() - 2; i++)
|
|
|
|
{
|
|
|
|
if( (src[i] > src[i-1]) && (src[i] > src[i+1]) && (src[i] > 0) )
|
|
|
|
{
|
|
|
|
// m_maxIndex.push_back( i + 1 );
|
|
|
|
m_maxIndex.push_back(i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
maxLength = m_maxIndex.size();
|
|
|
|
|
|
|
|
double selMax = 0;
|
|
|
|
|
|
|
|
for( unsigned int j = 0; j < maxLength ; j++)
|
|
|
|
{
|
|
|
|
for (int k = -2; k <= 2; ++k)
|
|
|
|
{
|
|
|
|
selMax = src[ m_maxIndex[j] + k ] ;
|
2015-10-05 10:17:49 -04:00
|
|
|
m_maxFit.push_back(selMax);
|
2011-03-02 07:37:39 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
double f = m_poly[0];
|
|
|
|
double h = m_poly[2];
|
|
|
|
|
|
|
|
if (h < -Qfilta || f > Qfiltc)
|
|
|
|
{
|
|
|
|
idx.push_back(m_maxIndex[j]);
|
|
|
|
}
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2011-03-02 07:37:39 -05:00
|
|
|
m_maxFit.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|