-
Notifications
You must be signed in to change notification settings - Fork 0
/
rectify.py
322 lines (244 loc) · 8.97 KB
/
rectify.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
import cv2
import numpy as np
import scipy.spatial.distance
import math
import utils
lista_titoli, lista_immagini, lista_stanze = utils.carica_lista_cvs()
def order_corners(corners):
p = []
sumx = corners[2][0][0] + corners[3][0][0] + corners[1][0][0] + corners[0][0][0]
sumy = corners[2][0][1] + corners[3][0][1] + corners[1][0][1] + corners[0][0][1]
medx = sumx / 4
medy = sumy / 4
for c in corners[:]:
# bottom left
if c[0][0] < medx and c[0][1] < medy:
bl = (c[0][0], c[0][1])
# bottom right
if c[0][0] > medx and c[0][1] < medy:
br = (c[0][0], c[0][1])
# top left
if c[0][0] < medx and c[0][1] > medy:
tl = (c[0][0], c[0][1])
# top right
if c[0][0] > medx and c[0][1] > medy:
tr = (c[0][0], c[0][1])
try:
p.append(bl)
p.append(br)
p.append(tl)
p.append(tr)
except UnboundLocalError:
return 0
return p
def rectify_image(rows, cols, img, p):
# image center
u0 = (cols) / 2.0
v0 = (rows) / 2.0
# widths and heights of the projected image
w1 = scipy.spatial.distance.euclidean(p[0], p[1])
w2 = scipy.spatial.distance.euclidean(p[2], p[3])
h1 = scipy.spatial.distance.euclidean(p[0], p[2])
h2 = scipy.spatial.distance.euclidean(p[1], p[3])
w = max(w1, w2)
h = max(h1, h2)
# visible aspect ratio
ar_vis = float(w) / float(h)
# make numpy arrays and append 1 for linear algebra
m1 = np.array((p[0][0], p[0][1], 1)).astype('float32')
m2 = np.array((p[1][0], p[1][1], 1)).astype('float32')
m3 = np.array((p[2][0], p[2][1], 1)).astype('float32')
m4 = np.array((p[3][0], p[3][1], 1)).astype('float32')
# calculate the focal disrance
k2 = np.dot(np.cross(m1, m4), m3) / np.dot(np.cross(m2, m4), m3)
k3 = np.dot(np.cross(m1, m4), m2) / np.dot(np.cross(m3, m4), m2)
n2 = k2 * m2 - m1
n3 = k3 * m3 - m1
n21 = n2[0]
n22 = n2[1]
n23 = n2[2]
n31 = n3[0]
n32 = n3[1]
n33 = n3[2]
# per evitare divisioni per 0
try:
f = math.sqrt(np.abs((1.0 / (n23 * n33)) * ((n21 * n31 - (n21 * n33 + n23 * n31) * u0 + n23 * n33 * u0 * u0) + (
n22 * n32 - (n22 * n33 + n23 * n32) * v0 + n23 * n33 * v0 * v0))))
A = np.array([[f, 0, u0], [0, f, v0], [0, 0, 1]]).astype('float32')
At = np.transpose(A)
Ati = np.linalg.inv(At)
Ai = np.linalg.inv(A)
# calculate the real aspect ratio
ar_real = math.sqrt(np.dot(np.dot(np.dot(n2, Ati), Ai), n2) / np.dot(np.dot(np.dot(n3, Ati), Ai), n3))
if ar_real < ar_vis:
W = int(w)
H = int(W / ar_real)
else:
H = int(h)
W = int(ar_real * H)
pts1 = np.array(p).astype('float32')
pts2 = np.float32([[0, 0], [W, 0], [0, H], [W, H]])
# project the image with the new w/h
M = cv2.getPerspectiveTransform(pts1, pts2)
dst = cv2.warpPerspective(img, M, (W, H))
except Exception:
return 0
return dst
def chekcWithSIFT(img1, img2, sx):
sift = cv2.xfeatures2d.SIFT_create()
# find the keypoints and descriptors with SIFT
kp1, des1 = sift.detectAndCompute(img1, None)
kp2, des2 = sift.detectAndCompute(img2, None)
FLANN_INDEX_KDTREE = 0
index_params = dict(algorithm=FLANN_INDEX_KDTREE, trees=5)
search_params = dict(checks=50)
flann = cv2.FlannBasedMatcher(index_params, search_params)
matches = flann.knnMatch(des1, des2, k=2)
ngood = 10
good = []
for m, n in matches:
if m.distance < 0.65 * n.distance:
good.append(m)
if len(good) > ngood:
good = sorted(good, key=lambda x: x.distance)
src_pts = np.float32([kp1[m.queryIdx].pt for m in good]).reshape(-1, 1, 2)
dst_pts = np.float32([kp2[m.trainIdx].pt for m in good]).reshape(-1, 1, 2)
if not sx:
M, mask = cv2.findHomography(dst_pts, src_pts, cv2.RANSAC, 50.0)
else:
M, mask = cv2.findHomography(src_pts, dst_pts, cv2.RANSAC, 50.0)
matchesMask = mask.ravel().tolist()
if M is None:
return False, 0, 0, 0, 0
score = 0
for i in good:
score += i.distance
return True, src_pts, dst_pts, good, M
else:
return False, 0, 0, 0, 0
def ORB(im1, im2):
# Initiate SIFT detector
orb = cv2.ORB_create()
# find the keypoints and descriptors with SIFT
kp1, des1 = orb.detectAndCompute(im1, None)
kp2, des2 = orb.detectAndCompute(im2, None)
# create BFMatcher object
bf = cv2.BFMatcher(cv2.NORM_HAMMING, crossCheck=True)
# Match descriptors.
if (des1 is None) or (des2 is None):
return False, 0, 0, 0, 100000
matches = bf.match(des1, des2)
# Sort them in the order of their distance.
matches = sorted(matches, key=lambda x: x.distance)
good = []
retkp1 = []
retkp2 = []
ngood = 10
for m in matches:
if m.distance < 45: # 40
good.append(m)
# Get the matching keypoints for each of the images
img1_idx = m.queryIdx
img2_idx = m.trainIdx
(x1, y1) = kp1[img1_idx].pt
(x2, y2) = kp2[img2_idx].pt
retkp1.append((x1, y1))
retkp2.append((x2, y2))
if len(good) >= ngood:
score = sum(x.distance for x in good[:ngood])
if score < 340: # 350
return True, good, retkp1, retkp2, score
else:
return False, 0, 0, 0, 100000
else:
return False, 0, 0, 0, 100000
def detectKeyPoints(img_rgb, sx):
min_score = 100000 # 100000
text = "quadro"
final_mat = 0
is_detected = False
final_room = "0"
temp = 0
for it in range(len(lista_immagini) - 1):
# Read the main image
titolo_quadro = lista_titoli[it + 1]
immage_template = "./template/" + lista_immagini[it + 1]
stanza = lista_stanze[it + 1]
template = cv2.imread(immage_template, 0) # 1 a colori
img_gray = cv2.cvtColor(img_rgb, cv2.COLOR_BGR2GRAY) # togli questa per settare a colori
detection_ORB, matches, ret_kp1, ret_kp2, score = ORB(img_gray, template)
if detection_ORB:
detection_SIFT, src_pts, dst_pts, good, M = chekcWithSIFT(img_gray, template, sx)
if score < min_score and detection_SIFT:
min_score = score
final_room = stanza
text = "{} - score: {}".format(titolo_quadro, int(score))
if not np.isscalar(M):
final_mat = M
is_detected = True
temp = (template.shape[1], template.shape[0])
if is_detected:
warped = cv2.warpPerspective(img_rgb, final_mat, temp)
return text, final_room, warped, min_score
return text, "0", 0, 100000
def hougesLinesAndCorner(image):
edges = cv2.Canny(image, 50, 150, apertureSize=3)
lines = cv2.HoughLines(edges, 1, np.pi / 180.0, 100, np.array([]), 0, 0)
out_line = np.zeros_like(image)
if lines is not None:
for line in lines:
rho, theta = line[0]
a = np.cos(theta)
b = np.sin(theta)
x0 = a * rho
y0 = b * rho
x1 = int(x0 + 1000 * (-b))
y1 = int(y0 + 1000 * (a))
x2 = int(x0 - 1000 * (-b))
y2 = int(y0 - 1000 * (a))
cv2.line(out_line, (x1, y1), (x2, y2), (255, 255, 255), 1)
corners = cv2.goodFeaturesToTrack(out_line, 4, 0.4, 80)
if corners is not None:
corners = np.int0(corners)
for i in corners:
x, y = i.ravel()
cv2.circle(out_line, (x, y), 3, 255, -1)
else:
corners = []
return corners
return corners
def determineOrientation(im):
blank = np.zeros_like(im)
corners = cv2.goodFeaturesToTrack(im, 4, 0.4, 80)
lista_punti_x = []
lista_punti_y = []
if corners is not None:
corners = np.int0(corners)
for i in corners:
x, y = i.ravel()
lista_punti_x.append(x)
lista_punti_y.append(y)
cv2.circle(blank, (x, y), 3, 255, -1)
if len(lista_punti_x) != 4 or len(lista_punti_y) != 4:
return True, False
lista_sx = []
lista_dx = []
# prendi punti piu a sx
a = lista_punti_x.index(min(lista_punti_x))
lista_sx.append((lista_punti_x[a], lista_punti_y[a]))
lista_punti_x.pop(a)
lista_punti_y.pop(a)
a = lista_punti_x.index(min(lista_punti_x))
lista_sx.append((lista_punti_x[a], lista_punti_y[a]))
# prendi punti piu a dx
a = lista_punti_x.index(max(lista_punti_x))
lista_dx.append((lista_punti_x[a], lista_punti_y[a]))
lista_punti_x.pop(a)
lista_punti_y.pop(a)
a = lista_punti_x.index(max(lista_punti_x))
lista_dx.append((lista_punti_x[a], lista_punti_y[a]))
sx = abs(lista_sx[0][1] - lista_sx[1][1])
dx = abs(lista_dx[0][1] - lista_dx[1][1])
if sx < dx:
return False, True
return True, True