c@259
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
c@378
|
2 /*
|
c@378
|
3 Copyright (c) 2005 Centre for Digital Music ( C4DM )
|
c@378
|
4 Queen Mary Univesrity of London
|
c@259
|
5
|
c@378
|
6 This program is free software; you can redistribute it and/or
|
c@378
|
7 modify it under the terms of the GNU General Public License as
|
c@378
|
8 published by the Free Software Foundation; either version 2 of the
|
c@378
|
9 License, or (at your option) any later version. See the file
|
c@378
|
10 COPYING included with this distribution for more information.
|
c@378
|
11 */
|
c@232
|
12 // GetKeyMode.cpp: implementation of the CGetKeyMode class.
|
c@232
|
13 //
|
c@232
|
14 //////////////////////////////////////////////////////////////////////
|
c@232
|
15
|
c@232
|
16 #include "GetKeyMode.h"
|
c@241
|
17 #include "maths/MathUtilities.h"
|
c@234
|
18 #include "base/Pitch.h"
|
c@234
|
19
|
c@234
|
20 #include <iostream>
|
c@232
|
21
|
c@272
|
22 #include <cstring>
|
c@272
|
23 #include <cstdlib>
|
c@272
|
24
|
daschuer@458
|
25 static const int kBinsPerOctave = 36;
|
daschuer@458
|
26
|
c@232
|
27 // Chords profile
|
daschuer@458
|
28 static double MajProfile[kBinsPerOctave] = {
|
daschuer@457
|
29 0.0384, 0.0629, 0.0258, 0.0121, 0.0146, 0.0106, 0.0364, 0.0610, 0.0267,
|
daschuer@457
|
30 0.0126, 0.0121, 0.0086, 0.0364, 0.0623, 0.0279, 0.0275, 0.0414, 0.0186,
|
daschuer@457
|
31 0.0173, 0.0248, 0.0145, 0.0364, 0.0631, 0.0262, 0.0129, 0.0150, 0.0098,
|
daschuer@457
|
32 0.0312, 0.0521, 0.0235, 0.0129, 0.0142, 0.0095, 0.0289, 0.0478, 0.0239};
|
c@232
|
33
|
daschuer@458
|
34 static double MinProfile[kBinsPerOctave] = {
|
daschuer@457
|
35 0.0375, 0.0682, 0.0299, 0.0119, 0.0138, 0.0093, 0.0296, 0.0543, 0.0257,
|
daschuer@457
|
36 0.0292, 0.0519, 0.0246, 0.0159, 0.0234, 0.0135, 0.0291, 0.0544, 0.0248,
|
daschuer@457
|
37 0.0137, 0.0176, 0.0104, 0.0352, 0.0670, 0.0302, 0.0222, 0.0349, 0.0164,
|
daschuer@457
|
38 0.0174, 0.0297, 0.0166, 0.0222, 0.0401, 0.0202, 0.0175, 0.0270, 0.0146};
|
c@232
|
39 //
|
c@265
|
40
|
c@232
|
41
|
c@232
|
42 //////////////////////////////////////////////////////////////////////
|
c@232
|
43 // Construction/Destruction
|
c@232
|
44 //////////////////////////////////////////////////////////////////////
|
c@232
|
45
|
c@234
|
46 GetKeyMode::GetKeyMode( int sampleRate, float tuningFrequency,
|
daschuer@457
|
47 double hpcpAverage, double medianAverage ) :
|
c@259
|
48 m_hpcpAverage( hpcpAverage ),
|
c@259
|
49 m_medianAverage( medianAverage ),
|
c@259
|
50 m_ChrPointer(0),
|
c@259
|
51 m_DecimatedBuffer(0),
|
c@259
|
52 m_ChromaBuffer(0),
|
c@259
|
53 m_MeanHPCP(0),
|
c@259
|
54 m_MajCorr(0),
|
c@259
|
55 m_MinCorr(0),
|
c@259
|
56 m_Keys(0),
|
c@259
|
57 m_MedianFilterBuffer(0),
|
c@265
|
58 m_SortedBuffer(0),
|
c@265
|
59 m_keyStrengths(0)
|
c@232
|
60 {
|
c@259
|
61 m_DecimationFactor = 8;
|
c@259
|
62
|
c@259
|
63 // Chromagram configuration parameters
|
c@259
|
64 m_ChromaConfig.normalise = MathUtilities::NormaliseUnitMax;
|
c@259
|
65 m_ChromaConfig.FS = lrint(sampleRate/(double)m_DecimationFactor);
|
daschuer@457
|
66 if (m_ChromaConfig.FS < 1) {
|
daschuer@457
|
67 m_ChromaConfig.FS = 1;
|
daschuer@457
|
68 }
|
c@232
|
69
|
c@259
|
70 // Set C (= MIDI #12) as our base :
|
c@259
|
71 // This implies that key = 1 => Cmaj, key = 12 => Bmaj, key = 13 => Cmin, etc.
|
daschuer@457
|
72 m_ChromaConfig.min = Pitch::getFrequencyForPitch( 48, 0, tuningFrequency );
|
daschuer@457
|
73 m_ChromaConfig.max = Pitch::getFrequencyForPitch( 96, 0, tuningFrequency );
|
c@234
|
74
|
daschuer@458
|
75 m_ChromaConfig.BPO = kBinsPerOctave;
|
c@259
|
76 m_ChromaConfig.CQThresh = 0.0054;
|
c@234
|
77
|
c@259
|
78 // Chromagram inst.
|
c@259
|
79 m_Chroma = new Chromagram( m_ChromaConfig );
|
c@235
|
80
|
c@259
|
81 // Get calculated parameters from chroma object
|
c@259
|
82 m_ChromaFrameSize = m_Chroma->getFrameSize();
|
c@259
|
83 // override hopsize for this application
|
c@259
|
84 m_ChromaHopSize = m_ChromaFrameSize;
|
c@235
|
85
|
c@265
|
86 // std::cerr << "chroma frame size = " << m_ChromaFrameSize << ", decimation factor = " << m_DecimationFactor << " therefore block size = " << getBlockSize() << std::endl;
|
c@265
|
87
|
c@259
|
88 // Chromagram average and estimated key median filter lengths
|
c@259
|
89 m_ChromaBuffersize = (int)ceil( m_hpcpAverage * m_ChromaConfig.FS/m_ChromaFrameSize );
|
c@259
|
90 m_MedianWinsize = (int)ceil( m_medianAverage * m_ChromaConfig.FS/m_ChromaFrameSize );
|
c@259
|
91
|
c@259
|
92 // Reset counters
|
c@259
|
93 m_bufferindex = 0;
|
c@259
|
94 m_ChromaBufferFilling = 0;
|
c@259
|
95 m_MedianBufferFilling = 0;
|
c@234
|
96
|
c@259
|
97 // Spawn objectc/arrays
|
c@259
|
98 m_DecimatedBuffer = new double[m_ChromaFrameSize];
|
c@259
|
99
|
daschuer@458
|
100 m_ChromaBuffer = new double[kBinsPerOctave * m_ChromaBuffersize];
|
daschuer@458
|
101 memset( m_ChromaBuffer, 0, sizeof(double) * kBinsPerOctave * m_ChromaBuffersize);
|
c@259
|
102
|
daschuer@458
|
103 m_MeanHPCP = new double[kBinsPerOctave];
|
c@259
|
104
|
daschuer@458
|
105 m_MajCorr = new double[kBinsPerOctave];
|
daschuer@458
|
106 m_MinCorr = new double[kBinsPerOctave];
|
daschuer@458
|
107 m_Keys = new double[2*kBinsPerOctave];
|
c@259
|
108
|
c@259
|
109 m_MedianFilterBuffer = new int[ m_MedianWinsize ];
|
c@259
|
110 memset( m_MedianFilterBuffer, 0, sizeof(int)*m_MedianWinsize);
|
c@259
|
111
|
c@259
|
112 m_SortedBuffer = new int[ m_MedianWinsize ];
|
daschuer@457
|
113 memset( m_SortedBuffer, 0, sizeof(int)*m_MedianWinsize);
|
c@259
|
114
|
daschuer@457
|
115 m_Decimator = new Decimator( m_ChromaFrameSize*m_DecimationFactor, m_DecimationFactor );
|
c@265
|
116
|
c@265
|
117 m_keyStrengths = new double[24];
|
c@232
|
118 }
|
c@232
|
119
|
c@232
|
120 GetKeyMode::~GetKeyMode()
|
c@232
|
121 {
|
c@259
|
122 delete m_Chroma;
|
c@259
|
123 delete m_Decimator;
|
c@259
|
124
|
c@259
|
125 delete [] m_DecimatedBuffer;
|
c@259
|
126 delete [] m_ChromaBuffer;
|
c@259
|
127 delete [] m_MeanHPCP;
|
c@259
|
128 delete [] m_MajCorr;
|
c@259
|
129 delete [] m_MinCorr;
|
c@259
|
130 delete [] m_Keys;
|
c@259
|
131 delete [] m_MedianFilterBuffer;
|
c@259
|
132 delete [] m_SortedBuffer;
|
c@265
|
133
|
c@265
|
134 delete[] m_keyStrengths;
|
c@232
|
135 }
|
c@232
|
136
|
c@232
|
137 double GetKeyMode::krumCorr(double *pData1, double *pData2, unsigned int length)
|
c@232
|
138 {
|
c@259
|
139 double retVal= 0.0;
|
c@259
|
140
|
c@259
|
141 double num = 0;
|
c@259
|
142 double den = 0;
|
c@259
|
143 double mX = MathUtilities::mean( pData1, length );
|
c@259
|
144 double mY = MathUtilities::mean( pData2, length );
|
c@259
|
145
|
c@259
|
146 double sum1 = 0;
|
c@259
|
147 double sum2 = 0;
|
c@259
|
148
|
daschuer@457
|
149 for( unsigned int i = 0; i <length; i++ ) {
|
c@259
|
150 num += ( pData1[i] - mX ) * ( pData2[i] - mY );
|
c@232
|
151
|
c@259
|
152 sum1 += ( (pData1[i]-mX) * (pData1[i]-mX) );
|
c@259
|
153 sum2 += ( (pData2[i]-mY) * (pData2[i]-mY) );
|
c@259
|
154 }
|
daschuer@457
|
155
|
c@259
|
156 den = sqrt(sum1 * sum2);
|
daschuer@457
|
157
|
daschuer@457
|
158 if( den>0 ) {
|
c@259
|
159 retVal = num/den;
|
daschuer@457
|
160 } else {
|
c@259
|
161 retVal = 0;
|
daschuer@457
|
162 }
|
c@232
|
163
|
c@259
|
164 return retVal;
|
c@232
|
165 }
|
c@232
|
166
|
c@232
|
167 int GetKeyMode::process(double *PCMData)
|
c@232
|
168 {
|
c@259
|
169 int key;
|
c@259
|
170 unsigned int j,k;
|
c@232
|
171
|
c@259
|
172 //////////////////////////////////////////////
|
c@259
|
173 m_Decimator->process( PCMData, m_DecimatedBuffer);
|
c@232
|
174
|
daschuer@457
|
175 m_ChrPointer = m_Chroma->process( m_DecimatedBuffer );
|
c@232
|
176
|
daschuer@456
|
177 // The Cromagram has the center of C at bin 0, while the major
|
daschuer@456
|
178 // and minor profiles have the center of C at 1. We want to have
|
daschuer@456
|
179 // the correlation for C result also at 1.
|
daschuer@456
|
180 // To achieve this we have to shift two times:
|
daschuer@458
|
181 MathUtilities::circShift( m_ChrPointer, kBinsPerOctave, 2);
|
c@248
|
182 /*
|
c@298
|
183 std::cout << "raw chroma: ";
|
daschuer@458
|
184 for (int ii = 0; ii < kBinsPerOctave; ++ii) {
|
daschuer@458
|
185 if (ii % (kBinsPerOctave/12) == 0) std::cout << "\n";
|
c@298
|
186 std::cout << m_ChrPointer[ii] << " ";
|
c@298
|
187 }
|
c@298
|
188 std::cout << std::endl;
|
c@248
|
189 */
|
c@259
|
190 // populate hpcp values;
|
c@259
|
191 int cbidx;
|
daschuer@458
|
192 for( j = 0; j < kBinsPerOctave; j++ ) {
|
daschuer@458
|
193 cbidx = (m_bufferindex * kBinsPerOctave) + j;
|
c@259
|
194 m_ChromaBuffer[ cbidx ] = m_ChrPointer[j];
|
c@259
|
195 }
|
c@232
|
196
|
c@259
|
197 //keep track of input buffers;
|
daschuer@457
|
198 if( m_bufferindex++ >= m_ChromaBuffersize - 1) {
|
c@259
|
199 m_bufferindex = 0;
|
daschuer@457
|
200 }
|
c@232
|
201
|
c@259
|
202 // track filling of chroma matrix
|
daschuer@457
|
203 if( m_ChromaBufferFilling++ >= m_ChromaBuffersize) {
|
c@259
|
204 m_ChromaBufferFilling = m_ChromaBuffersize;
|
daschuer@457
|
205 }
|
c@232
|
206
|
daschuer@457
|
207 //calculate mean
|
daschuer@458
|
208 for( k = 0; k < kBinsPerOctave; k++ ) {
|
c@259
|
209 double mnVal = 0.0;
|
daschuer@457
|
210 for( j = 0; j < m_ChromaBufferFilling; j++ ) {
|
daschuer@458
|
211 mnVal += m_ChromaBuffer[ k + (j*kBinsPerOctave) ];
|
c@259
|
212 }
|
c@232
|
213
|
c@259
|
214 m_MeanHPCP[k] = mnVal/(double)m_ChromaBufferFilling;
|
c@259
|
215 }
|
c@232
|
216
|
c@232
|
217
|
daschuer@458
|
218 for( k = 0; k < kBinsPerOctave; k++ ) {
|
daschuer@458
|
219 m_MajCorr[k] = krumCorr( m_MeanHPCP, MajProfile, kBinsPerOctave );
|
daschuer@458
|
220 m_MinCorr[k] = krumCorr( m_MeanHPCP, MinProfile, kBinsPerOctave );
|
c@232
|
221
|
daschuer@458
|
222 MathUtilities::circShift( MajProfile, kBinsPerOctave, 1 );
|
daschuer@458
|
223 MathUtilities::circShift( MinProfile, kBinsPerOctave, 1 );
|
c@259
|
224 }
|
daschuer@457
|
225
|
daschuer@458
|
226 for( k = 0; k < kBinsPerOctave; k++ ) {
|
c@259
|
227 m_Keys[k] = m_MajCorr[k];
|
daschuer@458
|
228 m_Keys[k+kBinsPerOctave] = m_MinCorr[k];
|
c@259
|
229 }
|
devnull@240
|
230
|
c@265
|
231 for (k = 0; k < 24; ++k) {
|
c@265
|
232 m_keyStrengths[k] = 0;
|
c@265
|
233 }
|
c@265
|
234
|
daschuer@458
|
235 for( k = 0; k < kBinsPerOctave*2; k++ ) {
|
daschuer@458
|
236 int idx = k / (kBinsPerOctave/12);
|
daschuer@458
|
237 int rem = k % (kBinsPerOctave/12);
|
c@298
|
238 if (rem == 0 || m_Keys[k] > m_keyStrengths[idx]) {
|
c@298
|
239 m_keyStrengths[idx] = m_Keys[k];
|
c@298
|
240 }
|
c@298
|
241
|
daschuer@458
|
242 // m_keyStrengths[k/(kBinsPerOctave/12)] += m_Keys[k];
|
c@265
|
243 }
|
devnull@240
|
244
|
c@248
|
245 /*
|
c@259
|
246 std::cout << "raw keys: ";
|
daschuer@458
|
247 for (int ii = 0; ii < 2*kBinsPerOctave; ++ii) {
|
daschuer@458
|
248 if (ii % (kBinsPerOctave/12) == 0) std::cout << "\n";
|
c@298
|
249 std::cout << m_Keys[ii] << " ";
|
c@298
|
250 }
|
c@298
|
251 std::cout << std::endl;
|
c@298
|
252
|
c@298
|
253 std::cout << "key strengths: ";
|
c@298
|
254 for (int ii = 0; ii < 24; ++ii) {
|
c@298
|
255 if (ii % 6 == 0) std::cout << "\n";
|
c@298
|
256 std::cout << m_keyStrengths[ii] << " ";
|
c@259
|
257 }
|
c@259
|
258 std::cout << std::endl;
|
c@248
|
259 */
|
c@259
|
260 double dummy;
|
daschuer@456
|
261 // m_Keys[1] is C center 1 / 3 + 1 = 1
|
daschuer@456
|
262 // m_Keys[4] is D center 4 / 3 + 1 = 2
|
daschuer@456
|
263 // '+ 1' because we number keys 1-24, not 0-23.
|
daschuer@458
|
264 key = MathUtilities::getMax( m_Keys, 2* kBinsPerOctave, &dummy ) / 3 + 1;
|
c@234
|
265
|
c@298
|
266 // std::cout << "key pre-sorting: " << key << std::endl;
|
c@232
|
267
|
c@232
|
268
|
c@259
|
269 //Median filtering
|
c@232
|
270
|
c@259
|
271 // track Median buffer initial filling
|
daschuer@457
|
272 if( m_MedianBufferFilling++ >= m_MedianWinsize) {
|
c@259
|
273 m_MedianBufferFilling = m_MedianWinsize;
|
daschuer@457
|
274 }
|
daschuer@457
|
275
|
c@259
|
276 //shift median buffer
|
daschuer@457
|
277 for( k = 1; k < m_MedianWinsize; k++ ) {
|
c@259
|
278 m_MedianFilterBuffer[ k - 1 ] = m_MedianFilterBuffer[ k ];
|
c@259
|
279 }
|
c@232
|
280
|
c@259
|
281 //write new key value into median buffer
|
c@259
|
282 m_MedianFilterBuffer[ m_MedianWinsize - 1 ] = key;
|
c@232
|
283
|
c@232
|
284
|
c@259
|
285 //Copy median into sorting buffer, reversed
|
c@259
|
286 unsigned int ijx = 0;
|
daschuer@457
|
287 for( k = 0; k < m_MedianWinsize; k++ ) {
|
c@259
|
288 m_SortedBuffer[k] = m_MedianFilterBuffer[m_MedianWinsize-1-ijx];
|
c@259
|
289 ijx++;
|
c@259
|
290 }
|
c@232
|
291
|
c@259
|
292 qsort(m_SortedBuffer, m_MedianBufferFilling, sizeof(unsigned int),
|
c@259
|
293 MathUtilities::compareInt);
|
c@259
|
294 /*
|
c@259
|
295 std::cout << "sorted: ";
|
c@259
|
296 for (int ii = 0; ii < m_MedianBufferFilling; ++ii) {
|
c@259
|
297 std::cout << m_SortedBuffer[ii] << " ";
|
c@259
|
298 }
|
c@259
|
299 std::cout << std::endl;
|
c@259
|
300 */
|
c@259
|
301 int sortlength = m_MedianBufferFilling;
|
c@259
|
302 int midpoint = (int)ceil((double)sortlength/2);
|
c@232
|
303
|
c@298
|
304 // std::cout << "midpoint = " << midpoint << endl;
|
c@298
|
305
|
daschuer@457
|
306 if( midpoint <= 0 ) {
|
c@259
|
307 midpoint = 1;
|
daschuer@457
|
308 }
|
c@232
|
309
|
c@259
|
310 key = m_SortedBuffer[midpoint-1];
|
c@232
|
311
|
c@298
|
312 // std::cout << "returning key = " << key << endl;
|
c@298
|
313
|
c@259
|
314 return key;
|
c@232
|
315 }
|
c@232
|
316
|
c@232
|
317
|
c@268
|
318 bool GetKeyMode::isModeMinor( int key )
|
c@232
|
319 {
|
c@259
|
320 return (key > 12);
|
c@232
|
321 }
|
daschuer@458
|
322
|
daschuer@458
|
323 unsigned int getChromaSize()
|
daschuer@458
|
324 {
|
daschuer@458
|
325 return kBinsPerOctave;
|
daschuer@458
|
326 }
|