/
connectivity_tumor.cpp
180 lines (142 loc) · 4.57 KB
/
connectivity_tumor.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
#include "connectivity_tumor.h"
#include <iostream>
namespace connectivity{
Mat* Mask=NULL;
int dim3=-1;
int dim2=-1;
int dim1=-1;
typedef struct islandPoints {
Point3i featurePoint;//岛屿的特征点
int islandVolume;//岛屿的体积
std::vector<Point3i> pointsInIsland;
} islandPoints;
//得到单个连通分支
void GetIsland(Point3i& startPoint,islandPoints& island,Mat * ImageFloodFill)
{
island.pointsInIsland.clear();
island.featurePoint=startPoint;
Point3i Seed;
Seed=startPoint;
if (Mask[Seed.z].at<uchar>(Seed.y,Seed.x)==0
|| Seed.z<0
||Seed.z>dim3){
std::cout<<"请选择点！"<<std::endl;
}
std::vector<Point3i> FloodFillQueue;
Point3i pointTmp;//用于储存点的中间变量
Point3i pointToPush;
int xMax=dim1;
int yMax=dim2;
int zMin=0;
int zMax=dim3;
FloodFillQueue.push_back(Seed);
while(!FloodFillQueue.empty())
{
pointTmp=FloodFillQueue.back();//传回最后一个数据，不检查这个数据是否存在。
FloodFillQueue.pop_back();//删除最后一个数据
//
if (Mask[pointTmp.z].at<uchar>(pointTmp.y,pointTmp.x)==1
&& ImageFloodFill[pointTmp.z].at<uchar>(pointTmp.y,pointTmp.x) == 0
){
ImageFloodFill[pointTmp.z].at<uchar>(pointTmp.y,pointTmp.x)=1;
island.pointsInIsland.push_back(pointTmp);
pointToPush=pointTmp;
pointToPush.x--;//-1
if (pointToPush.x>=0 &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.x+=2;//+1
if (pointToPush.x<xMax &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.x--;//归0
pointToPush.y--;//-1
if (pointToPush.y>=0 &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.y+=2;//+1
if (pointToPush.y<yMax &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.y--;//归0
pointToPush.z--;//-1
if (pointToPush.z>=zMin &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.z+=2;//+1
if (pointToPush.z<zMax &&
ImageFloodFill[pointToPush.z].at<uchar>(pointToPush.y,pointToPush.x)==0 ){
FloodFillQueue.push_back(pointToPush);}
pointToPush.z--;//归0
}
}//end while
island.islandVolume=island.pointsInIsland.size();
}
//得到所有的连通分支
void ComputeConnectedParts(_in_ Mat * Mask1,_in_ int dims1,_in_ int dims2,_in_ int dims3,_out_ vector<vector<Point3i> >& connectedMap )
{
connectedMap.clear();
//std::cout<<"hahhahah"<<dims1<<std::endl;
dim1=dims1;
dim2=dims2;
dim3=dims3;//这个地方好像没有必要
Mask=new Mat[dim3];
for (int i=0;i<dim3;i++)
{
Mask[i].create(dim2,dim1,CV_8UC1);
Mask[i].setTo(Scalar(0));
}
for(int k=0;k<dim3;k++)
{
for(int j=0;j<dim2;j++)
{
for(int i=0;i<dim1;i++)
{
Mask[k].at<uchar>(j,i)=Mask1[k].at<uchar>(j,i);
}
}
}
Mat* FloodFillTmp=new Mat[dim3];
for (int i=0;i<dim3;i++)
{
FloodFillTmp[i].create(dim2,dim1,CV_8UC1);
FloodFillTmp[i].setTo(Scalar(0));
}
for (int z=0;z<dim3;z++)
{
for (int y=0;y<dim2;y++)
{
for (int x=0;x<dim1;x++)
{
if (Mask[z].at<uchar>(y,x)>0)
{
islandPoints myIslandPoints;
Point3i point_tmp(x,y,z);
connectivity::GetIsland(point_tmp,myIslandPoints,FloodFillTmp);//注意这边(x,y)是矩阵坐标，换成点是(y,x)
for (int k=0;k<myIslandPoints.islandVolume;k++)
{
Mask[myIslandPoints.pointsInIsland[k].z].at<uchar>
(myIslandPoints.pointsInIsland[k].y,myIslandPoints.pointsInIsland[k].x)=0;
}
vector<Point3i> newPart;
newPart.clear();
for ( unsigned int i=0;i<myIslandPoints.pointsInIsland.size();i++)
{
newPart.push_back(myIslandPoints.pointsInIsland[i]);
}
newPart.resize(newPart.size());
connectedMap.push_back(newPart);
for (int k=0;k<myIslandPoints.islandVolume;k++)
{
FloodFillTmp[myIslandPoints.pointsInIsland[k].z].at<uchar>
(myIslandPoints.pointsInIsland[k].y,myIslandPoints.pointsInIsland[k].x)=0;
}
}
}
}
}
delete [] FloodFillTmp;
std::cout<<"In Total We Have "<<connectedMap.size()<<" Parts"<<std::endl;
//Mask=NULL;
}
}