stricter edge selsection, but there must must be a rule that the line must not deviate a couple degrees from detected when fitting to edges

handcrafted_solution.py

@@ -109,20 +109,20 @@ def get_vertices_and_edges_from_segmentation(gest_seg_np, edge_th=50.0):
 
     apex_pts = np.concatenate([apex_centroids, eave_end_point_centroids])
 
-    vertex_mask = np.zeros_like(apex_mask)
-    for i in apex_centroids:
-        cv2.circle(vertex_mask, np.round(i).astype(np.uint32), 20, (255,), 40, -1)
-    for i in eave_end_point_centroids:
-        cv2.circle(vertex_mask, np.round(i).astype(np.uint32), 15, (255,), 30, -1)
-    vertex_mask = np.bitwise_not(vertex_mask)
-
-    scale = 4
+    # vertex_mask = np.zeros_like(apex_mask)
+    # for i in apex_centroids:
+    #     cv2.circle(vertex_mask, np.round(i).astype(np.uint32), 20, (255,), 40, -1)
+    # for i in eave_end_point_centroids:
+    #     cv2.circle(vertex_mask, np.round(i).astype(np.uint32), 15, (255,), 30, -1)
+    # vertex_mask = np.bitwise_not(vertex_mask)
+
+    scale = 2
     vertex_size = np.zeros(apex_pts.shape[0])
     for i, coords in enumerate(apex_pts):
-        coords = np.round(coords).astype(np.uint32)
+        # coords = np.round(coords).astype(np.uint32)
         radius = 25#np.clip(int(max_depth//2 + depth_np[coords[1], coords[0]]), 10, 30)#int(np.clip(max_depth - depth_np[coords[1], coords[0]], 10, 20))
         vertex_size[i] = (scale*radius) ** 2 # because we are using squared distances
-        cv2.circle(vertex_mask, coords, radius - 5, (255, ), 2 * (radius - 5), -1)
+        # cv2.circle(vertex_mask, coords, radius - 5, (255, ), 2 * (radius - 5), -1)
     # vertex_size *= scale
     for edge_class in ['eave', 'ridge', 'rake', 'valley', 'flashing', 'step_flashing']:
         if len(apex_pts) < 2: