Principled aggregation of SPIDER’s warp and descriptor matches with incomparable confidences
Develop a principled method to aggregate correspondences produced by SPIDER’s dual heads—the dense warp head and the geometry-aware descriptor head—accounting for the fact that their confidence scores are defined under different objective functions, so that the combined match set is consistent and reliable across challenging scenarios.
References
Since the confidence value for each head is with respect to different objective functions, the best way to aggregate matches remain an open question.
Despite substantial progress in full-to-full shape matching, partial-shape matching remains a major open challenge: shapes may only partially overlap, increasing the solution space, making the problem particularly ill-posed, and often also requiring identification of the shared region.
The recorded examples and merge census do not establish superiority over maximum-weight matching, descriptor similarity, or hybrid rules in a controlled full search.