Update sample
Browse files
sample
CHANGED
|
@@ -1,16 +1,2 @@
|
|
| 1 |
-
|
| 2 |
-
|
| 3 |
-
|
| 4 |
-
Result:
|
| 5 |
-
|
| 6 |
-
per_face_accuracy: 0.6434782608695652
|
| 7 |
-
class_1_acc: 0.5977564102564102
|
| 8 |
-
class_2_acc: 0.928416485900217
|
| 9 |
-
class_3_acc: 0.37264150943396224
|
| 10 |
-
class_4_acc: 0.22641509433962265
|
| 11 |
-
class_5_acc: 0.6387832699619772
|
| 12 |
-
class_6_acc: 0.6504992867332382
|
| 13 |
-
class_7_acc: 0.5185185185185185
|
| 14 |
-
per_class_accuracy: 0.5618615107348494
|
| 15 |
-
IoU: 0.40692656027798174
|
| 16 |
-
[02:14, 03/03/2026] navinshrivatsan: accuracy - 64.34%
|
|
|
|
| 1 |
+
For each face/node in the graph, degree = how many edges are connected to it (outgoing edges in the directed representation).
|
| 2 |
+
In undirected data stored as bidirectional edges, this is effectively “number of adjacent faces.”
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|