andrew@33
|
1 /*
|
andrew@33
|
2 * midiEventHolder.cpp
|
andrew@33
|
3 * midiCannamReader3
|
andrew@33
|
4 *
|
andrew@33
|
5 * Created by Andrew on 19/07/2011.
|
andrew@33
|
6 * Copyright 2011 QMUL. All rights reserved.
|
andrew@33
|
7 *
|
andrew@33
|
8 */
|
andrew@33
|
9
|
andrew@33
|
10
|
andrew@33
|
11 //Main file to look at here is newNoteEvent() - this calls everything else to update the Bayesian array
|
andrew@33
|
12
|
andrew@46
|
13 //Relative speed is RECORDED / PLAYED
|
andrew@46
|
14 //so for timedifference t
|
andrew@46
|
15 //this is t/scalar in terms of position units of played time
|
andrew@46
|
16 //and by relative speed r, r*t/scalar
|
andrew@46
|
17
|
andrew@46
|
18
|
andrew@33
|
19 #include "midiEventHolder.h"
|
andrew@36
|
20
|
andrew@37
|
21 #include <iostream>
|
andrew@37
|
22 #include <fstream>
|
andrew@42
|
23 #include <assert.h>
|
andrew@33
|
24
|
andrew@33
|
25 midiEventHolder::midiEventHolder(){
|
andrew@36
|
26
|
andrew@49
|
27 timeProjectionToMeet = 600;//ms in future they will intersect bet predicted and causal play position
|
andrew@49
|
28
|
andrew@47
|
29 double scalarForPositionVectors = 10;
|
andrew@36
|
30
|
andrew@33
|
31 // recordedNoteOnIndex = 0;
|
andrew@34
|
32 alignmentPosition = 0;
|
andrew@33
|
33
|
andrew@33
|
34 useTempoPrior = false;//puts sine wave round tempo
|
andrew@33
|
35 confidenceWeightingUsed = true;
|
andrew@33
|
36 newOptimalMethod = true;
|
andrew@33
|
37
|
andrew@34
|
38 matchWindowWidth = 16000;//window size for matching in ms
|
andrew@33
|
39 interNoteRange = 1600;//preferred duration
|
andrew@33
|
40 //so max here is really four
|
andrew@33
|
41
|
andrew@33
|
42
|
andrew@33
|
43 likelihoodWidth = 100;//using 100 is good
|
andrew@33
|
44 likelihoodToNoiseRatio = 0.20;//was 0.02 on 18/11/11, changing to give more weight to observations
|
andrew@33
|
45 //was 0.08 on 11/12/11 but need more for tempo varn in rwc database
|
andrew@33
|
46
|
andrew@33
|
47 bayesStruct.speedLikelihoodNoise = 0.1;//was 0.05
|
andrew@33
|
48 bayesStruct.speedDecayWidth = 40;
|
andrew@33
|
49 bayesStruct.speedDecayAmount = 10;
|
andrew@33
|
50
|
andrew@40
|
51 drawTempoMode = false;
|
andrew@33
|
52 //there is option to use MAP estinate or integral in beayesianarraystricture class
|
andrew@33
|
53
|
andrew@33
|
54 runningInRealTime = true;
|
andrew@33
|
55 bayesStruct.realTimeMode = &runningInRealTime;
|
andrew@33
|
56
|
andrew@33
|
57 minimumMatchSpeed = 0.0;
|
andrew@33
|
58 maximumMatchSpeed = 2.0;
|
andrew@33
|
59 minimumTimeIntervalForTempoUpdate = 150;
|
andrew@33
|
60
|
andrew@33
|
61 width = ofGetWidth();
|
andrew@33
|
62 height = ofGetHeight();
|
andrew@33
|
63 screenWidth= &width;
|
andrew@33
|
64 screenHeight = &height;
|
andrew@33
|
65
|
andrew@33
|
66 ticksPerScreen = 4000;
|
andrew@33
|
67 tickLocation = 0;
|
andrew@33
|
68 pulsesPerQuarternote = 240;
|
andrew@33
|
69 noteArrayIndex = 0;
|
andrew@33
|
70 noteMinimum = 30;
|
andrew@33
|
71 noteMaximum = 96;
|
andrew@33
|
72
|
andrew@33
|
73
|
andrew@33
|
74
|
andrew@33
|
75
|
andrew@33
|
76
|
andrew@33
|
77 speedPriorValue = 1.0;
|
andrew@33
|
78
|
andrew@46
|
79 int tmpArraySize = (int)(matchWindowWidth/scalarForPositionVectors);
|
andrew@46
|
80 bayesStruct.resetSize(tmpArraySize);
|
andrew@46
|
81 bayesStruct.setPositionDistributionScalar(scalarForPositionVectors);
|
andrew@46
|
82 printf("ARRAY SIZE IS %i\n", tmpArraySize);
|
andrew@33
|
83
|
andrew@33
|
84 bayesStruct.resetSpeedSize(200);
|
andrew@33
|
85 bayesStruct.setRelativeSpeedScalar(0.01);
|
andrew@33
|
86 bayesStruct.relativeSpeedPrior.getMaximum();
|
andrew@33
|
87 //bayesStruct.simpleExample();
|
andrew@33
|
88
|
andrew@33
|
89
|
andrew@33
|
90 speedWindowWidthMillis = 1600;//4000
|
andrew@34
|
91
|
andrew@33
|
92 noteHeight = (*screenHeight) / (float)(noteMaximum - noteMinimum);
|
andrew@33
|
93
|
andrew@33
|
94
|
andrew@33
|
95 intervalsToCheck.push_back(1);
|
andrew@33
|
96 intervalsToCheck.push_back(2);
|
andrew@33
|
97 //intervalsToCheck.push_back(3);
|
andrew@33
|
98 intervalsToCheck.push_back(4);
|
andrew@33
|
99 intervalsToCheck.push_back(6);
|
andrew@33
|
100 intervalsToCheck.push_back(8);
|
andrew@33
|
101 intervalsToCheck.push_back(16);
|
andrew@33
|
102
|
andrew@33
|
103
|
andrew@33
|
104 drawPhaseMode = true;
|
andrew@33
|
105
|
andrew@33
|
106 printf("lookup index %f value %f\n", bayesStruct.prior.getLookupIndex(100, 30., 10.0), bayesStruct.prior.gaussianLookupTable[(int)bayesStruct.prior.getLookupIndex(100, 30., 10.0)]);
|
andrew@33
|
107 }
|
andrew@33
|
108
|
andrew@33
|
109
|
andrew@33
|
110
|
andrew@33
|
111 void midiEventHolder::reset(){
|
andrew@33
|
112 //called when we start playing
|
andrew@33
|
113
|
andrew@33
|
114 noteArrayIndex = 0;
|
andrew@33
|
115 tickLocation = 0;
|
andrew@34
|
116 startPlayingTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@33
|
117 bayesStruct.lastEventTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@33
|
118 numberOfScreensIn = 0;
|
andrew@33
|
119 // recordedNoteOnIndex = 0;
|
andrew@33
|
120 bayesStruct.setNewDistributionOffsets(0);
|
andrew@33
|
121 bayesStruct.posterior.offset = 0;
|
andrew@33
|
122
|
andrew@33
|
123 playedEventTimes.clear();
|
andrew@33
|
124 playedNoteOnMatrix.clear();
|
andrew@33
|
125 matchMatrix.clear();
|
andrew@33
|
126 bestMatchIndex = 0;
|
andrew@33
|
127
|
andrew@33
|
128 recordedTotalNoteCounterByPitch.clear();
|
andrew@33
|
129 recordedTotalNoteCounterByPitch.assign(127,0);
|
andrew@33
|
130 totalNoteCounterIndex = 0;
|
andrew@34
|
131
|
andrew@33
|
132 interNoteIntervals.clear();
|
andrew@33
|
133
|
andrew@35
|
134 smoothIndex = 0;
|
andrew@34
|
135 smoothPlayPosition = 0.0;
|
andrew@48
|
136 causalPlayPosition = 0;
|
andrew@48
|
137 lastCausalUpdateTime = getTimeNow(0);
|
andrew@48
|
138
|
andrew@34
|
139 // relativeSpeedForSmooth = 1.0;
|
andrew@34
|
140 // storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@34
|
141 // lastSmoothUpdateTime = getTimeNow(0);
|
andrew@34
|
142
|
andrew@34
|
143 printf("reset speed prior is %f\n", speedPriorValue);
|
andrew@46
|
144 // bayesStruct.resetSpeedToOne();
|
andrew@33
|
145 bayesStruct.setSpeedPrior(speedPriorValue);
|
andrew@33
|
146 setMatchedNotesBackToFalse();
|
andrew@34
|
147
|
andrew@46
|
148 // periodCounter = 0;
|
andrew@46
|
149 // for (int i = 0;i < periodValues.size();i++){
|
andrew@34
|
150 // printf("period at %f is %f\n", periodValues[i][2], periodValues[i][1]);
|
andrew@46
|
151 // }
|
andrew@34
|
152 /* if (periodValues.size() > 0){
|
andrew@34
|
153 updatePeriodValue(0);// periodValues[0][2];
|
andrew@34
|
154 printf("Resetting period to %f , size is %i\n", period, (int)periodValues.size());
|
andrew@34
|
155 }
|
andrew@34
|
156 */
|
andrew@34
|
157 //period = 500.0;
|
andrew@33
|
158 }
|
andrew@33
|
159
|
andrew@33
|
160 void midiEventHolder::setMatchedNotesBackToFalse(){
|
andrew@33
|
161 for (int i = 0;i < noteOnMatches.size();i++)
|
andrew@33
|
162 noteOnMatches[i] = false;
|
andrew@33
|
163 }
|
andrew@33
|
164
|
andrew@33
|
165 void midiEventHolder::clearAllEvents(){
|
andrew@33
|
166 recordedNoteOnMatrix.clear();
|
andrew@33
|
167 matchesFound.clear();
|
andrew@33
|
168 noteOnMatches.clear();
|
andrew@33
|
169 recordedEventTimes.clear();
|
andrew@33
|
170 measureVector.clear();
|
andrew@33
|
171 //played events:
|
andrew@33
|
172 playedEventTimes.clear();
|
andrew@33
|
173 playedNoteOnMatrix.clear();
|
andrew@33
|
174 matchMatrix.clear();
|
andrew@33
|
175 bestMatchFound.clear();
|
andrew@33
|
176 periodValues.clear();
|
andrew@33
|
177
|
andrew@35
|
178 beatPositions.clear();
|
andrew@35
|
179
|
andrew@33
|
180 recordedTotalNoteCounterByPitch.clear();
|
andrew@33
|
181 recordedTotalNoteCounterByPitch.assign(127, 0);
|
andrew@33
|
182 totalNoteCounterIndex = 0;
|
andrew@33
|
183 }
|
andrew@33
|
184
|
andrew@33
|
185 void midiEventHolder::printNotes(){
|
andrew@33
|
186 printf("RECORDED MATRIX\n");
|
andrew@33
|
187 for (int i = 0;i < recordedNoteOnMatrix.size();i++){
|
andrew@33
|
188 printf("ticktime %i :: pitch %i @ millis %f\n", recordedNoteOnMatrix[i][0], recordedNoteOnMatrix[i][1], recordedEventTimes[i]);
|
andrew@33
|
189 }
|
andrew@33
|
190 }
|
andrew@33
|
191
|
andrew@33
|
192
|
andrew@33
|
193 double midiEventHolder::getEventTimeTicks(double millis){
|
andrew@34
|
194 return 0.0;
|
andrew@34
|
195 //return (millis * pulsesPerQuarternote / period);
|
andrew@33
|
196 }
|
andrew@33
|
197
|
andrew@33
|
198 double midiEventHolder::getEventTimeMillis(double ticks){
|
andrew@33
|
199 return (period * ticks / (double) pulsesPerQuarternote);
|
andrew@33
|
200 }
|
andrew@33
|
201
|
andrew@33
|
202 void midiEventHolder::newNoteOnEvent(int pitch, int velocity, double timePlayed){
|
andrew@33
|
203 // tempoSpeedString = "";
|
andrew@46
|
204
|
andrew@33
|
205 //MOVE INTO BAYESSTRUCT?? XXX
|
andrew@33
|
206 //bayesStruct.copyPriorToPosterior();
|
andrew@33
|
207 //why was this here??
|
andrew@33
|
208 bayesStruct.prior.copyFromDynamicVector(bayesStruct.posterior);//try the otehr way
|
andrew@33
|
209 //bayesStruct.copyPriorToPosterior();
|
andrew@33
|
210 //need to get new MAP position and set the offset of the arrays
|
andrew@33
|
211 //currently bestEstimate is the approx for the new MAP position
|
andrew@33
|
212
|
andrew@33
|
213 lastPlayedPitch = pitch;
|
andrew@33
|
214 //add the new event to our played information matrix
|
andrew@33
|
215 IntVector v;
|
andrew@33
|
216 v.push_back(pitch);
|
andrew@33
|
217 v.push_back(velocity);
|
andrew@33
|
218 playedNoteOnMatrix.push_back(v);
|
andrew@33
|
219
|
andrew@33
|
220
|
andrew@33
|
221 //would update the arrays at this point to show where out current location (phase) and tempo is.
|
andrew@33
|
222 // double timeNow = ofGetElapsedTimeMillis() - startTime;
|
andrew@33
|
223 double timeNow = timePlayed;// - startTime;
|
andrew@33
|
224 recentNoteOnTime = timePlayed;
|
andrew@33
|
225
|
andrew@33
|
226 // printf("Max time %f OF time %f \n", timePlayed, timeNow);
|
andrew@33
|
227
|
andrew@33
|
228 playedEventTimes.push_back(timePlayed);
|
andrew@33
|
229
|
andrew@33
|
230 // double timeDifference = ofGetElapsedTimeMillis() - bayesStruct.lastEventTime;
|
andrew@33
|
231 double timeDifference = timePlayed - bayesStruct.lastEventTime;
|
andrew@33
|
232
|
andrew@33
|
233 //printf("note %i played at %f and last event %f time difference %f and current best estmate %f\n", pitch, timePlayed, bayesStruct.lastEventTime, timeDifference, bayesStruct.bestEstimate);
|
andrew@33
|
234
|
andrew@33
|
235 //addnoise to the tempo distribution
|
andrew@33
|
236 //bayesStruct.decaySpeedDistribution(timeDifference);
|
andrew@33
|
237
|
andrew@33
|
238 if (timeDifference > 50){
|
andrew@33
|
239 bayesStruct.addGaussianNoiseToSpeedPosterior(timeDifference * 10.0 / 100.);
|
andrew@33
|
240 // bayesStruct.addTriangularNoiseToSpeedPosterior(timeDifference * 10 / 100.);
|
andrew@33
|
241 }
|
andrew@33
|
242
|
andrew@34
|
243 // bayesStruct.updateTmpBestEstimate(timeDifference);// debug - didnt work bayesStruct.bestEstimate = bayesStruct.tmpBestEstimate;
|
andrew@33
|
244 bayesStruct.updateBestEstimate(timeDifference);
|
andrew@34
|
245
|
andrew@33
|
246 bayesStruct.lastBestEstimateUpdateTime = getTimeNow(timePlayed);
|
andrew@34
|
247 //updatePeriodValue(bayesStruct.lastBestEstimateUpdateTime);
|
andrew@34
|
248
|
andrew@33
|
249 // double newMAPestimateTime = bayesStruct.posterior.getIndexInRealTerms(bayesStruct.posterior.MAPestimate);
|
andrew@33
|
250 //was offset + bayesStruct.posterior.MAPestimate; but this doesnt include scalar to convert to millis
|
andrew@33
|
251
|
andrew@33
|
252 timeString = "Pitch:"+ofToString(pitch);
|
andrew@33
|
253 timeString += ", time now:"+ofToString(timeNow, 1);
|
andrew@33
|
254 timeString += " TD "+ofToString(timeDifference, 1);
|
andrew@33
|
255 timeString += " offset "+ofToString(bayesStruct.posterior.offset , 0);
|
andrew@33
|
256 timeString += " map Est: "+ofToString(bayesStruct.posterior.MAPestimate, 0);
|
andrew@33
|
257 // timeString += " Previous time" + ofToString(newMAPestimateTime,0);
|
andrew@33
|
258 timeString += " speedMap "+ofToString(bayesStruct.relativeSpeedPosterior.integratedEstimate, 2);
|
andrew@33
|
259 timeString += " :: "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.integratedEstimate), 2);
|
andrew@33
|
260
|
andrew@33
|
261 // newMAPestimateTime += (timeDifference * bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
262 // timeString += " : Predicted MAP time" + ofToString(newMAPestimateTime,0);
|
andrew@33
|
263
|
andrew@33
|
264 //then we recalculate the window start based on MAP being central
|
andrew@33
|
265 //then we do the matches on these and the likelihood on these.
|
andrew@33
|
266
|
andrew@46
|
267 bayesStruct.setNewDistributionOffsets(max(bayesStruct.posterior.offset, bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2)));
|
andrew@46
|
268 //bayesStruct.setNewDistributionOffsets(max(0.,newMAPestimateTime - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));
|
andrew@33
|
269
|
andrew@33
|
270 timeString += " \n : new offset " + ofToString(bayesStruct.prior.offset , 0);
|
andrew@33
|
271 timeString += " \n best estimate "+ofToString(bayesStruct.bestEstimate, 1);
|
andrew@33
|
272 timeString += " error "+ofToString(minimumMatchError, 0);
|
andrew@33
|
273 timeString += " map "+ofToString(bayesStruct.relativeSpeedPosterior.integratedEstimate, 1);
|
andrew@33
|
274 timeString += " rel speed "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.integratedEstimate), 2);
|
andrew@33
|
275
|
andrew@33
|
276
|
andrew@33
|
277 //be able to draw the prior in correct location relative to the midi notes
|
andrew@33
|
278 //this calculates the cross update of all possible speeds and all possible positions
|
andrew@33
|
279 bayesStruct.crossUpdateArrays(bayesStruct.posterior, bayesStruct.relativeSpeedPosterior, timeDifference);
|
andrew@33
|
280
|
andrew@33
|
281
|
andrew@33
|
282 timeString += " new OFF "+ofToString(bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2), 1);
|
andrew@33
|
283 timeString += " notearrayindex "+ofToString(noteArrayIndex, 0);
|
andrew@33
|
284 //when this is off teh screen there is a problem somehow XXX
|
andrew@33
|
285
|
andrew@46
|
286 bayesStruct.posterior.offset = bayesStruct.prior.offset;
|
andrew@46
|
287 //max(0., bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));// bayesStruct.prior.offset = max(0., bayesStruct.bestEstimate - (bayesStruct.prior.scalar*bayesStruct.prior.arraySize/2));
|
andrew@33
|
288
|
andrew@33
|
289 //trying to switch to prior
|
andrew@33
|
290
|
andrew@33
|
291
|
andrew@33
|
292 bayesStruct.lastEventTime = timePlayed;//bayesStruct.lastEventTime = ofGetElapsedTimeMillis();
|
andrew@33
|
293
|
andrew@33
|
294 //do the cross update to find current posterior for location
|
andrew@33
|
295 // totalConfidence= 0;
|
andrew@33
|
296 int numberOfMatchesFound = findLocalMatches(pitch);
|
andrew@33
|
297 setMatchLikelihoods(numberOfMatchesFound);
|
andrew@33
|
298 bayesStruct.calculatePosterior();
|
andrew@33
|
299
|
andrew@33
|
300 if (recordedEventTimes.size() > 0){
|
andrew@33
|
301 updateTempo();
|
andrew@33
|
302 //calcuateNewInterNoteIntervals();
|
andrew@33
|
303 }
|
andrew@34
|
304
|
andrew@46
|
305
|
andrew@34
|
306 //storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@33
|
307
|
andrew@33
|
308 }
|
andrew@33
|
309
|
andrew@33
|
310 void midiEventHolder::updateTempo(){
|
andrew@33
|
311 //having found matches we have matches for new note and matches for previous notes
|
andrew@33
|
312 if (newOptimalMethod)
|
andrew@33
|
313 findOptimumTempoPairsToCurrentBestMatch();
|
andrew@33
|
314 else if (!confidenceWeightingUsed)
|
andrew@33
|
315 findLocalTempoPairs();
|
andrew@33
|
316 else
|
andrew@33
|
317 findLocalTempoPairsWeightedForConfidence();
|
andrew@33
|
318
|
andrew@33
|
319
|
andrew@33
|
320 //bayesStruct.addGaussianNoiseToSpeedPosterior(10);
|
andrew@33
|
321 }
|
andrew@33
|
322
|
andrew@33
|
323 double midiEventHolder::getTimeNow(double eventTime){
|
andrew@33
|
324 double timeNow = eventTime;
|
andrew@33
|
325 if (runningInRealTime)
|
andrew@33
|
326 timeNow = ofGetElapsedTimeMillis();
|
andrew@33
|
327 return timeNow;
|
andrew@33
|
328 }
|
andrew@33
|
329
|
andrew@33
|
330 int midiEventHolder::findLocalMatches(int notePitch){
|
andrew@33
|
331
|
andrew@33
|
332 //here we find the matches to the new note within appropriate range
|
andrew@33
|
333
|
andrew@33
|
334 matchString = "";
|
andrew@33
|
335
|
andrew@33
|
336 windowStartTime = max(0.0,(bayesStruct.bestEstimate - matchWindowWidth/2));//was playPositionInMillis
|
andrew@33
|
337 // cout << "best estimate is " << bayesStruct.bestEstimate << endl;
|
andrew@33
|
338 int numberOfMatches = findMatch(notePitch, windowStartTime, windowStartTime + matchWindowWidth);
|
andrew@33
|
339
|
andrew@33
|
340
|
andrew@33
|
341 //matchString += " pitch: "+ofToString(notePitch)+" matches "+ofToString(numberOfMatches)+" win start "+ofToString(windowStartTime);
|
andrew@33
|
342
|
andrew@33
|
343 return numberOfMatches;
|
andrew@33
|
344
|
andrew@33
|
345
|
andrew@33
|
346 }
|
andrew@33
|
347
|
andrew@33
|
348
|
andrew@33
|
349 void midiEventHolder::setMatchLikelihoods(int numberOfMatches){
|
andrew@33
|
350 //reset the offset to match the prior
|
andrew@33
|
351 bayesStruct.likelihood.offset = bayesStruct.prior.offset;
|
andrew@33
|
352 bayesStruct.likelihood.zero();//set to zero
|
andrew@33
|
353
|
andrew@33
|
354 double quantity = likelihoodToNoiseRatio / numberOfMatches;
|
andrew@33
|
355
|
andrew@33
|
356 for (int i = 0;i < numberOfMatches && matchesFound[i] >= 0 && matchesFound[i] < recordedEventTimes.size();i++){
|
andrew@33
|
357 // printf("match times %i of %i::%f adding likelihood to %f\n", i, numberOfMatches, recordedEventTimes[matchesFound[i]], recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset);
|
andrew@33
|
358 //this is the vent time since start of file
|
andrew@46
|
359 if (recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset < bayesStruct.likelihood.arraySize*bayesStruct.likelihood.scalar){
|
andrew@33
|
360 // double confidenceMeasure = 0;
|
andrew@33
|
361 // if (totalConfidence > 0)
|
andrew@33
|
362 // confidenceMeasure = bayesStruct.posterior.getValueAtMillis(recordedEventTimes[matchesFound[i]])/totalConfidence;
|
andrew@44
|
363
|
andrew@44
|
364 //bayesStruct.likelihood.addGaussianShape(recordedEventTimes[matchesFound[i]] - bayesStruct.likelihood.offset, likelihoodWidth, quantity);//* confidenceMeasure
|
andrew@44
|
365 bayesStruct.likelihood.addGaussianShapeFromRealTime(recordedEventTimes[matchesFound[i]], likelihoodWidth, quantity);//* confidenceMeasure
|
andrew@33
|
366 }//end if
|
andrew@33
|
367 }
|
andrew@33
|
368 bayesStruct.likelihood.addConstant((1-likelihoodToNoiseRatio)/bayesStruct.likelihood.length);
|
andrew@33
|
369 }
|
andrew@33
|
370
|
andrew@33
|
371 int midiEventHolder::findMatch(const int& notePitch, const int& startTime, const int& endTime){
|
andrew@33
|
372
|
andrew@33
|
373 matchesFound.clear();
|
andrew@33
|
374 int startIndex = 0;
|
andrew@33
|
375
|
andrew@33
|
376 if (recordedEventTimes.size() > 0){
|
andrew@33
|
377
|
andrew@33
|
378 //get to the right range of events to check in
|
andrew@33
|
379 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < startTime)
|
andrew@33
|
380 startIndex++;
|
andrew@33
|
381
|
andrew@33
|
382 }
|
andrew@33
|
383
|
andrew@33
|
384 IntVector v;
|
andrew@33
|
385 DoubleVector d;
|
andrew@33
|
386 double tmpError = 100000.;//v high error
|
andrew@33
|
387
|
andrew@33
|
388 double minimumConfidence = 0;
|
andrew@33
|
389 while (startIndex < recordedEventTimes.size() && recordedEventTimes[startIndex] < endTime){
|
andrew@33
|
390 if (recordedNoteOnMatrix[startIndex][1] == notePitch){
|
andrew@33
|
391
|
andrew@33
|
392 matchesFound.push_back(startIndex);
|
andrew@33
|
393 v.push_back(startIndex);
|
andrew@33
|
394 //so startIndex is registered as a match
|
andrew@33
|
395
|
andrew@33
|
396 double eventConfidence = bayesStruct.posterior.getValueAtMillis(recordedEventTimes[startIndex]);
|
andrew@33
|
397 if (eventConfidence > minimumConfidence){
|
andrew@33
|
398 minimumConfidence = eventConfidence;
|
andrew@33
|
399 bestMatchIndex = startIndex;
|
andrew@33
|
400 }
|
andrew@33
|
401 d.push_back(eventConfidence);
|
andrew@33
|
402
|
andrew@33
|
403 double confidence = eventConfidence;//bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
404 // recordedEventTimes[startIndex]);
|
andrew@33
|
405 // matchString += "["+ofToString(startIndex)+"] = "+ofToString(confidence, 3)+" .";
|
andrew@33
|
406
|
andrew@33
|
407 if (abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate) < tmpError){
|
andrew@33
|
408 //record the error between expected and observed times
|
andrew@33
|
409 tmpError = abs(recordedEventTimes[startIndex] - bayesStruct.bestEstimate);
|
andrew@33
|
410 minimumMatchError = tmpError;//recordedEventTimes[startIndex] - bayesStruct.bestEstimate;
|
andrew@33
|
411 }
|
andrew@33
|
412
|
andrew@33
|
413 }
|
andrew@33
|
414 startIndex++;
|
andrew@33
|
415 }
|
andrew@33
|
416
|
andrew@33
|
417
|
andrew@33
|
418 // printf("%i MATCHES TO Note %i found\n", (int)matchesFound.size(), notePitch);
|
andrew@33
|
419 int size = matchesFound.size();
|
andrew@33
|
420 if (size > 0)
|
andrew@33
|
421 noteOnMatches[bestMatchIndex] = true;
|
andrew@33
|
422
|
andrew@33
|
423 v.insert(v.begin() , (int)size);//at beginning, we list how many matches there are that we have found
|
andrew@33
|
424 d.insert(d.begin() , (double)size);
|
andrew@33
|
425
|
andrew@33
|
426 //v.push_back(size);
|
andrew@33
|
427 //d.push_back(size);
|
andrew@33
|
428 //for (int i = 0;i < matchesFound.size()+1;i++){
|
andrew@33
|
429 // v.push_back(matchesFound[i]);
|
andrew@33
|
430 // printf("match %i,[%i] is %i\n", startIndex, i, v[i]);
|
andrew@33
|
431 //}
|
andrew@33
|
432
|
andrew@33
|
433
|
andrew@33
|
434 matchMatrix.push_back(v);
|
andrew@33
|
435 matchConfidence.push_back(d);
|
andrew@33
|
436
|
andrew@33
|
437 //bringing in way to list only the best matches and use these in tempo process
|
andrew@33
|
438 bestMatchFound.push_back(bestMatchIndex);
|
andrew@33
|
439
|
andrew@33
|
440 // printf("BEST MATCH TO note %i, start time %i, endtime %i, time %i is recorded time %i, confidence %0.2f\n", notePitch, startTime, endTime, (int) recordedEventTimes[bestMatchIndex], minimumConfidence);
|
andrew@33
|
441
|
andrew@33
|
442 return size;
|
andrew@33
|
443 }
|
andrew@33
|
444
|
andrew@33
|
445 bool midiEventHolder::checkIfMatchedNote(const int& tmpIndex){
|
andrew@33
|
446 for (int i = 0;i < matchesFound.size();i++){
|
andrew@33
|
447 if (matchesFound[i] == tmpIndex)
|
andrew@33
|
448 return true;
|
andrew@33
|
449 }
|
andrew@33
|
450 return false;
|
andrew@33
|
451 }
|
andrew@33
|
452
|
andrew@33
|
453
|
andrew@33
|
454
|
andrew@33
|
455 void midiEventHolder::findLocalTempoPairs(){
|
andrew@33
|
456
|
andrew@33
|
457 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
458 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
459 // printMatchesFound();
|
andrew@33
|
460 // printMatchMatrix();
|
andrew@33
|
461 // printf("possible notes \n");
|
andrew@33
|
462 bool needToUpdate = false;
|
andrew@33
|
463 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
464
|
andrew@33
|
465
|
andrew@33
|
466 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@33
|
467 //iterate through the recently matched events - even dodgy matches included
|
andrew@33
|
468 //size, index of match0, index of match1, ....
|
andrew@33
|
469
|
andrew@33
|
470
|
andrew@33
|
471 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@33
|
472
|
andrew@33
|
473 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
474
|
andrew@33
|
475
|
andrew@33
|
476 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
477 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
478
|
andrew@33
|
479 for (int k = 0;k < matchMatrix[previousIndex][0];k++){
|
andrew@33
|
480
|
andrew@33
|
481 int recordedPreviousIndex = matchMatrix[previousIndex][k+1];
|
andrew@33
|
482
|
andrew@33
|
483 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
484
|
andrew@33
|
485
|
andrew@33
|
486 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
487
|
andrew@33
|
488 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
489 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate &&
|
andrew@33
|
490 speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@33
|
491
|
andrew@33
|
492 //adding in a prior that prefers 1
|
andrew@33
|
493 double priorWeighting = 1;
|
andrew@33
|
494 if (useTempoPrior)
|
andrew@33
|
495 priorWeighting = sin(speedRatio * PI/2);
|
andrew@33
|
496
|
andrew@33
|
497
|
andrew@33
|
498
|
andrew@33
|
499 /*
|
andrew@33
|
500 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@33
|
501 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
502 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
503 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
504 */
|
andrew@33
|
505 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
506 // commented for debug
|
andrew@33
|
507
|
andrew@33
|
508 //bayesStruct.updateTempoDistribution(speedRatio, 0.1);//second paramter is confidence in the match
|
andrew@33
|
509 double amount = (1-bayesStruct.speedLikelihoodNoise)/10;
|
andrew@33
|
510 amount *= priorWeighting;
|
andrew@33
|
511 bayesStruct.updateTempoLikelihood(speedRatio, amount);
|
andrew@33
|
512 // tempoSpeedString += ofToString(recordedPreviousIndex) + " "+ ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
513 needToUpdate = true;
|
andrew@33
|
514 }
|
andrew@33
|
515 // printf("\n");
|
andrew@33
|
516 }
|
andrew@33
|
517
|
andrew@33
|
518 previousIndex--;
|
andrew@33
|
519 }//end while previousindex countdown
|
andrew@33
|
520 }//end for loop through possible current matches
|
andrew@33
|
521
|
andrew@33
|
522 if (needToUpdate)
|
andrew@33
|
523 bayesStruct.updateTempoDistribution();
|
andrew@33
|
524
|
andrew@33
|
525 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
526 }
|
andrew@33
|
527
|
andrew@33
|
528
|
andrew@33
|
529 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@33
|
530 bool needToUpdate = false;
|
andrew@33
|
531
|
andrew@33
|
532 DoubleVector speedIntervalsFound;
|
andrew@33
|
533
|
andrew@33
|
534 //adapted this to just use the best match for each note
|
andrew@33
|
535
|
andrew@33
|
536 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
537 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@33
|
538 // printMatchesFound();
|
andrew@33
|
539 // printMatchMatrix();
|
andrew@33
|
540 // printf("possible notes \n");
|
andrew@33
|
541
|
andrew@33
|
542 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
543
|
andrew@33
|
544 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
545 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
546 //that is the difference in confidence method
|
andrew@33
|
547
|
andrew@33
|
548
|
andrew@33
|
549 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
550
|
andrew@33
|
551 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
552
|
andrew@33
|
553 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
554 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
555 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
556
|
andrew@33
|
557 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
558
|
andrew@33
|
559 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
560
|
andrew@33
|
561
|
andrew@33
|
562 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
563
|
andrew@33
|
564 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
565 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
566 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
567
|
andrew@33
|
568 /* printf("(%i)", previousIndex);
|
andrew@33
|
569 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
570 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
571 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
572 printf("update on speed ratio %f\n", speedRatio);
|
andrew@33
|
573 */
|
andrew@33
|
574 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
575 // commented for debug
|
andrew@33
|
576
|
andrew@33
|
577
|
andrew@33
|
578 double priorWeighting = 1;
|
andrew@33
|
579
|
andrew@33
|
580 if (useTempoPrior)
|
andrew@33
|
581 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
582
|
andrew@33
|
583
|
andrew@33
|
584 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
585 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
586
|
andrew@33
|
587 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
588 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
589
|
andrew@33
|
590 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
591 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
592
|
andrew@33
|
593 needToUpdate = true;
|
andrew@33
|
594 }
|
andrew@33
|
595 // printf("\n");
|
andrew@33
|
596
|
andrew@33
|
597
|
andrew@33
|
598 previousIndex--;
|
andrew@33
|
599 }//end while previousindex countdown
|
andrew@33
|
600
|
andrew@33
|
601 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
602 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
603 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
604 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
605 }
|
andrew@33
|
606
|
andrew@33
|
607
|
andrew@33
|
608 if (needToUpdate)
|
andrew@33
|
609 bayesStruct.updateTempoDistribution();
|
andrew@33
|
610 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
611 }
|
andrew@33
|
612
|
andrew@33
|
613 double midiEventHolder::getBestSpeedEstimate(const int& currentPlayedIndex, const int& equivalentRecordedIndex){
|
andrew@33
|
614 double estimate = 1.0;
|
andrew@33
|
615 if (bestMatchIndex > 0){
|
andrew@33
|
616 double accordingToFileLengthEstimate = recordedEventTimes[equivalentRecordedIndex] - recordedEventTimes[0];
|
andrew@33
|
617 double playedEquivalent = (playedEventTimes[currentPlayedIndex] - playedEventTimes[0]);
|
andrew@33
|
618 if (accordingToFileLengthEstimate > 0 && playedEquivalent > 0)
|
andrew@33
|
619 accordingToFileLengthEstimate /= playedEquivalent;
|
andrew@33
|
620 estimate = accordingToFileLengthEstimate;
|
andrew@33
|
621 }
|
andrew@33
|
622 return estimate;
|
andrew@33
|
623 }
|
andrew@33
|
624
|
andrew@33
|
625 void midiEventHolder::findOptimumTempoPairsToCurrentBestMatch(){
|
andrew@33
|
626 bool needToUpdate = false;
|
andrew@33
|
627
|
andrew@33
|
628 DoubleVector speedIntervalsFound;
|
andrew@33
|
629
|
andrew@33
|
630 double currentSpeedEstimate = bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@33
|
631
|
andrew@33
|
632 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
633
|
andrew@33
|
634 bayesStruct.setLikelihoodToConstant();
|
andrew@33
|
635
|
andrew@33
|
636 int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
637 //we only look at intervals between the current best match and other recent best matched notes
|
andrew@33
|
638
|
andrew@33
|
639 //printf("BEST MATCH FOUND for index %i is %i ", currentPlayedIndex, bestMatchFound[currentPlayedIndex]);
|
andrew@33
|
640
|
andrew@33
|
641 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
642
|
andrew@33
|
643 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
644 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
645
|
andrew@33
|
646 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
647
|
andrew@33
|
648 int recordedPreviousIndex = bestMatchFound[previousIndex];
|
andrew@33
|
649
|
andrew@33
|
650 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@33
|
651
|
andrew@33
|
652 //we want the speed of the recording relative to that of the playing live
|
andrew@33
|
653 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@33
|
654
|
andrew@33
|
655 //now check if this can be closer the observed value
|
andrew@33
|
656 int checkRecordedCurrentIndex = recordedCurrentIndex;
|
andrew@33
|
657 int checkRecordedPreviousIndex ;//= recordedCurrentIndex;
|
andrew@33
|
658 int currentPlayedPitch = playedNoteOnMatrix[currentPlayedIndex][1];
|
andrew@33
|
659 int previousPlayedPitch = playedNoteOnMatrix[previousIndex][1];
|
andrew@33
|
660
|
andrew@33
|
661 double recordedTimeOfBestMatch = recordedEventTimes[recordedCurrentIndex];
|
andrew@33
|
662
|
andrew@33
|
663 //change this so we start first in window and go to end
|
andrew@33
|
664
|
andrew@33
|
665 while (checkRecordedCurrentIndex >= 0 && recordedEventTimes[checkRecordedCurrentIndex] > recordedTimeOfBestMatch - matchWindowWidth){
|
andrew@33
|
666
|
andrew@33
|
667 checkRecordedCurrentIndex--;
|
andrew@33
|
668 }
|
andrew@33
|
669
|
andrew@33
|
670 double bestSpeedEstimate = getBestSpeedEstimate(currentPlayedIndex, bestMatchIndex);
|
andrew@33
|
671
|
andrew@33
|
672 while (checkRecordedCurrentIndex < recordedEventTimes.size() && recordedEventTimes[checkRecordedCurrentIndex] < recordedTimeOfBestMatch + matchWindowWidth ){
|
andrew@33
|
673 if (recordedNoteOnMatrix[checkRecordedCurrentIndex][1] == currentPlayedPitch ){
|
andrew@33
|
674 checkRecordedPreviousIndex = checkRecordedCurrentIndex;
|
andrew@33
|
675 double recordedTimeCurrent = recordedEventTimes[checkRecordedCurrentIndex] ;
|
andrew@33
|
676 while (checkRecordedPreviousIndex >= 0 && recordedEventTimes[checkRecordedPreviousIndex] + maximumMatchSpeed*playedTimeDifference > recordedTimeCurrent ) {
|
andrew@33
|
677 if (recordedNoteOnMatrix[checkRecordedPreviousIndex][1] == previousPlayedPitch){
|
andrew@33
|
678 //we have a candidate
|
andrew@33
|
679 double speedToTest = recordedEventTimes[checkRecordedCurrentIndex] - recordedEventTimes[checkRecordedPreviousIndex];
|
andrew@33
|
680 speedToTest /= playedTimeDifference;
|
andrew@33
|
681 if (abs(speedToTest-currentSpeedEstimate) < abs(speedRatio - currentSpeedEstimate) ){
|
andrew@33
|
682 speedRatio = speedToTest;
|
andrew@33
|
683 }
|
andrew@33
|
684 }
|
andrew@33
|
685 checkRecordedPreviousIndex--;
|
andrew@33
|
686 }
|
andrew@33
|
687 }
|
andrew@33
|
688 checkRecordedCurrentIndex++;
|
andrew@33
|
689 }
|
andrew@33
|
690
|
andrew@33
|
691
|
andrew@33
|
692 if (recordedTimeDifference > minimumTimeIntervalForTempoUpdate
|
andrew@33
|
693 && speedRatio < maximumMatchSpeed && speedRatio > minimumMatchSpeed){
|
andrew@33
|
694
|
andrew@46
|
695 /* printf("(%i)", previousIndex);
|
andrew@33
|
696 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@33
|
697 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@33
|
698 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@33
|
699 printf("update on speed ratio %f\n", speedRatio);
|
andrew@46
|
700 */
|
andrew@33
|
701 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@33
|
702 // commented for debug
|
andrew@33
|
703
|
andrew@33
|
704
|
andrew@33
|
705 double priorWeighting = 1;
|
andrew@33
|
706
|
andrew@33
|
707 if (useTempoPrior)
|
andrew@33
|
708 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@33
|
709
|
andrew@33
|
710
|
andrew@33
|
711 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@33
|
712 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/16;//was 9
|
andrew@33
|
713
|
andrew@33
|
714 speedIntervalsFound.push_back(speedRatio);
|
andrew@33
|
715 // bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@33
|
716
|
andrew@33
|
717 // tempoSpeedString += ofToString(recordedCurrentIndex) + " :: " + ofToString(recordedPreviousIndex);
|
andrew@33
|
718 // tempoSpeedString += " " + ofToString(recordedTimeDifference)+ " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@33
|
719
|
andrew@33
|
720 needToUpdate = true;
|
andrew@33
|
721 }
|
andrew@33
|
722 // printf("\n");
|
andrew@33
|
723
|
andrew@33
|
724
|
andrew@33
|
725 previousIndex--;
|
andrew@33
|
726 }//end while previousindex countdown
|
andrew@33
|
727
|
andrew@33
|
728 if (speedIntervalsFound.size() > 0){
|
andrew@33
|
729 double amount = (1 - bayesStruct.speedLikelihoodNoise) / speedIntervalsFound.size();
|
andrew@33
|
730 for (int i = 0;i < speedIntervalsFound.size();i++)
|
andrew@33
|
731 bayesStruct.updateTempoLikelihood(speedIntervalsFound[i], amount);
|
andrew@33
|
732 }
|
andrew@33
|
733
|
andrew@33
|
734
|
andrew@33
|
735 if (needToUpdate)
|
andrew@33
|
736 bayesStruct.updateTempoDistribution();
|
andrew@46
|
737
|
andrew@33
|
738 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@33
|
739 }
|
andrew@33
|
740
|
andrew@33
|
741
|
andrew@33
|
742 void midiEventHolder::calcuateNewInterNoteIntervals(){
|
andrew@33
|
743 DoubleVector v;
|
andrew@33
|
744
|
andrew@33
|
745 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@33
|
746 // int recordedCurrentIndex = bestMatchFound[currentPlayedIndex];
|
andrew@33
|
747 int previousIndex = currentPlayedIndex-1;
|
andrew@33
|
748
|
andrew@33
|
749 //withing speedwindow i.e. 4 seconds
|
andrew@33
|
750 while (previousIndex >= 0 && playedEventTimes[previousIndex] + interNoteRange > playedEventTimes[currentPlayedIndex]) {
|
andrew@33
|
751
|
andrew@33
|
752 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@33
|
753
|
andrew@33
|
754 checkForCorrectInterval(playedTimeDifference, &v);
|
andrew@33
|
755
|
andrew@33
|
756 previousIndex--;
|
andrew@33
|
757 }
|
andrew@33
|
758
|
andrew@33
|
759 if (v.size() > 0)
|
andrew@33
|
760 interNoteIntervals.push_back(v);
|
andrew@33
|
761 //printf("\n");
|
andrew@33
|
762 }
|
andrew@33
|
763
|
andrew@33
|
764 void midiEventHolder::checkForCorrectInterval(const double& playedTimeDifference, DoubleVector* v){
|
andrew@33
|
765 double intervalDuration = 0.0;
|
andrew@33
|
766
|
andrew@33
|
767 for (int intervalIndex = 0;intervalIndex < 3;intervalIndex++){
|
andrew@33
|
768 //on;y check 1,2 and 4
|
andrew@33
|
769 double possibleDuration = playedTimeDifference / intervalsToCheck[intervalIndex];
|
andrew@33
|
770 if (possibleDuration >= 200 && possibleDuration < 400){
|
andrew@33
|
771 v->push_back(possibleDuration);
|
andrew@33
|
772 // printf("int %f / %i :: %f ", playedTimeDifference, intervalsToCheck[intervalIndex], possibleDuration);
|
andrew@33
|
773 }
|
andrew@33
|
774 }
|
andrew@33
|
775 }
|
andrew@33
|
776
|
andrew@33
|
777
|
andrew@33
|
778 void midiEventHolder::updatePlayPosition(){
|
andrew@34
|
779 //timeDifference = ofGetElapsedTimeMillis() - startPlayingTime;//elpased
|
andrew@33
|
780
|
andrew@33
|
781 //in actual fact if we are changing the speed of the play position
|
andrew@33
|
782 //we will need to update this via the file
|
andrew@33
|
783
|
andrew@33
|
784 //actually time since beginning of file i think
|
andrew@33
|
785
|
andrew@33
|
786 double timeDifference = 0;
|
andrew@34
|
787
|
andrew@34
|
788 if (runningInRealTime){
|
andrew@34
|
789
|
andrew@48
|
790 bayesStruct.updateBestEstimate(0);//was timedifference
|
andrew@34
|
791 // bayesStruct.updateTmpBestEstimate(timeDifference);
|
andrew@34
|
792 }
|
andrew@34
|
793
|
andrew@49
|
794 //did just update smooth to current if it was less
|
andrew@35
|
795
|
andrew@35
|
796 if (smoothPlayPosition < bayesStruct.bestEstimate){
|
andrew@35
|
797 updateSmoothPositionTo(bayesStruct.bestEstimate);
|
andrew@35
|
798 //smoothPlayPosition = bayesStruct.bestEstimate;
|
andrew@35
|
799 }
|
andrew@34
|
800
|
andrew@49
|
801
|
andrew@49
|
802
|
andrew@48
|
803 updateCausalPlayPosition(getTimeNow(bayesStruct.lastBestEstimateUpdateTime));
|
andrew@48
|
804
|
andrew@49
|
805 /*
|
andrew@49
|
806 //now we try updating it to a causal path that tries to match into the future
|
andrew@49
|
807 if (smoothPlayPosition < causalPlayPosition){
|
andrew@49
|
808 updateSmoothPositionTo(causalPlayPosition);
|
andrew@49
|
809 }
|
andrew@49
|
810 */
|
andrew@49
|
811
|
andrew@34
|
812 // playPositionInMillis = timeDifference;//based on updating from when we change period
|
andrew@34
|
813 //this to be added
|
andrew@34
|
814
|
andrew@33
|
815
|
andrew@33
|
816 //this is time diff in milliseconds
|
andrew@33
|
817 //then we have
|
andrew@33
|
818 double quarterNoteIntervals = (timeDifference / period);
|
andrew@33
|
819 tickLocation = quarterNoteIntervals * pulsesPerQuarternote;
|
andrew@33
|
820
|
andrew@33
|
821 updateNoteCounter();
|
andrew@33
|
822
|
andrew@33
|
823 }
|
andrew@33
|
824
|
andrew@35
|
825 void midiEventHolder::updateSmoothPositionTo(const double& newPosition){
|
andrew@42
|
826 //smooth play position was where we last outputted notes from.
|
andrew@42
|
827 //checking index is there to make sense.
|
andrew@35
|
828 while (smoothIndex > 0 && recordedEventTimes[smoothIndex] > smoothPlayPosition){
|
andrew@35
|
829 smoothIndex--;
|
andrew@42
|
830 //printf("going backewaers on smooth, ");
|
andrew@35
|
831 }
|
andrew@35
|
832 while (smoothIndex < recordedEventTimes.size()-1 && recordedEventTimes[smoothIndex] < smoothPlayPosition){
|
andrew@35
|
833 smoothIndex++;
|
andrew@42
|
834 //printf("outputting smooth\n ");
|
andrew@35
|
835 }
|
andrew@35
|
836
|
andrew@35
|
837
|
andrew@35
|
838 double playingTime = ofGetElapsedTimeMillis();
|
andrew@35
|
839 playingTime -= startPlayingTime;
|
andrew@35
|
840 //now at the last one
|
andrew@35
|
841
|
andrew@39
|
842 float smoothLocation = beatPositions[smoothIndex];
|
andrew@39
|
843 int currentNote = recordedNoteOnMatrix[smoothIndex][1];
|
andrew@36
|
844
|
andrew@35
|
845 while (smoothIndex < recordedEventTimes.size() && recordedEventTimes[smoothIndex] < newPosition){
|
andrew@36
|
846 float annotationTime = 0;
|
andrew@38
|
847 float annotationLocation = 0;
|
andrew@42
|
848 int annotationTick = 0;
|
andrew@36
|
849 int annotationNote = 0;
|
andrew@39
|
850 float difference = 10000;//very big
|
andrew@39
|
851 float currentLocationDifference = 1.0;
|
andrew@39
|
852 float range = 1.0;
|
andrew@36
|
853 if (smoothIndex < myNotation.rwcAnnotations.size()){
|
andrew@39
|
854 //add in test here to find closest matching note
|
andrew@39
|
855
|
andrew@42
|
856
|
andrew@36
|
857 annotationTime = myNotation.rwcAnnotations[smoothIndex].eventTime;
|
andrew@36
|
858 annotationNote = myNotation.rwcAnnotations[smoothIndex].midiNote;
|
andrew@38
|
859 annotationLocation = myNotation.rwcAnnotations[smoothIndex].beatLocation;
|
andrew@42
|
860 annotationTick = round(annotationLocation*480.0);
|
andrew@42
|
861 }else{
|
andrew@42
|
862 printf("No annotaion size %i\n", (int)myNotation.rwcAnnotations.size());
|
andrew@36
|
863 }
|
andrew@36
|
864
|
andrew@39
|
865 difference = playingTime - (annotationTime*1000.0);
|
andrew@36
|
866
|
andrew@35
|
867 if ((*fileOutput).is_open()){
|
andrew@36
|
868 (*fileOutput) << fixed << beatPositions[smoothIndex] <<",\t" << recordedNoteOnMatrix[smoothIndex][1] << ",\t";
|
andrew@36
|
869 (*fileOutput) << playingTime ;
|
andrew@37
|
870
|
andrew@36
|
871 if ( recordedNoteOnMatrix[smoothIndex][1] == annotationNote){
|
andrew@36
|
872 (*fileOutput) << " corresponds to " << annotationTime;
|
andrew@36
|
873 }
|
andrew@36
|
874 (*fileOutput) << " \n";
|
andrew@48
|
875
|
andrew@37
|
876 }
|
andrew@37
|
877
|
andrew@48
|
878 printf("annotations: rec tick time %i vs %i midi %i beat pos %f playing time now at %f :: annotaion %i loc % f time %f diff \t%f ms\n",
|
andrew@42
|
879 recordedNoteOnMatrix[smoothIndex][0], annotationTick, recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
880 beatPositions[smoothIndex], playingTime,
|
andrew@42
|
881 annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
882
|
andrew@42
|
883 // assert(annotationNote == recordedNoteOnMatrix[smoothIndex][1]);
|
andrew@42
|
884 assert(annotationTick == recordedNoteOnMatrix[smoothIndex][0]);
|
andrew@42
|
885
|
andrew@49
|
886 smoothDifference = difference;
|
andrew@42
|
887
|
andrew@37
|
888 if ((*differenceOutput).is_open()){
|
andrew@48
|
889 (*differenceOutput) << beatPositions[smoothIndex] << "," << difference << "," << playingTime << "," << (annotationTime*1000.0) << "\n";
|
andrew@42
|
890 // printf("midi %i beat pos %f playing time now at %f :: annotaion %i loc % f time %f diff \t%f ms\n",
|
andrew@42
|
891 // recordedNoteOnMatrix[smoothIndex][1],
|
andrew@42
|
892 // beatPositions[smoothIndex], playingTime,
|
andrew@42
|
893 // annotationNote, annotationLocation, annotationTime, difference);
|
andrew@42
|
894 }else{
|
andrew@42
|
895 printf("file not open\n");
|
andrew@35
|
896 }
|
andrew@35
|
897
|
andrew@35
|
898 smoothIndex++;
|
andrew@35
|
899 }
|
andrew@35
|
900
|
andrew@35
|
901
|
andrew@35
|
902 smoothPlayPosition = newPosition;
|
andrew@35
|
903
|
andrew@35
|
904 }
|
andrew@35
|
905
|
andrew@48
|
906 void midiEventHolder::updateCausalPlayPosition(const double& timeNow){
|
andrew@48
|
907 //projected position
|
andrew@49
|
908
|
andrew@48
|
909 double difference = bayesStruct.bestEstimate - causalPlayPosition;
|
andrew@48
|
910 causalSpeed = bayesStruct.speedEstimate;
|
andrew@48
|
911 causalSpeed += (difference/timeProjectionToMeet);
|
andrew@48
|
912
|
andrew@48
|
913 if (causalSpeed < 0)
|
andrew@48
|
914 causalSpeed = 0;
|
andrew@48
|
915
|
andrew@48
|
916 causalPlayPosition += causalSpeed * (timeNow - lastCausalUpdateTime);
|
andrew@48
|
917 lastCausalUpdateTime = timeNow;
|
andrew@48
|
918
|
andrew@48
|
919 }
|
andrew@46
|
920 /*
|
andrew@34
|
921 void midiEventHolder::updatePeriodValue(const double& millis){
|
andrew@34
|
922
|
andrew@34
|
923 double tmp = period;
|
andrew@46
|
924
|
andrew@46
|
925 // while (periodCounter >= 0 && periodCounter < periodValues.size()-1 && periodValues[periodCounter][2] < millis){
|
andrew@46
|
926 // periodCounter++;
|
andrew@46
|
927 // }
|
andrew@46
|
928 // while (periodCounter > 0 && periodValues[periodCounter][2] > millis){
|
andrew@46
|
929 // periodCounter--;
|
andrew@46
|
930 // }
|
andrew@46
|
931 //
|
andrew@34
|
932 //period = periodValues[periodCounter][1];
|
andrew@34
|
933
|
andrew@34
|
934 if (period != tmp){
|
andrew@34
|
935 printf("new period at %f of %f\n", millis, period);
|
andrew@34
|
936 }
|
andrew@34
|
937 }
|
andrew@46
|
938 */
|
andrew@34
|
939
|
andrew@33
|
940 void midiEventHolder::updateNoteCounter(){
|
andrew@33
|
941 while (totalNoteCounterIndex < bestMatchIndex){
|
andrew@33
|
942 int tmpPitch = recordedNoteOnMatrix[totalNoteCounterIndex][1];
|
andrew@33
|
943 recordedTotalNoteCounterByPitch[tmpPitch] += 1;
|
andrew@33
|
944 totalNoteCounterIndex++;
|
andrew@33
|
945 }
|
andrew@33
|
946 }
|
andrew@33
|
947
|
andrew@33
|
948
|
andrew@33
|
949 void midiEventHolder::drawMidiFile(){
|
andrew@46
|
950 //ofBackground(80,80,80);
|
andrew@33
|
951
|
andrew@33
|
952 //draws midi file on scrolling screen
|
andrew@33
|
953 int size = recordedNoteOnMatrix.size();
|
andrew@33
|
954 if (size > 0){
|
andrew@33
|
955
|
andrew@33
|
956 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
957
|
andrew@33
|
958 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
959 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
960
|
andrew@33
|
961 while (noteArrayIndex < recordedNoteOnMatrix.size()-1 && tickLocation > recordedNoteOnMatrix[noteArrayIndex][0] )
|
andrew@33
|
962 noteArrayIndex++;
|
andrew@33
|
963
|
andrew@33
|
964
|
andrew@33
|
965 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < recordedNoteOnMatrix[noteArrayIndex][0])
|
andrew@33
|
966 noteArrayIndex--;
|
andrew@33
|
967
|
andrew@33
|
968 //need to start where we currently are in file
|
andrew@33
|
969 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
970 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
971
|
andrew@33
|
972 while (maxNoteIndexToPrint < recordedNoteOnMatrix.size() && recordedNoteOnMatrix[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
973 maxNoteIndexToPrint++;
|
andrew@33
|
974
|
andrew@33
|
975 while (minNoteIndexToPrint > 0 && recordedNoteOnMatrix[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
976 minNoteIndexToPrint--;
|
andrew@33
|
977
|
andrew@33
|
978 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)recordedNoteOnMatrix.size());tmpIndex++){
|
andrew@33
|
979
|
andrew@33
|
980 ofSetColor(255,255,255);
|
andrew@33
|
981 if (checkIfMatchedNote(tmpIndex))
|
andrew@33
|
982 ofSetColor(100,100,100);//0,0,255);
|
andrew@33
|
983 else if(noteOnMatches[tmpIndex]){
|
andrew@33
|
984 ofSetColor(255,0,255);//dark grey
|
andrew@33
|
985 }
|
andrew@33
|
986 else{
|
andrew@33
|
987 ofSetColor(255,255,255);//255,255,255);
|
andrew@33
|
988 }
|
andrew@33
|
989
|
andrew@33
|
990 //ofSetColor(255,255,255);
|
andrew@33
|
991 if (tmpIndex == bestMatchIndex)
|
andrew@33
|
992 ofSetColor(255,0,0);//best recent match is in red
|
andrew@33
|
993
|
andrew@33
|
994 // XXX replace ofgetwidth below
|
andrew@33
|
995 //if (tmpIndex >= 0 && tmpIndex < size)
|
andrew@33
|
996 int xLocation = (float)(recordedNoteOnMatrix[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
997 int duration = (float)(recordedNoteOnMatrix[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
998
|
andrew@33
|
999
|
andrew@33
|
1000 int yLocation = (*screenHeight) - ((recordedNoteOnMatrix[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1001 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
1002
|
andrew@33
|
1003 }
|
andrew@33
|
1004
|
andrew@33
|
1005
|
andrew@33
|
1006 int xLocation;// = getLocationFromTicks(tickLocation);
|
andrew@33
|
1007 // ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1008
|
andrew@33
|
1009 //orange line at best estimate
|
andrew@33
|
1010 xLocation = getLocationFromMillis(bayesStruct.bestEstimate);
|
andrew@34
|
1011 ofSetColor(250,250,20);//250,100,0);
|
andrew@33
|
1012 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1013
|
andrew@34
|
1014 xLocation = getLocationFromMillis(smoothPlayPosition);//bayesStruct.tmpBestEstimate
|
andrew@34
|
1015 ofSetColor(0,250,0);//250,150, 250,100,0);
|
andrew@48
|
1016 // ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@48
|
1017
|
andrew@48
|
1018 xLocation = getLocationFromMillis(causalPlayPosition);//bayesStruct.tmpBestEstimate
|
andrew@48
|
1019 ofSetColor(0,250,0);//250,150, 250,100,0);
|
andrew@33
|
1020 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1021
|
andrew@33
|
1022 //lines where matching window start and end are
|
andrew@33
|
1023 ofSetColor(0);//0,100,255);
|
andrew@33
|
1024 xLocation = getLocationFromMillis(windowStartTime);
|
andrew@33
|
1025 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1026 xLocation = getLocationFromMillis(windowStartTime+matchWindowWidth);
|
andrew@33
|
1027 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1028
|
andrew@33
|
1029
|
andrew@33
|
1030 int maxSize = recordedNoteOnMatrix[size-1][0];
|
andrew@33
|
1031
|
andrew@33
|
1032 int tmpIndex = 0;
|
andrew@33
|
1033 while (tmpIndex < measureVector.size() && measureVector[tmpIndex] < (numberOfScreensIn+1)*ticksPerScreen){
|
andrew@33
|
1034 int measureLocation = measureVector[tmpIndex];
|
andrew@33
|
1035 int xLocation = (float)(measureLocation - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
1036 ofSetColor(155,155,0);
|
andrew@33
|
1037 ofLine(xLocation, 0, xLocation, (*screenHeight));
|
andrew@33
|
1038 tmpIndex++;
|
andrew@33
|
1039 }
|
andrew@33
|
1040
|
andrew@33
|
1041
|
andrew@33
|
1042 // ofDrawBitmapString(tempoSpeedString, 20, 20);
|
andrew@33
|
1043 /* string indexString = "num screens in "+ofToString(numberOfScreensIn)+"; min index to print "+ofToString(minNoteIndexToPrint)+", max index to print "+ofToString(maxNoteIndexToPrint);
|
andrew@33
|
1044 indexString += " size "+ofToString(size)+" tick loc "+ofToString(tickLocation)+" max size "+ofToString(maxSize);
|
andrew@33
|
1045 ofDrawBitmapString(indexString, 20, 40);
|
andrew@33
|
1046 */
|
andrew@33
|
1047 }
|
andrew@33
|
1048
|
andrew@33
|
1049 //ofDrawBitmapString(ofToString(timeOffsetForScreen, 1), 20,20);
|
andrew@46
|
1050 ofSetColor(255,255,255);
|
andrew@46
|
1051 ofDrawBitmapString(timeString, 20, 60);
|
andrew@49
|
1052 ofDrawBitmapString("diff "+ofToString(smoothDifference), 20, 140);
|
andrew@33
|
1053
|
andrew@33
|
1054 //last played piutch
|
andrew@33
|
1055 ofSetColor(0,200,0,50);
|
andrew@33
|
1056 int yLocation = (*screenHeight) - ((lastPlayedPitch - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1057 ofRect(0,yLocation, 100, noteHeight);
|
andrew@33
|
1058
|
andrew@33
|
1059
|
andrew@33
|
1060
|
andrew@33
|
1061 }
|
andrew@33
|
1062
|
andrew@33
|
1063
|
andrew@33
|
1064
|
andrew@33
|
1065 void midiEventHolder::drawMidiFile(IntMatrix& midiFileToDraw){
|
andrew@33
|
1066
|
andrew@33
|
1067 //using this to draw the live input
|
andrew@33
|
1068
|
andrew@33
|
1069 //draws midi file on scrolling screen
|
andrew@33
|
1070 int size = midiFileToDraw.size();
|
andrew@33
|
1071 if (size > 0){
|
andrew@33
|
1072
|
andrew@33
|
1073 numberOfScreensIn = floor(bayesStruct.bestEstimate / getEventTimeMillis(ticksPerScreen));//rpounds down on no screens in
|
andrew@33
|
1074
|
andrew@33
|
1075 // numberOfScreensIn = tickLocation / ticksPerScreen;//rounds down
|
andrew@33
|
1076 timeOffsetForScreen = getEventTimeMillis(numberOfScreensIn * ticksPerScreen);
|
andrew@33
|
1077
|
andrew@33
|
1078 while (noteArrayIndex < midiFileToDraw.size()-1 && tickLocation > midiFileToDraw[noteArrayIndex][0] )
|
andrew@33
|
1079 noteArrayIndex++;
|
andrew@33
|
1080
|
andrew@33
|
1081
|
andrew@33
|
1082 while (noteArrayIndex > 0 && noteArrayIndex < size && tickLocation < midiFileToDraw[noteArrayIndex][0])
|
andrew@33
|
1083 noteArrayIndex--;
|
andrew@33
|
1084
|
andrew@33
|
1085 //need to start where we currently are in file
|
andrew@33
|
1086 int maxNoteIndexToPrint = noteArrayIndex;
|
andrew@33
|
1087 int minNoteIndexToPrint = min(size-1,noteArrayIndex);//not needed as changed above
|
andrew@33
|
1088
|
andrew@33
|
1089 while (maxNoteIndexToPrint < midiFileToDraw.size() && midiFileToDraw[maxNoteIndexToPrint][0] < (numberOfScreensIn+1)*ticksPerScreen )
|
andrew@33
|
1090 maxNoteIndexToPrint++;
|
andrew@33
|
1091
|
andrew@33
|
1092 while (minNoteIndexToPrint > 0 && midiFileToDraw[minNoteIndexToPrint][0] > numberOfScreensIn*ticksPerScreen)//&& minNoteIndexToPrint < size
|
andrew@33
|
1093 minNoteIndexToPrint--;
|
andrew@33
|
1094
|
andrew@33
|
1095 for (int tmpIndex = max(0,minNoteIndexToPrint);tmpIndex < min(maxNoteIndexToPrint, (int)midiFileToDraw.size());tmpIndex++){
|
andrew@33
|
1096
|
andrew@33
|
1097 ofSetColor(0,0,255, 200);
|
andrew@33
|
1098
|
andrew@33
|
1099 int xLocation = (float)(midiFileToDraw[tmpIndex][0] - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen;
|
andrew@33
|
1100 int duration = (float)(midiFileToDraw[tmpIndex][3]*(*screenWidth))/(float)ticksPerScreen;
|
andrew@33
|
1101
|
andrew@33
|
1102
|
andrew@33
|
1103 int yLocation = (*screenHeight) - ((midiFileToDraw[tmpIndex][1] - noteMinimum )*(*screenHeight)/ (float)(noteMaximum - noteMinimum));
|
andrew@33
|
1104 ofRect(xLocation,yLocation, duration, noteHeight);
|
andrew@33
|
1105
|
andrew@33
|
1106 }
|
andrew@33
|
1107
|
andrew@33
|
1108
|
andrew@33
|
1109
|
andrew@33
|
1110 }
|
andrew@33
|
1111
|
andrew@33
|
1112
|
andrew@33
|
1113
|
andrew@33
|
1114 }
|
andrew@33
|
1115
|
andrew@33
|
1116
|
andrew@33
|
1117
|
andrew@33
|
1118 void midiEventHolder::drawFile(){
|
andrew@33
|
1119 drawMidiFile();
|
andrew@33
|
1120
|
andrew@34
|
1121 ofSetColor(0,0,255);
|
andrew@34
|
1122 ofDrawBitmapString("period"+ofToString(period, 2), ofGetWidth() - 180, 20);
|
andrew@33
|
1123
|
andrew@33
|
1124 // bayesStruct.drawArrays();
|
andrew@33
|
1125
|
andrew@33
|
1126 // ofSetColor(200,200,0);
|
andrew@33
|
1127 // bayesStruct.prior.drawConstrainedVector(0, bayesStruct.prior.arraySize, 400, 800);
|
andrew@33
|
1128
|
andrew@33
|
1129 //need to draw arrays within correct timescope
|
andrew@33
|
1130 if (drawPhaseMode)
|
andrew@33
|
1131 bayesStruct.drawArraysRelativeToTimeframe(timeOffsetForScreen, timeOffsetForScreen + getEventTimeMillis(ticksPerScreen));
|
andrew@33
|
1132
|
andrew@33
|
1133 if (drawTempoMode)
|
andrew@40
|
1134 bayesStruct.drawTempoArrays();
|
andrew@33
|
1135
|
andrew@33
|
1136
|
andrew@33
|
1137 ofSetColor(0, 0, 0);
|
andrew@33
|
1138 //ofDrawBitmapString(matchString, 20, ofGetHeight() - 20);
|
andrew@33
|
1139
|
andrew@33
|
1140 double confidence = bayesStruct.posterior.getValueAtMillis(mouseX);
|
andrew@33
|
1141 /*
|
andrew@33
|
1142 string mouseString = "mouseX "+ofToString(confidence, 3)+" .";
|
andrew@33
|
1143 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1144
|
andrew@33
|
1145 string mouseString = "updateCounter "+ofToString(bayesStruct.updateCounter);
|
andrew@33
|
1146 ofDrawBitmapString(mouseString, 20 , ofGetHeight() - 40);
|
andrew@33
|
1147
|
andrew@33
|
1148 string infostring = "speed "+ofToString(bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate), 3);
|
andrew@33
|
1149 ofDrawBitmapString(infostring, 20 , ofGetHeight() - 60);
|
andrew@33
|
1150 */
|
andrew@33
|
1151
|
andrew@33
|
1152 //drawInterNoteIntervals();
|
andrew@33
|
1153
|
andrew@33
|
1154 }
|
andrew@33
|
1155
|
andrew@33
|
1156 void midiEventHolder::drawInterNoteIntervals(){
|
andrew@33
|
1157
|
andrew@33
|
1158 ofSetColor(0,0,150);
|
andrew@33
|
1159 int size = interNoteIntervals.size();
|
andrew@33
|
1160 int numberToShow = min(100, size);
|
andrew@33
|
1161 double x ;
|
andrew@33
|
1162 for (int y = 1;y < numberToShow;y++){
|
andrew@33
|
1163 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1164 double interval = interNoteIntervals[size - y][point];
|
andrew@33
|
1165 x = interval - 200;
|
andrew@33
|
1166 x *= (*screenWidth) / 200.0;
|
andrew@33
|
1167 }
|
andrew@33
|
1168 double h = (double)(y * (*screenHeight)) / numberToShow;
|
andrew@33
|
1169 ofCircle(x, h, 5);
|
andrew@33
|
1170 }
|
andrew@33
|
1171
|
andrew@33
|
1172 }
|
andrew@33
|
1173
|
andrew@33
|
1174
|
andrew@33
|
1175 void midiEventHolder::printInterNoteIntervals(){
|
andrew@33
|
1176
|
andrew@33
|
1177 int size = interNoteIntervals.size();
|
andrew@33
|
1178 int numberToShow = 20;
|
andrew@33
|
1179 double x ;
|
andrew@33
|
1180 for (int y = max(0, size - numberToShow);y < interNoteIntervals.size();y++){
|
andrew@33
|
1181 for (int point = 0;point < interNoteIntervals[y].size();point++){
|
andrew@33
|
1182 printf("[%i][%i] : %f", y, point, interNoteIntervals[y][point]);
|
andrew@33
|
1183 }
|
andrew@33
|
1184 printf("\n");
|
andrew@33
|
1185 }
|
andrew@33
|
1186
|
andrew@33
|
1187 }
|
andrew@33
|
1188
|
andrew@46
|
1189 //int midiEventHolder::getLocationFromTicks(double tickPosition){
|
andrew@46
|
1190 // return 0;
|
andrew@34
|
1191 // return (int)((float)(tickPosition - numberOfScreensIn*ticksPerScreen)*(*screenWidth)/(float)ticksPerScreen);
|
andrew@34
|
1192 //not used
|
andrew@46
|
1193 //}
|
andrew@33
|
1194
|
andrew@33
|
1195 int midiEventHolder::getLocationFromMillis(double millisPosition){
|
andrew@33
|
1196 //(getEventTimeTicks(windowStartTime+matchWindowWidth) - numberOfScreensIn*ticksPerScreen)*(*screenWidth) / (double)ticksPerScreen
|
andrew@33
|
1197 return (millisPosition - timeOffsetForScreen)*(*screenWidth)/getEventTimeMillis(ticksPerScreen);
|
andrew@33
|
1198 }
|
andrew@33
|
1199
|
andrew@46
|
1200 /*
|
andrew@33
|
1201 void midiEventHolder::exampleCrossUpdate(){
|
andrew@33
|
1202
|
andrew@33
|
1203 bayesStruct.crossUpdateArrays(bayesStruct.posterior, bayesStruct.relativeSpeedPosterior, 200);
|
andrew@33
|
1204
|
andrew@33
|
1205 }
|
andrew@46
|
1206 */
|
andrew@33
|
1207
|
andrew@33
|
1208 void midiEventHolder::setStartPlayingTimes(){
|
andrew@34
|
1209 startPlayingTime = getTimeNow(0);//ofGetElapsedTimeMillis();
|
andrew@34
|
1210 //startTime = startPlayingTime;
|
andrew@42
|
1211 printf("starting playing at time %f\n", startPlayingTime);
|
andrew@33
|
1212 /*
|
andrew@33
|
1213 bayesStruct.lastEventTime = 0;//ofGetElapsedTimeMillis();
|
andrew@33
|
1214 bayesStruct.bestEstimate = 0;
|
andrew@33
|
1215 bayesStruct.resetArrays();
|
andrew@33
|
1216 bayesStruct.lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@33
|
1217 */
|
andrew@33
|
1218 bayesStruct.setStartPlaying();
|
andrew@33
|
1219 matchString = "";
|
andrew@33
|
1220 }
|
andrew@33
|
1221
|
andrew@33
|
1222
|
andrew@33
|
1223 void midiEventHolder::printMatchMatrix(){
|
andrew@33
|
1224 printf("match matrix:\n");
|
andrew@33
|
1225 for (int i = 0;i < matchMatrix.size();i++){
|
andrew@33
|
1226 for (int k = 0;k < matchMatrix[i].size();k++){
|
andrew@33
|
1227 printf("%i , ", matchMatrix[i][k]);
|
andrew@33
|
1228 }
|
andrew@33
|
1229 printf("\n");
|
andrew@33
|
1230 }
|
andrew@33
|
1231
|
andrew@33
|
1232 }
|
andrew@33
|
1233
|
andrew@33
|
1234
|
andrew@33
|
1235
|
andrew@33
|
1236 void midiEventHolder::printRecordedEvents(){
|
andrew@33
|
1237 printf("Recorded Events:\n");
|
andrew@33
|
1238 for (int i = 0;i < recordedNoteOnMatrix.size();i++){
|
andrew@33
|
1239 for (int k = 0;k < recordedNoteOnMatrix[i].size();k++){
|
andrew@33
|
1240 printf("[%i] = %i ,", i, recordedNoteOnMatrix[i][k]);
|
andrew@33
|
1241 }
|
andrew@33
|
1242 if (i < recordedEventTimes.size())
|
andrew@33
|
1243 printf("time %f \n", recordedEventTimes[i]);
|
andrew@33
|
1244 else
|
andrew@33
|
1245 printf("\n");
|
andrew@33
|
1246 }
|
andrew@33
|
1247
|
andrew@33
|
1248 }
|
andrew@33
|
1249
|
andrew@33
|
1250
|
andrew@33
|
1251
|
andrew@33
|
1252 void midiEventHolder::reorderMatrixFromNoteTimes(IntMatrix& noteOnMatrix){
|
andrew@33
|
1253 double currentTime = -19999.;
|
andrew@33
|
1254 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1255 int nextIndex = getIndexOfMinimumAboveTime(currentTime, noteOnMatrix);
|
andrew@33
|
1256 // cout << "index of min time " << currentTime << " is " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << endl;
|
andrew@33
|
1257
|
andrew@33
|
1258 if (nextIndex >= 0 && nextIndex > i && noteOnMatrix[nextIndex][0] < noteOnMatrix[i][0] ){
|
andrew@33
|
1259 //which it should be
|
andrew@33
|
1260 // cout << " index " << nextIndex << " at time " << noteOnMatrix[nextIndex][0] << " swaps with inex " << i << " at time " << noteOnMatrix[i][0] << endl;
|
andrew@33
|
1261 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1262 // double tmp = beatPositions[i];
|
andrew@35
|
1263 // beatPositions[i] = beatPositions[nextIndex];
|
andrew@35
|
1264 // = tmp;
|
andrew@35
|
1265
|
andrew@35
|
1266 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1267
|
andrew@35
|
1268
|
andrew@33
|
1269 currentTime = noteOnMatrix[i][0];
|
andrew@33
|
1270 }
|
andrew@33
|
1271
|
andrew@33
|
1272 }
|
andrew@33
|
1273 //printRecordedEvents();
|
andrew@33
|
1274
|
andrew@33
|
1275 }
|
andrew@33
|
1276
|
andrew@33
|
1277
|
andrew@33
|
1278
|
andrew@33
|
1279
|
andrew@33
|
1280 void midiEventHolder::doublecheckOrder(IntMatrix& noteOnMatrix){
|
andrew@33
|
1281
|
andrew@33
|
1282 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1283 int nextIndex = getIndexOfMinimumAboveIndex(i, noteOnMatrix);
|
andrew@33
|
1284 if (nextIndex > i){
|
andrew@33
|
1285 noteOnMatrix[i].swap(noteOnMatrix[nextIndex]);
|
andrew@35
|
1286 swap (beatPositions[i], beatPositions[nextIndex]);
|
andrew@35
|
1287
|
andrew@33
|
1288 }
|
andrew@33
|
1289 }
|
andrew@33
|
1290 }
|
andrew@33
|
1291
|
andrew@33
|
1292 int midiEventHolder::getIndexOfMinimumAboveIndex(const int& index, IntMatrix& noteOnMatrix){
|
andrew@33
|
1293 int returnIndex = index;
|
andrew@33
|
1294 int min = noteOnMatrix[index][0];
|
andrew@33
|
1295 for (int i = index;i < noteOnMatrix.size();i++){
|
andrew@33
|
1296 if (noteOnMatrix[i][0] < min){
|
andrew@33
|
1297 returnIndex = i;
|
andrew@33
|
1298 min = noteOnMatrix[i][0];
|
andrew@33
|
1299 }
|
andrew@33
|
1300 }
|
andrew@33
|
1301 return returnIndex;
|
andrew@33
|
1302 }
|
andrew@33
|
1303
|
andrew@33
|
1304
|
andrew@33
|
1305 int midiEventHolder::getIndexOfMinimumAboveTime(const double& time, IntMatrix& noteOnMatrix){
|
andrew@33
|
1306 int index = 0;
|
andrew@33
|
1307 double minimumTime = 100000000.;
|
andrew@33
|
1308 int bestIndex = -1;
|
andrew@33
|
1309 while (index < noteOnMatrix.size()){
|
andrew@33
|
1310
|
andrew@33
|
1311 if (noteOnMatrix[index][0] > time && noteOnMatrix[index][0] < minimumTime){
|
andrew@33
|
1312 bestIndex = index;
|
andrew@33
|
1313 minimumTime = noteOnMatrix[index][0];
|
andrew@33
|
1314 }
|
andrew@33
|
1315 index++;
|
andrew@33
|
1316 }
|
andrew@33
|
1317 return bestIndex;
|
andrew@33
|
1318 }
|
andrew@33
|
1319
|
andrew@33
|
1320
|
andrew@33
|
1321
|
andrew@33
|
1322
|
andrew@33
|
1323 void midiEventHolder::correctTiming(IntMatrix& noteOnMatrix){
|
andrew@33
|
1324
|
andrew@33
|
1325 if (noteOnMatrix.size() > 0 && noteOnMatrix[0][0] < 0) {
|
andrew@33
|
1326 int offset = noteOnMatrix[0][0];
|
andrew@33
|
1327 for (int i = 0;i < noteOnMatrix.size();i++){
|
andrew@33
|
1328 noteOnMatrix[i][0] -= offset;
|
andrew@33
|
1329 }
|
andrew@33
|
1330 }
|
andrew@33
|
1331
|
andrew@33
|
1332 }
|
andrew@33
|
1333
|
andrew@33
|
1334
|
andrew@33
|
1335 void midiEventHolder::printNoteCounter(){
|
andrew@33
|
1336 for (int i = 0;i < recordedTotalNoteCounterByPitch.size();i++){
|
andrew@33
|
1337 printf("RECORDED TOTAL[%i] := %i", i, recordedTotalNoteCounterByPitch[i]);
|
andrew@33
|
1338 }
|
andrew@34
|
1339 }
|
andrew@34
|
1340
|
andrew@34
|
1341 /* double timeDiff = 0;//timeDifference;
|
andrew@34
|
1342 if (runningInRealTime)
|
andrew@34
|
1343 timeDiff = ofGetElapsedTimeMillis() - lastSmoothUpdateTime;
|
andrew@34
|
1344 // bayesStruct.lastBestEstimateUpdateTime;
|
andrew@34
|
1345
|
andrew@34
|
1346 //smoothPlayPosition = bayesStruct.bestEstimate + 100;
|
andrew@34
|
1347 //relativeSpeedForSmooth = 0.1;
|
andrew@34
|
1348 //bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate);
|
andrew@34
|
1349 // speedEstimate*2;
|
andrew@34
|
1350
|
andrew@34
|
1351 smoothPlayPosition = storedSmoothPlayPosition + timeDiff * relativeSpeedForSmooth;// * bayesStruct.speedEstimate;
|
andrew@34
|
1352 storedSmoothPlayPosition = smoothPlayPosition;
|
andrew@34
|
1353 lastSmoothUpdateTime = getTimeNow(bayesStruct.lastBestEstimateUpdateTime);
|
andrew@34
|
1354 updateSmoothPlaySpeed();
|
andrew@34
|
1355 //bayesStruct.posterior.getIndexInRealTerms(bayesStruct.posterior.MAPestimate)
|
andrew@34
|
1356
|
andrew@34
|
1357 }
|
andrew@34
|
1358
|
andrew@34
|
1359 void midiEventHolder::updateSmoothPlaySpeed(){
|
andrew@34
|
1360 //project where current play pos will be in two seconds and aim for it.
|
andrew@34
|
1361 double timeToAimForMillis = 2000.0;
|
andrew@34
|
1362 //double timeDiff = ofGetElapsedTimeMillis() - bayesStruct.lastBestEstimateUpdateTime;//since the update need to get to where we are
|
andrew@34
|
1363 double projection = bayesStruct.bestEstimate + bayesStruct.speedEstimate*timeToAimForMillis;//
|
andrew@34
|
1364 double timeDifferenceFromSmooth = projection - smoothPlayPosition;
|
andrew@34
|
1365 relativeSpeedForSmooth = timeDifferenceFromSmooth / timeToAimForMillis;
|
andrew@34
|
1366
|
andrew@34
|
1367 }
|
andrew@34
|
1368 */
|
andrew@35
|
1369
|
andrew@35
|
1370
|
andrew@35
|
1371 /*
|
andrew@35
|
1372 void midiEventHolder::findLocalTempoPairsWeightedForConfidence(){
|
andrew@35
|
1373 bool needToUpdate = false;
|
andrew@35
|
1374
|
andrew@35
|
1375 //adapted this to just use the best match for each note
|
andrew@35
|
1376
|
andrew@35
|
1377 int currentPlayedIndex = playedNoteOnMatrix.size()-1;
|
andrew@35
|
1378 // printf("played %i : %i, vel %i\n", currentPlayedIndex, playedNoteOnMatrix[currentPlayedIndex][0], playedNoteOnMatrix[currentPlayedIndex][1]);
|
andrew@35
|
1379 // printMatchesFound();
|
andrew@35
|
1380 // printMatchMatrix();
|
andrew@35
|
1381 // printf("possible notes \n");
|
andrew@35
|
1382
|
andrew@35
|
1383 bayesStruct.setLikelihoodToConstant();
|
andrew@35
|
1384
|
andrew@35
|
1385 for (int i = 0;i < matchMatrix[currentPlayedIndex][0];i++){
|
andrew@35
|
1386
|
andrew@35
|
1387 //iterate through the recently matched events - even dodgy matches included
|
andrew@35
|
1388 //size, index of match0, index of match1, ....
|
andrew@35
|
1389 int recordedCurrentIndex = matchMatrix[currentPlayedIndex][i+1];
|
andrew@35
|
1390
|
andrew@35
|
1391 double currentMatchConfidence = matchConfidence[currentPlayedIndex][i+1];//new confidence
|
andrew@35
|
1392
|
andrew@35
|
1393 int previousIndex = currentPlayedIndex-1;
|
andrew@35
|
1394
|
andrew@35
|
1395 while (previousIndex >= 0 && playedEventTimes[previousIndex] + speedWindowWidthMillis > playedEventTimes[currentPlayedIndex]) {
|
andrew@35
|
1396 double playedTimeDifference = playedEventTimes[currentPlayedIndex] - playedEventTimes[previousIndex];
|
andrew@35
|
1397
|
andrew@35
|
1398 // for (int k = 0;k < matchMatrix[previousIndex][0];k++)
|
andrew@35
|
1399 int recordedPreviousIndex = bestMatchFound[previousIndex];//matchMatrix[previousIndex][k+1];
|
andrew@35
|
1400
|
andrew@35
|
1401 //double previousMatchConfidence = matchConfidence[previousIndex][k+1];
|
andrew@35
|
1402
|
andrew@35
|
1403
|
andrew@35
|
1404 double recordedTimeDifference = recordedEventTimes[recordedCurrentIndex] - recordedEventTimes[recordedPreviousIndex];
|
andrew@35
|
1405
|
andrew@35
|
1406
|
andrew@35
|
1407 //we want the speed of the recording relative to that of the playing live
|
andrew@35
|
1408
|
andrew@35
|
1409 double speedRatio = recordedTimeDifference / playedTimeDifference;
|
andrew@35
|
1410 if (speedRatio <= maximumMatchSpeed && speedRatio >= minimumMatchSpeed){
|
andrew@35
|
1411
|
andrew@35
|
1412 printf("(%i)", matchMatrix[currentPlayedIndex][i+1]);
|
andrew@35
|
1413 printf("[%i] :: ", recordedPreviousIndex);
|
andrew@35
|
1414 // printf(" conf %f & %f ", currentMatchConfidence, previousMatchConfidence);
|
andrew@35
|
1415 printf(" rec{%f} vs play(%f) ", recordedTimeDifference, playedTimeDifference);
|
andrew@35
|
1416 printf("update on speed ratio %f\n", speedRatio);
|
andrew@35
|
1417
|
andrew@35
|
1418 // matchString += " speed: "+ofToString(speedRatio, 3);
|
andrew@35
|
1419 // commented for debug
|
andrew@35
|
1420
|
andrew@35
|
1421
|
andrew@35
|
1422 double priorWeighting = 1;
|
andrew@35
|
1423
|
andrew@35
|
1424 if (useTempoPrior)
|
andrew@35
|
1425 priorWeighting = sin(speedRatio * PI/2);//adding in a prior that prefers 1.0 speed
|
andrew@35
|
1426
|
andrew@35
|
1427
|
andrew@35
|
1428 // double weighting = previousMatchConfidence * currentMatchConfidence ;
|
andrew@35
|
1429 double amount = (1-bayesStruct.speedLikelihoodNoise)*priorWeighting/10;
|
andrew@35
|
1430 bayesStruct.updateTempoLikelihood(speedRatio, amount);//second paramter is confidence in the match
|
andrew@35
|
1431 tempoSpeedString += ofToString(recordedPreviousIndex) + " " + ofToString(speedRatio, 2) + " "+ofToString(amount, 2) += " \n";
|
andrew@35
|
1432
|
andrew@35
|
1433 needToUpdate = true;
|
andrew@35
|
1434 }
|
andrew@35
|
1435 // printf("\n");
|
andrew@35
|
1436
|
andrew@35
|
1437
|
andrew@35
|
1438 previousIndex--;
|
andrew@35
|
1439 }//end while previousindex countdown
|
andrew@35
|
1440 }//end for loop through possible current matches
|
andrew@35
|
1441
|
andrew@35
|
1442 if (needToUpdate)
|
andrew@35
|
1443 bayesStruct.updateTempoDistribution();
|
andrew@35
|
1444 //printf("current speed is %f\n", bayesStruct.relativeSpeedPosterior.getIndexInRealTerms(bayesStruct.relativeSpeedPosterior.MAPestimate));
|
andrew@35
|
1445 }
|
andrew@35
|
1446 */
|
andrew@35
|
1447
|
andrew@42
|
1448 /*
|
andrew@42
|
1449 JUNK SMOOTH StuffHex
|
andrew@42
|
1450 /*
|
andrew@42
|
1451 int testIndex = smoothIndex;
|
andrew@42
|
1452 while (testIndex >= 0 && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1453
|
andrew@42
|
1454 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1455 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1456 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1457 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1458 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1459 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1460 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1461 }
|
andrew@42
|
1462 }
|
andrew@42
|
1463 testIndex--;
|
andrew@42
|
1464 }
|
andrew@42
|
1465
|
andrew@42
|
1466 testIndex = smoothIndex;
|
andrew@42
|
1467 while (testIndex >= 0 && testIndex < myNotation.rwcAnnotations.size() && abs(smoothLocation - myNotation.rwcAnnotations[testIndex].beatLocation) < range){
|
andrew@42
|
1468
|
andrew@42
|
1469 if (myNotation.rwcAnnotations[testIndex].midiNote == currentNote){
|
andrew@42
|
1470 if (abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation) < currentLocationDifference){
|
andrew@42
|
1471 currentLocationDifference = abs(myNotation.rwcAnnotations[testIndex].beatLocation - smoothLocation);
|
andrew@42
|
1472 difference = playingTime - (myNotation.rwcAnnotations[testIndex].eventTime*1000.0);
|
andrew@42
|
1473 annotationNote = myNotation.rwcAnnotations[testIndex].midiNote;
|
andrew@42
|
1474 annotationLocation = myNotation.rwcAnnotations[testIndex].beatLocation;
|
andrew@42
|
1475 annotationTime = myNotation.rwcAnnotations[testIndex].eventTime;
|
andrew@42
|
1476 }
|
andrew@42
|
1477 }
|
andrew@42
|
1478 testIndex++;
|
andrew@42
|
1479 }
|
andrew@42
|
1480 */
|