Algorithm 3 Non-Maximum Suppression

Input:

Bounding boxes$B=\{b_1,\dots ,b_{200}\}$, $b_i\in R^4$; $N_t$

$Scores=\left\{s_1,\dots ,s_{200}\right\}$, $s_i\in R^1;$

Output:

Bounding boxes $D,score S$;

1: function $NMS\left(B,S,N_t\right)$

2: $D\leftarrow${ }

3: while $B \# empty$ do

4:    $m\leftarrow argmax\left(S\right)$

5:    $M\leftarrow b_m$:

6:    $D\leftarrow D\cup M$:

7:    $B\leftarrow B-M$:

8:    for $b_i in B$ do

9:        if IoU$\left(M,b_i\right)>N_t$ then

10:            $B\leftarrow B-b_i$:

11:            $S\leftarrow S-S_i$:

12:        end if

13:    end for

14: end while

15: return $D,S$

16: end function