Formula: transformer decoder; bipartite matching loss
Details
Every query predicts one box, and the loss is defined only after a one-to-one assignment between predictions and ground truth found by the Hungarian algorithm on the pairwise cost. There is no non-maximum suppression and no anchor set: the matching is what removes the duplicates. Unmatched queries train to the no-object class.
Examples
D <- data.frame(x = c(1, 2, 3, 4), y = c(2, 4, 5, 9))
Detrbb(D, D)
#> $estimate
#> [1] 0
#>
#> $assignment
#> [1] 0 1
#>
#> $cost
#> [1] 0
#>
#> $matched
#> [1] 0 1
#>
#> $unmatched
#> integer(0)
#>
#> $l1_cost
#> [1] 0
#>
#> $giou_cost
#> [1] 0
#>
#> $Q
#> [1] 2
#>
#> $G
#> [1] 2
#>
#> $method
#> [1] "DETR set prediction with Hungarian matching"
#>
#> attr(,"class")
#> [1] "morie_rich_result" "list"
