forked from liangfu/bet2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bet2_mex.cpp
executable file
·947 lines (759 loc) · 28.3 KB
/
bet2_mex.cpp
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
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
/* BET - Brain Extraction Tool
BETv1 Steve Smith
BETv2 Mickael Pechaud, Mark Jenkinson, Steve Smith
FMRIB Image Analysis Group
Copyright (C) 1999-2006 University of Oxford */
/* Part of FSL - FMRIB's Software Library
http://www.fmrib.ox.ac.uk/fsl
fsl@fmrib.ox.ac.uk
Developed at FMRIB (Oxford Centre for Functional Magnetic Resonance
Imaging of the Brain), Department of Clinical Neurology, Oxford
University, Oxford, UK
LICENCE
FMRIB Software Library, Release 5.0 (c) 2012, The University of
Oxford (the "Software")
The Software remains the property of the University of Oxford ("the
University").
The Software is distributed "AS IS" under this Licence solely for
non-commercial use in the hope that it will be useful, but in order
that the University as a charitable foundation protects its assets for
the benefit of its educational and research purposes, the University
makes clear that no condition is made or to be implied, nor is any
warranty given or to be implied, as to the accuracy of the Software,
or that it will be suitable for any particular purpose or for use
under any specific conditions. Furthermore, the University disclaims
all responsibility for the use which is made of the Software. It
further disclaims any liability for the outcomes arising from using
the Software.
The Licensee agrees to indemnify the University and hold the
University harmless from and against any and all claims, damages and
liabilities asserted by third parties (including claims for
negligence) which arise directly or indirectly from the use of the
Software or the sale of any products based on the Software.
No part of the Software may be reproduced, modified, transmitted or
transferred in any form or by any means, electronic or mechanical,
without the express permission of the University. The permission of
the University is not required if the said reproduction, modification,
transmission or transference is done without financial return, the
conditions of this Licence are imposed upon the receiver of the
product, and all original and amended source code is included in any
transmitted product. You may be held legally responsible for any
copyright infringement that is caused or encouraged by your failure to
abide by these terms and conditions.
You are not permitted under this Licence to use this Software
commercially. Use for which any financial return is received shall be
defined as commercial use, and includes (1) integration of all or part
of the source code or the Software into a product for sale or license
by or on behalf of Licensee to third parties or (2) use of the
Software or any derivative of it for research with the final aim of
developing software products for sale or license to a third party or
(3) use of the Software or any derivative of it for research with the
final aim of developing non-software products for sale or license to a
third party, or (4) use of the Software to provide any service to an
external organisation for which payment is received. If you are
interested in using the Software commercially, please contact Isis
Innovation Limited ("Isis"), the technology transfer company of the
University, to negotiate a licence. Contact details are:
innovation@isis.ox.ac.uk quoting reference DE/9564. */
#define WIN64
#include "mex.h"
#include <iostream>
#include <string>
#include <fstream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include "utils/options.h"
#include "newimage/newimageall.h"
#include "meshclass/meshclass.h"
using namespace std;
using namespace NEWIMAGE;
using namespace Utilities;
using namespace mesh;
void noMoreMemory()
{
cerr<<"Unable to satisfy request for memory"<<endl;
abort();
}
struct bet_parameters
{
double min, max, t98, t2, t, tm, radius;
Pt cog;
};
const double normal_max_update_fraction = .5;
const double lambda_fit = .1;
vector<float> empty_vector(0, 0);
string title="BET (Brain Extraction Tool) v2.1 - FMRIB Analysis Group, Oxford";
string examples="bet2 <input_fileroot> <output_fileroot> [options]";
Option<bool> verbose(string("-v,--verbose"), false,
string("switch on diagnostic messages"),
false, no_argument);
Option<bool> generate_mesh(string("-e,--mesh"), false,
string("generates brain surface as mesh in vtk format"),
false, no_argument);
Option<bool> help(string("-h,--help"), false,
string("displays this help, then exits"),
false, no_argument);
Option<bool> outline(string("-o,--outline"), false,
string("generate brain surface outline overlaid onto original image"),
false, no_argument);
Option<bool> skull(string("-s,--skull"), false,
string("generate approximate skull image"),
false, no_argument);
Option<string> generate_mask(string("-m,--mask"), string(""),
string("~<m>\tgenerate binary brain mask"),
false, requires_argument);
Option<bool> no_output(string("-n,--nooutput"), false,
string("don't generate segmented brain image output"),
false, no_argument);
Option<bool> apply_thresholding(string("-t,--threshold"), false,
string("-apply thresholding to segmented brain image and mask"),
false, no_argument);
Option<float> fractional_threshold(string("-f"), 0.5,
string("~<f>\t\tfractional intensity threshold (0->1); default=0.5; smaller values give larger brain outline estimates"), false, requires_argument);
Option<float> gradient_threshold(string("-g"), 0.0,
string("~<g>\t\tvertical gradient in fractional intensity threshold (-1->1); default=0; positive values give larger brain outline at bottom, smaller at top"), false, requires_argument);
Option<float> smootharg(string("-w,--smooth"), 1.0,
string("~<r>\tsmoothness factor; default=1; values smaller than 1 produce more detailed brain surface, values larger than one produce smoother, less detailed surface"), false, requires_argument);
Option<float> radiusarg(string("-r,--radius"), 0.0,
string("~<r>\thead radius (mm not voxels); initial surface sphere is set to half of this"), false, requires_argument);
Option<float> centerarg(string("-c"), 0.0,
string("~<x y z>\tcentre-of-gravity (voxels not mm) of initial mesh surface."), false, requires_3_arguments);
void draw_segment(volume<short>& image, const Pt& p1, const Pt& p2)
{
double xdim = (double) image.xdim();
double ydim = (double) image.ydim();
double zdim = (double) image.zdim();
double mininc = min(xdim,min(ydim,zdim)) * .5;
Vec n = p1 - p2;
double d = n.norm();
n.normalize();
for (double i=0; i<=d; i+=mininc)
{
Pt p = p2 + i* n;
image((int) floor((p.X)/xdim +.5),(int) floor((p.Y)/ydim +.5),(int) floor((p.Z)/zdim +.5)) = 0;
}
}
volume<short> draw_mesh(const volume<short>& image, const Mesh &m)
{
double xdim = (double) image.xdim();
double ydim = (double) image.ydim();
double zdim = (double) image.zdim();
double mininc = min(xdim,min(ydim,zdim)) * .5;
volume<short> res = image;
for (list<Triangle*>::const_iterator i = m._triangles.begin(); i!=m._triangles.end(); i++)
{
Vec n = (*(*i)->get_vertice(0) - *(*i)->get_vertice(1));
double d = n.norm();
n.normalize();
for (double j=0; j<=d; j+=mininc)
{
Pt p = (*i)->get_vertice(1)->get_coord() + j* n;
draw_segment(res, p, (*i)->get_vertice(2)->get_coord());
}
}
return res;
}
void draw_segment_bis(volume<float>& image, const Pt& p1, const Pt& p2, double max)
{
double xdim = (double) image.xdim();
double ydim = (double) image.ydim();
double zdim = (double) image.zdim();
double mininc = min(xdim,min(ydim,zdim)) * .5;
Vec n = p1 - p2;
double d = n.norm();
n.normalize();
for (double i=0; i<=d; i+=mininc)
{
Pt p = p2 + i* n;
image((int) ((p.X)/xdim +.5),(int) ((p.Y)/ydim +.5),(int) ((p.Z)/zdim +.5)) = max;
}
}
volume<float> draw_mesh_bis(const volume<float>& image, const Mesh &m)
{
double xdim = (double) image.xdim();
double ydim = (double) image.ydim();
double zdim = (double) image.zdim();
double mininc = min(xdim,min(ydim,zdim)) * .5;
volume<float> res = image;
double max = image.max();
for (list<Triangle*>::const_iterator i = m._triangles.begin(); i!=m._triangles.end(); i++)
{
Vec n = (*(*i)->get_vertice(0) - *(*i)->get_vertice(1));
double d = n.norm();
n.normalize();
for (double j=0; j<=d; j+=mininc)
{
Pt p = (*i)->get_vertice(1)->get_coord() + j* n;
draw_segment_bis(res, p, (*i)->get_vertice(2)->get_coord(), max);
}
}
return res;
}
//calculates the mask from the mesh by spreading an initial point outside the mesh, and stopping it when the mesh is reached.
volume<short> make_mask_from_mesh(const volume<float> & image, const Mesh& m)
{
// cout<<"make_mask_from_mesh begins"<<endl;
double xdim = (double) image.xdim();
double ydim = (double) image.ydim();
double zdim = (double) image.zdim();
volume<short> mask;
copyconvert(image,mask);
int xsize = mask.xsize();
int ysize = mask.ysize();
int zsize = mask.zsize();
mask = 1;
mask = draw_mesh(mask, m);
vector<Pt> current;
current.clear();
Pt c(0., 0., 0.);
for (vector<Mpoint *>::const_iterator it=m._points.begin(); it!=m._points.end(); it++)
c+=(*it)->get_coord();
c*=(1./m._points.size());
c.X/=xdim; c.Y/=ydim; c.Z/=zdim;
current.push_back(c);
while (!current.empty())
{
Pt pc = current.back();
int x, y, z;
x=(int) pc.X; y=(int) pc.Y; z=(int) pc.Z;
//current.remove(pc);
current.pop_back();
mask.value(x, y, z) = 0;
if (0<=x-1 && mask.value(x-1, y, z)==1) current.push_back(Pt(x-1, y, z));
if (0<=y-1 && mask.value(x, y-1, z)==1) current.push_back(Pt(x, y-1, z));
if (0<=z-1 && mask.value(x, y, z-1)==1) current.push_back(Pt(x, y, z-1));
if (xsize>x+1 && mask.value(x+1, y, z)==1) current.push_back(Pt(x+1, y, z));
if (ysize>y+1 && mask.value(x, y+1, z)==1) current.push_back(Pt(x, y+1, z));
if (zsize>z+1 && mask.value(x, y, z+1)==1) current.push_back(Pt(x, y, z+1));
}
// cout<<"make_mask_from_mesh ends"<<endl;
return mask;
}
volume<float> inside_mesh(const volume<float> & image, const Mesh& m)
{
volume<float> res = image;
int xsize = image.xsize();
int ysize = image.ysize();
int zsize = image.zsize();
volume<short> inside = make_mask_from_mesh(image, m);
for (int k=0; k<zsize; k++)
for (int j=0; j<ysize; j++)
for (int i=0; i<xsize; i++)
res.value(i, j, k) = (1-inside.value(i, j, k)) * image.value(i, j, k);
return res;
}
bet_parameters adjust_initial_mesh(const volume<float> & image, Mesh& m, const double & rad = 0., const double xpara=0., const double ypara=0., const double zpara=0.)
{
bet_parameters bp;
double xdim = image.xdim();
double ydim = image.ydim();
double zdim = image.zdim();
double t2, t98, t;
//computing t2 && t98
// cout<<"computing robust min && max begins"<<endl;
bp.min = image.min();
bp.max = image.max();
t2 = image.robustmin();
t98 = image.robustmax();
//t2=32.;
//t98=16121.;
// cout<<"computing robust min && max ends"<<endl;
t = t2 + .1*(t98 - t2);
bp.t98 = t98;
bp.t2 = t2;
bp.t = t;
// cout<<"t2 "<<t2<<" t98 "<<t98<<" t "<<t<<endl;
// cout<<"computing center && radius begins"<<endl;
//finds the COG
Pt center(0, 0, 0);
double counter = 0;
if (xpara == 0. & ypara==0. & zpara==0.)
{
double tmp = t - t2;
for (int k=0; k<image.zsize(); k++)
for (int j=0; j<image.ysize(); j++)
for (int i=0; i<image.xsize(); i++)
{
double c = image(i, j, k ) - t2;
if (c > tmp)
{
c = min(c, t98 - t2);
counter+=c;
center += Pt(c*i*xdim, c*j*ydim, c*k*zdim);
}
}
center=Pt(center.X/counter, center.Y/counter, center.Z/counter);
//cout<<counter<<endl;
// cout<<"cog "<<center.X<<" "<<center.Y<<" "<<center.Z<<endl;
}
else center=Pt(xpara*xdim, ypara*ydim, zpara*zdim);
bp.cog = center;
if (rad == 0.)
{
double radius=0;
counter=0;
double scale=xdim*ydim*zdim;
for (int k=0; k<image.zsize(); k++)
for (int j=0; j<image.ysize(); j++)
for (int i=0; i<image.xsize(); i++)
{
double c = image(i, j, k);
if (c > t)
{
counter+=1;
}
}
radius = pow (.75 * counter*scale/M_PI, 1.0/3.0);
// cout<<radius<<endl;
bp.radius = radius;
}
else (bp.radius = rad);
m.translation(center.X, center.Y, center.Z);
m.rescale (bp.radius/2, center);
// cout<<"computing center && radius ends"<<endl;
//computing tm
// cout<<"computing tm begins"<<endl;
vector<double> vm;
for (int k=0; k<image.zsize(); k++)
for (int j=0; j<image.ysize(); j++)
for (int i=0; i<image.xsize(); i++)
{
double d = image.value(i, j, k);
Pt p(i*xdim, j*ydim, k*zdim);
if (d > t2 && d < t98 && ((p - center)|(p - center)) < bp.radius * bp.radius)
vm.push_back(d);
}
int med = (int) floor(vm.size()/2.);
// cout<<"before sort"<<endl;
nth_element(vm.begin(), vm.begin() + med - 1, vm.end());
//partial_sort(vm.begin(), vm.begin() + med + 1, vm.end());
//double tm = vm[med];
double tm=(*max_element(vm.begin(), vm.begin() + med));
// cout<<"tm "<<tm<<endl;
bp.tm = tm;
// cout<<"computing tm ends"<<endl;
return bp;
}
double step_of_computation(const volume<float> & image, Mesh & m, const double bet_main_parameter, const int pass, const double increase_smoothing, const int iteration_number, double & l, const double t2, const double tm, const double t, const double E,const double F, const double zcog, const double radius, const double local_th=0., const int d1=7, const int d2=3){
double xdim = image.xdim();
double ydim = image.ydim();
double zdim = image.zdim();
double dscale = Min(Min(Min(xdim,ydim),zdim),1.0);
//cout << xdim << " " << ydim << " " << zdim << " " << dscale << endl;
if (iteration_number==50 || iteration_number%100 == 0 )
{
l = 0;
int counter = 0;
for (vector<Mpoint*>::iterator i = m._points.begin(); i!=m._points.end(); i++ )
{
counter++;
l += (*i)->medium_distance_of_neighbours();
}
l/=counter;
}
for (vector<Mpoint*>::iterator i = m._points.begin(); i!=m._points.end(); i++)
{
Vec sn, st, u1, u2, u3, u;
double f2, f3=0;
Vec n = (*i)->local_normal();
Vec dv = (*i)->difference_vector();
double tmp = dv|n;
sn = n * tmp;
st = dv - sn;
u1 = st*.5;
double rinv = (2 * fabs(sn|n))/(l*l);
f2 = (1+tanh(F*(rinv - E)))*0.5;
if (pass > 0)
if (tmp > 0) {
f2*=increase_smoothing;
f2 = Min(f2, 1.);
}
u2 = f2 * sn;
//main term of bet
{
double local_t = bet_main_parameter;
if (local_th != 0.0)
{
local_t = Min(1., Max(0., bet_main_parameter + local_th*((*i)->get_coord().Z - zcog)/radius));
}
double Imin = tm;
double Imax = t;
Pt p = (*i)->get_coord() + (-1)*n;
double iv = p.X/xdim + .5, jv = p.Y/ydim +.5, kv = p.Z/zdim +.5;
if (image.in_bounds((int)iv,(int) jv,(int) kv))
{
double im=image.value((int)iv,(int)jv,(int)kv);
Imin = Min(Imin, im);
Imax = Max(Imax,im);
double nxv=n.X/xdim, nyv=n.Y/ydim, nzv=n.Z/zdim;
int i2=(int)(iv-(d1-1)*nxv), j2 =(int) (jv-(d1-1)*nyv), k2 =(int)(kv-(d1-1)*nzv);
nxv*=dscale; nyv*=dscale; nzv*=dscale;
if (image.in_bounds(i2, j2, k2))
{
im=image.value(i2,j2,k2);
Imin = Min(Imin, im);
for (double gi=2.0; gi<d1; gi+=dscale)
{
//cout << gi << " " << endl;
// the following is a quick calc of Pt p = (*i)->get_coord() + (-gi)*n;
iv-=nxv; jv-=nyv; kv-=nzv;
im = image.value((int) (iv), (int) (jv), (int) (kv));
Imin = Min(Imin, im);
if (gi<d2)
Imax = Max(Imax,im);
}
Imin = Max (t2, Imin);
Imax = Min (tm, Imax);
const double tl = (Imax - t2) * local_t + t2;
if (Imax - t2 > 0)
f3=2*(Imin - tl)/(Imax - t2);
else f3=(Imin - tl)*2;
}
}
}
f3 *= (normal_max_update_fraction * lambda_fit * l);
u3 = f3 * n;
u = u1 + u2 + u3;
//cout<<"l "<<l<<"u1 "<<((u1*n).norm())<<"u2 "<<(u2|n)<<"u3 "<<(u3|n)<<endl;
(*i)->_update_coord = (*i)->get_coord() + u;
}
m.update();
return (0);
}
volume<float> find_skull (volume<float> & image, const Mesh & m, const double t2, double t, double t98)
{
const double skull_search = 30;
const double skull_start = -3;
volume<float> result = image;
result=0;
volume<short> volmesh;
copyconvert(image,volmesh);
int xsize = volmesh.xsize();
int ysize = volmesh.ysize();
int zsize = volmesh.zsize();
double xdim = volmesh.xdim();
double ydim = volmesh.ydim();
double zdim = volmesh.zdim();
double scale = Min(xdim, Min(ydim, zdim));
volmesh = 1;
volmesh = draw_mesh(volmesh, m);
image.setinterpolationmethod(trilinear);
for (vector<Mpoint*>::const_iterator i = m._points.begin(); i != m._points.end(); i++)
{
double max_neighbour = 0;
const Vec normal = (*i)->local_normal();
const Vec n = Vec(normal.X/xdim, normal.Y/ydim, normal.Z/zdim);
for (list<Mpoint*>::const_iterator nei = (*i)->_neighbours.begin(); nei != (*i)->_neighbours.end(); nei++)
max_neighbour = Max(((**i) - (**nei)).norm(), max_neighbour);
max_neighbour = ceil((max_neighbour)/2);
const Pt mpoint((*i)->get_coord().X/xdim,(*i)->get_coord().Y/ydim,(*i)->get_coord().Z/zdim);
for (int ck = (int)floor(mpoint.Z - max_neighbour/zdim); ck <= (int)floor(mpoint.Z + max_neighbour/zdim); ck++)
for (int cj = (int)floor(mpoint.Y - max_neighbour/ydim); cj <= (int)floor(mpoint.Y + max_neighbour/ydim); cj++)
for (int ci = (int)floor(mpoint.X - max_neighbour/xdim); ci <= (int)floor(mpoint.X + max_neighbour/xdim); ci++)
{
bool compute = false;
const Pt point(ci, cj, ck);
const Pt realpoint(ci*xdim, cj*ydim, ck*zdim);
if (volmesh(ci, cj, ck) == 0)
{
double mindist = 10000;
for (list<Mpoint*>::const_iterator nei = (*i)->_neighbours.begin(); nei != (*i)->_neighbours.end(); nei++)
mindist = Min(((realpoint) - (**nei)).norm(), mindist);
if (mindist >= ((realpoint) - (**i)).norm()) compute = true;
}
if (compute)
{
double maxval = t;
double minval = image.interpolate(point.X, point.Y, point.Z);
double d_max = 0;
for (double d=0; d<skull_search; d+=scale*.5)
{
Pt current = point + d * n;
double val = image.interpolate(current.X, current.Y, current.Z);
if (val>maxval)
{
maxval=val;
d_max=d;
}
if (val<minval)
minval=val;
}
if (maxval > t)
{
double d_min=skull_start;
double maxJ =-1000000;
double lastJ=-2000000;
for(double d=skull_start; d<d_max; d+=scale*0.5)
{
Pt current = point + d * n;
if (current.X >= 0 && current.Y >= 0 && current.Z >= 0 && current.X<xsize && current.Y<ysize && current.Z<zsize)
{
double tmpf = d/30 - image.interpolate(current.X, current.Y, current.Z) / (t98 - t2);
if (tmpf > maxJ)
{
maxJ=tmpf;
d_min = d;
}
lastJ=tmpf;
}
}
double maxgrad = 0;
double d_skull;
Pt current2 = point + d_min * n;
if (current2.X >= 0 && current2.Y >= 0 && current2.Z >= 0 && current2.X<xsize && current2.Y<ysize && current2.Z<zsize)
{
double val2 = image.interpolate(current2.X, current2.Y, current2.Z);
for(double d=d_min + scale; d<d_max; d+=0.5*scale)
{
Pt current = point + d * n;
if (current.X >= 0 && current.Y >= 0 && current.Z >= 0 && current.X<xsize && current.Y<ysize && current.Z<zsize)
{
double val = image.interpolate(current.X, current.Y, current.Z);
double grad = val - val2;
val2 = val;
if (grad > 0)
{
if (grad > maxgrad)
{
maxgrad=grad;
d_skull=d;
}
else d = d_max;
}
}
}
}
if (maxgrad > 0)
{
Pt current3 = point + d_skull * n;
if (current3.X >= 0 && current3.Y >= 0 && current3.Z >= 0 && current3.X<xsize && current3.Y<ysize && current3.Z<zsize)
result ((int)current3.X, (int)current3.Y, (int)current3.Z) = 100/*max*/;
}
}
}
}
}
return result;
}
int RunBET(float *BrainData,int NX, int NY, int NZ, float *Mask){
double xarg = 0, yarg = 0, zarg = 0;
volume<float> testvol(NX,NY,NZ);
for (int l = 0; l < NX; l++ ){
for (int m = 0; m < NY; m++ ){
for (int n = 0; n < NZ; n++ ){
testvol(l,m,n) = BrainData[l+NX*m+NX*NY*n];
}
}
}
double bet_main_parameter = pow(fractional_threshold.value(), .275);
string out = "Test_brain";
// 2D kludge (worked for bet, but not here in bet2, hohum)
if (testvol.xsize()*testvol.xdim()<20) testvol.setxdim(200);
if (testvol.ysize()*testvol.ydim()<20) testvol.setydim(200);
if (testvol.zsize()*testvol.zdim()<20) testvol.setzdim(200);
Mesh m;
make_mesh_from_icosa(5, m);
bet_parameters bp = adjust_initial_mesh(testvol, m, radiusarg.value(), xarg, yarg, zarg);
Mesh moriginal=m;
const double rmin=3.33 * smootharg.value();
const double rmax=10 * smootharg.value();
const double E = (1/rmin + 1/rmax)/2.;
const double F = 6./(1/rmin - 1/rmax);
const int nb_iter = 1000;
const double self_intersection_threshold = 4000;
double l = 0;
for (int i=0; i<nb_iter; i++)
{
step_of_computation(testvol, m, bet_main_parameter, 0, 0, i, l, bp.t2, bp.tm, bp.t, E, F, bp.cog.Z, bp.radius, gradient_threshold.value());
// display progress, revised by liangfu
if (((i+1) % int (nb_iter * .01f)) == 0)
{
fprintf (stdout,
"[%3.0f%%] BET: Performing %d of %d iterations.\t\t\r",
(i+1) * 100.f / nb_iter, i+1, nb_iter);
fflush (stdout);
}
}
double tmp = m.self_intersection(moriginal);
if (verbose.value() && !generate_mesh.value())
cout<<"self-intersection total "<<tmp<<" (threshold=4000.0) "<<endl;
bool self_intersection;
if (!generate_mesh.value()) self_intersection = (tmp > self_intersection_threshold);
else (self_intersection = m.real_self_intersection());
int pass = 0;
if (verbose.value() && generate_mesh.value() && self_intersection)
cout<<"the mesh is self-intersecting "<<endl;
//self-intersection treatment
while (self_intersection)
{
if (self_intersection && verbose.value()) {cout<<"thus will rerun with higher smoothness constraint"<<endl;};
m = moriginal;
l = 0;
pass++;
for (int i=0; i<nb_iter; i++)
{
double incfactor = pow (10.0,(double) pass + 1);
if (i > .75 * (double)nb_iter)
incfactor = 4.*(1. - i/(double)nb_iter) * (incfactor - 1.) + 1.;
step_of_computation(testvol, m, bet_main_parameter, pass, incfactor, i, l, bp.t2, bp.tm, bp.t, E, F, bp.cog.Z, bp.radius, gradient_threshold.value());
}
double tmp = m.self_intersection(moriginal);
self_intersection = (tmp > self_intersection_threshold);
if (!generate_mesh.value()) self_intersection = (tmp > self_intersection_threshold);
else (self_intersection = m.real_self_intersection());
if (verbose.value() && !generate_mesh.value())
cout<<"self-intersection total "<<tmp<<" (threshold=4000.0) "<<endl;
if (verbose.value() && generate_mesh.value() && self_intersection)
cout<<"the mesh is self-intersecting"<<endl;
if (pass==10) // give up
self_intersection=0;
}
//display
volume<short> brainmask = make_mask_from_mesh(testvol, m);
if (apply_thresholding.value())
{
int xsize = testvol.xsize();
int ysize = testvol.ysize();
int zsize = testvol.zsize();
for (int k=0; k<zsize; k++)
for (int j=0; j<ysize; j++)
for (int i=0; i<xsize; i++)
if (testvol.value(i, j, k) < bp.t) brainmask.value(i, j, k) = 1;
}
if (!(no_output.value()))
{
int xsize = testvol.xsize();
int ysize = testvol.ysize();
int zsize = testvol.zsize();
volume<float> output = testvol;
for (int k=0; k<zsize; k++)
for (int j=0; j<ysize; j++)
for (int i=0; i<xsize; i++)
output.value(i, j, k) = (1-brainmask.value(i, j, k)) * output.value(i, j, k);
//if (save_volume(output,out.c_str())<0) return -1;
}
//worked
if (generate_mask.value().size()>0){
//if (save_volume((short)1 - brainmask, generate_mask.value().c_str())<0) return -1;
}else{
string maskstr = out + "_mask";
//if (save_volume((short)1 - brainmask, maskstr.c_str())<0) return -1;
for (int l = 0; l < NX; l++ ){
for (int m = 0; m < NY; m++ ){
for (int n = 0; n < NZ; n++ ){
Mask[l+NX*m+NX*NY*n] = 1.0-brainmask(l,m,n);
}
}
}
}
if (outline.value())
{
string outlinestr = out+"_overlay";
volume<float> outline = draw_mesh_bis(testvol, m);
if (save_volume(outline, outlinestr.c_str())<0) return -1;
}
if (generate_mesh.value())
{
string meshstr = out+"_mesh.vtk";
m.save(meshstr.c_str(),3);
}
if (skull.value())
{
string skullstr = out+"_skull";
volume<float> skull = find_skull(testvol, m, bp.t2, bp.t, bp.t98);
volume<short> bskull;
copyconvert(skull,bskull);
if (save_volume(bskull, skullstr.c_str())<0) return -1;
}
return 1;
}
void mexFunction (int nlhs, mxArray * plhs[], int nrhs, const mxArray * prhs[])
{
/////////////////////////////////////////////////////////////////
// Input check
/////////////////////////////////////////////////////////////////
if (!(nrhs==1 || nrhs==2) ){
mexErrMsgTxt("One or two input arguments!\n");
}
if (nrhs==2)
if(!mxIsStruct(prhs[1]))
mexErrMsgTxt("Second argument must be a struct \n");
if (!mxIsSingle(prhs[0]))mexErrMsgTxt("First argument must be of single precision\n");
/////////////////////////////////////////////////////////////////
// Parsing options
/////////////////////////////////////////////////////////////////
OptionParser options(title, examples);
options.add(outline);
options.add(generate_mask);
options.add(skull);
options.add(no_output);
options.add(fractional_threshold);
options.add(gradient_threshold);
options.add(radiusarg);
options.add(smootharg);
options.add(centerarg);
options.add(apply_thresholding);
options.add(generate_mesh);
options.add(verbose);
options.add(help);
mxArray *mx;
if (nrhs==2){
// Outline
if ((mx = mxGetField(prhs[1], 0, "outline"))) {
double *temp = mxGetPr(mx);
if(temp[0])
outline.set_T(1);
else
outline.set_T(0);
//mexPrintf("outline %d\n",outline.value()) ;
}
// fractional_threshold
if ((mx = mxGetField(prhs[1], 0, "fractional_threshold"))) {
double *temp = mxGetPr(mx);
const string tempString = to_string(temp[0]);
fractional_threshold.set_value(tempString);
}
// Skull
if ((mx = mxGetField(prhs[1], 0, "skull"))) {
double *temp = mxGetPr(mx);
if(temp[0])
skull.set_T(1);
else
skull.set_T(0);
mexPrintf("skull %d\n",skull.value()) ;
}
// smootharg
if ((mx = mxGetField(prhs[1], 0, "smooth"))) {
double *temp = mxGetPr(mx);
const string tempString = to_string(temp[0]);
smootharg.set_value(tempString);
}
}
/////////////////////////////////////////////////////////////////
// Input data
/////////////////////////////////////////////////////////////////
float *BrainData = (float*)mxGetPr(prhs[0]);
const mwSize *dims = mxGetDimensions(prhs[0]);
mwSize number_of_dimensions = mxGetNumberOfDimensions(prhs[0]);
if (mxIsComplex(prhs[0]))
mexErrMsgTxt("Only magnitude data!\n");
if (number_of_dimensions!=3)
mexErrMsgTxt("3D data expected!\n");
// Data dimensions
int NX = dims[0];
int NY = dims[1];
int NZ = dims[2];
// ######################################################################
// Output data
// ######################################################################
mwSize ndim = 3;
mwSize *Dims = new mwSize[ndim];
Dims[0] = NX;
Dims[1] = NY;
Dims[2] = NZ;
plhs[0] = mxCreateNumericArray(ndim,Dims , mxSINGLE_CLASS, mxREAL);
float *Mask = (float*)mxGetPr(plhs[0]);
RunBET(BrainData,NX, NY, NZ, Mask);
delete[] Dims;
}