forked from sccn/mobilab
-
Notifications
You must be signed in to change notification settings - Fork 1
/
my_load_xdf.m
598 lines (559 loc) · 23.6 KB
/
my_load_xdf.m
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
function [streams,fileheader] = my_load_xdf(filename,tmpFolder)
% Import an XDF file.
% [Streams,FileHeader] = load_xdf(Filename)
%
% This is a simple MATLAB importer for mult-stream XDF (Extensible Data Format) recordings. All
% information covered by the XDF 1.0 specification is imported, plus any additional meta-data
% associated with streams or with the container file itself.
%
% See http://code.google.com/p/xdf/ for more information on XDF.
%
% In:
% Filename : name of the file to import (*.xdf or *.xdfz)
%
% Out:
% Streams : cell array of structs, one for each stream; the structs have the following content:
% .time_series field: contains the stream's time series [#Channels x #Samples]
% this matrix is of the type declared in .info.channel_format
% .time_stamps field: contains the time stamps for each sample (synced across streams)
%
% .info field: contains the meta-data of the stream (all values are strings)
% .name: name of the stream
% .type: content-type of the stream ('EEG','Events', ...)
% .channel_format: value format ('int8','int16','int32','int64','float32','double64','string')
% .nominal_srate: nominal sampling rate of the stream (as declared by the device);
% zero for streams with irregular sampling rate
% .effective_srate: effective (measured) sampling rate of the stream, if regular
% (otherwise omitted)
% .desc: struct with any domain-specific meta-data declared for the stream; see
% www.xdf.org for the declared specifications
%
% .segments field: struct array containing segment ranges for regularly sampled
% time series with breaks (not present if the stream is irregular)
% .index_range: 1st and last index of the segment within the .time_series/.time_stamps
% arrays
% .t_begin: time of the 1st sample in the segment, in seconds
% .t_end: time of the last sample in the segment, in seconds
% .duration: duration of the segment, in seconds
% .num_samples: number of samples in the segment
% .effective_srate: effective (i.e. measured) sampling rate within the segment
%
% FileHeader : struct with file header contents in the .info field
%
% Examples:
% % load the streams contained in a given XDF file
% streams = load_xdf('C:\Recordings\myrecording.xdf')
%
% Notes:
% A somewhat higher-quality clock drift post-processing is performed when the Statistics toolbox
% is present.
%
% License:
% This file is covered by the BSD license.
%
% Copyright (c) 2012, Christian Kothe
% Portions Copyright (c) 2010, Wouter Falkena
% All rights reserved.
%
% Redistribution and use in source and binary forms, with or without
% modification, are permitted provided that the following conditions are
% met:
%
% * Redistributions of source code must retain the above copyright
% notice, this list of conditions and the following disclaimer.
% * Redistributions in binary form must reproduce the above copyright
% notice, this list of conditions and the following disclaimer in
% the documentation and/or other materials provided with the distribution
%
% THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
% AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
% IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
% ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
% LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
% CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
% SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
% INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
% CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
% ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
% POSSIBILITY OF SUCH DAMAGE.
%
%
% Christian Kothe, Swartz Center for Computational Neuroscience, UCSD
% 2012-04-22
%
% Contains portions of xml2struct Copyright (c) 2010, Wouter Falkena,
% ASTI, TUDelft, 21-08-2010
%
% version 1.08
if ~exist(filename,'file')
error(['The file "' filename '" does not exist.']); end
if nargin < 2, tmpFolder = tempdir;end
if ~exist(tmpFolder,'dir'), tmpFolder = tempdir;end
% uncompress if necessary
[p,n,x] = fileparts(filename);
if strcmp(x,'.xdfz')
% idea for this type of approach by Michael Kleder
import com.mathworks.mlwidgets.io.InterruptibleStreamCopier
src = java.io.FileInputStream(filename);
flt = java.util.zip.InflaterInputStream(src);
filename = [p filesep n '_temp_uncompressed' x];
dst = java.io.FileOutputStream(filename);
copier = InterruptibleStreamCopier.getInterruptibleStreamCopier;
copier.copyStream(flt,dst);
dst.close();
src.close();
end
% open the file (and make sure that we don't forget to close it)
f = fopen(filename,'r','ieee-le.l64');
closer = onCleanup(@()close_file(f,filename));
streams = {}; % cell array of returned streams (in the order of appearance in the file)
idmap = sparse(2^31-1,1); % remaps stream id's onto indices in streams
temp = struct(); % struct array of temporary per-stream information
fileheader = struct(); % the file header
% check whether we have a working mex file for the inner loop
have_mex = exist('load_xdf_innerloop','file');
if ~have_mex
disp('NOTE: apparently you are missing a compiled binary version of the inner loop code. Using the slow MATLAB code instead.'); end
% === read the file ===
% [MagicCode]
if ~strcmp(fread(f,4,'*char')','XDF:')
error(['This is not a valid XDF file (' filename ').']); end
% for each chunk...
while 1
% [NumLengthBytes], [Length]
len = read_varlen_int(f);
if ~len
break; end
% [Tag]
switch fread(f,1,'uint16')
% [Samples] chunk
case 3
try
% [StreamId]
id = idmap(fread(f,1,'uint32'));
if have_mex
% read the chunk data at once
data = fread(f,len-6,'*uint8');
% run the mex kernel
[values,timestamps] = load_xdf_innerloop(data, temp(id).chns, temp(id).readfmt, temp(id).sampling_interval, temp(id).last_timestamp);
temp(id).last_timestamp = timestamps(end);
else
% [NumSampleBytes], [NumSamples]
num = read_varlen_int(f);
% allocate space
timestamps = zeros(1,num);
if strcmp(temp(id).readfmt,'*string')
values = cell(temp(id).chns,num);
else
values = zeros(temp(id).chns,num);
end
% for each sample...
for s=1:num
% read or deduce time stamp
if fread(f,1,'*uint8')
timestamps(s) = fread(f,1,'double');
else
timestamps(s) = temp(id).last_timestamp + temp(id).sampling_interval;
end
% read the values
if strcmp(temp(id).readfmt,'*string')
for v = 1:size(values,1)
values{v,s} = fread(f,read_varlen_int(f),'*char')'; end
else
values(:,s) = fread(f,size(values,1),temp(id).readfmt);
end
temp(id).last_timestamp = timestamps(s);
end
end
% append to the time series...
%--
if ~isfield(streams{id},'precision'), streams{id}.precision = class(values);end
if ~strcmp(temp(id).readfmt,'*string')
fwrite(streams{id}.fid,values,streams{id}.precision);
temp(id).time_series{1} = nan;
else
temp(id).time_series{end+1} = values;
end
%--
%temp(id).time_series{end+1} = values;
temp(id).time_stamps{end+1} = timestamps;
catch e
% an error occurred (perhaps a chopped-off file): emit a warning
% and return the file up to this point
warning(e.identifier,e.message);
break;
end
% [StreamHeader] chunk
case 2
% [StreamId]
streamid = fread(f,1,'uint32');
id = length(streams)+1;
idmap(streamid) = id;
% [Content]
header = parse_xml_struct(fread(f,len-6,'*char')');
streams{id} = header;
% generate a few temporary fields
temp(id).chns = str2num(header.info.channel_count);
temp(id).srate = str2num(header.info.nominal_srate);
temp(id).last_timestamp = 0;
temp(id).time_series = {};
temp(id).time_stamps = {};
temp(id).clock_times = [];
temp(id).clock_values = [];
if temp(id).srate > 0
temp(id).sampling_interval = 1/temp(id).srate;
else
temp(id).sampling_interval = 0;
end
% fread parsing format for data values
temp(id).readfmt = ['*' header.info.channel_format];
if strcmp(temp(id).readfmt,'*double64')
temp(id).readfmt = 'double'; end
%--
[~,streams{id}.tmpfile] = fileparts(tempname);
streams{id}.tmpfile = [tmpFolder filesep streams{id}.tmpfile];
streams{id}.fid = fopen(streams{id}.tmpfile,'w');
%--
% [StreamFooter] chunk
case 6
% [StreamId]
id = idmap(fread(f,1,'uint32'));
% [Content]
footer = parse_xml_struct(fread(f,len-6,'*char')');
streams{id} = hlp_superimposedata(footer,streams{id});
% [FileHeader] chunk
case 1
fileheader = parse_xml_struct(fread(f,len-2,'*char')');
% [ClockOffset] chunk
case 4
% [StreamId]
id = idmap(fread(f,1,'uint32'));
% [CollectionTime]
temp(id).clock_times(end+1) = fread(f,1,'double');
% [OffsetValue]
temp(id).clock_values(end+1) = fread(f,1,'double');
otherwise
% skip other chunks (Boundary, ...)
fread(f,len-2,'*uint8');
end
end
for it=1:length(streams), try fclose(streams{id}.fid);end;end %#ok
% === do some advanced post-processing on the result ===
for k=1:length(temp)
% concatenate the signal
%--
if iscell(temp(k).time_series), temp(k).time_series = [temp(k).time_series{:}];end
%--
temp(k).time_stamps = [temp(k).time_stamps{:}];
if ~isempty(temp(k).time_stamps) && ~isempty(temp(k).time_series)
try
clock_times = temp(k).clock_times;
clock_values = temp(k).clock_values;
% calculate clock offset mapping
try
mapping = robustfit(clock_times,clock_values);
catch %#ok<CTCH>
try
mapping = regress(clock_values',[ones(length(clock_times),1) clock_times']);
catch %#ok<CTCH>
mapping = clock_values / [ones(1,length(clock_times)); clock_times];
end
end
% apply offset correction
temp(k).time_stamps = temp(k).time_stamps + (mapping(1) + mapping(2)*temp(k).time_stamps);
catch %#ok<CTCH>
disp(['No clock offsets were available for stream "' streams{k}.info.name '"']);
end
% do some fix-ups if the time series is regularly sampled
if temp(k).srate
segment_threshold = [1,500]; % time that has to pass without data from a regularly sampled
% stream to assume that the stream is fragmented into segments
% (breaks shorter than this will be assumed to be time-stamping
% glitches) in seconds and in samples (both thresholds have to
% be exceeded)
% check for segment breaks
breaks_at = diff(temp(k).time_stamps) > max(segment_threshold(1),segment_threshold(2)*temp(k).sampling_interval);
if any(breaks_at)
% turn the break mask into a cell array of [begin,end] index ranges
tmp = find(breaks_at)';
tmp = [tmp tmp+1]';
tmp = [1 tmp(:)' length(breaks_at)];
ranges = num2cell(reshape(tmp,2,[])',2);
else
ranges = {[1,length(temp(k).time_stamps)]};
end
% calculate some meta-data about the segments
segments = repmat(struct(),1,length(ranges));
for r=1:length(ranges)
range = ranges{r};
segments(r).num_samples = range(2)-range(1)+1;
segments(r).index_range = range;
% re-calculate the time stamps within the range (linearly interpolated)
if segments(r).num_samples > 0
indices = segments(r).index_range(1):segments(r).index_range(2);
stamps = temp(k).time_stamps(indices);
freeMemory = java.lang.management.ManagementFactory.getOperatingSystemMXBean().getFreePhysicalMemorySize();
neededMemory = whos('stamps');
if freeMemory > 4*neededMemory.bytes
mapping = stamps / [ones(1,length(indices)); indices];
else
mapping = stamps(1:4:end) / [ones(1,length(stamps(1:4:end))); indices(1:4:end)];
end
temp(k).time_stamps(indices) = mapping(1) + mapping(2) * indices;
end
segments(r).t_begin = temp(k).time_stamps(range(1));
segments(r).t_end = temp(k).time_stamps(range(2));
segments(r).duration = segments(r).t_end - segments(r).t_begin;
segments(r).effective_srate = segments(r).num_samples / segments(r).duration;
end
% calculate the weighted mean sampling rate over all segments
temp(k).effective_rate = sum(bsxfun(@times,[segments.effective_srate],[segments.num_samples]/sum([segments.num_samples])));
% transfer the information into the output structs
streams{k}.info.effective_srate = temp(k).effective_rate;
streams{k}.segments = segments;
end
end
streams{k}.time_series = temp(k).time_series;
streams{k}.time_stamps = temp(k).time_stamps;
end
clear temp
rmThis = false(length(streams),1);
for it=1:length(streams)
if isempty(streams{it}.time_series)
rmThis(it) = true;
if isfield(streams{it},'tmpfile'), try delete(streams{it}.tmpfile);end;end %#ok
end;
end
streams(rmThis) = [];
end
% read a variable-length integer
function num = read_varlen_int(f)
try
switch fread(f,1,'*uint8')
case 1
num = fread(f,1,'*uint8');
case 4
num = fread(f,1,'*uint32');
case 8
num = fread(f,1,'*uint64');
otherwise
error('Invalid variable-length integer encountered.');
end
catch
num = 0;
end
end
% close the file and delete temporary data
function close_file(f,filename)
fclose(f);
if strfind(filename,'_temp_uncompressed.xdf')
delete(filename); end
end
% --- helper functions ---
% parse a simplified (attribute-free) subset of XML into a MATLAB struct
function result = parse_xml_struct(str)
import org.xml.sax.InputSource
import javax.xml.parsers.*
import java.io.*
tmp = InputSource();
tmp.setCharacterStream(StringReader(str));
result = parseChildNodes(xmlread(tmp));
% this is part of xml2struct (slightly simplified)
function [children,ptext] = parseChildNodes(theNode)
% Recurse over node children.
children = struct;
ptext = [];
if theNode.hasChildNodes
childNodes = theNode.getChildNodes;
numChildNodes = childNodes.getLength;
for count = 1:numChildNodes
theChild = childNodes.item(count-1);
[text,name,childs] = getNodeData(theChild);
if (~strcmp(name,'#text') && ~strcmp(name,'#comment'))
if (isfield(children,name))
if (~iscell(children.(name)))
children.(name) = {children.(name)}; end
index = length(children.(name))+1;
children.(name){index} = childs;
if(~isempty(text))
children.(name){index} = text; end
else
children.(name) = childs;
if(~isempty(text))
children.(name) = text; end
end
elseif (strcmp(name,'#text'))
if (~isempty(regexprep(text,'[\s]*','')))
if (isempty(ptext))
ptext = text;
else
ptext = [ptext text];
end
end
end
end
end
end
% this is part of xml2struct (slightly simplified)
function [text,name,childs] = getNodeData(theNode)
% Create structure of node info.
name = char(theNode.getNodeName);
if ~isvarname(name)
name = regexprep(name,'[-]','_dash_');
name = regexprep(name,'[:]','_colon_');
name = regexprep(name,'[.]','_dot_');
end
[childs,text] = parseChildNodes(theNode);
if (isempty(fieldnames(childs)))
try
text = char(theNode.getData);
catch
end
end
end
end
function res = hlp_superimposedata(varargin)
% Merge multiple partially populated data structures into one fully populated one.
% Result = hlp_superimposedata(Data1, Data2, Data3, ...)
%
% The function is applicable when you have cell arrays or structs/struct arrays with non-overlapping
% patterns of non-empty entries, where all entries should be merged into a single data structure
% which retains their original positions. If entries exist in multiple data structures at the same
% location, entries of later items will be ignored (i.e. earlier data structures take precedence).
%
% In:
% DataK : a data structure that should be super-imposed with the others to form a single data
% structure
%
% Out:
% Result : the resulting data structure
%
% Christian Kothe, Swartz Center for Computational Neuroscience, UCSD
% 2011-08-19
% first, compactify the data by removing the empty items
compact = varargin(~cellfun('isempty',varargin));
% start with the last data structure, then merge the remaining data structures into it (in reverse
% order as this avoids having to grow arrays incrementally in typical cases)
res = compact{end};
for k=length(compact)-1:-1:1
res = merge(res,compact{k}); end
end
% merge data structures A and B
function A = merge(A,B)
if iscell(A) && iscell(B)
% make sure that both have the same number of dimensions
if ndims(A) > ndims(B)
B = grow_cell(B,size(A));
elseif ndims(A) < ndims(B)
A = grow_cell(A,size(B));
end
% make sure that both have the same size
if all(size(B)==size(A))
% we're fine
elseif all(size(B)>=size(A))
% A is a minor of B: grow A
A = grow_cell(A,size(B));
elseif all(size(A)>=size(B))
% B is a minor of A: grow B
B = grow_cell(B,size(A));
else
% A and B have mixed sizes... grow both as necessary
M = max(size(A),size(B));
A = grow_cell(A,M);
B = grow_cell(B,M);
end
% find all non-empty elements in B
idx = find(~cellfun(@(x)isequal(x,[]),B));
if ~isempty(idx)
% check if any of these is occupied in A
clean = cellfun('isempty',A(idx));
if ~all(clean)
% merge all conflicting items recursively
conflicts = idx(~clean);
for k=conflicts(:)'
A{k} = merge(A{k},B{k}); end
% and transfer the rest
if any(clean)
A(idx(clean)) = B(idx(clean)); end
else
% transfer all to A
A(idx) = B(idx);
end
end
elseif isstruct(A) && isstruct(B)
% first make sure that both have the same fields
fnA = fieldnames(A);
fnB = fieldnames(B);
if isequal(fnA,fnB)
% we're fine
elseif isequal(sort(fnA),sort(fnB))
% order doesn't match -- impose A's order on B
B = orderfields(B,fnA);
elseif isempty(setdiff(fnA,fnB))
% B has a superset of A's fields: add the remaining fields to A, and order them according to B
remaining = setdiff(fnB,fnA);
for fn = remaining'
A(1).(fn{1}) = []; end
A = orderfields(A,fnB);
elseif isempty(setdiff(fnB,fnA))
% A has a superset of B's fields: add the remaining fields to B, and order them according to A
remaining = setdiff(fnA,fnB);
for fn = remaining'
B(1).(fn{1}) = []; end
B = orderfields(B,fnA);
else
% A and B have incommensurable fields; add B's fields to A's fields, add A's fields to B's
% and order according to A's fields
remainingB = setdiff(fnB,fnA);
for fn = remainingB'
A(1).(fn{1}) = []; end
remainingA = setdiff(fnA,fnB);
for fn = remainingA'
B(1).(fn{1}) = []; end
B = orderfields(B,A);
end
% that being established, convert them to cell arrays, merge their cell arrays, and convert back to structs
merged = merge(struct2cell(A),struct2cell(B));
A = cell2struct(merged,fieldnames(A),1);
elseif isstruct(A) && ~isstruct(B)
if ~isempty(B)
error('One of the sub-items is a struct, and the other one is of a non-struct type.');
else
% we retain A
end
elseif isstruct(B) && ~isstruct(A)
if ~isempty(A)
error('One of the sub-items is a struct, and the other one is of a non-struct type.');
else
% we retain B
A = B;
end
elseif iscell(A) && ~iscell(B)
if ~isempty(B)
error('One of the sub-items is a cell array, and the other one is of a non-cell type.');
else
% we retain A
end
elseif iscell(B) && ~iscell(A)
if ~isempty(A)
error('One of the sub-items is a cell array, and the other one is of a non-cell type.');
else
% we retain B
A = B;
end
elseif isempty(A) && ~isempty(B)
% we retain B
A = B;
elseif isempty(B) && ~isempty(A)
% we retain A
elseif ~isequal(A,B)
% we retain A and warn about dropping B
disp('Two non-empty (and non-identical) sub-elements occupied the same index; one was dropped. This warning will only be displayed once.');
end
end
% grow a cell array to accomodate a particular index
% (assuming that this index is not contained in the cell array yet)
function C = grow_cell(C,idx)
tmp = sprintf('%i,',idx);
eval(['C{' tmp(1:end-1) '} = [];']);
end