Skip to content

Instantly share code, notes, and snippets.

@woolpeeker
Created December 15, 2021 02:20
Show Gist options
  • Save woolpeeker/d933c3877b0e29140f54bddbebbe737f to your computer and use it in GitHub Desktop.
Save woolpeeker/d933c3877b0e29140f54bddbebbe737f to your computer and use it in GitHub Desktop.
nms
# Non_maximum_suppression
import numpy as np
def nms(dets, scores, thresh):
'''
dets is a numpy array : num_dets, 4
scores ia nump array : num_dets,
'''
x1 = dets[:, 0]
y1 = dets[:, 1]
x2 = dets[:, 2]
y2 = dets[:, 3]
areas = (x2 - x1 + 1) * (y2 - y1 + 1)
order = scores.argsort()[::-1] # get boxes with more ious first
keep = []
while order.size > 0:
i = order[0] # pick maxmum iou box
keep.append(i)
xx1 = np.maximum(x1[i], x1[order[1:]])
yy1 = np.maximum(y1[i], y1[order[1:]])
xx2 = np.minimum(x2[i], x2[order[1:]])
yy2 = np.minimum(y2[i], y2[order[1:]])
w = np.maximum(0.0, xx2 - xx1 + 1) # maximum width
h = np.maximum(0.0, yy2 - yy1 + 1) # maxiumum height
inter = w * h
ovr = inter / (areas[i] + areas[order[1:]] - inter)
inds = np.where(ovr <= thresh)[0]
order = order[inds + 1]
return keep
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment