1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
/************************************************************************/
/* */
/* Centre for Speech Technology Research */
/* University of Edinburgh, UK */
/* Copyright (c) 1996,1997 */
/* All Rights Reserved. */
/* */
/* Permission to use, copy, modify, distribute this software and its */
/* documentation for research, educational and individual use only, is */
/* hereby granted without fee, subject to the following conditions: */
/* 1. The code must retain the above copyright notice, this list of */
/* conditions and the following disclaimer. */
/* 2. Any modifications must be clearly marked as such. */
/* 3. Original authors' names are not deleted. */
/* This software may not be used for commercial purposes without */
/* specific prior written permission from the authors. */
/* */
/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
/* THIS SOFTWARE. */
/* */
/************************************************************************/
/* Author: Richard Caley (rjc@cstr.ed.ac.uk) */
/* Date: Tue May 27 1997 */
/************************************************************************/
/************************************************************************/
/* */
/* temporary place fro some new functions. */
/* */
/************************************************************************/
#include <math.h>
#include <stdlib.h>
#include "EST_Wave.h"
#include "EST_wave_aux.h"
#include "EST_simplestats.h"
#include "EST_cutils.h"
EST_Wave difference(EST_Wave &a, EST_Wave &b)
{
int i, j;
int size = Lof(a.num_samples(), b.num_samples());
EST_Wave diff = a;
// ERROR REORG - this needs to return a proper error
if (a.num_channels() != b.num_channels())
{
cerr << "Error: Can't compare " << a.num_channels() <<
" channel EST_Wave with " << b.num_channels() << " channel EST_Wave\n";
return diff;
}
for (i = 0; i < size; ++i)
for (j = 0; j < a.num_channels(); ++j)
diff.a(i, j) = a.a(i, j) - b.a(i, j);
return diff;
}
void meansd(EST_Wave &tr, float &mean, float &sd, int channel)
{
float var=0.0;
int i, n;
for (n = 0, i = 0, mean = 0.0; i < tr.num_samples(); ++i)
{
mean += tr.a(i, channel);
++n;
}
mean /= n;
for (i = 0, mean = 0.0; i < tr.num_samples(); ++i)
var += pow(tr.a(i, channel) - mean, 2.0);
var /= n;
sd = sqrt(var);
}
float rms_error(EST_Wave &a, EST_Wave &b, int channel)
{
int i;
int size = Lof(a.num_samples(), b.num_samples());
float sum = 0;
for (i = 0; i < size; ++i)
sum += pow((a.a(i, channel) - b.a(i, channel)), 2.0);
sum = sqrt(sum / size);
return sum;
}
float abs_error(EST_Wave &a, EST_Wave &b, int channel)
{
int i;
int size = Lof(a.num_samples(), b.num_samples());
float sum = 0;
for (i = 0; i < size; ++i)
{
// cout << i << " " << a.a(i, channel) << " " << b.a(i, channel) << endl;
sum += fabs(a.a(i, channel) - b.a(i, channel));
}
return sum / size;
}
float correlation(EST_Wave &a, EST_Wave &b, int channel)
{
int i;
int size = Lof(a.num_samples(), b.num_samples());
float predict,real;
EST_SuffStats x,y,xx,yy,xy,se,e;
float cor,error;
for (i = 0; i < size; ++i)
{
// cout << a.a(i, channel) << " " << b.a(i, channel) << endl;
predict = b.a(i, channel);
real = a.a(i, channel);
x += predict;
y += real;
error = predict-real;
se += error*error;
e += fabs(error);
xx += predict*predict;
yy += real*real;
xy += predict*real;
}
cor = (xy.mean() - (x.mean()*y.mean()))/
(sqrt(xx.mean()-(x.mean()*x.mean())) *
sqrt(yy.mean()-(y.mean()*y.mean())));
// cout << xy.mean() << " " << x.mean() << " " << y.mean() << " " << xx.mean() << " " << yy.mean() << endl;
// cout << "RMSE " << sqrt(se.mean()) << " Correlation is " << cor << " Mean (abs) Error " << e.mean() << " (" << e.stddev() << ")" << endl;
return cor;
}
void absolute(EST_Wave &wave)
{
int i, j;
for (i = 0; i < wave.num_samples(); ++i)
for (j = 0; j < wave.num_channels(); ++j)
wave.a(i, j) = abs(wave.a(i, j));
}
EST_FVector rms_error(EST_Wave &a, EST_Wave &b)
{
int i;
EST_FVector e;
// ERROR REORG - this needs to return a proper error
if (a.num_channels() != b.num_channels())
{
cerr << "Error: Can't compare " << a.num_channels() <<
" channel EST_Wave with " << b.num_channels() << " channel EST_Wave\n";
return e;
}
e.resize(a.num_channels());
for (i = 0; i < a.num_channels(); ++i)
e[i] = rms_error(a, b, i);
return e;
}
EST_FVector abs_error(EST_Wave &a, EST_Wave &b)
{
int i;
EST_FVector e;
// ERROR REORG - this needs to return a proper error
if (a.num_channels() != b.num_channels())
{
cerr << "Error: Can't compare " << a.num_channels() <<
" channel EST_Wave with " << b.num_channels() << " channel EST_Wave\n";
return e;
}
e.resize(a.num_channels());
for (i = 0; i < a.num_channels(); ++i)
e[i] = abs_error(a, b, i);
return e;
}
EST_FVector correlation(EST_Wave &a, EST_Wave &b)
{
int i;
EST_FVector cor;
// ERROR REORG - this needs to return a proper error
if (a.num_channels() != b.num_channels())
{
cerr << "Error: Can't compare " << a.num_channels() <<
" channel EST_Wave with " << b.num_channels() << " channel EST_Wave\n";
return cor;
}
cor.resize(a.num_channels());
for (i = 0; i < a.num_channels(); ++i)
cor[i] = correlation(a, b, i);
return cor;
}
EST_Wave error(EST_Wave &ref, EST_Wave &test, int relax)
{
int i, j, k, l;
EST_Wave diff;
diff = ref;
int t;
// relaxation allows an error to be ignored near boundaries. The
// degree of relation specifies how many samples can be ignored.
int *r = new int[relax*3];
for (l = 0; l < ref.num_channels(); ++l)
for (i = 0; i < ref.num_samples(); ++i)
{
t = 0;
for (k = 0, j = Gof((i - relax), 0); j < i + relax + 1; ++j, ++k)
{
if (ref.a(i, l) > 0.5)
r[k] = ((j < test.num_samples()) && (test.a(j, l)> 0.6)) ?1
: 0;
else
r[k] = ((j < test.num_samples()) && (test.a(j, l)< 0.4)) ?1
: 0;
t |= r[k];
}
diff.a(i, l) = t;
}
delete [] r;
return diff;
}
|
