df036f4c
David Mayerich
added the network...
|
1
2
3
|
#ifndef STIM_NETWORK_H
#define STIM_NETWORK_H
|
7f27eafa
David Mayerich
simplified the st...
|
4
|
#include <stdlib.h>
|
9c97e126
David Mayerich
added an axis-ali...
|
5
|
#include <assert.h>
|
7f27eafa
David Mayerich
simplified the st...
|
6
7
8
9
10
|
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string.h>
#include <math.h>
|
308a743c
David Mayerich
fixed class compa...
|
11
|
#include <stim/math/vec3.h>
|
5687cf1b
Cherub P. Harder
Added #include <s...
|
12
|
#include <stim/visualization/obj.h>
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
13
|
#include <stim/visualization/swc.h>
|
58ee2b21
David Mayerich
incorporated stim...
|
14
|
#include <stim/visualization/cylinder.h>
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
15
|
#include <stim/structures/kdtree.cuh>
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
16
|
#include <stim/cuda/cudatools/timer.h>
|
7f27eafa
David Mayerich
simplified the st...
|
17
|
|
df036f4c
David Mayerich
added the network...
|
18
|
|
c72184d1
Jiaming Guo
add many function...
|
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
|
#ifdef __CUDACC__
//device gaussian function
__device__ float gaussianFunction(float x, float std){ return expf(-x/(2*std*std));}
//compute metric in parallel
template <typename T>
__global__ void d_metric(T* M, size_t n, T* D, float sigma){
size_t x = blockDim.x * blockIdx.x + threadIdx.x;
if(x >= n) return;
M[x] = 1.0f - gaussianFunction(D[x], sigma);
}
//find the corresponding edge index from array index
__global__ void d_findedge(size_t* I, size_t n, unsigned* R, size_t* E, size_t ne){
size_t x = blockDim.x * blockIdx.x + threadIdx.x;
if(x >= n) return;
unsigned i = 0;
size_t N = 0;
for(unsigned e = 0; e < ne; e++){
N += E[e];
if(I[x] < N){
R[x] = i;
break;
}
i++;
}
}
#endif
//hard-coded factor
|
62d95dcd
Jiaming Guo
fixed resample bugs
|
49
|
int threshold_fac = 0;
|
c72184d1
Jiaming Guo
add many function...
|
50
|
|
df036f4c
David Mayerich
added the network...
|
51
|
namespace stim{
|
7f27eafa
David Mayerich
simplified the st...
|
52
53
54
55
56
|
/** This is the a class that interfaces with gl_spider in order to store the currently
* segmented network. The following data is stored and can be extracted:
* 1)Network geometry and centerline.
* 2)Network connectivity (a graph of nodes and edges), reconstructed using ANN library.
*/
|
df036f4c
David Mayerich
added the network...
|
57
|
|
df036f4c
David Mayerich
added the network...
|
58
59
60
|
template<typename T>
class network{
|
7f27eafa
David Mayerich
simplified the st...
|
61
62
|
///Each edge is a fiber with two nodes.
///Each node is an in index to the endpoint of the fiber in the nodes array.
|
58ee2b21
David Mayerich
incorporated stim...
|
63
|
class edge : public cylinder<T>
|
7f27eafa
David Mayerich
simplified the st...
|
64
65
66
|
{
public:
unsigned v[2]; //unique id's designating the starting and ending
|
7c43b7f9
pranathivemuri
return resampled ...
|
67
|
// default constructor
|
eb554b48
David Mayerich
bug fixes for Net...
|
68
|
edge() : cylinder<T>() {
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
69
|
v[1] = (unsigned)(-1); v[0] = (unsigned)(-1);
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
70
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
71
|
/// Constructor - creates an edge from a list of points by calling the stim::fiber constructor
|
e376212f
David Mayerich
added support for...
|
72
|
|
3800c27f
David Mayerich
added code to sub...
|
73
|
///@param p is an array of positions in space
|
ee17b90b
Jiaming Guo
make it compatibl...
|
74
|
edge(stim::centerline<T> p) : cylinder<T>(p){}
|
3800c27f
David Mayerich
added code to sub...
|
75
|
|
eb554b48
David Mayerich
bug fixes for Net...
|
76
|
/// Copy constructor creates an edge from a cylinder
|
58ee2b21
David Mayerich
incorporated stim...
|
77
|
edge(stim::cylinder<T> f) : cylinder<T>(f) {}
|
3800c27f
David Mayerich
added code to sub...
|
78
79
80
|
/// Resamples an edge by calling the fiber resampling function
edge resample(T spacing){
|
58ee2b21
David Mayerich
incorporated stim...
|
81
|
edge e(cylinder<T>::resample(spacing)); //call the fiber->edge constructor
|
3800c27f
David Mayerich
added code to sub...
|
82
83
84
85
86
|
e.v[0] = v[0]; //copy the vertex data
e.v[1] = v[1];
return e; //return the new edge
}
|
9c97e126
David Mayerich
added an axis-ali...
|
87
|
|
7f27eafa
David Mayerich
simplified the st...
|
88
|
/// Output the edge information as a string
|
df036f4c
David Mayerich
added the network...
|
89
90
|
std::string str(){
std::stringstream ss;
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
91
|
ss<<"("<<cylinder<T>::size()<<")\tl = "<<this->length()<<"\t"<<v[0]<<"----"<<v[1];
|
df036f4c
David Mayerich
added the network...
|
92
93
|
return ss.str();
}
|
df036f4c
David Mayerich
added the network...
|
94
|
|
c72184d1
Jiaming Guo
add many function...
|
95
96
97
98
99
100
101
102
103
104
105
106
107
|
std::vector<edge> split(unsigned int idx){
std::vector< stim::cylinder<T> > C;
C.resize(2);
C = (*this).cylinder<T>::split(idx);
std::vector<edge> E(C.size());
for(unsigned e = 0; e < E.size(); e++){
E[e] = C[e];
}
return E;
}
|
9c97e126
David Mayerich
added an axis-ali...
|
108
109
|
};
|
7f27eafa
David Mayerich
simplified the st...
|
110
|
///Node class that stores the physical position of the node as well as the edges it is connected to (edges that connect to it), As well as any additional data necessary.
|
308a743c
David Mayerich
fixed class compa...
|
111
|
class vertex : public stim::vec3<T>
|
7f27eafa
David Mayerich
simplified the st...
|
112
113
|
{
public:
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
114
115
116
|
//std::vector<unsigned int> edges; //indices of edges connected to this node.
std::vector<unsigned int> e[2]; //indices of edges going out (e[0]) and coming in (e[1])
//stim::vec3<T> p; //position of this node in physical space.
|
7f27eafa
David Mayerich
simplified the st...
|
117
118
|
//constructor takes a stim::vec
|
308a743c
David Mayerich
fixed class compa...
|
119
|
vertex(stim::vec3<T> p) : stim::vec3<T>(p){}
|
7f27eafa
David Mayerich
simplified the st...
|
120
121
122
123
|
/// Output the vertex information as a string
std::string str(){
std::stringstream ss;
|
308a743c
David Mayerich
fixed class compa...
|
124
|
ss<<"\t(x, y, z) = "<<stim::vec3<T>::str();
|
7f27eafa
David Mayerich
simplified the st...
|
125
126
127
128
129
130
131
132
133
134
135
|
if(e[0].size() > 0){
ss<<"\t> ";
for(unsigned int o = 0; o < e[0].size(); o++)
ss<<e[0][o]<<" ";
}
if(e[1].size() > 0){
ss<<"\t< ";
for(unsigned int i = 0; i < e[1].size(); i++)
ss<<e[1][i]<<" ";
}
|
df036f4c
David Mayerich
added the network...
|
136
|
|
7f27eafa
David Mayerich
simplified the st...
|
137
|
return ss.str();
|
df036f4c
David Mayerich
added the network...
|
138
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
139
|
|
fe0c7539
pranathivemuri
added functions t...
|
140
|
|
df036f4c
David Mayerich
added the network...
|
141
142
|
};
|
9c97e126
David Mayerich
added an axis-ali...
|
143
|
protected:
|
df036f4c
David Mayerich
added the network...
|
144
|
|
7f27eafa
David Mayerich
simplified the st...
|
145
|
std::vector<edge> E; //list of edges
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
146
|
std::vector<vertex> V; //list of vertices.
|
30b20d4f
Jiaming Guo
make it render be...
|
147
|
//std::vector<int> NT; //stores a list of neuronal type for each point in the centerline (will set value only when centerline is built from swc file)
|
9c97e126
David Mayerich
added an axis-ali...
|
148
149
|
public:
|
df036f4c
David Mayerich
added the network...
|
150
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
151
152
153
154
155
156
157
158
159
160
161
162
|
///default constructor
network()
{
}
///constructor with a file to load.
network(std::string fileLocation)
{
load_obj(fileLocation);
}
|
7f27eafa
David Mayerich
simplified the st...
|
163
164
165
|
///Returns the number of edges in the network.
unsigned int edges(){
return E.size();
|
df036f4c
David Mayerich
added the network...
|
166
167
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
168
169
170
|
///Returns the number of nodes in the network.
unsigned int vertices(){
return V.size();
|
df036f4c
David Mayerich
added the network...
|
171
172
|
}
|
eceb6571
Jiaming Guo
fixed bug when sw...
|
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
///Returns the radius at specific point in the edge
T get_R(unsigned e, unsigned i) {
return E[e].r(i);
}
///Returns the length of current edge
T get_L(unsigned e) {
return E[e].length();
}
///Returns the start vertex of current edge
size_t get_SP(unsigned e) {
return E[e].v[0];
}
///Returns the end vertex of current edge
size_t get_EP(unsigned e) {
return E[e].v[1];
}
|
87d0a1d2
David Mayerich
minor changes for...
|
193
194
195
|
//scale the network by some constant value
// I don't think these work??????
/*std::vector<vertex> operator*(T s){
|
fe0c7539
pranathivemuri
added functions t...
|
196
197
198
199
200
201
202
203
204
205
206
207
208
|
for (unsigned i=0; i< vertices; i ++ ){
V[i] = V[i] * s;
}
return V;
}
std::vector<vertex> operator*(vec<T> s){
for (unsigned i=0; i< vertices; i ++ ){
for (unsigned dim = 0 ; dim< 3; dim ++){
V[i][dim] = V[i][dim] * s[dim];
}
}
return V;
|
87d0a1d2
David Mayerich
minor changes for...
|
209
|
}*/
|
fe0c7539
pranathivemuri
added functions t...
|
210
|
|
abce2443
pranathivemuri
average branching...
|
211
|
// Returns an average of branching index in the network
|
abce2443
pranathivemuri
average branching...
|
212
213
214
215
216
217
218
219
220
221
|
double BranchingIndex(){
double B=0;
for(unsigned v=0; v < V.size(); v ++){
B += ((V[v].e[0].size()) + (V[v].e[1].size()));
}
B = B / V.size();
return B;
}
|
15a53122
pranathivemuri
Added other simpl...
|
222
|
// Returns number of branch points in thenetwork
|
15a53122
pranathivemuri
Added other simpl...
|
223
224
225
226
227
228
229
230
231
232
233
234
235
|
unsigned int BranchP(){
unsigned int B=0;
unsigned int c;
for(unsigned v=0; v < V.size(); v ++){
c = ((V[v].e[0].size()) + (V[v].e[1].size()));
if (c > 2){
B += 1;}
}
return B;
}
// Returns number of end points (tips) in thenetwork
|
15a53122
pranathivemuri
Added other simpl...
|
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
|
unsigned int EndP(){
unsigned int B=0;
unsigned int c;
for(unsigned v=0; v < V.size(); v ++){
c = ((V[v].e[0].size()) + (V[v].e[1].size()));
if (c == 1){
B += 1;}
}
return B;
}
//// Returns a dictionary with the key as the vertex
//std::map<std::vector<vertex>,unsigned int> DegreeDict(){
// std::map<std::vector<vertex>,unsigned int> dd;
// unsigned int c = 0;
// for(unsigned v=0; v < V.size(); v ++){
// c = ((V[v].e[0].size()) + (V[v].e[1].size()));
// dd[V[v]] = c;
// }
// return dd;
//}
//// Return number of branching stems
//unsigned int Stems(){
// unsigned int s = 0;
// std::map<std::vector<vertex>,unsigned int> dd;
// dd = DegreeDict();
// //for(unsigned v=0; v < V.size(); v ++){
// // V[v].e[0].
// return s;
//}
|
87d0a1d2
David Mayerich
minor changes for...
|
269
|
//Calculate Metrics---------------------------------------------------
|
fe0c7539
pranathivemuri
added functions t...
|
270
271
|
// Returns an average of fiber/edge lengths in the network
double Lengths(){
|
1b2858a2
David Mayerich
fixed some commen...
|
272
273
|
stim::vec<T> L;
double sumLength = 0;
|
fe0c7539
pranathivemuri
added functions t...
|
274
275
276
277
278
279
280
281
282
283
284
285
286
|
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
L.push_back(E[e].length()); //append the edge length
sumLength = sumLength + E[e].length();
}
double avg = sumLength / E.size();
return avg;
}
// Returns an average of tortuosities in the network
double Tortuosities(){
stim::vec<T> t;
stim::vec<T> id1, id2; // starting and ending vertices of the edge
|
fe0c7539
pranathivemuri
added functions t...
|
287
288
289
290
291
|
double distance;double tortuosity;double sumTortuosity = 0;
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
id1 = E[e][0]; //get the edge starting point
id2 = E[e][E[e].size() - 1]; //get the edge ending point
distance = (id1 - id2).len(); //displacement between the starting and ending points
|
fe0c7539
pranathivemuri
added functions t...
|
292
293
294
295
296
297
298
299
300
|
if(distance > 0){
tortuosity = E[e].length()/ distance ; // tortuoisty = edge length / edge displacement
}
else{
tortuosity = 0;}
t.push_back(tortuosity);
sumTortuosity += tortuosity;
}
double avg = sumTortuosity / E.size();
|
fe0c7539
pranathivemuri
added functions t...
|
301
302
303
|
return avg;
}
|
15a53122
pranathivemuri
Added other simpl...
|
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
|
// Returns average contraction of the network
double Contractions(){
stim::vec<T> t;
stim::vec<T> id1, id2; // starting and ending vertices of the edge
double distance;double contraction;double sumContraction = 0;
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
id1 = E[e][0]; //get the edge starting point
id2 = E[e][E[e].size() - 1]; //get the edge ending point
distance = (id1 - id2).len(); //displacement between the starting and ending points
contraction = distance / E[e].length(); // tortuoisty = edge length / edge displacement
t.push_back(contraction);
sumContraction += contraction;
}
double avg = sumContraction / E.size();
return avg;
}
|
fe0c7539
pranathivemuri
added functions t...
|
320
|
|
15a53122
pranathivemuri
Added other simpl...
|
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
|
// returns average fractal dimension of the branches of the network
double FractalDimensions(){
stim::vec<T> t;
stim::vec<T> id1, id2; // starting and ending vertices of the edge
double distance;double fract;double sumFractDim = 0;
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
id1 = E[e][0]; //get the edge starting point
id2 = E[e][E[e].size() - 1]; //get the edge ending point
distance = (id1 - id2).len(); //displacement between the starting and ending points
fract = std::log(distance) / std::log(E[e].length()); // tortuoisty = edge length / edge displacement
t.push_back(sumFractDim);
sumFractDim += fract;
}
double avg = sumFractDim / E.size();
return avg;
}
|
87d0a1d2
David Mayerich
minor changes for...
|
337
338
339
340
|
//returns a cylinder represented a given fiber (based on edge index)
stim::cylinder<T> get_cylinder(unsigned e){
return E[e]; //return the specified edge (casting it to a fiber)
|
3800c27f
David Mayerich
added code to sub...
|
341
342
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
343
344
|
//load a network from an OBJ file
void load_obj(std::string filename){
|
e376212f
David Mayerich
added support for...
|
345
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
346
347
|
stim::obj<T> O; //create an OBJ object
O.load(filename); //load the OBJ file as an object
|
df036f4c
David Mayerich
added the network...
|
348
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
349
|
std::vector<unsigned> id2vert; //this list stores the OBJ vertex ID associated with each network vertex
|
df036f4c
David Mayerich
added the network...
|
350
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
351
|
unsigned i[2]; //temporary, IDs associated with the first and last points in an OBJ line
|
df036f4c
David Mayerich
added the network...
|
352
|
|
7f27eafa
David Mayerich
simplified the st...
|
353
354
|
//for each line in the OBJ object
for(unsigned int l = 1; l <= O.numL(); l++){
|
df036f4c
David Mayerich
added the network...
|
355
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
356
|
std::vector< stim::vec<T> > c; //allocate an array of points for the vessel centerline
|
7f27eafa
David Mayerich
simplified the st...
|
357
|
O.getLine(l, c); //get the fiber centerline
|
df036f4c
David Mayerich
added the network...
|
358
|
|
eb554b48
David Mayerich
bug fixes for Net...
|
359
|
stim::centerline<T> c3(c.size());
|
308a743c
David Mayerich
fixed class compa...
|
360
361
|
for(size_t j = 0; j < c.size(); j++)
c3[j] = c[j];
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
362
|
c3.update();
|
308a743c
David Mayerich
fixed class compa...
|
363
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
364
365
366
367
368
|
// edge new_edge = c3; ///This is dangerous.
edge new_edge(c3);
//create an edge from the given centerline
unsigned int I = new_edge.size(); //calculate the number of points on the centerline
|
df036f4c
David Mayerich
added the network...
|
369
|
|
7f27eafa
David Mayerich
simplified the st...
|
370
|
//get the first and last vertex IDs for the line
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
371
|
std::vector< unsigned > id; //create an array to store the centerline point IDs
|
9c97e126
David Mayerich
added an axis-ali...
|
372
|
O.getLinei(l, id); //get the list of point IDs for the line
|
7f27eafa
David Mayerich
simplified the st...
|
373
374
|
i[0] = id.front(); //get the OBJ ID for the first element of the line
i[1] = id.back(); //get the OBJ ID for the last element of the line
|
df036f4c
David Mayerich
added the network...
|
375
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
376
|
std::vector<unsigned>::iterator it; //create an iterator for searching the id2vert array
|
7f27eafa
David Mayerich
simplified the st...
|
377
|
unsigned it_idx; //create an integer for the id2vert entry index
|
df036f4c
David Mayerich
added the network...
|
378
|
|
7f27eafa
David Mayerich
simplified the st...
|
379
|
//find out if the nodes for this fiber have already been created
|
7f27eafa
David Mayerich
simplified the st...
|
380
|
it = find(id2vert.begin(), id2vert.end(), i[0]); //look for the first node
|
7f27eafa
David Mayerich
simplified the st...
|
381
|
if(it == id2vert.end()){ //if i[0] hasn't already been used
|
4df9ec0e
pranathivemuri
compare networks ...
|
382
|
vertex new_vertex = new_edge[0]; //create a new vertex, assign it a position
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
383
384
385
386
|
new_vertex.e[0].push_back(E.size()); //add the current edge as outgoing
new_edge.v[0] = V.size(); //add the new edge to the edge
V.push_back(new_vertex); //add the new vertex to the vertex list
id2vert.push_back(i[0]); //add the ID to the ID->vertex conversion list
|
df036f4c
David Mayerich
added the network...
|
387
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
388
|
else{ //if the vertex already exists
|
15a53122
pranathivemuri
Added other simpl...
|
389
|
it_idx = std::distance(id2vert.begin(), it);
|
df480014
pranathivemuri
added in comments...
|
390
|
V[it_idx].e[0].push_back(E.size()); //add the current edge as outgoing
|
3800c27f
David Mayerich
added code to sub...
|
391
|
new_edge.v[0] = it_idx;
|
df036f4c
David Mayerich
added the network...
|
392
393
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
394
|
it = find(id2vert.begin(), id2vert.end(), i[1]); //look for the second ID
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
395
396
397
|
if(it == id2vert.end()){ //if i[1] hasn't already been used
vertex new_vertex = new_edge[I-1]; //create a new vertex, assign it a position
new_vertex.e[1].push_back(E.size()); //add the current edge as incoming
|
b2f48bca
Pavel Govyadinov
fixed merge confl...
|
398
|
new_edge.v[1] = V.size(); //add the new vertex to the edge
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
399
400
|
V.push_back(new_vertex); //add the new vertex to the vertex list
id2vert.push_back(i[1]); //add the ID to the ID->vertex conversion list
|
df036f4c
David Mayerich
added the network...
|
401
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
402
|
else{ //if the vertex already exists
|
15a53122
pranathivemuri
Added other simpl...
|
403
|
it_idx = std::distance(id2vert.begin(), it);
|
df480014
pranathivemuri
added in comments...
|
404
|
V[it_idx].e[1].push_back(E.size()); //add the current edge as incoming
|
3800c27f
David Mayerich
added code to sub...
|
405
|
new_edge.v[1] = it_idx;
|
df036f4c
David Mayerich
added the network...
|
406
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
407
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
408
|
E.push_back(new_edge); //push the edge to the list
|
df036f4c
David Mayerich
added the network...
|
409
|
|
df036f4c
David Mayerich
added the network...
|
410
|
}
|
e376212f
David Mayerich
added support for...
|
411
412
|
}
|
58674036
Jiaming Guo
fix minor error f...
|
413
|
//load a network from an SWC file
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
414
415
416
417
|
void load_swc(std::string filename) {
stim::swc<T> S; // create swc variable
S.load(filename); // load the node information
S.create_tree(); // link those node according to their linking relationships as a tree
|
2b28db3e
Jiaming Guo
better render
|
418
|
S.resample();
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
419
|
|
30b20d4f
Jiaming Guo
make it render be...
|
420
|
//NT.push_back(S.node[0].type); // set the neuronal_type value to the first vertex in the network
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
421
422
|
std::vector<unsigned> id2vert; // this list stores the SWC vertex ID associated with each network vertex
unsigned i[2]; // temporary, IDs associated with the first and last points
|
2b28db3e
Jiaming Guo
better render
|
423
424
|
for (unsigned int l = 0; l < S.numE(); l++) { // for every edge
|
30b20d4f
Jiaming Guo
make it render be...
|
425
|
//NT.push_back(S.node[l].type);
|
2b28db3e
Jiaming Guo
better render
|
426
427
428
429
430
431
432
433
|
std::vector< stim::vec3<T> > c;
S.get_points(l, c);
stim::centerline<T> c3(c.size()); // new fiber
for (unsigned j = 0; j < c.size(); j++)
c3[j] = c[j]; // copy the points
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
434
435
|
c3.update(); // update the L information
|
58674036
Jiaming Guo
fix minor error f...
|
436
437
438
439
|
stim::cylinder<T> C3(c3); // create a new cylinder in order to copy the origin radius information
// upadate the R information
std::vector<T> radius;
|
2b28db3e
Jiaming Guo
better render
|
440
441
|
S.get_radius(l, radius);
|
58674036
Jiaming Guo
fix minor error f...
|
442
443
|
C3.copy_r(radius);
|
2b28db3e
Jiaming Guo
better render
|
444
445
446
447
|
edge new_edge(C3); // new edge
//create an edge from the given centerline
unsigned int I = new_edge.size(); //calculate the number of points on the centerline
|
58674036
Jiaming Guo
fix minor error f...
|
448
|
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
449
|
//get the first and last vertex IDs for the line
|
2b28db3e
Jiaming Guo
better render
|
450
451
|
i[0] = S.E[l].front();
i[1] = S.E[l].back();
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
|
std::vector<unsigned>::iterator it; //create an iterator for searching the id2vert array
unsigned it_idx; //create an integer for the id2vert entry index
//find out if the nodes for this fiber have already been created
it = find(id2vert.begin(), id2vert.end(), i[0]); //look for the first node
if (it == id2vert.end()) { //if i[0] hasn't already been used
vertex new_vertex = new_edge[0]; //create a new vertex, assign it a position
new_vertex.e[0].push_back(E.size()); //add the current edge as outgoing
new_edge.v[0] = V.size(); //add the new edge to the edge
V.push_back(new_vertex); //add the new vertex to the vertex list
id2vert.push_back(i[0]); //add the ID to the ID->vertex conversion list
}
else { //if the vertex already exists
it_idx = std::distance(id2vert.begin(), it);
V[it_idx].e[0].push_back(E.size()); //add the current edge as outgoing
new_edge.v[0] = it_idx;
}
it = find(id2vert.begin(), id2vert.end(), i[1]); //look for the second ID
if (it == id2vert.end()) { //if i[1] hasn't already been used
|
2b28db3e
Jiaming Guo
better render
|
473
|
vertex new_vertex = new_edge[I - 1]; //create a new vertex, assign it a position
|
1599ae65
Jiaming Guo
add swc.h and fun...
|
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
|
new_vertex.e[1].push_back(E.size()); //add the current edge as incoming
new_edge.v[1] = V.size(); //add the new vertex to the edge
V.push_back(new_vertex); //add the new vertex to the vertex list
id2vert.push_back(i[1]); //add the ID to the ID->vertex conversion list
}
else { //if the vertex already exists
it_idx = std::distance(id2vert.begin(), it);
V[it_idx].e[1].push_back(E.size()); //add the current edge as incoming
new_edge.v[1] = it_idx;
}
E.push_back(new_edge); //push the edge to the list
}
}
|
26e84a59
Jiaming Guo
add adjacency_mat...
|
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
|
/// Get adjacency matrix of the network
std::vector< typename std::vector<int> > get_adj_mat() {
unsigned n = V.size(); // get the number of vertices in the networks
std::vector< typename std::vector<int> > result(n, std::vector<int>(n, 0)); // initialize every entry in the matrix to be 0
result.resize(n); // resize rows
for (unsigned i = 0; i < n; i++)
result[i].resize(n); // resize columns
for (unsigned i = 0; i < n; i++) { // for every vertex
unsigned num_out = V[i].e[0].size(); // number of outgoing edges of current vertex
if (num_out != 0) {
for (unsigned j = 0; j < num_out; j++) {
int edge_idx = V[i].e[0][j]; // get the jth out-going edge index of current vertex
int vertex_idx = E[edge_idx].v[1]; // get the ending vertex of specific out-going edge
result[i][vertex_idx] = 1; // can simply set to 1 if it is simple-graph
result[vertex_idx][i] = 1; // symmetric
}
}
}
return result;
}
|
7f27eafa
David Mayerich
simplified the st...
|
514
515
|
/// Output the network as a string
std::string str(){
|
e376212f
David Mayerich
added support for...
|
516
|
|
7f27eafa
David Mayerich
simplified the st...
|
517
518
519
520
|
std::stringstream ss;
ss<<"Nodes ("<<V.size()<<")--------"<<std::endl;
for(unsigned int v = 0; v < V.size(); v++){
ss<<"\t"<<v<<V[v].str()<<std::endl;
|
e376212f
David Mayerich
added support for...
|
521
522
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
523
524
525
|
ss<<"Edges ("<<E.size()<<")--------"<<std::endl;
for(unsigned e = 0; e < E.size(); e++){
ss<<"\t"<<e<<E[e].str()<<std::endl;
|
df036f4c
David Mayerich
added the network...
|
526
527
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
528
|
return ss.str();
|
df036f4c
David Mayerich
added the network...
|
529
|
}
|
3800c27f
David Mayerich
added code to sub...
|
530
531
|
/// This function resamples all fibers in a network given a desired minimum spacing
|
9c97e126
David Mayerich
added an axis-ali...
|
532
|
/// @param spacing is the minimum distance between two points on the network
|
3800c27f
David Mayerich
added code to sub...
|
533
|
stim::network<T> resample(T spacing){
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
534
535
|
stim::network<T> n; //create a new network that will be an exact copy, with resampled fibers
n.V = V; //copy all vertices
|
30b20d4f
Jiaming Guo
make it render be...
|
536
|
//n.NT = NT; //copy all the neuronal type information
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
537
|
n.E.resize(edges()); //allocate space for the edge list
|
3800c27f
David Mayerich
added code to sub...
|
538
539
|
//copy all fibers, resampling them in the process
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
540
541
|
for(unsigned e = 0; e < edges(); e++){ //for each edge in the edge list
n.E[e] = E[e].resample(spacing); //resample the edge and copy it to the new network
|
3800c27f
David Mayerich
added code to sub...
|
542
543
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
544
|
return n; //return the resampled network
|
4df9ec0e
pranathivemuri
compare networks ...
|
545
546
|
}
|
c72184d1
Jiaming Guo
add many function...
|
547
548
|
// host gaussian function
__host__ float gaussianFunction(float x, float std = 25){ return exp(-x/(2*std*std));} // std default value is 25
|
4df9ec0e
pranathivemuri
compare networks ...
|
549
|
|
9c97e126
David Mayerich
added an axis-ali...
|
550
|
/// Calculate the total number of points on all edges.
|
797f8ab0
David Mayerich
cleaned up the st...
|
551
552
553
554
|
unsigned total_points(){
unsigned n = 0;
for(unsigned e = 0; e < E.size(); e++)
n += E[e].size();
|
4df9ec0e
pranathivemuri
compare networks ...
|
555
|
return n;
|
797f8ab0
David Mayerich
cleaned up the st...
|
556
|
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
557
|
|
fcd2eb7c
David Mayerich
added support for...
|
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
|
//Copy the point cloud representing the centerline for the network into an array
void centerline_cloud(T* dst) {
size_t p; //stores the current edge point
size_t P; //stores the number of points in an edge
size_t i = 0; //index into the output array of points
for (size_t e = 0; e < E.size(); e++) { //for each edge in the network
P = E[e].size(); //get the number of points in this edge
for (p = 0; p < P; p++) {
dst[i * 3 + 0] = E[e][p][0];
dst[i * 3 + 1] = E[e][p][1];
dst[i * 3 + 2] = E[e][p][2];
i++;
}
}
}
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
574
575
|
// convert vec3 to array
void stim2array(float *a, stim::vec3<T> b){
|
797f8ab0
David Mayerich
cleaned up the st...
|
576
577
578
579
580
|
a[0] = b[0];
a[1] = b[1];
a[2] = b[2];
}
|
c72184d1
Jiaming Guo
add many function...
|
581
|
// convert vec3 to array in bunch
|
c9712fb4
Jiaming Guo
fix minor error w...
|
582
|
void edge2array(T* a, edge b){
|
c72184d1
Jiaming Guo
add many function...
|
583
584
585
586
587
588
589
590
|
size_t n = b.size();
for(size_t i = 0; i < n; i++){
a[i * 3 + 0] = b[i][0];
a[i * 3 + 1] = b[i][1];
a[i * 3 + 2] = b[i][2];
}
}
|
9c97e126
David Mayerich
added an axis-ali...
|
591
592
593
594
|
/// Calculate the average magnitude across the entire network.
/// @param m is the magnitude value to use. The default is 0 (usually radius).
T average(unsigned m = 0){
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
595
596
597
|
T M, L; //allocate space for the total magnitude and length
M = L = 0; //initialize both the initial magnitude and length to zero
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
|
c72184d1
Jiaming Guo
add many function...
|
598
|
M += E[e].integrate(); //get the integrated magnitude
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
599
|
L += E[e].length(); //get the edge length
|
9c97e126
David Mayerich
added an axis-ali...
|
600
|
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
601
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
602
|
return M / L; //return the average magnitude
|
9c97e126
David Mayerich
added an axis-ali...
|
603
604
605
|
}
/// This function compares two networks and returns the percentage of the current network that is missing from A.
|
9c97e126
David Mayerich
added an axis-ali...
|
606
607
|
/// @param A is the network to compare to - the field is generated for A
/// @param sigma is the user-defined tolerance value - smaller values provide a stricter comparison
|
eb554b48
David Mayerich
bug fixes for Net...
|
608
|
stim::network<T> compare(stim::network<T> A, float sigma, int device = -1){
|
9c97e126
David Mayerich
added an axis-ali...
|
609
|
|
fcd2eb7c
David Mayerich
added support for...
|
610
611
|
stim::network<T> R; //generate a network storing the result of the comparison
R = (*this); //initialize the result with the current network
|
9c97e126
David Mayerich
added an axis-ali...
|
612
|
|
fcd2eb7c
David Mayerich
added support for...
|
613
|
T *c; // centerline (array of double pointers) - points on kdtree must be double
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
614
|
size_t n_data = A.total_points(); // set the number of points
|
c9712fb4
Jiaming Guo
fix minor error w...
|
615
|
c = (T*) malloc(sizeof(T) * n_data * 3); // allocate an array to store all points in the data set
|
9c97e126
David Mayerich
added an axis-ali...
|
616
|
|
797f8ab0
David Mayerich
cleaned up the st...
|
617
|
unsigned t = 0;
|
fcd2eb7c
David Mayerich
added support for...
|
618
619
|
for(unsigned e = 0; e < A.E.size(); e++){ //for each edge in the network
for(unsigned p = 0; p < A.E[e].size(); p++){ //for each point in the edge
|
797f8ab0
David Mayerich
cleaned up the st...
|
620
621
|
for(unsigned d = 0; d < 3; d++){ //for each coordinate
|
fcd2eb7c
David Mayerich
added support for...
|
622
|
c[t * 3 + d] = A.E[e][p][d]; //copy the point into the array c
|
4df9ec0e
pranathivemuri
compare networks ...
|
623
|
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
624
|
t++;
|
4df9ec0e
pranathivemuri
compare networks ...
|
625
|
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
626
627
|
}
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
628
|
//generate a KD-tree for network A
|
fcd2eb7c
David Mayerich
added support for...
|
629
|
size_t MaxTreeLevels = 3; // max tree level
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
630
631
632
|
#ifdef __CUDACC__
cudaSetDevice(device);
|
c72184d1
Jiaming Guo
add many function...
|
633
634
|
stim::kdtree<T, 3> kdt; // initialize a pointer to a kd tree
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
635
|
kdt.create(c, n_data, MaxTreeLevels); // build a KD tree
|
797f8ab0
David Mayerich
cleaned up the st...
|
636
|
|
9c97e126
David Mayerich
added an axis-ali...
|
637
|
for(unsigned e = 0; e < R.E.size(); e++){ //for each edge in A
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
638
639
|
//R.E[e].add_mag(0); //add a new magnitude for the metric
//size_t errormag_id = R.E[e].nmags() - 1; //get the id for the new magnitude
|
c72184d1
Jiaming Guo
add many function...
|
640
641
|
size_t n = R.E[e].size(); // the number of points in current edge
|
c9712fb4
Jiaming Guo
fix minor error w...
|
642
|
T* queryPt = new T[3 * n];
|
c72184d1
Jiaming Guo
add many function...
|
643
644
645
|
T* m1 = new T[n];
T* dists = new T[n];
size_t* nnIdx = new size_t[n];
|
797f8ab0
David Mayerich
cleaned up the st...
|
646
|
|
c72184d1
Jiaming Guo
add many function...
|
647
648
649
650
|
T* d_dists;
T* d_m1;
cudaMalloc((void**)&d_dists, n * sizeof(T));
cudaMalloc((void**)&d_m1, n * sizeof(T));
|
797f8ab0
David Mayerich
cleaned up the st...
|
651
|
|
c72184d1
Jiaming Guo
add many function...
|
652
653
654
655
656
657
658
659
660
661
662
663
664
665
|
edge2array(queryPt, R.E[e]);
kdt.search(queryPt, n, nnIdx, dists);
cudaMemcpy(d_dists, dists, n * sizeof(T), cudaMemcpyHostToDevice); // copy dists from host to device
// configuration parameters
size_t threads = (1024>n)?n:1024;
size_t blocks = n/threads + (n%threads)?1:0;
d_metric<<<blocks, threads>>>(d_m1, n, d_dists, sigma); //calculate the metric value based on the distance
cudaMemcpy(m1, d_m1, n * sizeof(T), cudaMemcpyDeviceToHost);
for(unsigned p = 0; p < n; p++){
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
666
|
R.E[e].set_r(p, m1[p]);
|
c72184d1
Jiaming Guo
add many function...
|
667
668
669
670
671
672
673
674
675
676
|
}
//d_set_mag<<<blocks, threads>>>(R.E[e].M, errormag_id, n, m1);
}
#else
stim::kdtree<T, 3> kdt;
kdt.create(c, n_data, MaxTreeLevels);
for(unsigned e = 0; e < R.E.size(); e++){ //for each edge in A
|
c72184d1
Jiaming Guo
add many function...
|
677
678
|
size_t n = R.E[e].size(); // the number of points in current edge
|
c9712fb4
Jiaming Guo
fix minor error w...
|
679
|
T* query = new T[3 * n];
|
c72184d1
Jiaming Guo
add many function...
|
680
681
682
683
684
685
686
687
688
|
T* m1 = new T[n];
T* dists = new T[n];
size* nnIdx = new size_t[n];
edge2array(queryPt, R.E[e]);
kdt.cpu_search(queryPt, n, nnIdx, dists); //find the distance between A and the current network
for(unsigned p = 0; p < R.E[e].size(); p++){
|
2b28db3e
Jiaming Guo
better render
|
689
690
|
m1[p] = 1.0f - gaussianFunction((T)dists[p], sigma); //calculate the metric value based on the distance
R.E[e].set_r(p, m1[p]); //set the error for the second point in the segment
|
c72184d1
Jiaming Guo
add many function...
|
691
692
693
694
695
696
697
698
699
700
701
|
}
}
#endif
return R; //return the resulting network
}
/// This function compares two networks and split the current one according to the nearest neighbor of each point in each edge
/// @param A is the network to split
/// @param B is the corresponding mapping network
/// @param sigma is the user-defined tolerance value - smaller values provide a stricter comparison
/// @param device is the device that user want to use
|
6b317c71
Jiaming Guo
add function to r...
|
702
|
void split(stim::network<T> A, stim::network<T> B, float sigma, int device, float threshold){
|
c72184d1
Jiaming Guo
add many function...
|
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
|
T *c;
size_t n_data = B.total_points();
c = (T*) malloc(sizeof(T) * n_data * 3);
size_t NB = B.E.size(); // the number of edges in B
unsigned t = 0;
for(unsigned e = 0; e < NB; e++){ // for every edge in B
for(unsigned p = 0; p < B.E[e].size(); p++){ // for every points in B.E[e]
for(unsigned d = 0; d < 3; d++){
c[t * 3 + d] = B.E[e][p][d]; // convert to array
}
t++;
}
}
size_t MaxTreeLevels = 3; // max tree level
#ifdef __CUDACC__
cudaSetDevice(device);
stim::kdtree<T, 3> kdt; // initialize a pointer to a kd tree
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
724
|
|
9c97e126
David Mayerich
added an axis-ali...
|
725
|
//compare each point in the current network to the field produced by A
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
726
|
kdt.create(c, n_data, MaxTreeLevels); // build a KD tree
|
797f8ab0
David Mayerich
cleaned up the st...
|
727
|
|
ee17b90b
Jiaming Guo
make it compatibl...
|
728
|
std::vector<std::vector<unsigned> > relation; // the relationship between GT and T corresponding to NN
|
c72184d1
Jiaming Guo
add many function...
|
729
730
731
|
relation.resize(A.E.size());
for(unsigned e = 0; e < A.E.size(); e++){ //for each edge in A
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
732
733
|
//A.E[e].add_mag(0); //add a new magnitude for the metric
//size_t errormag_id = A.E[e].nmags() - 1;
|
c72184d1
Jiaming Guo
add many function...
|
734
735
736
|
size_t n = A.E[e].size(); // the number of edges in A
|
c9712fb4
Jiaming Guo
fix minor error w...
|
737
|
T* queryPt = new T[3 * n]; // set of all the points in current edge
|
c72184d1
Jiaming Guo
add many function...
|
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
|
T* m1 = new T[n]; // array of metrics for every point in current edge
T* dists = new T[n]; // store the distances for every point in current edge
size_t* nnIdx = new size_t[n]; // store the indices for every point in current edge
// define pointers in device
T* d_dists;
T* d_m1;
size_t* d_nnIdx;
// allocate memory for defined pointers
cudaMalloc((void**)&d_dists, n * sizeof(T));
cudaMalloc((void**)&d_m1, n * sizeof(T));
cudaMalloc((void**)&d_nnIdx, n * sizeof(size_t));
edge2array(queryPt, A.E[e]); // convert edge to array
kdt.search(queryPt, n, nnIdx, dists); // search the tree to find the NN for every point in current edge
cudaMemcpy(d_dists, dists, n * sizeof(T), cudaMemcpyHostToDevice); // copy dists from host to device
cudaMemcpy(d_nnIdx, nnIdx, n * sizeof(size_t), cudaMemcpyHostToDevice); // copy Idx from host to device
// configuration parameters
size_t threads = (1024>n)?n:1024; // test to see whether the number of point in current edge is more than 1024
size_t blocks = n/threads + (n%threads)?1:0;
d_metric<<<blocks, threads>>>(d_m1, n, d_dists, sigma); // calculate the metrics in parallel
cudaMemcpy(m1, d_m1, n * sizeof(T), cudaMemcpyDeviceToHost);
for(unsigned p = 0; p < n; p++){
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
767
|
A.E[e].set_r(p, m1[p]); // set the error(radius) value to every point in current edge
|
c72184d1
Jiaming Guo
add many function...
|
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
|
}
relation[e].resize(n); // resize every edge relation size
unsigned* d_relation;
cudaMalloc((void**)&d_relation, n * sizeof(unsigned)); // allocate memory
std::vector<size_t> edge_point_num(NB); // %th element is the number of points that %th edge has
for(unsigned ee = 0; ee < NB; ee++)
edge_point_num[ee] = B.E[ee].size();
size_t* d_edge_point_num;
cudaMalloc((void**)&d_edge_point_num, NB * sizeof(size_t));
cudaMemcpy(d_edge_point_num, &edge_point_num[0], NB * sizeof(size_t), cudaMemcpyHostToDevice);
d_findedge<<<blocks, threads>>>(d_nnIdx, n, d_relation, d_edge_point_num, NB); // find the edge corresponding to the array index in parallel
cudaMemcpy(&relation[e][0], d_relation, n * sizeof(unsigned), cudaMemcpyDeviceToHost); //copy relationship from device to host
}
#else
stim::kdtree<T, 3> kdt;
kdt.create(c, n_data, MaxTreeLevels);
std::vector<std::vector<unsigned>> relation; // the mapping relationship between two networks
relation.resize(A.E.size());
for(unsigned i = 0; i < A.E.size(); i++)
relation[i].resize(A.E[i].size());
std::vector<size_t> edge_point_num(NB); //%th element is the number of points that %th edge has
for(unsigned ee = 0; ee < NB; ee++)
edge_point_num[ee] = B.E[ee].size();
|
c72184d1
Jiaming Guo
add many function...
|
800
|
for(unsigned e = 0; e < A.E.size(); e++){ //for each edge in A
|
2b28db3e
Jiaming Guo
better render
|
801
802
|
size_t n = A.E[e].size(); //the number of edges in A
|
c72184d1
Jiaming Guo
add many function...
|
803
|
|
c9712fb4
Jiaming Guo
fix minor error w...
|
804
|
T* queryPt = new T[3 * n];
|
c72184d1
Jiaming Guo
add many function...
|
805
806
807
808
809
810
811
812
813
|
T* m1 = new T[n];
T* dists = new T[n]; //store the distances
size_t* nnIdx = new size_t[n]; //store the indices
edge2array(queryPt, A.E[e]);
kdt.search(queryPt, n, nnIdx, dists);
for(unsigned p = 0; p < A.E[e].size(); p++){
m1[p] = 1.0f - gaussianFunction((T)dists[p], sigma); //calculate the metric value based on the distance
|
2b28db3e
Jiaming Guo
better render
|
814
|
A.E[e].set_r(p, m1[p]); //set the error for the second point in the segment
|
c72184d1
Jiaming Guo
add many function...
|
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
|
unsigned id = 0; //mapping edge's idx
size_t num = 0; //total number of points before #th edge
for(unsigned i = 0; i < NB; i++){
num += B.E[i].size();
if(nnIdx[p] < num){ //find the edge it belongs to
relation[e][p] = id;
break;
}
id++; //current edge won't be the one, move to next edge
}
}
}
#endif
E = A.E;
V = A.V;
unsigned int id = 0; // split value
for(unsigned e = 0; e < E.size(); e++){ // for every edge
for(unsigned p = 0; p < E[e].size() - 1; p++){ // for every point in each edge
|
62d95dcd
Jiaming Guo
fixed resample bugs
|
835
836
837
838
839
|
int t = E[e].length() / sigma * 2;
if (t <= 20)
threshold_fac = E[e].size();
else
threshold_fac = (E[e].length() / sigma * 2)/10;
|
c72184d1
Jiaming Guo
add many function...
|
840
841
|
if(relation[e][p] != relation[e][p + 1]){ // find the nearest edge changing point
id = p + 1; // if there is no change in NN
|
62d95dcd
Jiaming Guo
fixed resample bugs
|
842
|
if(id < threshold_fac || (E[e].size() - id) < threshold_fac)
|
c72184d1
Jiaming Guo
add many function...
|
843
844
845
846
847
|
id = E[e].size() - 1; // extreme situation is not acceptable
else
break;
}
if(p == E[e].size() - 2) // if there is no splitting index, set the id to the last point index of current edge
|
62d95dcd
Jiaming Guo
fixed resample bugs
|
848
|
id = E[e].size() - 1;
|
c72184d1
Jiaming Guo
add many function...
|
849
|
}
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
850
|
//unsigned errormag_id = E[e].nmags() - 1;
|
c72184d1
Jiaming Guo
add many function...
|
851
852
|
T G = 0; // test to see whether it has its nearest neighbor
for(unsigned i = 0; i < E[e].size(); i++)
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
853
|
G += E[e].r(i); // won't split special edges
|
6b317c71
Jiaming Guo
add function to r...
|
854
|
if(G / E[e].size() > threshold) // should based on the color map
|
c72184d1
Jiaming Guo
add many function...
|
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
|
id = E[e].size() - 1; // set split idx to outgoing direction vertex
std::vector<edge> tmpe;
tmpe.resize(2);
tmpe = E[e].split(id);
vertex tmpv = stim::vec3<T>(-1, -1, 0); // store the split point as vertex
if(tmpe.size() == 2){
relation.resize(relation.size() + 1);
for(unsigned d = id; d < E[e].size(); d++)
relation[relation.size() - 1].push_back(relation[e][d]);
tmpe[0].v[0] = E[e].v[0]; // begining vertex of first half edge -> original begining vertex
tmpe[1].v[1] = E[e].v[1]; // ending vertex of second half edge -> original ending vertex
tmpv = E[e][id];
V.push_back(tmpv);
tmpe[0].v[1] = (unsigned)V.size() - 1; // ending vertex of first half edge -> new vertex
tmpe[1].v[0] = (unsigned)V.size() - 1; // begining vertex of second half edge -> new vertex
edge tmp(E[e]);
E[e] = tmpe[0]; // replace original edge by first half edge
E.push_back(tmpe[1]); // push second half edge to the last
V[V.size() - 1].e[1].push_back(e); // push first half edge to the incoming of new vertex
V[V.size() - 1].e[0].push_back((unsigned)E.size() - 1); // push second half edge to the outgoing of new vertex
for(unsigned i = 0; i < V[tmp.v[1]].e[1].size(); i++) // find the incoming edge of original ending vertex
if(V[tmp.v[1]].e[1][i] == e)
|
30b20d4f
Jiaming Guo
make it render be...
|
878
|
V[tmp.v[1]].e[1][i] = (unsigned)E.size() - 1; // set to new edge
|
c72184d1
Jiaming Guo
add many function...
|
879
880
881
|
}
}
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
882
|
|
c72184d1
Jiaming Guo
add many function...
|
883
884
885
886
|
/// This function compares two splitted networks and yields a mapping relationship between them according to NN
/// @param B is the network that the current network is going to map to
/// @param C is the mapping relationship: C[e1] = _e1 means e1 edge in current network is mapping the _e1 edge in B
/// @param device is the device that user want to use
|
6b317c71
Jiaming Guo
add function to r...
|
887
|
void mapping(stim::network<T> B, std::vector<unsigned> &C, int device, float threshold){
|
c72184d1
Jiaming Guo
add many function...
|
888
889
|
stim::network<T> A; //generate a network storing the result of the comparison
A = (*this);
|
797f8ab0
David Mayerich
cleaned up the st...
|
890
|
|
c72184d1
Jiaming Guo
add many function...
|
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
|
size_t n = A.E.size(); // the number of edges in A
size_t NB = B.E.size(); // the number of edges in B
C.resize(A.E.size());
T *c; // centerline (array of double pointers) - points on kdtree must be double
size_t n_data = B.total_points(); // set the number of points
c = (T*) malloc(sizeof(T) * n_data * 3);
unsigned t = 0;
for(unsigned e = 0; e < NB; e++){ // for each edge in the network
for(unsigned p = 0; p < B.E[e].size(); p++){ // for each point in the edge
for(unsigned d = 0; d < 3; d++){ // for each coordinate
c[t * 3 + d] = B.E[e][p][d];
}
t++;
}
}
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
910
|
|
c72184d1
Jiaming Guo
add many function...
|
911
912
913
914
915
916
917
918
919
|
//generate a KD-tree for network A
//float metric = 0.0; // initialize metric to be returned after comparing the network
size_t MaxTreeLevels = 3; // max tree level
#ifdef __CUDACC__
cudaSetDevice(device);
stim::kdtree<T, 3> kdt; // initialize a pointer to a kd tree
kdt.create(c, n_data, MaxTreeLevels); // build a KD tree
|
797f8ab0
David Mayerich
cleaned up the st...
|
920
|
|
c72184d1
Jiaming Guo
add many function...
|
921
|
for(unsigned e = 0; e < n; e++){ //for each edge in A
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
922
|
//size_t errormag_id = A.E[e].nmags() - 1; //get the id for the new magnitude
|
c72184d1
Jiaming Guo
add many function...
|
923
924
925
926
|
//pre-judge to get rid of impossibly mapping edges
T M = 0;
for(unsigned p = 0; p < A.E[e].size(); p++)
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
927
|
M += A.E[e].r(p);
|
c72184d1
Jiaming Guo
add many function...
|
928
|
M = M / A.E[e].size();
|
6b317c71
Jiaming Guo
add function to r...
|
929
|
if(M > threshold)
|
c72184d1
Jiaming Guo
add many function...
|
930
931
|
C[e] = (unsigned)-1; //set the nearest edge of impossibly mapping edges to maximum of unsigned
else{
|
c9712fb4
Jiaming Guo
fix minor error w...
|
932
|
T* queryPt = new T[3];
|
c72184d1
Jiaming Guo
add many function...
|
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
|
T* dists = new T[1];
size_t* nnIdx = new size_t[1];
stim2array(queryPt, A.E[e][A.E[e].size()/2]);
kdt.search(queryPt, 1, nnIdx, dists);
unsigned id = 0; //mapping edge's idx
size_t num = 0; //total number of points before #th edge
for(unsigned i = 0; i < NB; i++){
num += B.E[i].size();
if(nnIdx[0] < num){
C[e] = id;
break;
}
id++;
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
949
950
|
}
}
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
951
|
#else
|
c72184d1
Jiaming Guo
add many function...
|
952
|
stim::kdtree<T, 3> kdt;
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
953
954
|
kdt.create(c, n_data, MaxTreeLevels);
T *dists = new T[1]; // near neighbor distances
|
fcd2eb7c
David Mayerich
added support for...
|
955
|
size_t *nnIdx = new size_t[1]; // near neighbor indices // allocate near neigh indices
|
797f8ab0
David Mayerich
cleaned up the st...
|
956
|
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
957
|
stim::vec3<T> p0, p1;
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
958
|
T* queryPt = new T[3];
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
959
|
|
c72184d1
Jiaming Guo
add many function...
|
960
961
|
for(unsigned e = 0; e < R.E.size(); e++){ // for each edge in A
T M; // the sum of metrics of current edge
|
c72184d1
Jiaming Guo
add many function...
|
962
|
for(unsigned p = 0; p < R.E[e].size(); p++)
|
2b28db3e
Jiaming Guo
better render
|
963
|
M += A.E[e].r(p);
|
c72184d1
Jiaming Guo
add many function...
|
964
|
M = M / A.E[e].size();
|
6b317c71
Jiaming Guo
add function to r...
|
965
|
if(M > threshold)
|
c72184d1
Jiaming Guo
add many function...
|
966
967
968
|
C[e] = (unsigned)-1;
else{ // if it should have corresponding edge in B, then...
p1 = R.E[e][R.E[e].size()/2];
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
969
|
stim2array(queryPt, p1);
|
c72184d1
Jiaming Guo
add many function...
|
970
971
972
973
974
975
976
977
978
979
980
981
|
kdt.cpu_search(queryPt, 1, nnIdx, dists); // search the tree
unsigned id = 0; //mapping edge's idx
size_t num = 0; //total number of points before #th edge
for(unsigned i = 0; i < NB; i++){
num += B.E[i].size();
if(nnIdx[0] < num){
C[e] = id;
break;
}
id++;
}
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
982
983
984
|
}
}
#endif
|
3800c27f
David Mayerich
added code to sub...
|
985
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
986
|
|
b3a38641
David Mayerich
added the ability...
|
987
|
/// Returns the number of magnitude values stored in each edge. This should be uniform across the network.
|
0d0ef1a9
David Mayerich
Adapted classes t...
|
988
989
990
|
//unsigned nmags(){
// return E[0].nmags();
//}
|
10b95d6e
pranathivemuri
load text file to...
|
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
|
// split a string in text by the character sep
stim::vec<T> split(std::string &text, char sep)
{
stim::vec<T> tokens;
std::size_t start = 0, end = 0;
while ((end = text.find(sep, start)) != std::string::npos) {
tokens.push_back(atof(text.substr(start, end - start).c_str()));
start = end + 1;
}
tokens.push_back(atof(text.substr(start).c_str()));
return tokens;
}
// load a network in text file to a network class
void load_txt(std::string filename)
{
std::vector <std::string> file_contents;
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
1007
|
std::ifstream file(filename.c_str());
|
10b95d6e
pranathivemuri
load text file to...
|
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
|
std::string line;
std::vector<unsigned> id2vert; //this list stores the vertex ID associated with each network vertex
//for each line in the text file, store them as strings in file_contents
while (std::getline(file, line))
{
std::stringstream ss(line);
file_contents.push_back(ss.str());
}
unsigned int numEdges = atoi(file_contents[0].c_str()); //number of edges in the network
unsigned int I = atoi(file_contents[1].c_str()) ; //calculate the number of points3d on the first edge
unsigned int count = 1; unsigned int k = 2; // count is global counter through the file contents, k is for the vertices on the edges
// for each edge in the network.
for (unsigned int i = 0; i < numEdges; i ++ )
{
// pre allocate a position vector p with number of points3d on the edge p
std::vector< stim::vec<T> > p(0, I);
// for each point on the nth edge
for (unsigned int j = k; j < I + k; j++)
{
// split the points3d of floats with separator space and form a float3 position vector out of them
p.push_back(split(file_contents[j], ' '));
}
count += p.size() + 1; // increment count to point at the next edge in the network
I = atoi(file_contents[count].c_str()); // read in the points3d at the next edge and convert it to an integer
k = count + 1;
edge new_edge = p; // create an edge with a vector of points3d on the edge
E.push_back(new_edge); // push the edge into the network
}
unsigned int numVertices = atoi(file_contents[count].c_str()); // this line in the text file gives the number of distinct vertices
count = count + 1; // this line of text file gives the first verrtex
// push each vertex into V
for (unsigned int i = 0; i < numVertices; i ++)
{
vertex new_vertex = split(file_contents[count], ' ');
V.push_back(new_vertex);
count += atoi(file_contents[count + 1].c_str()) + 2; // Skip number of edge ids + 2 to point to the next vertex
}
} // end load_txt function
|
b3a38641
David Mayerich
added the ability...
|
1046
|
|
abce2443
pranathivemuri
average branching...
|
1047
1048
1049
1050
1051
1052
1053
1054
1055
|
// strTxt returns a string of edges
std::string
strTxt(std::vector< stim::vec<T> > p)
{
std::stringstream ss;
std::stringstream oss;
for(unsigned int i = 0; i < p.size(); i++){
ss.str(std::string());
for(unsigned int d = 0; d < 3; d++){
|
9f5c0d4a
Pavel Govyadinov
edits to make net...
|
1056
|
ss<<p[i][d];
|
abce2443
pranathivemuri
average branching...
|
1057
|
}
|
8b7d6f9a
David Mayerich
light modificatio...
|
1058
|
ss << "\n";
|
abce2443
pranathivemuri
average branching...
|
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
|
}
return ss.str();
}
// removes specified character from string
void removeCharsFromString(std::string &str, char* charsToRemove ) {
for ( unsigned int i = 0; i < strlen(charsToRemove); ++i ) {
str.erase( remove(str.begin(), str.end(), charsToRemove[i]), str.end() );
}
}
//exports network to txt file
void
to_txt(std::string filename)
{
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
1072
1073
|
std::ofstream ofs(filename.c_str(), std::ofstream::out | std::ofstream::app);
//int num;
|
abce2443
pranathivemuri
average branching...
|
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
|
ofs << (E.size()).str() << "\n";
for(unsigned int i = 0; i < E.size(); i++)
{
std::string str;
ofs << (E[i].size()).str() << "\n";
str = E[i].strTxt();
ofs << str << "\n";
}
for(int i = 0; i < V.size(); i++)
{
std::string str;
str = V[i].str();
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
1086
1087
|
char temp[4] = "[],";
removeCharsFromString(str, temp);
|
abce2443
pranathivemuri
average branching...
|
1088
1089
1090
1091
|
ofs << str << "\n";
}
ofs.close();
}
|
7f27eafa
David Mayerich
simplified the st...
|
1092
1093
|
}; //end stim::network class
}; //end stim namespace
|
c72184d1
Jiaming Guo
add many function...
|
1094
|
#endif
|