SemAnCorr: Semantic Anchored Correspondence for Zero-Shot Manipulation Skill Transfer
- URL: http://arxiv.org/abs/2607.28382v1
- Date: Thu, 30 Jul 2026 15:41:39 GMT
- Title: SemAnCorr: Semantic Anchored Correspondence for Zero-Shot Manipulation Skill Transfer
- Abstract summary: SemAnCorr is a training-free framework that establishes dense correspondence.<n>We show that SemAnCorr achieves 90.8% semantic accuracy in our benchmark evaluation.<n>We show that these improvements translate directly into real-world manipulation performance.
- Score: 12.085313110793734
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Transferring manipulation skills across object instances that share functionality but differ in geometry remains a fundamental challenge in robot learning. While recent correspondence methods leverage dense visual descriptors and 3D feature fields, nearest-neighbor feature matching often produces spatially incoherent correspondences that fail to recover the local geometric frames required for reliable skill transfer. We introduce SemAnCorr, a training-free framework that establishes dense correspondence by selecting semantically consistent anchor regions through joint pose-correspondence optimization and propagating these constraints over the object surface using functional maps. The resulting correspondences preserve both semantic consistency and geometric coherence, enabling object-centric manipulation skills to transfer across geometrically diverse instances. We evaluate SemAnCorr on a dense correspondence benchmark built on PartNet-Mobility, achieving 90.8% semantic accuracy in our benchmark evaluation while improving geometric coherence over recent state-of-the-art baselines. Finally, we show that these improvements translate directly into real-world manipulation performance: using a single demonstration, SemAnCorr enables substantially more reliable zero-shot manipulation skill transfer to previously unseen objects than existing correspondence methods. Videos and additional visualizations are available at [https://semancorr.github.io](https://semancorr.github.io) .
Related papers
- GRAFT: Graph-Based Affordance Transfer via Part Correspondence [15.954352116733013]
Generalizing robotic manipulation to unseen objects remains challenging, as learning-based approaches require many demonstrations and fail in few-shot settings.<n>We propose GRAFT, a geometry-aware correspondence framework for zero-shot manipulation transfer using only one demonstration per object.<n>For an unseen object, our method first retrieves the most functionally and geometrically similar instance from the demonstration buffer with aligned functional parts, and finally propagates the contact points through point-wise correspondence.
arXiv Detail & Related papers (2026-06-23T23:58:57Z) - Improving Relative Representations with Learned Anchors and Whitened Inner Products [0.0]
Independently trained neural models typically converge to incompatible latent representations.<n>Relative Representations (RR) address this by mapping absolute coordinates to a shared space defined by similarities to common anchor points.<n>Traditional implementations rely on randomly sampled anchors and cosine similarity.<n>We propose a robust framework for cross-model communication based on two improvements.
arXiv Detail & Related papers (2026-05-28T21:43:53Z) - Affordance Transfer Across Object Instances via Semantically Anchored Functional Map [4.786936073180585]
We propose emphSemantic Anchored Functional Maps (SemFM), a framework for transferring affordances across objects from a single visual demonstration.<n>Our method identifies semantically corresponding functional regions between objects, selects mutually exclusive semantic anchors, and propagates these constraints over the surface.<n>Experiments on synthetic object categories and real-world robotic manipulation tasks show that our approach enables accurate affordance transfer with modest computational cost.
arXiv Detail & Related papers (2026-02-16T16:04:47Z) - Copy-Trasform-Paste: Zero-Shot Object-Object Alignment Guided by Vision-Language and Geometric Constraints [12.704390013489054]
We study zero-shot 3D alignment of two given meshes, using a text prompt describing their relation.<n>We optimize the relative pose at test time, updating translation, rotation, and isotropic scale with CLIP-driven gradients.<n>Our method outperforms all alternatives, yielding semantically faithful and physically plausible alignments.
arXiv Detail & Related papers (2026-01-20T18:12:55Z) - Do It Yourself: Learning Semantic Correspondence from Pseudo-Labels [81.22943696917304]
We propose improving semantic correspondence estimation through 3D-aware pseudo-labeling.<n>We establish a new state-of-the-art on SPair-71k, achieving an absolute gain of over 4% and of over 7% compared to methods with similar supervision requirements.
arXiv Detail & Related papers (2025-06-05T17:54:33Z) - Geometry-Editable and Appearance-Preserving Object Compositon [67.98806888489385]
General object composition (GOC) aims to seamlessly integrate a target object into a background scene with desired geometric properties.<n>Recent approaches derive semantic embeddings and integrate them into advanced diffusion models to enable geometry-editable generation.<n>We introduce a Disentangled Geometry-editable and Appearance-preserving Diffusion model that first leverages semantic embeddings to implicitly capture desired geometric transformations.
arXiv Detail & Related papers (2025-05-27T09:05:28Z) - Learning Affine Correspondences by Integrating Geometric Constraints [30.695253062973784]
We present a new pipeline designed for extracting accurate affine correspondences by integrating dense matching and geometric constraints.<n>Specifically, a novel extraction framework is introduced, with the aid of dense matching and a novel keypoint scale and orientation estimator.<n>The experimental show that the accuracy and robustness of our method outperform the existing ones in image matching tasks.
arXiv Detail & Related papers (2025-04-07T08:44:50Z) - Telling Left from Right: Identifying Geometry-Aware Semantic Correspondence [80.6840060272386]
This paper identifies the importance of being geometry-aware for semantic correspondence.
We show that incorporating this information can markedly enhance semantic correspondence performance.
Our method achieves a PCK@0.10 score of 65.4 (zero-shot) and 85.6 (supervised) on the challenging SPair-71k dataset.
arXiv Detail & Related papers (2023-11-28T18:45:13Z) - REGTR: End-to-end Point Cloud Correspondences with Transformers [79.52112840465558]
We conjecture that attention mechanisms can replace the role of explicit feature matching and RANSAC.
We propose an end-to-end framework to directly predict the final set of correspondences.
Our approach achieves state-of-the-art performance on 3DMatch and ModelNet benchmarks.
arXiv Detail & Related papers (2022-03-28T06:01:00Z) - Temporally-Consistent Surface Reconstruction using Metrically-Consistent
Atlases [131.50372468579067]
We propose a method for unsupervised reconstruction of a temporally-consistent sequence of surfaces from a sequence of time-evolving point clouds.
We represent the reconstructed surfaces as atlases computed by a neural network, which enables us to establish correspondences between frames.
Our approach outperforms state-of-the-art ones on several challenging datasets.
arXiv Detail & Related papers (2021-11-12T17:48:25Z) - Pairwise Similarity Knowledge Transfer for Weakly Supervised Object
Localization [53.99850033746663]
We study the problem of learning localization model on target classes with weakly supervised image labels.
In this work, we argue that learning only an objectness function is a weak form of knowledge transfer.
Experiments on the COCO and ILSVRC 2013 detection datasets show that the performance of the localization model improves significantly with the inclusion of pairwise similarity function.
arXiv Detail & Related papers (2020-03-18T17:53:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.