Repository navigation
Expand file tree
/
Copy pathParser.cpp
More file actions
271 lines (180 loc) · 5.88 KB
/
Copy pathParser.cpp
File metadata and controls
271 lines (180 loc) · 5.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
#include "Parser.h"
using namespace std;
Parser::Parser(vector <vector<Pixel> > pic) {
picture=pic;
//resize bw
BWArray.resize(pic.size(),vector<Pixel>(pic[0].size(),Pixel()));
makePupilBW();
}
void Parser::makePupilBW(){
for (int i = 0; i< picture.size(); i++) {
for (int j = 0; j < picture[0].size(); j++) {
if(picture[i][j].isPrettyBlack()){
BWArray[i][j].makeBlack();
}
else{
BWArray[i][j].makeWhite();
}
}
}
}
vector<int> Parser::findPupil() {
vector<int> coordinates;
//weighted center vector, may not need to do this
vector<vector<int> > a;
//change this for pupil circularity
double varianceInRadiusValue=.04;
//change this for pupil size
double varianceInSize = .05;
//minumim circularity
varianceInRadius = varianceInRadiusValue*BWArray.size();
//minimum size of pupil
minRadius = (int) ((double)varianceInSize*((double)BWArray.size()/2));
int saveI = 0;
int saveJ = 0;
//cout<< "finding pupil" << endl;
vector <int> radii;
for (int i = 0; i < BWArray.size(); i++) {
for (int j = 0; j < BWArray[0].size(); j++) {
if (BWArray[i][j].isActuallyBlack()) {
radii = getRadiusVector(i, j);
//cout<< "is circular " << isCircularEnough(radii) << " is it largest? " << isLargestRadius(radii) << " and is it large enough ? " << isLargeEnough(radii) << endl;
if(isCircularEnough(radii) && isLargestRadius(radii) && isLargeEnough(radii)){
saveI=i;
saveJ=j;
}
}
}
}
cout<< "min radius is " << minRadius<< endl;
cout<< "largestPupilRadius is " << largestPupilRadius<< endl;
cout<< "I is " << saveI << endl;
cout<< "J is " << saveJ << endl;
if (largestPupilRadius<minRadius) {
cout<< "error Pupil not large enough"<< endl;
}
//could be reversed?
coordinates.push_back(saveI);
coordinates.push_back(saveJ);
pupilJ=saveJ;
pupilI=saveI;
//needs to find a circle by some predefined contingincies depending on the width and heigh of image. Basically, image needs to be certain size and the eye must be close enough
return coordinates;
}
int Parser::getUpRadius(int i, int j){
int radCounter=0;
for (; BWArray[i][j].isActuallyBlack() && i > 0; i--) {
radCounter++;
//cout<< "radcounter = "<<radCounter<< endl;
}
return radCounter;
}
int Parser::getDownRadius(int i, int j){
int radCounter=0;
for (; BWArray[i][j].isActuallyBlack(); i++) {
radCounter++;
}
return radCounter;
}
int Parser::getRightRadius(int i, int j){
int radCounter=0;
for (; BWArray[i][j].isActuallyBlack(); j++) {
radCounter++;
}
return radCounter;
}
int Parser::getLeftRadius(int i, int j){
int radCounter=0;
for (; BWArray[i][j].isActuallyBlack(); j--) {
radCounter++;
}
return radCounter;
}
vector<int> Parser::getRadiusVector(int i, int j){
vector<int> a;
//you dont have to use RightRadiusm
int radiusToAdd = getUpRadius(i, j);
//cout<< "radius to add = " << radiusToAdd<< endl;
a.push_back(radiusToAdd);
radiusToAdd = getDownRadius(i, j);
a.push_back(radiusToAdd);
radiusToAdd = getLeftRadius(i, j);
a.push_back(radiusToAdd);
radiusToAdd = getRightRadius(i, j);
a.push_back(radiusToAdd);
return a;
}
/**
Largest Radius returns if the value is the largest radius
*/
bool Parser::isLargestRadius(vector<int> radii){
int r = getAvg(radii);
if( r >= largestPupilRadius){
largestPupilRadius = r;
return true;
}
return false;
}
/**
checks if all the radii are more than the minimum pupil size
*/
bool Parser::isLargeEnough(vector<int> radii){
for (int i = 0; i<radii.size(); i++) {
if( i > minRadius)
return false;
}
return true;
}
bool Parser::isCircularEnough(vector<int> radii){
for (int i = 0; i+1 < radii.size() ; i++) {
if(abs(radii[i]-radii[i+1]) > varianceInRadius)
return false;
}
return true;
}
int Parser::getAvg(vector<int> radii){
int sum=0;
int i=0;
for(; i < radii.size(); i++){
sum+=radii[i];
}
return (int)(((double)sum/(double)i));
}
vector<int> Parser::getWeightedCenter(vector<vector<int> > b, int bound){
//error catch more than inner vector of 3 length
//inner vector should be <number of blacks, j>
int heightCenter = 0;
int widthCenter=0;
//follow algorithm on boogie board
int topSum = 0;
int bottomSum = 0;
for (int i = 0; i < b.size(); i++) {
for (int j = 0; j < b[0].size(); j++) {
topSum +=( b[i][0] * b[i][1] );
bottomSum+= b[i][0];
}
}
heightCenter= (int) (((double)topSum) / ((double)bottomSum));
widthCenter= b[heightCenter][0]/2+bound;
vector<int> a;
a[0]=heightCenter;
a[1]=widthCenter;
return a;
}
int Parser::getLeftEdgeCoordinates(){
int j = pupilJ;
for(; BWArray[pupilI][j].isActuallyBlack(); j--){
}
cout<< "left edge j = " << j<< endl;
return j;
}
vector<Pixel> Parser::getIrisArray() {
//Add a method to this that adjusts brightness based on pupil and iris size (while loop until correct iris size);
vector<Pixel> array;
findPupil();
cout<< " getLeftEdgeCoordinates is " << getLeftEdgeCoordinates() << endl;
for(int i = getLeftEdgeCoordinates(); !picture[pupilI][i].isPrettySclera(); i--){
array.push_back(picture[pupilI][i]);
}
return array;
}