Shape-of-You: Fused Gromov-Wasserstein Optimal Transport for Semantic Correspondence in-the-Wild
Shape-of-You (SoY) employs fused Gromov-Wasserstein optimal transport with 3D geometric priors, achieving state-of-the-art semantic correspondence without explicit annotations.
Key Findings
Methodology
This work formulates semantic correspondence as a fused Gromov-Wasserstein (FGW) optimal transport problem, integrating feature similarity and structural consistency. Using pretrained 3D models, geometric intra-structure is defined in 3D space to resolve ambiguities. An anchor-based linearization approximates FGW, generating noisy but structurally consistent pseudo-labels. A soft-target loss blends these pseudo-labels with network predictions, enabling robust training. The pipeline involves: 1) extracting 3D geometric info, 2) multi-stage optimization of correspondences, 3) training a lightweight adapter network for inference.
Key Results
- On SPair-71k and AP-10k datasets, SoY achieves [email protected] scores of 67.9% and 68.0%, surpassing previous methods like ASIC and DINOv2+SD. Geometric structure incorporation improved accuracy by 2.3% to 7.0%, demonstrating the importance of structural cues in resolving symmetries and repetitive features.
- Introducing geometric constraints significantly enhanced matching consistency, especially in ambiguous scenarios. The soft loss improved training stability and generalization, leading to superior performance in complex scenes.
- Ablation studies confirmed that anchor quantity and 3D geometric integration are critical for optimal results, validating the effectiveness of the proposed approach.
Significance
This approach advances unsupervised semantic correspondence by reducing reliance on explicit geometric annotations, addressing a key bottleneck in real-world applications. By leveraging 3D geometric priors, it effectively handles symmetries and repetitive patterns, common challenges in in-the-wild images. The method's robustness and efficiency open new avenues for large-scale, annotation-free applications such as automatic image annotation, 3D reconstruction, and robotic perception, significantly impacting both academia and industry.
Technical Contribution
The main technical innovation is the integration of FGW optimization with 3D geometric priors, enabling structural-aware matching without explicit annotations. The anchor-based linearization reduces computational complexity of GW, making it feasible for large-scale problems. The soft target loss introduces a novel way to handle noisy pseudo-labels, improving training robustness. This framework bridges the gap between feature-based and structure-based matching, offering a new paradigm for semantic correspondence.
Novelty
This is the first work to incorporate fused Gromov-Wasserstein optimal transport with 3D geometric priors for unsupervised semantic correspondence. Unlike prior methods relying solely on 2D appearance features or local matching, it explicitly models intra-structure in 3D space, effectively resolving ambiguities from symmetries and repetitive features, marking a significant step forward.
Limitations
- The method's reliance on pretrained 3D models introduces computational overhead, limiting real-time deployment. In scenes with severe occlusion or missing geometry, accuracy drops due to insufficient geometric cues.
- Anchor-based linearization, while efficient, may oversimplify complex deformations, affecting structure preservation in highly non-rigid cases.
- Scalability to extremely large scenes or highly cluttered environments remains challenging, requiring further optimization.
Future Work
Future directions include integrating multi-scale geometric features, enhancing anchor selection strategies, and reducing computational costs. Extending the framework to dynamic scenes and multi-modal data could broaden its applicability. Additionally, exploring end-to-end training with joint feature and structure learning may further improve robustness and efficiency.
AI Executive Summary
Semantic correspondence is a fundamental task in computer vision, enabling pixel-level alignment across different instances within the same category. Traditional methods rely heavily on annotated data or explicit geometric information, which are costly and difficult to scale for real-world scenarios. Recent advances, such as foundation models like DINO, have demonstrated impressive zero-shot capabilities by extracting dense features, but they primarily operate locally and on 2D appearance cues. This leads to issues like geometric ambiguities, especially in symmetrical or repetitive structures.
To address these limitations, this paper introduces Shape-of-You (SoY), a novel framework that leverages fused Gromov-Wasserstein (FGW) optimal transport to jointly optimize feature similarity and intra-structure consistency. The key innovation is the use of pretrained 3D models to define intra-structure in geometric space, which helps resolve ambiguities that purely appearance-based methods cannot handle. The authors develop an anchor-based linearization approach to approximate the computationally intensive FGW, enabling efficient optimization. They also introduce a soft target loss that blends guidance from the probabilistic transport plan with the network's own predictions, making training robust to noisy pseudo-labels.
Experimental results on challenging datasets like SPair-71k and AP-10k demonstrate that SoY outperforms existing methods, achieving [email protected] scores of 67.9% and 68.0%, respectively. The incorporation of geometric structure consistently improves matching accuracy, especially in ambiguous cases. This work significantly advances the field by reducing the dependence on explicit geometric annotations, offering a scalable, structure-aware, unsupervised solution for semantic correspondence. Its broader impact lies in enabling more robust, annotation-free applications in image editing, robotics, and 3D understanding, paving the way for future research integrating structure and appearance in complex visual tasks.
Deep Analysis
Background
Semantic correspondence has evolved from early handcrafted feature-based methods to deep learning approaches utilizing dense features from foundation models like DINO and CLIP. These models significantly improved zero-shot matching but still faced challenges in complex, real-world scenes with symmetries, occlusions, and repetitive patterns. Incorporating geometric information, especially 3D priors, has been shown to improve robustness, but existing methods often rely on explicit annotations like camera poses or 3D models, which are costly. Gromov-Wasserstein (GW) optimal transport has been effective in capturing structural similarities in point clouds and graphs, but its computational complexity limits practical use in high-dimensional feature spaces. This work bridges these gaps by integrating 3D geometric priors with FGW optimization, enabling structure-aware, unsupervised semantic correspondence without explicit annotations.
Core Problem
The core challenge is to establish accurate pixel-level correspondences across diverse, in-the-wild images without relying on explicit geometric annotations. Existing methods struggle with ambiguities caused by symmetries and repetitive features, as local feature matching in 2D appearance space is insufficient. Incorporating 3D geometric priors can mitigate these issues but introduces computational complexity. The problem is to develop a scalable, robust framework that jointly optimizes feature similarity and structural consistency in a computationally feasible manner, addressing the limitations of local matching and 2D-only approaches.
Innovation
The paper's key innovations include: 1) Formulating semantic correspondence as a fused Gromov-Wasserstein (FGW) optimal transport problem, combining feature similarity with structural consistency; 2) Leveraging pretrained 3D models to define intra-structure in geometric space, resolving ambiguities from symmetries; 3) Developing an anchor-based linearization algorithm to approximate GW efficiently, enabling end-to-end training; 4) Introducing a soft target loss that blends guidance from probabilistic transport plans with network predictions, improving robustness to noise. These innovations collectively enable structure-aware, unsupervised matching that surpasses prior methods relying solely on appearance features.
Methodology
- �� Extract dense semantic features from pretrained models (e.g., DINO) for each image region.
- �� Lift 2D image patches into 3D space using a pretrained 3D foundation model (VGGT), obtaining geometric coordinates.
- �� Initialize pseudo-labels via unbalanced optimal transport based on feature similarity, accommodating partial overlaps.
- �� Select high-confidence anchor pairs from initial transport plan, compute intra-instance distance matrices in 3D.
- �� Approximate Gromov-Wasserstein distance by linearizing around anchors, reducing quadratic complexity.
- �� Fuse semantic feature cost with geometric structure cost into a combined cost matrix.
- �� Iteratively optimize the transport plan, updating anchors and costs, to enforce global structural consistency.
- �� Use the resulting probabilistic plan as a soft supervision signal, blending with network predictions via a dynamic soft target loss.
- �� Train a lightweight adapter network to predict correspondences efficiently at inference.
Experiments
The framework is evaluated on SPair-71k and AP-10k datasets, measuring [email protected]. Baselines include ASIC, DINOv2+SD, and DistillDIFT. Hyperparameters such as the number of anchors and the fusion weight α are tuned via ablation studies. The experiments demonstrate that incorporating geometric priors improves accuracy across categories, especially in ambiguous cases. The robustness of the soft target loss is validated through stability tests, and the efficiency of the anchor-based linearization is confirmed by runtime analysis. Cross-scenario tests show strong generalization, confirming the framework's scalability and effectiveness.
Results
SoY achieves [email protected] of 67.9% on SPair-71k, outperforming previous methods (ASIC 39.9%, DINOv2+SD 63.5%). Incorporating the GW term improves accuracy by 2.3% to 7.0%, especially in symmetric and ambiguous cases. On AP-10k, performance gains are consistent across intra- and cross-species settings. Ablation results highlight the importance of geometric structure integration and anchor selection. The soft target loss enhances training stability, leading to better generalization and robustness against pseudo-label noise.
Applications
This method can be applied in automatic image annotation, 3D reconstruction, robotic perception, and augmented reality, where accurate semantic correspondence is crucial. Its unsupervised nature reduces reliance on costly annotations, making it suitable for large-scale deployment. The structure-aware approach improves robustness in real-world scenarios with complex geometries, occlusions, and symmetries. Future extensions could include multi-view integration, dynamic scene understanding, and multi-modal data fusion, broadening its industrial impact.
Limitations & Outlook
Despite its strengths, the approach faces challenges in scenes with severe occlusion or missing geometry, where geometric cues are insufficient. The reliance on pretrained 3D models increases computational costs, limiting real-time applications. Anchor-based linearization may oversimplify highly non-rigid deformations, affecting structure preservation. Scalability to very large scenes or cluttered environments remains limited, requiring further algorithmic optimization. Future work should focus on reducing complexity and enhancing robustness in diverse conditions.
Plain Language Accessible to non-experts
想象你在整理一堆不同的拼图,每个拼图代表一张图片。传统的方法就像只看拼图的颜色和图案,试图找到相似的拼块,但有时候颜色相似的拼块其实在不同位置,容易搞错。本文的方法像是用一台超级聪明的机器人帮你,它不仅看颜色,还能理解每个拼块在空间中的位置和形状。它会用一些特别的“标记”来记住拼块的空间关系,就像用线把相关的拼块连接起来。这样,即使拼图上有很多重复的图案或对称的部分,它也能正确地把拼块拼在一起,不会搞错。这个机器人还会不断学习,变得越来越聪明,帮你拼出最完整、最漂亮的拼图。这个技术未来可以用在自动识别图片中的物体、虚拟现实游戏,甚至让机器人更聪明地导航和操作。是不是很酷?
ELI14 Explained like you're 14
想象你在玩拼图游戏,但有时候拼图上的颜色和图案很像,搞得你很难知道哪个拼块应该放哪里。传统的方法就像只看颜色,容易搞错。现在,这个新方法就像用一台超级聪明的机器人帮你,它不仅看颜色,还能理解每个拼块在空间中的位置和形状。它会用一些特别的“标记”来记住拼块的空间关系,就像用线把相关的拼块连接起来。这样,即使拼图上有很多重复的图案或对称的部分,它也能正确地把拼块拼在一起,不会搞错。这个机器人还会不断学习,变得越来越聪明,帮你拼出最完整、最漂亮的拼图。这个技术未来可以用在自动识别图片中的物体、虚拟现实游戏,甚至让机器人更聪明地导航和操作。是不是很酷?
Abstract
Semantic correspondence is essential for handling diverse in-the-wild images lacking explicit correspondence annotations. While recent 2D foundation models offer powerful features, adapting them for unsupervised learning via nearest-neighbor pseudo-labels has key limitations: it operates locally, ignoring structural relationships, and consequently its reliance on 2D appearance fails to resolve geometric ambiguities arising from symmetries or repetitive features. In this work, we address this by reformulating pseudo-label generation as a Fused Gromov-Wasserstein (FGW) problem, which jointly optimizes inter-feature similarity and intra-structural consistency. Our framework, Shape-of-You (SoY), leverages a 3D foundation model to define this intra-structure in the geometric space, resolving abovementioned ambiguity. However, since FGW is a computationally prohibitive quadratic problem, we approximate it through anchor-based linearization. The resulting probabilistic transport plan provides a structurally consistent but noisy supervisory signal. Thus, we introduce a soft-target loss dynamically blending guidance from this plan with network predictions to build a learning framework robust to this noise. SoY achieves state-of-the-art performance on SPair-71k and AP-10k datasets, establishing a new benchmark in semantic correspondence without explicit geometric annotations. Code is available at Shape-of-You.