Name
Abstract | ||
|---|---|---|
We propose Probabilistic Warp Consistency, a weakly-supervised learning objective for semantic matching. Our approach directly supervises the dense matching scores predicted by the network, encoded as a conditional probability distribution. We first construct an image triplet by applying a known warp to one of the images in a pair depicting different instances of the same object class. Our probabilistic learning objectives are then derived using the constraints arising from the resulting image triplet. We further account for occlusion and background clutter present in real image pairs by extending our probabilistic output space with a learnable unmatched state. To supervise it, we design an objective between image pairs depicting different object classes. We validate our method by applying it to four recent semantic matching architectures. Our weakly-supervised approach sets a new state-of-the-art on four challenging semantic matching benchmarks. Lastly, we demonstrate that our objective also brings substantial improvements in the strongly-supervised regime, when combined with keypoint annotations. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/CVPR52688.2022.00851 | IEEE Conference on Computer Vision and Pattern Recognition |
Keywords | DocType | Volume |
Motion and tracking, Recognition: detection,categorization,retrieval | Conference | 2022 |
Issue | ISSN | Citations |
1 | IEEE/CVF Conference on Computer Vision and Pattern Recognition
(CVPR) 2022 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Truong Prune | 1 | 1 | 1.02 |
| Danelljan Martin | 2 | 1344 | 49.35 |
| Fisher Yu | 3 | 1280 | 50.27 |
| Luc Van Gool | 4 | 0 | 0.68 |