Articulating then Matching: Zero-Shot Shape Matching for Uncurated Data

• URL: http://arxiv.org/abs/2606.29167v1
• Date: Sun, 28 Jun 2026 03:05:46 GMT
• Title: Articulating then Matching: Zero-Shot Shape Matching for Uncurated Data
• Abstract summary: Finding dense correspondences between 3D shapes is a fundamental yet unresolved challenge, especially in real-world environments.<n>We present ATM, a framework that requires no correspondence-specific training and robustly addresses these issues at once.
• Score: 0.5014513738509991
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Finding dense correspondences between 3D shapes is a fundamental yet unresolved challenge, especially in real-world environments. These environments present severe challenges, including the lack of time and sufficient samples for training, the prevalence of uncurated extreme-high resolution data with topological distortions, and the need to handle diverse 3D representations. In this paper, we present ATM, a zero-shot framework that requires no correspondence-specific training and robustly addresses these issues at once through an articulate-then-match paradigm. Rather than relying on intrinsic geometric properties, we leverage powerful pretrained vision foundation models and parametric shape priors to estimate parametric shape models from multi-view renderings, and systematically ground these estimations via multi-view geometric consistency. By mapping diverse inputs into a shared canonical parametric space, we inherently establish robust coarse correspondences that bypass topological noise, which are then refined into precise dense mappings via spectral refinement. Operating purely on test-time optimized parametric reconstructions, ATM requires no correspondence training data, is naturally immune to connectivity artifacts, and seamlessly handles diverse 3D modalities, including meshes, point clouds, and 3D Gaussians. Extensive experiments demonstrate that our method achieves strong results on non-isometric benchmarks (average geodesic errors of 2.4-TOPKIDS, 3.8-SMAL), reducing errors by 73% and 37% respectively compared to the baseline URSSM. Furthermore, it exhibits unprecedented robustness on in-the-wild raw scans of up to 200k vertices per shape while maintaining near-constant computation time and consistent superior accuracy.

Related papers

• Loss Landscape Topology Reveals Why Simple Baselines are Competitive at 3D Point Cloud Segmentation Under Class Imbalance [5.276232626689568]
  We evaluate 11 imbalance mitigation approaches across datasets with extreme and moderate imbalance ratios.<n>Standard cross-entropy with uniform weighting achieves competitive performance, typically within 0.8-3.3% mIoU.<n>This work provides the first mechanistic explanation for why techniques proven effective in 2D do not readily transfer to point-based 3D point cloud segmentation.
  arXiv  Detail & Related papers  (2026-07-23T09:19:31Z)
• SpaR3D-MoE: Adaptive 3D Spatial Reasoning from Sparse Views Meets Geometry-Inductive Mixture-of-Experts [9.401672754315614]
  SpaR3DMoE is an end-to-end framework that enables adaptive spatial reasoning by MLLMs with geometryaware capabilities from only sparse RGB inputs.
  arXiv  Detail & Related papers  (2026-07-07T09:27:38Z)
• NoPA: Non-Parametric Online 3D Scene Graph Generation [57.15076373014265]
  NoPA represents each object as a separate non-parametric distribution.<n>We leverage maximum mean discrepancy on kernel density estimates to enable robust merging of object candidates.<n>NoPA substantially outperforms current methods without sacrificing real-time inference speed.
  arXiv  Detail & Related papers  (2026-07-01T07:18:07Z)
• SCOPE: Scale-Consistent One-Pass Estimation of 3D Geometry [69.89196162649091]
  SCOPE (Scale-Consistent One-Pass Estimation of 3D Geometry) is a novel approach for estimating 3D geometry from extended monocular video sequences.<n>Our approach generates affine-invariant 3D point maps with shared parameters across entire sequences, enabling consistent scale-invariant representations.
  arXiv  Detail & Related papers  (2026-06-19T10:23:25Z)
• An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching [69.56116761337786]
  We introduce the first integer linear programming approach specifically designed to address the challenges of partial-partial shape matching.<n>Our approach achieves high-quality matching results both in terms of matching error and smoothness.
  arXiv  Detail & Related papers  (2026-02-06T10:34:52Z)
• Tail-Aware Post-Training Quantization for 3D Geometry Models [58.79500829118265]
  Post-Training Quantization (PTQ) enables efficient inference without retraining.<n>PTQ fails to transfer effectively to 3D models due to intricate feature distributions and prohibitive calibration overhead.<n>We propose TAPTQ, a Tail-Aware Post-Training Quantization pipeline for 3D geometric learning.
  arXiv  Detail & Related papers  (2026-02-02T07:21:15Z)
• Dens3R: A Foundation Model for 3D Geometry Prediction [44.13431776180547]
  Dens3R is a 3D foundation model designed for joint geometric dense prediction.<n>By integrating image-pair matching features with intrinsic invariance modeling, Dens3R accurately regresses multiple geometric quantities.
  arXiv  Detail & Related papers  (2025-07-22T07:22:30Z)
• Deep Supervised LSTM for 3D morphology estimation from Multi-View RGB Images of Wheat Spikes [0.0]
  Estimating morphological traits from two-dimensional RGB images presents inherent challenges.<n>We propose a neural network approach for volume estimation in 2D images.<n>Our deep supervised model achieves a mean absolute percentage error (MAPE) of 6.46% on six-view indoor images.
  arXiv  Detail & Related papers  (2025-06-22T15:02:18Z)
• Deformation-Guided Unsupervised Non-Rigid Shape Matching [7.327850781641328]
  We present an unsupervised data-driven approach for non-rigid shape matching. Our approach is particularly robust when matching digitized shapes using 3D scanners.
  arXiv  Detail & Related papers  (2023-11-27T09:55:55Z)
• U-RED: Unsupervised 3D Shape Retrieval and Deformation for Partial Point Clouds [84.32525852378525]
  We propose U-RED, an Unsupervised shape REtrieval and Deformation pipeline. It takes an arbitrary object observation as input, typically captured by RGB images or scans, and jointly retrieves and deforms the geometrically similar CAD models. We show that U-RED surpasses existing state-of-the-art approaches by 47.3%, 16.7% and 31.6% respectively under Chamfer Distance.
  arXiv  Detail & Related papers  (2023-08-11T20:56:05Z)
• FrozenRecon: Pose-free 3D Scene Reconstruction with Frozen Depth Models [67.96827539201071]
  We propose a novel test-time optimization approach for 3D scene reconstruction. Our method achieves state-of-the-art cross-dataset reconstruction on five zero-shot testing datasets.
  arXiv  Detail & Related papers  (2023-08-10T17:55:02Z)
• Self-supervised Human Mesh Recovery with Cross-Representation Alignment [20.69546341109787]
  Self-supervised human mesh recovery methods have poor generalizability due to limited availability and diversity of 3D-annotated benchmark datasets. We propose cross-representation alignment utilizing the complementary information from the robust but sparse representation (2D keypoints) This adaptive cross-representation alignment explicitly learns from the deviations and captures complementary information: richness from sparse representation and robustness from dense representation.
  arXiv  Detail & Related papers  (2022-09-10T04:47:20Z)
• Robust Extrinsic Symmetry Estimation in 3D Point Clouds [4.416484585765027]
  Detecting the reflection symmetry plane of an object represented by a 3D point cloud is a fundamental problem in 3D computer vision and geometry processing. We propose a statistical estimator-based approach for the plane of reflection symmetry that is robust to outliers and missing parts.
  arXiv  Detail & Related papers  (2021-09-21T03:09:51Z)
• Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
  Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames. We show that our approach significantly improves accuracy, scalability, and robustness against noise.
  arXiv  Detail & Related papers  (2020-06-15T09:15:54Z)

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.