c@232
|
1 // GetKeyMode.cpp: implementation of the CGetKeyMode class.
|
c@232
|
2 //
|
c@232
|
3 //////////////////////////////////////////////////////////////////////
|
c@232
|
4
|
c@232
|
5 #include "GetKeyMode.h"
|
c@232
|
6 #include "dsp/maths/MathUtilities.h"
|
c@234
|
7 #include "base/Pitch.h"
|
c@234
|
8
|
c@234
|
9 #include <iostream>
|
c@232
|
10
|
c@232
|
11 // Chords profile
|
c@232
|
12 static double MajProfile[36] =
|
c@232
|
13 { 0.0384, 0.0629, 0.0258, 0.0121, 0.0146, 0.0106, 0.0364, 0.0610, 0.0267,
|
devnull@240
|
14 0.0126, 0.0121, 0.0086, 0.0364, 0.0623, 0.0279, 0.0275, 0.0414, 0.0186,
|
c@232
|
15 0.0173, 0.0248, 0.0145, 0.0364, 0.0631, 0.0262, 0.0129, 0.0150, 0.0098,
|
c@232
|
16 0.0312, 0.0521, 0.0235, 0.0129, 0.0142, 0.0095, 0.0289, 0.0478, 0.0239};
|
c@232
|
17
|
c@232
|
18 static double MinProfile[36] =
|
c@232
|
19 { 0.0375, 0.0682, 0.0299, 0.0119, 0.0138, 0.0093, 0.0296, 0.0543, 0.0257,
|
c@232
|
20 0.0292, 0.0519, 0.0246, 0.0159, 0.0234, 0.0135, 0.0291, 0.0544, 0.0248,
|
c@232
|
21 0.0137, 0.0176, 0.0104, 0.0352, 0.0670, 0.0302, 0.0222, 0.0349, 0.0164,
|
c@232
|
22 0.0174, 0.0297, 0.0166, 0.0222, 0.0401, 0.0202, 0.0175, 0.0270, 0.0146};
|
c@232
|
23 //
|
c@232
|
24
|
c@232
|
25 //////////////////////////////////////////////////////////////////////
|
c@232
|
26 // Construction/Destruction
|
c@232
|
27 //////////////////////////////////////////////////////////////////////
|
c@232
|
28
|
c@234
|
29 GetKeyMode::GetKeyMode( int sampleRate, float tuningFrequency,
|
c@234
|
30 double hpcpAverage, double medianAverage )
|
c@232
|
31 :
|
c@232
|
32 m_hpcpAverage( hpcpAverage ),
|
c@232
|
33 m_medianAverage( medianAverage ),
|
c@232
|
34 m_ChrPointer(0),
|
c@232
|
35 m_DecimatedBuffer(0),
|
c@232
|
36 m_ChromaBuffer(0),
|
c@232
|
37 m_MeanHPCP(0),
|
c@232
|
38 m_MajCorr(0),
|
c@232
|
39 m_MinCorr(0),
|
c@232
|
40 m_Keys(0),
|
c@232
|
41 m_MedianFilterBuffer(0),
|
c@232
|
42 m_SortedBuffer(0)
|
c@232
|
43 {
|
c@232
|
44 m_DecimationFactor = 8;
|
c@232
|
45
|
c@232
|
46 //Chromagram configuration parameters
|
c@234
|
47 m_ChromaConfig.isNormalised = 1;
|
c@234
|
48 m_ChromaConfig.FS = lrint(sampleRate/(double)m_DecimationFactor);
|
c@234
|
49
|
c@234
|
50 // m_ChromaConfig.min = 111.0641;
|
c@234
|
51 // m_ChromaConfig.max = 1.7770e+003;
|
c@234
|
52
|
devnull@240
|
53 // Set C (= MIDI #12) as our base :
|
devnull@240
|
54 // This implies that key = 1 => Cmaj, key = 12 => Bmaj, key = 13 => Cmin, etc.
|
devnull@240
|
55 m_ChromaConfig.min = Pitch::getFrequencyForPitch
|
devnull@240
|
56 (12, 0, tuningFrequency);
|
devnull@240
|
57 m_ChromaConfig.max = Pitch::getFrequencyForPitch
|
devnull@240
|
58 (96, 0, tuningFrequency);
|
c@235
|
59
|
c@235
|
60 // The chromagram minimum pitch is 1/6 of a tone above A, two
|
c@235
|
61 // octaves below middle C (for a 36-bin chromagram). The
|
c@235
|
62 // maximum pitch is four octaves higher.
|
devnull@240
|
63 /* m_ChromaConfig.min = Pitch::getFrequencyForPitch
|
c@235
|
64 (45, 1.f / 3.f, tuningFrequency);
|
c@235
|
65
|
c@235
|
66 m_ChromaConfig.max = m_ChromaConfig.min * 2;
|
c@235
|
67 m_ChromaConfig.max = m_ChromaConfig.max * 2;
|
c@235
|
68 m_ChromaConfig.max = m_ChromaConfig.max * 2;
|
c@235
|
69 m_ChromaConfig.max = m_ChromaConfig.max * 2;
|
devnull@240
|
70 */
|
c@235
|
71 std::cerr << "Chromagram range: " << m_ChromaConfig.min << " -> " << m_ChromaConfig.max << std::endl;
|
c@234
|
72
|
c@234
|
73 m_ChromaConfig.BPO = 36;
|
c@234
|
74 m_ChromaConfig.CQThresh = 0.0054;
|
c@232
|
75
|
c@232
|
76 //Chromagram inst.
|
c@234
|
77 m_Chroma = new Chromagram( m_ChromaConfig );
|
c@232
|
78
|
c@232
|
79 //Get calculated parameters from chroma object
|
c@232
|
80 m_ChromaFrameSize = m_Chroma->getFrameSize();
|
c@232
|
81 //override hopsize for this application
|
c@232
|
82 m_ChromaHopSize = m_ChromaFrameSize;//m_Chroma->GetHopSize();
|
c@234
|
83 m_BPO = m_ChromaConfig.BPO;
|
c@232
|
84
|
c@232
|
85 //Chromagram average and estimated key median filter lengths
|
c@234
|
86 m_ChromaBuffersize = (int)ceil( m_hpcpAverage * m_ChromaConfig.FS/m_ChromaFrameSize );
|
c@234
|
87 m_MedianWinsize = (int)ceil( m_medianAverage * m_ChromaConfig.FS/m_ChromaFrameSize );
|
c@232
|
88
|
c@232
|
89 //Reset counters
|
c@232
|
90 m_bufferindex = 0;
|
c@232
|
91 m_ChromaBufferFilling = 0;
|
c@232
|
92 m_MedianBufferFilling = 0;
|
c@232
|
93
|
c@232
|
94
|
c@232
|
95 //Spawn objectc/arrays
|
c@232
|
96 m_DecimatedBuffer = new double[m_ChromaFrameSize];
|
c@232
|
97
|
c@232
|
98 m_ChromaBuffer = new double[m_BPO * m_ChromaBuffersize];
|
c@232
|
99 memset( m_ChromaBuffer, 0, sizeof(double) * m_BPO * m_ChromaBuffersize);
|
c@232
|
100
|
c@232
|
101 m_MeanHPCP = new double[m_BPO];
|
c@232
|
102
|
c@232
|
103 m_MajCorr = new double[m_BPO];
|
c@232
|
104 m_MinCorr = new double[m_BPO];
|
c@232
|
105 m_Keys = new double[2*m_BPO];
|
c@232
|
106
|
c@232
|
107 m_MedianFilterBuffer = new int[ m_MedianWinsize ];
|
c@232
|
108 memset( m_MedianFilterBuffer, 0, sizeof(int)*m_MedianWinsize);
|
c@232
|
109
|
c@232
|
110 m_SortedBuffer = new int[ m_MedianWinsize ];
|
c@232
|
111 memset( m_SortedBuffer, 0, sizeof(int)*m_MedianWinsize);
|
c@232
|
112
|
c@232
|
113 m_Decimator = new Decimator( m_ChromaFrameSize*m_DecimationFactor, m_DecimationFactor );
|
c@232
|
114 }
|
c@232
|
115
|
c@232
|
116 GetKeyMode::~GetKeyMode()
|
c@232
|
117 {
|
c@232
|
118
|
c@232
|
119 delete m_Chroma;
|
c@232
|
120 delete m_Decimator;
|
c@232
|
121
|
c@232
|
122 delete [] m_DecimatedBuffer;
|
c@232
|
123 delete [] m_ChromaBuffer;
|
c@232
|
124 delete [] m_MeanHPCP;
|
c@232
|
125 delete [] m_MajCorr;
|
c@232
|
126 delete [] m_MinCorr;
|
c@232
|
127 delete [] m_Keys;
|
c@232
|
128 delete [] m_MedianFilterBuffer;
|
c@232
|
129 delete [] m_SortedBuffer;
|
c@232
|
130 }
|
c@232
|
131
|
c@232
|
132 double GetKeyMode::krumCorr(double *pData1, double *pData2, unsigned int length)
|
c@232
|
133 {
|
c@232
|
134 double retVal= 0.0;
|
c@232
|
135
|
c@232
|
136 double num = 0;
|
c@232
|
137 double den = 0;
|
c@232
|
138 double mX = MathUtilities::mean( pData1, length );
|
c@232
|
139 double mY = MathUtilities::mean( pData2, length );
|
c@232
|
140
|
c@232
|
141 double sum1 = 0;
|
c@232
|
142 double sum2 = 0;
|
c@232
|
143
|
c@232
|
144 for( unsigned int i = 0; i <length; i++ )
|
c@232
|
145 {
|
c@232
|
146 num += ( pData1[i] - mX ) * ( pData2[i] - mY );
|
c@232
|
147
|
c@232
|
148 sum1 += ( (pData1[i]-mX) * (pData1[i]-mX) );
|
c@232
|
149 sum2 += ( (pData2[i]-mY) * (pData2[i]-mY) );
|
c@232
|
150 }
|
c@232
|
151
|
c@232
|
152 den = sqrt(sum1 * sum2);
|
c@232
|
153
|
c@232
|
154 if( den>0 )
|
c@232
|
155 retVal = num/den;
|
c@232
|
156 else
|
c@232
|
157 retVal = 0;
|
c@232
|
158
|
c@232
|
159
|
c@232
|
160 return retVal;
|
c@232
|
161 }
|
c@232
|
162
|
c@232
|
163 int GetKeyMode::process(double *PCMData)
|
c@232
|
164 {
|
c@232
|
165 int key;
|
c@232
|
166
|
c@232
|
167 unsigned int j,k;
|
c@232
|
168
|
c@232
|
169 //////////////////////////////////////////////
|
c@232
|
170 m_Decimator->process( PCMData, m_DecimatedBuffer);
|
c@232
|
171
|
c@232
|
172 m_ChrPointer = m_Chroma->process( m_DecimatedBuffer );
|
c@232
|
173
|
devnull@240
|
174
|
devnull@240
|
175 // Move bins such that the centre of the base note is in the middle of its three bins :
|
devnull@240
|
176 // Added 21.11.07 by Chris Sutton based on debugging with Katy Noland + comparison with Matlab equivalent.
|
devnull@240
|
177 MathUtilities::circShift( m_ChrPointer, m_BPO, 1);
|
devnull@240
|
178
|
c@234
|
179 std::cout << "raw chroma: ";
|
c@234
|
180 for (int ii = 0; ii < m_BPO; ++ii) {
|
c@234
|
181 std::cout << m_ChrPointer[ii] << " ";
|
c@234
|
182 }
|
c@234
|
183 std::cout << std::endl;
|
c@234
|
184
|
c@232
|
185 // populate hpcp values;
|
c@232
|
186 int cbidx;
|
c@232
|
187 for( j = 0; j < m_BPO; j++ )
|
c@232
|
188 {
|
c@232
|
189 cbidx = (m_bufferindex * m_BPO) + j;
|
c@232
|
190 m_ChromaBuffer[ cbidx ] = m_ChrPointer[j];
|
c@232
|
191 }
|
c@232
|
192
|
c@232
|
193 //keep track of input buffers;
|
c@232
|
194 if( m_bufferindex++ >= m_ChromaBuffersize - 1)
|
c@232
|
195 m_bufferindex = 0;
|
c@232
|
196
|
c@232
|
197 // track filling of chroma matrix
|
c@232
|
198 if( m_ChromaBufferFilling++ >= m_ChromaBuffersize)
|
c@232
|
199 m_ChromaBufferFilling = m_ChromaBuffersize;
|
c@232
|
200
|
c@232
|
201 //calculate mean
|
c@232
|
202 for( k = 0; k < m_BPO; k++ )
|
c@232
|
203 {
|
c@232
|
204 double mnVal = 0.0;
|
c@232
|
205 for( j = 0; j < m_ChromaBufferFilling; j++ )
|
c@232
|
206 {
|
c@232
|
207 mnVal += m_ChromaBuffer[ k + (j*m_BPO) ];
|
c@232
|
208 }
|
c@232
|
209
|
c@232
|
210 m_MeanHPCP[k] = mnVal/(double)m_ChromaBufferFilling;
|
c@232
|
211 }
|
c@232
|
212
|
c@232
|
213
|
c@232
|
214 for( k = 0; k < m_BPO; k++ )
|
c@232
|
215 {
|
c@232
|
216 m_MajCorr[k] = krumCorr( m_MeanHPCP, MajProfile, m_BPO );
|
c@232
|
217 m_MinCorr[k] = krumCorr( m_MeanHPCP, MinProfile, m_BPO );
|
c@232
|
218
|
c@232
|
219 MathUtilities::circShift( MajProfile, m_BPO, 1 );
|
c@232
|
220 MathUtilities::circShift( MinProfile, m_BPO, 1 );
|
c@232
|
221 }
|
devnull@240
|
222
|
c@232
|
223 for( k = 0; k < m_BPO; k++ )
|
c@232
|
224 {
|
c@232
|
225 m_Keys[k] = m_MajCorr[k];
|
c@232
|
226 m_Keys[k+m_BPO] = m_MinCorr[k];
|
c@232
|
227 }
|
devnull@240
|
228
|
devnull@240
|
229
|
c@234
|
230 std::cout << "raw keys: ";
|
c@234
|
231 for (int ii = 0; ii < 2*m_BPO; ++ii) {
|
c@234
|
232 std::cout << m_Keys[ii] << " ";
|
c@234
|
233 }
|
c@234
|
234 std::cout << std::endl;
|
devnull@240
|
235
|
c@232
|
236 double dummy;
|
devnull@240
|
237 // '1 +' because we number keys 1-24, not 0-23.
|
devnull@240
|
238 key = 1 + (int)ceil( (double)MathUtilities::getMax( m_Keys, 2* m_BPO, &dummy )/3 );
|
c@234
|
239
|
devnull@240
|
240 std::cout << "key pre-sorting: " << key << std::endl;
|
c@232
|
241
|
c@232
|
242
|
c@232
|
243 //Median filtering
|
c@232
|
244
|
c@232
|
245 // track Median buffer initial filling
|
c@232
|
246 if( m_MedianBufferFilling++ >= m_MedianWinsize)
|
c@232
|
247 m_MedianBufferFilling = m_MedianWinsize;
|
c@232
|
248
|
c@232
|
249 //shift median buffer
|
c@232
|
250 for( k = 1; k < m_MedianWinsize; k++ )
|
c@232
|
251 {
|
c@232
|
252 m_MedianFilterBuffer[ k - 1 ] = m_MedianFilterBuffer[ k ];
|
c@232
|
253 }
|
c@232
|
254
|
c@232
|
255 //write new key value into median buffer
|
c@232
|
256 m_MedianFilterBuffer[ m_MedianWinsize - 1 ] = key;
|
c@232
|
257
|
c@232
|
258
|
c@232
|
259 //Copy median into sorting buffer, reversed
|
c@232
|
260 unsigned int ijx = 0;
|
c@232
|
261 for( k = 0; k < m_MedianWinsize; k++ )
|
c@232
|
262 {
|
c@232
|
263 m_SortedBuffer[k] = m_MedianFilterBuffer[m_MedianWinsize-1-ijx];
|
c@232
|
264 ijx++;
|
c@232
|
265 }
|
c@232
|
266
|
c@232
|
267
|
c@232
|
268 //quicksort
|
c@232
|
269 qsort(m_SortedBuffer, m_MedianBufferFilling, sizeof(unsigned int), MathUtilities::compareInt);
|
devnull@240
|
270
|
c@234
|
271 std::cout << "sorted: ";
|
c@234
|
272 for (int ii = 0; ii < m_MedianBufferFilling; ++ii) {
|
c@234
|
273 std::cout << m_SortedBuffer[ii] << " ";
|
c@234
|
274 }
|
c@234
|
275 std::cout << std::endl;
|
devnull@240
|
276
|
c@232
|
277 int sortlength = m_MedianBufferFilling;
|
c@232
|
278 int midpoint = (int)ceil((double)sortlength/2);
|
c@232
|
279
|
c@232
|
280 if( midpoint <= 0 )
|
c@232
|
281 midpoint = 1;
|
c@232
|
282
|
c@232
|
283 key = m_SortedBuffer[midpoint-1];
|
c@232
|
284
|
c@232
|
285 return key;
|
c@232
|
286 }
|
c@232
|
287
|
c@232
|
288
|
c@232
|
289 int GetKeyMode::isModeMinor( int key )
|
c@232
|
290 {
|
c@233
|
291 // return ((key-1 - (int)MathUtilities::mod((double)(key-1),(double)12))/12);
|
c@233
|
292 return (key > 12);
|
c@232
|
293 }
|