andrew@0
|
1 /*
|
andrew@0
|
2 * BayesianArrayStructure.cpp
|
andrew@0
|
3 * midiCannamReader
|
andrew@0
|
4 *
|
andrew@0
|
5 * Created by Andrew on 17/07/2011.
|
andrew@0
|
6 * Copyright 2011 QMUL. All rights reserved.
|
andrew@0
|
7 *
|
andrew@0
|
8 */
|
andrew@0
|
9
|
andrew@3
|
10 //look at reset speed to one - what does this do? - get rid of?
|
andrew@3
|
11
|
andrew@3
|
12
|
andrew@0
|
13 #include "BayesianArrayStructure.h"
|
andrew@0
|
14
|
andrew@0
|
15 BayesianArrayStructure::BayesianArrayStructure(){
|
andrew@0
|
16 printf("Bayesian structure: DeFault constructor called");
|
andrew@0
|
17
|
andrew@0
|
18 prior.createVector(1);
|
andrew@0
|
19 likelihood.createVector(1);
|
andrew@0
|
20 posterior.createVector(1);
|
andrew@0
|
21
|
andrew@3
|
22 speedPriorValue = 1.0;
|
andrew@3
|
23
|
andrew@0
|
24 lastEventTime = ofGetElapsedTimeMillis();
|
andrew@0
|
25
|
andrew@2
|
26 /*
|
andrew@2
|
27 tmpPrior.createVector(240);
|
andrew@2
|
28 tmpPrior.addGaussianShape(100, 40, 1);
|
andrew@2
|
29 tmpPrior.addGaussianShape(200, 10, 0.2);
|
andrew@2
|
30 tmpPrior.translateDistribution(20);
|
andrew@2
|
31 */
|
andrew@2
|
32 tmpBestEstimate = 0;
|
andrew@0
|
33 }
|
andrew@0
|
34
|
andrew@0
|
35 BayesianArrayStructure::BayesianArrayStructure(int length){
|
andrew@0
|
36 printf("BAYESIAN STURTUCRE CREATED LENGTH: %i\n", length);
|
andrew@0
|
37 //this constructor isnt called it seems
|
andrew@0
|
38 prior.createVector(length);
|
andrew@0
|
39 likelihood.createVector(length);
|
andrew@0
|
40 posterior.createVector(length);
|
andrew@2
|
41
|
andrew@2
|
42 lastEventTime = 0;
|
andrew@0
|
43
|
andrew@0
|
44 }
|
andrew@0
|
45
|
andrew@0
|
46
|
andrew@0
|
47
|
andrew@0
|
48 void BayesianArrayStructure::resetSize(int length){
|
andrew@0
|
49 printf("BAYESIAN STRUCTURE size is : %i\n", length);
|
andrew@0
|
50
|
andrew@0
|
51 prior.createVector(length);
|
andrew@0
|
52 likelihood.createVector(length);
|
andrew@0
|
53 posterior.createVector(length);
|
andrew@0
|
54
|
andrew@2
|
55
|
andrew@0
|
56 acceleration.createVector(length);
|
andrew@0
|
57
|
andrew@0
|
58 }
|
andrew@0
|
59
|
andrew@0
|
60
|
andrew@0
|
61
|
andrew@0
|
62 void BayesianArrayStructure::resetSpeedToOne(){
|
andrew@0
|
63 relativeSpeedPrior.zero();
|
andrew@0
|
64 relativeSpeedPosterior.zero();
|
andrew@0
|
65 relativeSpeedLikelihood.zero();
|
andrew@0
|
66
|
andrew@2
|
67 //relativeSpeedPosterior.addGaussianShape(40, 5, 0.6);
|
andrew@0
|
68
|
andrew@2
|
69 relativeSpeedPosterior.addGaussianShape(100, 20, 0.8);
|
andrew@2
|
70 // relativeSpeedPosterior.addGaussianShape(50, 1, 0.8);
|
andrew@2
|
71
|
andrew@2
|
72 // relativeSpeedPosterior.addToIndex(100, 1);
|
andrew@2
|
73 //relativeSpeedPosterior.addToIndex(50, 1);
|
andrew@0
|
74 relativeSpeedPosterior.renormalise();
|
andrew@0
|
75 relativeSpeedPosterior.getMaximum();
|
andrew@0
|
76
|
andrew@3
|
77 setSpeedPrior(speedPriorValue);
|
andrew@3
|
78
|
andrew@2
|
79 prior.zero();
|
andrew@2
|
80 posterior.zero();
|
andrew@2
|
81 // posterior.offset = - 200;
|
andrew@2
|
82 // posterior.addGaussianShape(200, 40, 1);
|
andrew@2
|
83 posterior.addToIndex(0, 1);
|
andrew@2
|
84 posterior.renormalise();
|
andrew@2
|
85
|
andrew@2
|
86 //acceleration.addGaussianShape(2000, 20, 0.8);
|
andrew@0
|
87
|
andrew@0
|
88 }
|
andrew@0
|
89
|
andrew@3
|
90 void BayesianArrayStructure::setSpeedPrior(double f){
|
andrew@3
|
91 speedPriorValue = f;
|
andrew@3
|
92 int index = relativeSpeedPosterior.getRealTermsAsIndex(speedPriorValue);
|
andrew@3
|
93 relativeSpeedPosterior.zero();
|
andrew@3
|
94 relativeSpeedPosterior.addGaussianShape(index, 20, 0.8);
|
andrew@3
|
95 relativeSpeedPosterior.renormalise();
|
andrew@3
|
96 relativeSpeedPosterior.getMaximum();
|
andrew@3
|
97 relativeSpeedPrior.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@3
|
98 printf("BAYES STRUCTU ' SPEED PRIOR %f . index %i\n", speedPriorValue, index);
|
andrew@3
|
99
|
andrew@3
|
100 }
|
andrew@3
|
101
|
andrew@0
|
102 void BayesianArrayStructure::resetSpeedSize(int length){
|
andrew@0
|
103 printf("BAYESIAN SPEED size is : %i\n", length);
|
andrew@0
|
104
|
andrew@0
|
105 relativeSpeedPrior.createVector(length);
|
andrew@0
|
106 relativeSpeedLikelihood.createVector(length);
|
andrew@0
|
107 relativeSpeedPosterior.createVector(length);
|
andrew@2
|
108 tmpPosteriorForStorage.createVector(length);
|
andrew@0
|
109
|
andrew@0
|
110
|
andrew@0
|
111 }
|
andrew@2
|
112
|
andrew@0
|
113 void BayesianArrayStructure::setRelativeSpeedScalar(double f){
|
andrew@0
|
114 relativeSpeedPrior.scalar = f;
|
andrew@0
|
115 relativeSpeedPosterior.scalar = f;
|
andrew@0
|
116 relativeSpeedLikelihood.scalar = f;
|
andrew@0
|
117 }
|
andrew@0
|
118
|
andrew@2
|
119
|
andrew@2
|
120 void BayesianArrayStructure::setPositionDistributionScalar(double f){
|
andrew@2
|
121 if (f > 0){
|
andrew@2
|
122 prior.scalar = f;
|
andrew@2
|
123 posterior.scalar = f;
|
andrew@2
|
124 likelihood.scalar = f;
|
andrew@2
|
125 }
|
andrew@2
|
126 }
|
andrew@2
|
127
|
andrew@0
|
128 void BayesianArrayStructure::simpleExample(){
|
andrew@0
|
129 //simple example
|
andrew@0
|
130
|
andrew@2
|
131 // prior.addGaussianShape(50, 10, 1);
|
andrew@2
|
132 // prior.addGaussianShape(150, 30, 0.3);
|
andrew@2
|
133 // prior.addGaussianShape(250, 30, 0.2);
|
andrew@2
|
134
|
andrew@2
|
135 // likelihood.addGaussianShape(90, 20, 0.6);
|
andrew@2
|
136 // likelihood.addConstant(0.02);
|
andrew@2
|
137 // posterior.doProduct(prior, likelihood);
|
andrew@0
|
138
|
andrew@0
|
139 // relativeSpeedPosterior.addToIndex(100, 1);
|
andrew@0
|
140 // relativeSpeedPosterior.addToIndex(40, 0.7);
|
andrew@2
|
141
|
andrew@2
|
142 // relativeSpeedPosterior.addGaussianShape(100, 2, 1);
|
andrew@2
|
143 // relativeSpeedPosterior.addGaussianShape(40, 2, 0.5);
|
andrew@0
|
144 relativeSpeedPosterior.getMaximum();
|
andrew@2
|
145 relativeSpeedPrior.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@0
|
146 }
|
andrew@0
|
147
|
andrew@0
|
148 void BayesianArrayStructure::copyPriorToPosterior(){
|
andrew@0
|
149
|
andrew@0
|
150 for (int i = 0;i < prior.arraySize;i++){
|
andrew@0
|
151 posterior.array[i] = prior.array[i];
|
andrew@0
|
152 }
|
andrew@0
|
153 }
|
andrew@0
|
154
|
andrew@2
|
155 void BayesianArrayStructure::setStartPlaying(){
|
andrew@2
|
156 lastEventTime = 0;//ofGetElapsedTimeMillis();
|
andrew@2
|
157 bestEstimate = 0;
|
andrew@2
|
158 lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@2
|
159
|
andrew@2
|
160 resetArrays();
|
andrew@2
|
161 }
|
andrew@2
|
162
|
andrew@0
|
163 void BayesianArrayStructure::resetArrays(){
|
andrew@2
|
164 //called when we start playing
|
andrew@2
|
165
|
andrew@0
|
166 prior.zero();
|
andrew@0
|
167 likelihood.zero();
|
andrew@2
|
168 posterior.zero();
|
andrew@2
|
169
|
andrew@2
|
170 updateCounter = 0;
|
andrew@2
|
171
|
andrew@2
|
172 posterior.offset = 0;
|
andrew@2
|
173 setNewDistributionOffsets(0);
|
andrew@2
|
174
|
andrew@2
|
175 int zeroIndex = posterior.getRealTermsAsIndex(0);
|
andrew@2
|
176
|
andrew@2
|
177 posterior.addGaussianShape(zeroIndex, 500, 1);
|
andrew@2
|
178 // posterior.addToIndex(0, 1);
|
andrew@0
|
179 likelihood.addConstant(1);
|
andrew@2
|
180
|
andrew@2
|
181 updateCounter = 0;
|
andrew@2
|
182
|
andrew@0
|
183 bestEstimate = 0;
|
andrew@0
|
184 // lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@0
|
185
|
andrew@3
|
186 setSpeedPrior(speedPriorValue);
|
andrew@0
|
187 }
|
andrew@0
|
188
|
andrew@2
|
189 void BayesianArrayStructure::zeroArrays(){
|
andrew@2
|
190 prior.zero();
|
andrew@2
|
191 likelihood.zero();
|
andrew@2
|
192 posterior.zero();
|
andrew@2
|
193
|
andrew@2
|
194 relativeSpeedPrior.zero();
|
andrew@2
|
195 relativeSpeedPosterior.zero();
|
andrew@2
|
196 relativeSpeedLikelihood.zero();
|
andrew@2
|
197
|
andrew@2
|
198 }
|
andrew@2
|
199
|
andrew@2
|
200
|
andrew@2
|
201 void BayesianArrayStructure::updateTmpBestEstimate(const double& timeDifference){
|
andrew@2
|
202 //input is the time since the start of playing
|
andrew@2
|
203
|
andrew@2
|
204 // double timeDiff = ofGetElapsedTimeMillis() - lastEventTime;//lastBestEstimateUpdateTime;
|
andrew@2
|
205
|
andrew@2
|
206 tmpBestEstimate = posterior.getIndexInRealTerms(posterior.MAPestimate) + timeDifference*relativeSpeedPosterior.getIndexInRealTerms(relativeSpeedPosterior.MAPestimate);
|
andrew@2
|
207 //
|
andrew@3
|
208 printf("tmp best %f and best %f time diff %f posterior MAP %f at speed %f\n", tmpBestEstimate, bestEstimate, timeDifference, posterior.getIndexInRealTerms(posterior.MAPestimate), relativeSpeedPosterior.getIndexInRealTerms(relativeSpeedPosterior.MAPestimate));
|
andrew@2
|
209 //lastBestEstimateUpdateTime = ofGetElapsedTimeMillis();
|
andrew@2
|
210 }
|
andrew@2
|
211
|
andrew@0
|
212 void BayesianArrayStructure::updateBestEstimate(){
|
andrew@2
|
213 // double timeDiff = ofGetElapsedTimeMillis() - lastEventTime;//
|
andrew@2
|
214 double timeDiff = ofGetElapsedTimeMillis() - lastBestEstimateUpdateTime;
|
andrew@2
|
215 bestEstimate = posterior.getIndexInRealTerms(posterior.MAPestimate) + timeDiff*relativeSpeedPosterior.getIndexInRealTerms(relativeSpeedPosterior.MAPestimate);
|
andrew@0
|
216
|
andrew@2
|
217 // bestEstimate = tmpBestEstimate;
|
andrew@0
|
218 }
|
andrew@0
|
219
|
andrew@0
|
220 void BayesianArrayStructure::calculatePosterior(){
|
andrew@2
|
221 //posterior.doProduct(prior, likelihood);
|
andrew@2
|
222
|
andrew@2
|
223 int i;
|
andrew@2
|
224 for (i = 0;i < posterior.length;i++){
|
andrew@2
|
225 posterior.array[i] = likelihood.array[i] * prior.array[i];
|
andrew@2
|
226 }
|
andrew@2
|
227
|
andrew@2
|
228
|
andrew@0
|
229 posterior.renormalise();
|
andrew@0
|
230
|
andrew@2
|
231
|
andrew@0
|
232
|
andrew@0
|
233
|
andrew@0
|
234 }
|
andrew@0
|
235
|
andrew@0
|
236
|
andrew@0
|
237
|
andrew@0
|
238
|
andrew@0
|
239 void BayesianArrayStructure::setNewDistributionOffsets(const double& newOffset){
|
andrew@0
|
240 prior.offset = newOffset;
|
andrew@0
|
241 likelihood.offset = newOffset;
|
andrew@2
|
242 //posterior.offset = newOffset;
|
andrew@0
|
243 }
|
andrew@0
|
244
|
andrew@0
|
245
|
andrew@0
|
246 void BayesianArrayStructure::crossUpdateArrays(DynamicVector& position, DynamicVector& speed, double timeDifference){
|
andrew@0
|
247 //set the cutoff for offset of position first! XXX
|
andrew@0
|
248
|
andrew@0
|
249 // printf("time difference %f, ", timeDifference);
|
andrew@0
|
250
|
andrew@0
|
251 double timeDifferenceInPositionVectorUnits = timeDifference / prior.scalar;
|
andrew@0
|
252
|
andrew@0
|
253 prior.zero();//kill prior
|
andrew@0
|
254 calculateNewPriorOffset(timeDifference);//set new prior offset here
|
andrew@0
|
255
|
andrew@0
|
256 for (int i = 0;i < speed.arraySize;i++){
|
andrew@0
|
257 // printf("[%i] %f\n", i, speed.array[i]);
|
andrew@0
|
258 //set speed
|
andrew@0
|
259 double speedValue = speed.getIndexInRealTerms(i);//so for scalar 0.01, 50 -> speed value of 0.5
|
andrew@0
|
260
|
andrew@0
|
261 //so we have moved
|
andrew@0
|
262 int distanceMoved = round(timeDifferenceInPositionVectorUnits * speedValue);//round the value
|
andrew@0
|
263
|
andrew@0
|
264 if (speed.array[i] != 0){
|
andrew@0
|
265
|
andrew@2
|
266 // printf("speed [%i] gives %f moved %i in %f units \n", i, speedValue, distanceMoved, timeDifferenceInPositionVectorUnits);
|
andrew@0
|
267
|
andrew@0
|
268 for (int postIndex = 0;postIndex < position.arraySize;postIndex++){
|
andrew@2
|
269 //old posterior contributing to new prior
|
andrew@0
|
270 int newPriorIndex = postIndex + position.offset - prior.offset + distanceMoved;
|
andrew@0
|
271 if (newPriorIndex >= 0 && newPriorIndex < prior.arraySize){
|
andrew@0
|
272 prior.addToIndex(newPriorIndex, position.array[postIndex]*speed.array[i]);
|
andrew@0
|
273 // printf("adding [%i] : %f\n", newPriorIndex, posterior.array[postIndex]*speed.array[i]);
|
andrew@0
|
274 }
|
andrew@0
|
275
|
andrew@0
|
276 }
|
andrew@0
|
277
|
andrew@0
|
278 }//if not zero
|
andrew@0
|
279 }//end speed
|
andrew@2
|
280 updateCounter++;
|
andrew@0
|
281 prior.renormalise();
|
andrew@0
|
282
|
andrew@0
|
283 }
|
andrew@0
|
284
|
andrew@2
|
285
|
andrew@2
|
286 void BayesianArrayStructure::addGaussianNoiseToSpeedPosterior(const double& std_dev){
|
andrew@2
|
287 tmpPosteriorForStorage.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@2
|
288
|
andrew@2
|
289 for (int i = 0;i < relativeSpeedPosterior.length;i++){
|
andrew@2
|
290 tmpPosteriorForStorage.addGaussianShape(i, std_dev, relativeSpeedPosterior.array[i]);
|
andrew@2
|
291 }
|
andrew@2
|
292
|
andrew@2
|
293 tmpPosteriorForStorage.renormalise();
|
andrew@2
|
294
|
andrew@2
|
295 relativeSpeedPosterior.copyFromDynamicVector(tmpPosteriorForStorage);
|
andrew@2
|
296 }
|
andrew@2
|
297
|
andrew@2
|
298
|
andrew@2
|
299 void BayesianArrayStructure::addTriangularNoiseToSpeedPosterior(const double& std_dev){
|
andrew@2
|
300 tmpPosteriorForStorage.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@2
|
301
|
andrew@2
|
302 for (int i = 0;i < relativeSpeedPosterior.length;i++){
|
andrew@2
|
303 //adding a linear amount depending on distance
|
andrew@2
|
304 tmpPosteriorForStorage.addTriangularShape(i, std_dev*2.0, relativeSpeedPosterior.array[i]);
|
andrew@2
|
305 }
|
andrew@2
|
306
|
andrew@2
|
307 tmpPosteriorForStorage.renormalise();
|
andrew@2
|
308
|
andrew@2
|
309 relativeSpeedPosterior.copyFromDynamicVector(tmpPosteriorForStorage);
|
andrew@2
|
310 }
|
andrew@2
|
311
|
andrew@0
|
312 void BayesianArrayStructure::calculateNewPriorOffset(const double& timeDifference){
|
andrew@0
|
313
|
andrew@0
|
314 double maxSpeed = relativeSpeedPosterior.getIndexInRealTerms(relativeSpeedPosterior.MAPestimate);
|
andrew@0
|
315 // printf("Maxspeed is %f\n", maxSpeed);
|
andrew@0
|
316
|
andrew@0
|
317 double priorMax = posterior.getMaximum();
|
andrew@0
|
318 double distanceTravelled = maxSpeed * (timeDifference / prior.scalar);
|
andrew@0
|
319 double newMaxLocation = posterior.MAPestimate + distanceTravelled;
|
andrew@0
|
320 // printf("MAP: %i, tim df %f, distance %f, new location %f\n", posterior.MAPestimate, timeDifference, distanceTravelled, newMaxLocation);
|
andrew@0
|
321
|
andrew@0
|
322 }
|
andrew@0
|
323
|
andrew@0
|
324
|
andrew@0
|
325 void BayesianArrayStructure::decaySpeedDistribution(double timeDifference){
|
andrew@0
|
326
|
andrew@0
|
327 // commented for the moment
|
andrew@0
|
328 double relativeAmount = max(1.0, timeDifference/1000.);
|
andrew@0
|
329 // printf("decay %f around %i \n", timeDifference, relativeSpeedPosterior.MAPestimate);
|
andrew@0
|
330 relativeAmount *= speedDecayAmount;
|
andrew@0
|
331 relativeSpeedPosterior.renormalise();
|
andrew@0
|
332 relativeSpeedPosterior.addGaussianShape(relativeSpeedPosterior.MAPestimate, speedDecayWidth, relativeAmount);
|
andrew@0
|
333
|
andrew@0
|
334 relativeSpeedPosterior.renormalise();
|
andrew@0
|
335 double newMax = relativeSpeedPosterior.getMaximum();
|
andrew@0
|
336
|
andrew@0
|
337 //old code
|
andrew@0
|
338 // relativeSpeedPosterior.addGaussianShape(relativeSpeedPosterior.MAPestimate, speedDecayWidth, 10);
|
andrew@0
|
339 //relativeSpeedPosterior.addConstant(1);
|
andrew@0
|
340
|
andrew@0
|
341 /*
|
andrew@0
|
342 relativeSpeedPrior.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@0
|
343 relativeSpeedLikelihood.zero();
|
andrew@0
|
344 relativeSpeedLikelihood.addConstant(0.2);
|
andrew@0
|
345 relativeSpeedLikelihood.addGaussianShape(relativeSpeedPosterior.maximumValue, speedDecayWidth, relativeAmount);
|
andrew@0
|
346 relativeSpeedPosterior.doProduct(relativeSpeedPrior, relativeSpeedLikelihood);
|
andrew@0
|
347 relativeSpeedPosterior.renormalise();
|
andrew@0
|
348 */
|
andrew@0
|
349
|
andrew@0
|
350
|
andrew@0
|
351
|
andrew@0
|
352 }
|
andrew@0
|
353
|
andrew@0
|
354 void BayesianArrayStructure::updateTempoDistribution(const double& speedRatio, const double& matchFactor){
|
andrew@0
|
355 //speedratio is speed of played relative to the recording
|
andrew@0
|
356
|
andrew@0
|
357 double index = relativeSpeedLikelihood.getRealTermsAsIndex(speedRatio);
|
andrew@0
|
358 // printf("\nindex of likelihood would be %f\n", index);
|
andrew@0
|
359 if (index >= 0 && index < relativeSpeedPrior.length){
|
andrew@0
|
360 //then we can do update
|
andrew@0
|
361
|
andrew@0
|
362 //set new likelihood
|
andrew@0
|
363 relativeSpeedLikelihood.zero();
|
andrew@2
|
364 relativeSpeedLikelihood.addConstant(speedLikelihoodNoise);
|
andrew@0
|
365
|
andrew@0
|
366 relativeSpeedLikelihood.addGaussianShape(index , 5, 0.5*matchFactor);
|
andrew@0
|
367
|
andrew@0
|
368
|
andrew@0
|
369 //copy posterior to prior
|
andrew@0
|
370 relativeSpeedPrior.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@0
|
371
|
andrew@0
|
372 //update
|
andrew@0
|
373 relativeSpeedPosterior.doProduct(relativeSpeedPrior, relativeSpeedLikelihood);
|
andrew@0
|
374
|
andrew@0
|
375 //normalise
|
andrew@0
|
376 relativeSpeedPosterior.renormalise();
|
andrew@0
|
377
|
andrew@0
|
378 relativeSpeedPosterior.getMaximum();
|
andrew@0
|
379 }//end if within range
|
andrew@0
|
380
|
andrew@0
|
381
|
andrew@0
|
382 }
|
andrew@0
|
383
|
andrew@0
|
384
|
andrew@0
|
385 void BayesianArrayStructure::setFlatTempoLikelihood(){ //set new likelihood
|
andrew@0
|
386 relativeSpeedLikelihood.zero();
|
andrew@0
|
387 relativeSpeedLikelihood.addConstant(0.3);
|
andrew@0
|
388 }
|
andrew@0
|
389
|
andrew@0
|
390 void BayesianArrayStructure::updateTempoLikelihood(const double& speedRatio, const double& matchFactor){
|
andrew@0
|
391
|
andrew@0
|
392 double index = relativeSpeedLikelihood.getRealTermsAsIndex(speedRatio);
|
andrew@0
|
393
|
andrew@0
|
394 if (index >= 0 && index < relativeSpeedPrior.length){
|
andrew@0
|
395 relativeSpeedLikelihood.addGaussianShape(index , 5, 0.5);//*matchFactor);
|
andrew@0
|
396 }
|
andrew@0
|
397 }
|
andrew@0
|
398
|
andrew@0
|
399
|
andrew@0
|
400 void BayesianArrayStructure::calculateTempoUpdate(){
|
andrew@0
|
401 //copy posterior to prior
|
andrew@0
|
402 relativeSpeedPrior.copyFromDynamicVector(relativeSpeedPosterior);
|
andrew@0
|
403
|
andrew@0
|
404 //update
|
andrew@0
|
405 relativeSpeedPosterior.doProduct(relativeSpeedPrior, relativeSpeedLikelihood);
|
andrew@0
|
406
|
andrew@0
|
407 //normalise
|
andrew@0
|
408 relativeSpeedPosterior.renormalise();
|
andrew@0
|
409
|
andrew@0
|
410 relativeSpeedPosterior.getMaximum();
|
andrew@0
|
411
|
andrew@0
|
412 }
|
andrew@0
|
413
|
andrew@0
|
414
|
andrew@0
|
415 void BayesianArrayStructure::drawArrays(){
|
andrew@0
|
416
|
andrew@0
|
417 //bayesArray.drawFloatArray(&bayesArray.prior[0], 0, 200);
|
andrew@0
|
418 //bayesArray.drawFloatArray(&bayesArray.prior[0], 0, 200);
|
andrew@0
|
419
|
andrew@0
|
420 int displaySize = prior.arraySize;
|
andrew@2
|
421 ofSetColor(0,0,255);
|
andrew@0
|
422 prior.drawVector(0, displaySize);
|
andrew@0
|
423 ofSetColor(0,255,0);
|
andrew@0
|
424 likelihood.drawVector(0, displaySize);
|
andrew@2
|
425 ofSetColor(255,0,255);
|
andrew@0
|
426 posterior.drawVector(0, displaySize);
|
andrew@2
|
427
|
andrew@0
|
428
|
andrew@0
|
429 // ofSetColor(255,255,255);
|
andrew@0
|
430 // tmpPrior.drawVector(0,300);
|
andrew@0
|
431
|
andrew@0
|
432 }
|
andrew@0
|
433
|
andrew@0
|
434
|
andrew@0
|
435 void BayesianArrayStructure::drawTempoArrays(){
|
andrew@0
|
436 ofSetColor(0,255,255);
|
andrew@0
|
437 relativeSpeedPrior.drawVector(0, relativeSpeedPrior.arraySize);
|
andrew@0
|
438
|
andrew@0
|
439 ofSetColor(255,0,255);
|
andrew@0
|
440 relativeSpeedLikelihood.drawVector(0, relativeSpeedLikelihood.arraySize);
|
andrew@0
|
441
|
andrew@0
|
442 ofSetColor(255,255,0);
|
andrew@0
|
443 relativeSpeedPosterior.drawVector(0, relativeSpeedPosterior.arraySize);
|
andrew@0
|
444
|
andrew@2
|
445 ofSetColor(0,0,255);
|
andrew@2
|
446 tmpPosteriorForStorage.drawVector(0, tmpPosteriorForStorage.arraySize);
|
andrew@2
|
447
|
andrew@0
|
448 ofSetColor(255,255, 255);
|
andrew@0
|
449 ofLine(screenWidth/2, 0, screenWidth/2, ofGetHeight());//middle of screen
|
andrew@0
|
450
|
andrew@0
|
451 ofSetColor(0, 255, 0);
|
andrew@0
|
452 double fractionOfScreen = ((double)relativeSpeedPosterior.MAPestimate / relativeSpeedPosterior.length);
|
andrew@0
|
453 ofLine(screenWidth * fractionOfScreen, 0, screenWidth * fractionOfScreen, ofGetHeight());
|
andrew@0
|
454 }
|
andrew@0
|
455
|
andrew@0
|
456
|
andrew@0
|
457 void BayesianArrayStructure::drawArraysRelativeToTimeframe(const double& startTimeMillis, const double& endTimeMillis){
|
andrew@0
|
458
|
andrew@0
|
459 screenWidth = ofGetWidth();
|
andrew@0
|
460
|
andrew@0
|
461 int startArrayIndex = 0;
|
andrew@0
|
462
|
andrew@0
|
463 if (prior.getIndexInRealTerms(prior.arraySize-1) > startTimeMillis){
|
andrew@0
|
464 //i.e. the array is on the page
|
andrew@0
|
465
|
andrew@0
|
466 while (prior.getIndexInRealTerms(startArrayIndex) < startTimeMillis){
|
andrew@0
|
467 startArrayIndex++;
|
andrew@0
|
468 }
|
andrew@0
|
469 int endArrayIndex = prior.arraySize-1;
|
andrew@0
|
470 //could find constraints here
|
andrew@0
|
471 if (prior.getIndexInRealTerms(prior.arraySize-1) > endTimeMillis)
|
andrew@0
|
472 endArrayIndex = (floor)((endTimeMillis - prior.offset)/prior.scalar);
|
andrew@0
|
473
|
andrew@0
|
474 //so we need to figure where start and end array are on screen
|
andrew@0
|
475 int startScreenPosition, endScreenPosition;
|
andrew@0
|
476 double screenWidthMillis = endTimeMillis - startTimeMillis;
|
andrew@0
|
477
|
andrew@0
|
478 startScreenPosition = (prior.getIndexInRealTerms(startArrayIndex) - startTimeMillis)*screenWidth/screenWidthMillis;
|
andrew@0
|
479 endScreenPosition = (double)(prior.getIndexInRealTerms(endArrayIndex) - startTimeMillis)*screenWidth/screenWidthMillis;
|
andrew@0
|
480
|
andrew@0
|
481 ofSetColor(0,0,100);
|
andrew@0
|
482 string relativeString = " offset "+ofToString(prior.offset, 1);//starttimes("+ofToString(startTimeMillis)+", "+ofToString(endTimeMillis);
|
andrew@0
|
483 relativeString += ": index "+ofToString(startArrayIndex)+" , "+ofToString(endArrayIndex)+" [";
|
andrew@0
|
484 // relativeString += ofToString(prior.getIndexInRealTerms(endArrayIndex), 3)+"] (sc-width:"+ofToString(screenWidthMillis, 1)+") ";
|
andrew@0
|
485 relativeString += " mapped to screen "+ofToString(startScreenPosition)+" , "+ofToString(endScreenPosition);
|
andrew@0
|
486 ofDrawBitmapString(relativeString, 100, 180);
|
andrew@0
|
487
|
andrew@1
|
488 ofSetColor(255, 255, 0);
|
andrew@0
|
489 likelihood.drawConstrainedVector(startArrayIndex, endArrayIndex, startScreenPosition, endScreenPosition);
|
andrew@0
|
490
|
andrew@0
|
491 ofSetColor(0,0,200);
|
andrew@0
|
492 prior.drawConstrainedVector(startArrayIndex, endArrayIndex, startScreenPosition, endScreenPosition);
|
andrew@0
|
493
|
andrew@0
|
494 ofSetColor(200, 0, 0);
|
andrew@0
|
495 posterior.drawConstrainedVector(startArrayIndex, endArrayIndex, startScreenPosition, endScreenPosition);
|
andrew@0
|
496
|
andrew@1
|
497
|
andrew@0
|
498 // ofSetColor(0, 200, 255);
|
andrew@0
|
499 // acceleration.drawConstrainedVector(startArrayIndex, endArrayIndex, startScreenPosition, endScreenPosition);
|
andrew@0
|
500
|
andrew@0
|
501
|
andrew@0
|
502 }
|
andrew@0
|
503
|
andrew@0
|
504 } |