IoU sits under every detection metric and every round of non-maximum suppression, and it has one bug that everybody writes once.
Implement iou_matrix(a, b). Given a of shape (n, 4) and b of shape (m, 4), where each row is a box [x1, y1, x2, y2] with x2 >= x1 and y2 >= y1, return the (n, m) array whose entry [i, j] is the intersection over union of a[i] and b[j].
You have read the opening. The rest is free with a Bezen account, and no card is needed.
Behind the sign-in