Input: Kernel predictions $Z=\left\{Z_1,Z_2,\cdots ,Z_n\right\}$

Output: Bounding box list L

Function prediction (Z)

1) Initialize a set of zero arrays $M=\left\{M_1,M_2,\cdots ,M_n\right\}$

2) While $i=1$ to $n$ do

3) If $Z_i\left(p\right)>\delta$ Then $M_i\left(p\right)=True$ // $\delta$ is a threshold with value of 0.35

4) $M\leftarrow morphologyEx\left(M\right)$

5) $K\leftarrow scaleExpanded\left(M\right)$

6) $C,Label\leftarrow connectedComponents\left(K\right)$

7) $L\leftarrow minAreaRectByLabel\left(C,Label\right)$

8) return L