Algorithm 1: The Non-Maximum Suppression algorithm

1 While $\mathbf{B}\ne empty$ 2 $m\leftarrow argmax\mathbf{S}$ 3 $\mathbf{M}\leftarrow b_m$ 4 $\mathbf{D}\leftarrow \mathbf{D}\cup \mathbf{M};\mathbf{B}\leftarrow \mathbf{B}-\mathbf{M}$ 5 For $b_i\in \mathbf{B}$ 6 If $iou\left(M,b_i\right)$ 7 $\mathbf{B}\leftarrow \mathbf{B}-b_i;\mathbf{S}\leftarrow \mathbf{S}-s_i$