annotate src/DynamicVector.cpp @ 52:13194a9dca77 tip

Added exporting of image and text data
author Andrew N Robertson <andrew.robertson@eecs.qmul.ac.uk>
date Tue, 17 Jul 2012 22:13:10 +0100
parents 032edf186a68
children
rev   line source
andrew@0 1 /*
andrew@0 2 * DynamicVector.cpp
andrew@0 3 * midiCannamReader
andrew@0 4 *
andrew@0 5 * Created by Andrew on 18/07/2011.
andrew@0 6 * Copyright 2011 QMUL. All rights reserved.
andrew@0 7 *
andrew@0 8 */
andrew@0 9
andrew@2 10
andrew@0 11 #include "DynamicVector.h"
andrew@0 12
andrew@0 13 DynamicVector::DynamicVector(){
andrew@0 14 length = 0;
andrew@0 15 arraySize = 0;
andrew@0 16 maximumValue = 0;
andrew@0 17 MAPestimate = 0;
andrew@0 18 offset = 0;
andrew@0 19 scalar = 1;
andrew@9 20 integratedEstimate = length/2;
andrew@4 21
andrew@4 22 gaussianLookupMean = (double) GAUSSIAN_LOOKUP_LENGTH/2;
andrew@4 23 gaussianLookupStdDev = (double)(GAUSSIAN_LOOKUP_LENGTH/16);
andrew@4 24 double factor = 1.0;//(1.0 / (gaussianLookupStdDev*sqrt(2*PI)) );//1.0;//-1.0/(2*PI*sqrt(gaussianLookupStdDev));
andrew@4 25 for (int i = 0;i < GAUSSIAN_LOOKUP_LENGTH;i++){
andrew@4 26 gaussianLookupTable[i] = factor*exp(-1.0*(i-gaussianLookupMean)*(i-gaussianLookupMean)/(2.0*gaussianLookupStdDev*gaussianLookupStdDev));
andrew@4 27 }
andrew@4 28
andrew@0 29 }
andrew@0 30
andrew@0 31 void DynamicVector::copyFromDynamicVector(const DynamicVector& dynamicVec){
andrew@0 32 if (dynamicVec.length == length){
andrew@0 33 for (int i = 0;i < length;i++)
andrew@0 34 array[i] = dynamicVec.array[i];
andrew@0 35 }
andrew@0 36 else{
andrew@0 37 printf("CANNOT COPY VECTORS OF NON SAME LENGTH!!\n");
andrew@0 38 }
andrew@0 39 }
andrew@0 40
andrew@0 41 void DynamicVector::createVector(int len){
andrew@0 42 array.clear();
andrew@0 43 for (int i = 0; i < len;i++){
andrew@0 44 array.push_back(0);
andrew@0 45 }
andrew@0 46 length = len;
andrew@0 47 arraySize = array.size();
andrew@9 48 integratedEstimate = length/2;
andrew@0 49 }
andrew@0 50
andrew@0 51
andrew@0 52 double DynamicVector::getMaximum(){
andrew@0 53 int i;
andrew@0 54 double max = 0;
andrew@0 55 for (i=0;i < length;i++){
andrew@0 56 if (array[i] > max){
andrew@0 57 max = array[i];
andrew@0 58 MAPestimate = i;
andrew@0 59 }
andrew@0 60 }
andrew@0 61 maximumValue = max;
andrew@0 62 return max;
andrew@0 63 }
andrew@0 64
andrew@2 65 double DynamicVector::getIntegratedEstimate(){
andrew@2 66 //returns the index of the integrated average - where the probability distribution is centred
andrew@9 67 integratedEstimate = 0;
andrew@2 68 double integratedTotal = 0;
andrew@2 69 for (int i = 0;i < length;i++){
andrew@9 70 integratedEstimate += array[i]*i;
andrew@2 71 integratedTotal += array[i];
andrew@2 72 }
andrew@2 73 if (integratedTotal > 0){
andrew@9 74 integratedEstimate /= integratedTotal;
andrew@2 75 }
andrew@9 76 return integratedEstimate;
andrew@2 77 }
andrew@2 78
andrew@9 79 void DynamicVector::updateIntegratedEstimate(){
andrew@9 80 //returns the index of the integrated average - where the probability distribution is centred
andrew@9 81 integratedEstimate = 0;
andrew@9 82 double integratedTotal = 0;
andrew@9 83 for (int i = 0;i < length;i++){
andrew@9 84 integratedEstimate += array[i]*i;
andrew@9 85 integratedTotal += array[i];
andrew@9 86 }
andrew@9 87 if (integratedTotal > 0){
andrew@9 88 integratedEstimate /= integratedTotal;
andrew@9 89 }
andrew@9 90
andrew@9 91 }
andrew@9 92
andrew@9 93
andrew@0 94 void DynamicVector::zero(){
andrew@0 95 for (int i = 0;i < array.size();i++)
andrew@0 96 array[i] = 0;
andrew@0 97 }
andrew@0 98
andrew@0 99 void DynamicVector::renormalise(){
andrew@0 100 double tmpMax = getMaximum();
andrew@0 101 if (tmpMax > 0){
andrew@0 102 // printf("renormalise : max is %f and size is %i\n", tmpMax, arraySize);
andrew@0 103 for (int i = 0;i < array.size();i++)
andrew@0 104 array[i] /= tmpMax;
andrew@0 105
andrew@0 106 }
andrew@0 107 //printArray();
andrew@0 108 }
andrew@0 109
andrew@0 110 void DynamicVector::doProduct(DynamicVector& arrayOne, DynamicVector& arrayTwo){
andrew@0 111
andrew@0 112 for (int i = 0;i < arrayOne.length;i++)
andrew@0 113 array[i] = arrayOne.array[i] * arrayTwo.array[i];
andrew@0 114 }
andrew@0 115
andrew@0 116
andrew@0 117 void DynamicVector::printArray(){
andrew@0 118 for (int i = 0;i < arraySize;i++){
andrew@0 119 printf("[%i] = %f\n", i, array[i]);
andrew@0 120 }
andrew@0 121 }
andrew@0 122
andrew@0 123 void DynamicVector::translateDistribution(int translationIndex){
andrew@0 124 int tmpIndex;
andrew@0 125 DoubleVector tmpArray;
andrew@0 126 int i;
andrew@0 127
andrew@0 128 for (i=0;i < arraySize;i++){
andrew@0 129 tmpArray.push_back(array[i]);
andrew@0 130 }
andrew@0 131 //translate values
andrew@0 132 for (i=0;i < arraySize;i++){
andrew@0 133 tmpIndex = (i + translationIndex + arraySize)%arraySize;
andrew@0 134 array[tmpIndex] = tmpArray[i];
andrew@0 135 }
andrew@0 136 tmpArray.clear();
andrew@0 137 //now delete tmp array
andrew@0 138 }
andrew@0 139
andrew@22 140 void DynamicVector::addGaussianShape(const double& mean, const double& StdDev, double factor){
andrew@4 141
andrew@0 142 int i;
andrew@9 143 double std_dev_factor = (2*StdDev*StdDev);
andrew@2 144 factor *= (1/(StdDev*sqrt(2*PI)));
andrew@9 145 int maxVal = min((int) array.size(), (int)(mean + 4.8*StdDev));
andrew@9 146 int minVal = max(0, (int)(mean - 4.8*StdDev));
andrew@9 147
andrew@9 148 for (i=minVal;i < maxVal;i++){
andrew@9 149 array[i] += factor*exp(-1*(i-mean)*(i-mean)/(std_dev_factor));
andrew@0 150 }
andrew@4 151
andrew@9 152 // addGaussianShapeByLookupTable(mean, StdDev, factor);
andrew@4 153 }
andrew@4 154
andrew@22 155 void DynamicVector::addGaussianShapeByLookupTable(double& mean, double& StdDev, double factor){
andrew@4 156 int i;
andrew@4 157 int lookupIndex ;
andrew@4 158 factor *= (1/(StdDev*sqrt(2*PI)));
andrew@4 159 for (i=0;i<array.size()-1;i++){
andrew@4 160 lookupIndex = round(getLookupIndex(i, mean, StdDev));
andrew@4 161 array[i] += factor*gaussianLookupTable[lookupIndex];
andrew@4 162 }
andrew@0 163 //printf("ADDED GAUSSIAN SHAPE %i\n", (int)array.size());
andrew@0 164 }
andrew@0 165
andrew@4 166 double DynamicVector::getLookupIndex(const int& i, const double& mean, const double& StdDev){
andrew@4 167
andrew@4 168 double Z = ((double)i - mean)/StdDev;
andrew@4 169 double lookupIndex = Z*gaussianLookupStdDev + gaussianLookupMean;
andrew@4 170
andrew@4 171 if (lookupIndex < 0)
andrew@4 172 lookupIndex = 0;
andrew@4 173
andrew@4 174 if (lookupIndex >= GAUSSIAN_LOOKUP_LENGTH)
andrew@4 175 lookupIndex = GAUSSIAN_LOOKUP_LENGTH-1;
andrew@4 176
andrew@4 177 // (i - mean)*(i-mean)*(GAUSSIAN_LOOKUP_LENGTH*GAUSSIAN_LOOKUP_LENGTH/16.0)/(StdDev*StdDev);
andrew@4 178 return lookupIndex;
andrew@4 179 }
andrew@4 180
andrew@2 181 void DynamicVector::addTriangularShape(double mean, double width, double factor){
andrew@2 182 int i;
andrew@2 183
andrew@2 184 for (i= max(0., (double)(mean - width));i < min((mean+width), (double)array.size());i++){
andrew@2 185 array[i] += factor * abs(i - mean) / mean;
andrew@2 186 }
andrew@2 187
andrew@2 188 }
andrew@2 189
andrew@22 190 void DynamicVector::addConstant(const double& value){
andrew@0 191 for (int i=0;i<array.size();i++){
andrew@0 192 array[i] += value;
andrew@0 193 }
andrew@0 194 }
andrew@0 195
andrew@0 196
andrew@22 197 void DynamicVector::addToIndex(const int& index, const double& constant){
andrew@0 198 array[index] += constant;
andrew@0 199 }
andrew@0 200
andrew@0 201
andrew@0 202 double DynamicVector::getIndexInRealTerms(const int& index){
andrew@0 203 if (index < arraySize)
andrew@0 204 return (offset + scalar*index);
andrew@0 205 else
andrew@0 206 return 0;
andrew@0 207 }
andrew@0 208
andrew@0 209 double DynamicVector::getRealTermsAsIndex(double value){
andrew@0 210 value -= offset;
andrew@0 211 value /= scalar;
andrew@0 212
andrew@0 213 return value;
andrew@0 214
andrew@0 215 }
andrew@0 216
andrew@1 217 double DynamicVector::getValueAtMillis(const double& millis){
andrew@1 218
andrew@1 219 int index = round(getRealTermsAsIndex(millis));
andrew@1 220 if (index >= 0 && index < length)
andrew@1 221 return array[index];
andrew@1 222 else
andrew@1 223 return 0;
andrew@1 224 }
andrew@1 225
andrew@0 226 void DynamicVector::drawVector(const int& minIndex, const int& maxIndex){
andrew@0 227
andrew@0 228
andrew@0 229 double stepSize = ofGetWidth() / (double)(maxIndex - minIndex);
andrew@9 230 double screenHeight = (double) ofGetHeight();
andrew@0 231 double maxVal = getMaximum();
andrew@9 232
andrew@4 233 int startInt = max(1,minIndex+1);
andrew@4 234 int endInt = min(maxIndex, (int)array.size());
andrew@4 235 double heightConstant = screenHeight / maxVal;
andrew@23 236 int lastHeightPixel = heightConstant * (maxVal - array[startInt-1]);
andrew@4 237 int newHeightPixel;
andrew@4 238 for (int i = startInt;i < endInt;i++){
andrew@23 239 newHeightPixel = (int) heightConstant * (maxVal - array[i]);
andrew@4 240 ofLine (stepSize*(i-1), lastHeightPixel, stepSize*i, newHeightPixel);
andrew@4 241 lastHeightPixel = newHeightPixel;
andrew@0 242 }
andrew@0 243
andrew@0 244 }
andrew@0 245
andrew@0 246
andrew@0 247 void DynamicVector::drawConstrainedVector(const int& minIndex, const int& maxIndex, const int& minScreenIndex, const int& maxScreenIndex){
andrew@0 248 //constrain the height and width
andrew@0 249
andrew@0 250 double stepSize = (maxScreenIndex - minScreenIndex) / (double)(maxIndex - minIndex);//step size in pixels per array bin
andrew@0 251 double screenHeight = ofGetHeight();
andrew@0 252 double maxVal = getMaximum();
andrew@0 253
andrew@0 254 //OPTIMIZE!! XXX could just add stepsize each time
andrew@0 255 //not add minindex each time
andrew@0 256 int i = max(1,minIndex+1);
andrew@0 257 // ofDrawBitmapString("i = "+ofToString(i)+" :: screen min: "+ofToString(minScreenIndex + stepSize*(i-minIndex-1)), 20, 640);
andrew@0 258
andrew@0 259 while ((minScreenIndex + stepSize*(i-minIndex)) < 0)
andrew@0 260 i++;//only draw what is on the screen
andrew@0 261
andrew@0 262 for ( ; i < min(maxIndex+1, (int)array.size());i++){
andrew@0 263 ofLine (minScreenIndex + (stepSize*(i-minIndex-1)), screenHeight * (1 - array[i-1] / maxVal),
andrew@0 264 minScreenIndex + (stepSize*(i-minIndex)), screenHeight * (1 - array[i] / maxVal) );
andrew@0 265
andrew@0 266 }
andrew@0 267
andrew@0 268 ofLine(minScreenIndex, screenHeight, minScreenIndex, screenHeight/2);
andrew@0 269 ofLine(maxScreenIndex, screenHeight, maxScreenIndex, screenHeight/2);
andrew@0 270
andrew@0 271 // ofDrawBitmapString(ofToString(stepSize, 2)+" "+ofToString(maxScreenIndex - minScreenIndex, 0), 20, 600);
andrew@0 272
andrew@0 273 }