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>
|
58ee2b21
David Mayerich
incorporated stim...
|
13
|
#include <stim/visualization/cylinder.h>
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
14
|
#include <stim/structures/kdtree.cuh>
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
15
|
#include <stim/cuda/cudatools/timer.h>
|
7f27eafa
David Mayerich
simplified the st...
|
16
|
|
df036f4c
David Mayerich
added the network...
|
17
18
|
namespace stim{
|
7f27eafa
David Mayerich
simplified the st...
|
19
20
21
22
23
|
/** 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...
|
24
|
|
df036f4c
David Mayerich
added the network...
|
25
26
27
28
|
template<typename T>
class network{
|
7f27eafa
David Mayerich
simplified the st...
|
29
30
|
///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...
|
31
|
class edge : public cylinder<T>
|
7f27eafa
David Mayerich
simplified the st...
|
32
33
34
|
{
public:
unsigned v[2]; //unique id's designating the starting and ending
|
7c43b7f9
pranathivemuri
return resampled ...
|
35
|
// default constructor
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
36
37
|
edge() : cylinder<T>()
{
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
38
|
v[1] = (unsigned)(-1); v[0] = (unsigned)(-1);
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
39
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
40
|
/// Constructor - creates an edge from a list of points by calling the stim::fiber constructor
|
e376212f
David Mayerich
added support for...
|
41
|
|
3800c27f
David Mayerich
added code to sub...
|
42
|
///@param p is an array of positions in space
|
308a743c
David Mayerich
fixed class compa...
|
43
|
edge(std::vector< stim::vec3<T> > p) : cylinder<T>(p){}
|
3800c27f
David Mayerich
added code to sub...
|
44
45
|
/// Copy constructor creates an edge from a fiber
|
58ee2b21
David Mayerich
incorporated stim...
|
46
|
edge(stim::cylinder<T> f) : cylinder<T>(f) {}
|
3800c27f
David Mayerich
added code to sub...
|
47
48
49
|
/// Resamples an edge by calling the fiber resampling function
edge resample(T spacing){
|
58ee2b21
David Mayerich
incorporated stim...
|
50
|
edge e(cylinder<T>::resample(spacing)); //call the fiber->edge constructor
|
3800c27f
David Mayerich
added code to sub...
|
51
52
53
54
55
|
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...
|
56
|
|
7f27eafa
David Mayerich
simplified the st...
|
57
|
/// Output the edge information as a string
|
df036f4c
David Mayerich
added the network...
|
58
59
|
std::string str(){
std::stringstream ss;
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
60
|
ss<<"("<<cylinder<T>::size()<<")\tl = "<<this->length()<<"\t"<<v[0]<<"----"<<v[1];
|
df036f4c
David Mayerich
added the network...
|
61
62
|
return ss.str();
}
|
df036f4c
David Mayerich
added the network...
|
63
|
|
9c97e126
David Mayerich
added an axis-ali...
|
64
65
|
};
|
7f27eafa
David Mayerich
simplified the st...
|
66
|
///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...
|
67
|
class vertex : public stim::vec3<T>
|
7f27eafa
David Mayerich
simplified the st...
|
68
69
|
{
public:
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
70
71
72
|
//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...
|
73
74
|
//constructor takes a stim::vec
|
308a743c
David Mayerich
fixed class compa...
|
75
|
vertex(stim::vec3<T> p) : stim::vec3<T>(p){}
|
7f27eafa
David Mayerich
simplified the st...
|
76
77
78
79
|
/// Output the vertex information as a string
std::string str(){
std::stringstream ss;
|
308a743c
David Mayerich
fixed class compa...
|
80
|
ss<<"\t(x, y, z) = "<<stim::vec3<T>::str();
|
7f27eafa
David Mayerich
simplified the st...
|
81
82
83
84
85
86
87
88
89
90
91
|
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...
|
92
|
|
7f27eafa
David Mayerich
simplified the st...
|
93
|
return ss.str();
|
df036f4c
David Mayerich
added the network...
|
94
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
95
|
|
fe0c7539
pranathivemuri
added functions t...
|
96
|
|
df036f4c
David Mayerich
added the network...
|
97
98
|
};
|
9c97e126
David Mayerich
added an axis-ali...
|
99
|
protected:
|
df036f4c
David Mayerich
added the network...
|
100
|
|
7f27eafa
David Mayerich
simplified the st...
|
101
102
|
std::vector<edge> E; //list of edges
std::vector<vertex> V; //list of vertices.
|
9c97e126
David Mayerich
added an axis-ali...
|
103
104
|
public:
|
df036f4c
David Mayerich
added the network...
|
105
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
106
107
108
109
110
111
112
113
114
115
116
117
|
///default constructor
network()
{
}
///constructor with a file to load.
network(std::string fileLocation)
{
load_obj(fileLocation);
}
|
7f27eafa
David Mayerich
simplified the st...
|
118
119
120
|
///Returns the number of edges in the network.
unsigned int edges(){
return E.size();
|
df036f4c
David Mayerich
added the network...
|
121
122
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
123
124
125
|
///Returns the number of nodes in the network.
unsigned int vertices(){
return V.size();
|
df036f4c
David Mayerich
added the network...
|
126
127
|
}
|
87d0a1d2
David Mayerich
minor changes for...
|
128
129
130
|
//scale the network by some constant value
// I don't think these work??????
/*std::vector<vertex> operator*(T s){
|
fe0c7539
pranathivemuri
added functions t...
|
131
132
133
134
135
136
137
138
139
140
141
142
143
|
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...
|
144
|
}*/
|
fe0c7539
pranathivemuri
added functions t...
|
145
|
|
abce2443
pranathivemuri
average branching...
|
146
|
// Returns an average of branching index in the network
|
abce2443
pranathivemuri
average branching...
|
147
148
149
150
151
152
153
154
155
156
|
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...
|
157
|
// Returns number of branch points in thenetwork
|
15a53122
pranathivemuri
Added other simpl...
|
158
159
160
161
162
163
164
165
166
167
168
169
170
|
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...
|
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
|
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...
|
204
|
//Calculate Metrics---------------------------------------------------
|
fe0c7539
pranathivemuri
added functions t...
|
205
206
|
// Returns an average of fiber/edge lengths in the network
double Lengths(){
|
1b2858a2
David Mayerich
fixed some commen...
|
207
208
|
stim::vec<T> L;
double sumLength = 0;
|
fe0c7539
pranathivemuri
added functions t...
|
209
210
211
212
213
214
215
216
217
218
219
220
221
|
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...
|
222
223
224
225
226
|
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...
|
227
228
229
230
231
232
233
234
235
|
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...
|
236
237
238
|
return avg;
}
|
15a53122
pranathivemuri
Added other simpl...
|
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
// 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...
|
255
|
|
15a53122
pranathivemuri
Added other simpl...
|
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
|
// 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...
|
272
273
274
275
|
//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...
|
276
277
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
278
279
|
//load a network from an OBJ file
void load_obj(std::string filename){
|
e376212f
David Mayerich
added support for...
|
280
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
281
282
|
stim::obj<T> O; //create an OBJ object
O.load(filename); //load the OBJ file as an object
|
df036f4c
David Mayerich
added the network...
|
283
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
284
|
std::vector<unsigned> id2vert; //this list stores the OBJ vertex ID associated with each network vertex
|
df036f4c
David Mayerich
added the network...
|
285
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
286
|
unsigned i[2]; //temporary, IDs associated with the first and last points in an OBJ line
|
df036f4c
David Mayerich
added the network...
|
287
|
|
7f27eafa
David Mayerich
simplified the st...
|
288
289
|
//for each line in the OBJ object
for(unsigned int l = 1; l <= O.numL(); l++){
|
df036f4c
David Mayerich
added the network...
|
290
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
291
|
std::vector< stim::vec<T> > c; //allocate an array of points for the vessel centerline
|
7f27eafa
David Mayerich
simplified the st...
|
292
|
O.getLine(l, c); //get the fiber centerline
|
df036f4c
David Mayerich
added the network...
|
293
|
|
308a743c
David Mayerich
fixed class compa...
|
294
295
296
297
|
std::vector< stim::vec3<T> > c3(c.size());
for(size_t j = 0; j < c.size(); j++)
c3[j] = c[j];
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
298
299
300
301
302
|
// 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...
|
303
|
|
7f27eafa
David Mayerich
simplified the st...
|
304
|
//get the first and last vertex IDs for the line
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
305
|
std::vector< unsigned > id; //create an array to store the centerline point IDs
|
9c97e126
David Mayerich
added an axis-ali...
|
306
|
O.getLinei(l, id); //get the list of point IDs for the line
|
7f27eafa
David Mayerich
simplified the st...
|
307
308
|
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...
|
309
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
310
|
std::vector<unsigned>::iterator it; //create an iterator for searching the id2vert array
|
7f27eafa
David Mayerich
simplified the st...
|
311
|
unsigned it_idx; //create an integer for the id2vert entry index
|
df036f4c
David Mayerich
added the network...
|
312
|
|
7f27eafa
David Mayerich
simplified the st...
|
313
|
//find out if the nodes for this fiber have already been created
|
7f27eafa
David Mayerich
simplified the st...
|
314
|
it = find(id2vert.begin(), id2vert.end(), i[0]); //look for the first node
|
7f27eafa
David Mayerich
simplified the st...
|
315
|
if(it == id2vert.end()){ //if i[0] hasn't already been used
|
4df9ec0e
pranathivemuri
compare networks ...
|
316
|
vertex new_vertex = new_edge[0]; //create a new vertex, assign it a position
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
317
318
319
320
|
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...
|
321
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
322
|
else{ //if the vertex already exists
|
15a53122
pranathivemuri
Added other simpl...
|
323
|
it_idx = std::distance(id2vert.begin(), it);
|
df480014
pranathivemuri
added in comments...
|
324
|
V[it_idx].e[0].push_back(E.size()); //add the current edge as outgoing
|
3800c27f
David Mayerich
added code to sub...
|
325
|
new_edge.v[0] = it_idx;
|
df036f4c
David Mayerich
added the network...
|
326
327
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
328
|
it = find(id2vert.begin(), id2vert.end(), i[1]); //look for the second ID
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
329
330
331
|
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...
|
332
|
new_edge.v[1] = V.size(); //add the new vertex to the edge
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
333
334
|
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...
|
335
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
336
|
else{ //if the vertex already exists
|
15a53122
pranathivemuri
Added other simpl...
|
337
|
it_idx = std::distance(id2vert.begin(), it);
|
df480014
pranathivemuri
added in comments...
|
338
|
V[it_idx].e[1].push_back(E.size()); //add the current edge as incoming
|
3800c27f
David Mayerich
added code to sub...
|
339
|
new_edge.v[1] = it_idx;
|
df036f4c
David Mayerich
added the network...
|
340
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
341
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
342
|
E.push_back(new_edge); //push the edge to the list
|
df036f4c
David Mayerich
added the network...
|
343
|
|
df036f4c
David Mayerich
added the network...
|
344
|
}
|
e376212f
David Mayerich
added support for...
|
345
346
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
347
348
|
/// Output the network as a string
std::string str(){
|
e376212f
David Mayerich
added support for...
|
349
|
|
7f27eafa
David Mayerich
simplified the st...
|
350
351
352
353
|
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...
|
354
355
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
356
357
358
|
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...
|
359
360
|
}
|
7f27eafa
David Mayerich
simplified the st...
|
361
|
return ss.str();
|
df036f4c
David Mayerich
added the network...
|
362
|
}
|
3800c27f
David Mayerich
added code to sub...
|
363
364
|
/// This function resamples all fibers in a network given a desired minimum spacing
|
9c97e126
David Mayerich
added an axis-ali...
|
365
|
/// @param spacing is the minimum distance between two points on the network
|
3800c27f
David Mayerich
added code to sub...
|
366
|
stim::network<T> resample(T spacing){
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
367
368
|
stim::network<T> n; //create a new network that will be an exact copy, with resampled fibers
n.V = V; //copy all vertices
|
3800c27f
David Mayerich
added code to sub...
|
369
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
370
|
n.E.resize(edges()); //allocate space for the edge list
|
3800c27f
David Mayerich
added code to sub...
|
371
372
|
//copy all fibers, resampling them in the process
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
373
374
|
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...
|
375
376
|
}
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
377
|
return n; //return the resampled network
|
4df9ec0e
pranathivemuri
compare networks ...
|
378
379
380
|
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
381
|
|
9c97e126
David Mayerich
added an axis-ali...
|
382
|
/// Calculate the total number of points on all edges.
|
797f8ab0
David Mayerich
cleaned up the st...
|
383
384
385
386
|
unsigned total_points(){
unsigned n = 0;
for(unsigned e = 0; e < E.size(); e++)
n += E[e].size();
|
4df9ec0e
pranathivemuri
compare networks ...
|
387
|
return n;
|
797f8ab0
David Mayerich
cleaned up the st...
|
388
|
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
389
|
|
fcd2eb7c
David Mayerich
added support for...
|
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
|
//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++;
}
}
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
406
407
408
|
// gaussian function
float gaussianFunction(float x, float std=25){ return exp(-x/(2*std*std));} // by default std = 25
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
409
410
|
// convert vec3 to array
void stim2array(float *a, stim::vec3<T> b){
|
797f8ab0
David Mayerich
cleaned up the st...
|
411
412
413
414
415
|
a[0] = b[0];
a[1] = b[1];
a[2] = b[2];
}
|
9c97e126
David Mayerich
added an axis-ali...
|
416
417
418
419
|
/// 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 ...
|
420
421
422
|
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
|
9c97e126
David Mayerich
added an axis-ali...
|
423
|
M += E[e].integrate(m); //get the integrated magnitude
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
424
|
L += E[e].length(); //get the edge length
|
9c97e126
David Mayerich
added an axis-ali...
|
425
|
}
|
4df9ec0e
pranathivemuri
compare networks ...
|
426
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
427
|
return M / L; //return the average magnitude
|
9c97e126
David Mayerich
added an axis-ali...
|
428
429
430
431
432
433
|
}
/// This function compares two networks and returns the percentage of the current network that is missing from A.
/// @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
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
434
|
stim::network<T> compare(stim::network<T> A, float sigma, int device){
|
9c97e126
David Mayerich
added an axis-ali...
|
435
|
|
fcd2eb7c
David Mayerich
added support for...
|
436
437
|
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...
|
438
|
|
fcd2eb7c
David Mayerich
added support for...
|
439
|
T *c; // centerline (array of double pointers) - points on kdtree must be double
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
440
|
size_t n_data = A.total_points(); // set the number of points
|
fcd2eb7c
David Mayerich
added support for...
|
441
|
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...
|
442
|
|
797f8ab0
David Mayerich
cleaned up the st...
|
443
|
unsigned t = 0;
|
fcd2eb7c
David Mayerich
added support for...
|
444
445
|
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...
|
446
447
|
for(unsigned d = 0; d < 3; d++){ //for each coordinate
|
fcd2eb7c
David Mayerich
added support for...
|
448
|
c[t * 3 + d] = A.E[e][p][d]; //copy the point into the array c
|
4df9ec0e
pranathivemuri
compare networks ...
|
449
|
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
450
|
t++;
|
4df9ec0e
pranathivemuri
compare networks ...
|
451
|
}
|
797f8ab0
David Mayerich
cleaned up the st...
|
452
453
|
}
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
454
|
//generate a KD-tree for network A
|
fcd2eb7c
David Mayerich
added support for...
|
455
456
|
//float metric = 0.0; // initialize metric to be returned after comparing the network
size_t MaxTreeLevels = 3; // max tree level
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
457
458
459
460
461
|
#ifdef __CUDACC__
cudaSetDevice(device);
stim::cuda_kdtree<T, 3> kdt; // initialize a pointer to a kd tree
|
9c97e126
David Mayerich
added an axis-ali...
|
462
|
//compare each point in the current network to the field produced by A
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
463
464
|
kdt.create(c, n_data, MaxTreeLevels); // build a KD tree
T *dists = new T[1]; // near neighbor distances
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
465
|
size_t *nnIdx = new size_t[1]; // near neighbor indices // allocate near neigh indices
|
797f8ab0
David Mayerich
cleaned up the st...
|
466
|
|
308a743c
David Mayerich
fixed class compa...
|
467
|
stim::vec3<T> p0, p1;
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
468
|
T m1;
|
e8c9a82b
David Mayerich
fixed GCC errors ...
|
469
470
|
//float M = 0; //stores the total metric value
//float L = 0; //stores the total network length
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
471
|
T* queryPt = new T[3];
|
9c97e126
David Mayerich
added an axis-ali...
|
472
|
for(unsigned e = 0; e < R.E.size(); e++){ //for each edge in A
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
473
|
R.E[e].add_mag(0); //add a new magnitude for the metric
|
797f8ab0
David Mayerich
cleaned up the st...
|
474
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
475
|
for(unsigned p = 0; p < R.E[e].size(); p++){ //for each point in the edge
|
797f8ab0
David Mayerich
cleaned up the st...
|
476
|
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
477
|
p1 = R.E[e][p]; //get the next point in the edge
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
478
|
stim2array(queryPt, p1);
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
479
|
kdt.search(queryPt, 1, nnIdx, dists); //find the distance between A and the current network
|
fbbc07be
Jiaming Guo
replace ANN by kd...
|
480
|
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
481
|
m1 = 1.0f - gaussianFunction((T)dists[0], sigma); //calculate the metric value based on the distance
|
2e0f052a
Pavel Govyadinov
minor changes to ...
|
482
|
R.E[e].set_mag(m1, p, 1); //set the error for the second point in the segment
|
797f8ab0
David Mayerich
cleaned up the st...
|
483
|
|
797f8ab0
David Mayerich
cleaned up the st...
|
484
485
|
}
}
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
486
487
488
489
|
#else
stim::cpu_kdtree<T, 3> kdt;
kdt.create(c, n_data, MaxTreeLevels);
T *dists = new T[1]; // near neighbor distances
|
fcd2eb7c
David Mayerich
added support for...
|
490
|
size_t *nnIdx = new size_t[1]; // near neighbor indices // allocate near neigh indices
|
797f8ab0
David Mayerich
cleaned up the st...
|
491
|
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
492
493
494
|
stim::vec3<T> p0, p1;
T m1;
T* queryPt = new T[3];
|
fcd2eb7c
David Mayerich
added support for...
|
495
496
|
for(unsigned e = 0; e < R.E.size(); e++){ //for each edge in A
R.E[e].add_mag(0); //add a new magnitude for the metric
|
41100e51
Jiaming Guo
add cpu kdtree ve...
|
497
498
499
500
501
502
503
504
505
506
507
508
|
for(unsigned p = 0; p < R.E[e].size(); p++){ //for each point in the edge
p1 = R.E[e][p]; //get the next point in the edge
stim2array(queryPt, p1);
kdt.cpu_search(queryPt, 1, nnIdx, dists); //find the distance between A and the current network
m1 = 1.0f - gaussianFunction((T)dists[0], sigma); //calculate the metric value based on the distance
R.E[e].set_mag(m1, p, 1); //set the error for the second point in the segment
}
}
#endif
|
9c97e126
David Mayerich
added an axis-ali...
|
509
|
return R; //return the resulting network
|
3800c27f
David Mayerich
added code to sub...
|
510
|
}
|
9c97e126
David Mayerich
added an axis-ali...
|
511
|
|
b3a38641
David Mayerich
added the ability...
|
512
513
514
515
|
/// Returns the number of magnitude values stored in each edge. This should be uniform across the network.
unsigned nmags(){
return E[0].nmags();
}
|
10b95d6e
pranathivemuri
load text file to...
|
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
|
// 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 ...
|
532
|
std::ifstream file(filename.c_str());
|
10b95d6e
pranathivemuri
load text file to...
|
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
|
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...
|
571
|
|
abce2443
pranathivemuri
average branching...
|
572
573
574
575
576
577
578
579
580
|
// 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...
|
581
|
ss<<p[i][d];
|
abce2443
pranathivemuri
average branching...
|
582
|
}
|
8b7d6f9a
David Mayerich
light modificatio...
|
583
|
ss << "\n";
|
abce2443
pranathivemuri
average branching...
|
584
585
586
587
588
589
590
591
592
593
594
595
596
|
}
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 ...
|
597
598
|
std::ofstream ofs(filename.c_str(), std::ofstream::out | std::ofstream::app);
//int num;
|
abce2443
pranathivemuri
average branching...
|
599
600
601
602
603
604
605
606
607
608
609
610
|
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 ...
|
611
612
|
char temp[4] = "[],";
removeCharsFromString(str, temp);
|
abce2443
pranathivemuri
average branching...
|
613
614
615
616
|
ofs << str << "\n";
}
ofs.close();
}
|
7f27eafa
David Mayerich
simplified the st...
|
617
618
|
}; //end stim::network class
}; //end stim namespace
|
df036f4c
David Mayerich
added the network...
|
619
|
#endif
|