| Algorithm 1: Generalised Intersection over Union [24] |
| input: Two arbitrary convex shapes: A, B ⊆ S ∈ Rn output: GIoU 1 For A and B, find the smallest enclosing convex object C, where C ⊆ S ∈ Rn (1) (2) |
| Algorithm 1: Generalised Intersection over Union [24] |
| input: Two arbitrary convex shapes: A, B ⊆ S ∈ Rn output: GIoU 1 For A and B, find the smallest enclosing convex object C, where C ⊆ S ∈ Rn (1) (2) |