Upload New File

data.py.txt

+"""
+As implemented in https://github.com/abewley/sort but with some modifications
+
+For each detected item, it computes the intersection over union (IOU) w.r.t. each tracked object. (IOU matrix)
+Then, it applies the Hungarian algorithm (via linear_assignment) to assign each det. item to the best possible
+
+            unmatched_detections.append(d)
+    
+    # Find lost tracklets
+    unmatched_trackers = []
+    for t, trk in enumerate(trackers):
+        if t not in matched_indices[:, 1]:
+            unmatched_trackers.append(t)
+
+    # Filter out matched with low IOU
+    matches = []
+    for m in matched_indices:
+        if iou_matrix[m[0], m[1]] < iou_threshold:
+            unmatched_detections.append(m[0])
+            unmatched_trackers.append(m[1])
+        else:
+            matches.append(m.reshape(1, 2))
+
+    if len(matches) == 0:
+        matches = np.empty((0, 2), dtype=int)
+    else:
+        matches = np.concatenate(matches, axis=0)
+
+    return matches, np.array(unmatched_detections), np.array(unmatched_trackers)
\ No newline at end of file