deep_sort.iou_matching Namespace Reference

Functions
def	iou (bbox, candidates)
def	iou_cost (tracks, detections, track_indices=None, detection_indices=None)

Function Documentation

def deep_sort.iou_matching.iou	(		bbox,
			candidates
	)

Computer intersection over union.

Parameters
----------
bbox : ndarray
    A bounding box in format `(top left x, top left y, width, height)`.
candidates : ndarray
    A matrix of candidate bounding boxes (one per row) in the same format
    as `bbox`.

Returns
-------
ndarray
    The intersection over union in [0, 1] between the `bbox` and each
    candidate. A higher score means a larger fraction of the `bbox` is
    occluded by the candidate.

Definition at line 7 of file iou_matching.py.

def deep_sort.iou_matching.iou_cost	(		tracks,
			detections,
			track_indices = None,
			detection_indices = None
	)

An intersection over union distance metric.

Parameters
----------
tracks : List[deep_sort.track.Track]
    A list of tracks.
detections : List[deep_sort.detection.Detection]
    A list of detections.
track_indices : Optional[List[int]]
    A list of indices to tracks that should be matched. Defaults to
    all `tracks`.
detection_indices : Optional[List[int]]
    A list of indices to detections that should be matched. Defaults
    to all `detections`.

Returns
-------
ndarray
    Returns a cost matrix of shape
    len(track_indices), len(detection_indices) where entry (i, j) is
    `1 - iou(tracks[track_indices[i]], detections[detection_indices[j]])`.

Definition at line 43 of file iou_matching.py.