← Search

Simone Melzi

13 accepted papers

2025

Escaping Plato's Cave: Towards the Alignment of 3D and Text Latent Spaces

CVPR 2025poster

Recent works have shown that, when trained at scale, uni-modal 2D vision and text encoders converge to learned features that share remarkable structural properties, despite arising from different representations. However, the role of 3D encoders with respect to other modalities remains unexplored. F…

Cited by 0SourcePDFScholar
2025

Implicit-ARAP: Efficient Handle-Guided Neural Field Deformation via Local Patch Meshing

NeurIPS 2025poster

Neural fields have emerged as a powerful representation for 3D geometry, enabling compact and continuous modeling of complex shapes. Despite their expressive power, manipulating neural fields in a controlled and accurate manner -- particularly under spatial constraints -- remains an open challenge,…

Cited by 0SourceScholar
2024

ReMatching: Low-Resolution Representations for Scalable Shape Correspondence

ECCV 2024poster

"We introduce ReMatching, a novel shape correspondence solution based on the functional maps framework. Our method, by exploiting a new and appropriate re-meshing paradigm, can target shape-matching tasks even on meshes counting millions of vertices, where the original functional maps does not apply…

2021

Fast Sinkhorn Filters: Using Matrix Scaling for Non-Rigid Shape Correspondence With Functional Maps

CVPR 2021poster

In this paper, we provide a theoretical foundation for pointwise map recovery from functional maps and highlight its relation to a range of shape correspondence methods based on spectral alignment. With this analysis in hand, we develop a novel spectral registration technique: Fast Sinkhorn Filters,…

Cited by 64PDFcodeScholar
2021

Learning disentangled representations via product manifold projection

ICML 2021spotlight

We propose a novel approach to disentangle the generative factors of variation underlying a given set of observations. Our method builds upon the idea that the (unknown) low-dimensional manifold underlying the data space can be explicitly modeled as a product of submanifolds. This definition of dise…

Cited by 31SourcePDFScholar
2021

Shape Registration in the Time of Transformers

NeurIPS 2021poster

In this paper, we propose a transformer-based procedure for the efficient registration of non-rigid 3D point clouds. The proposed approach is data-driven and adopts for the first time the transformers architecture in the registration task. Our method is general and applies to different settings. Gi…

2021

Universal Spectral Adversarial Attacks for Deformable Shapes

CVPR 2021poster

Machine learning models are known to be vulnerable to adversarial attacks, namely perturbations of the data that lead to wrong predictions despite being imperceptible. However, the existence of "universal" attacks (i.e., unique perturbations that transfer across different data points) has only been…

Cited by 19PDFScholar
2020

Correspondence learning via linearly-invariant embedding

NeurIPS 2020poster

In this paper, we propose a fully differentiable pipeline for estimating accurate dense correspondences between 3D point clouds. The proposed pipeline is an extension and a generalization of the functional maps framework. However, instead of using the Laplace-Beltrami eigenfunctions as done in virtu…

2019

GFrames: Gradient-Based Local Reference Frame for 3D Shape Matching

CVPR 2019oral

We introduce GFrames, a novel local reference frame (LRF) construction for 3D meshes and point clouds. GFrames are based on the computation of the intrinsic gradient of a scalar field defined on top of the input shape. The resulting tangent vector field defines a repeatable tangent direction of the…

Cited by 34PDFScholar
2017

Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach

ICCV 2017poster

Feature selection is playing an increasingly significant role with respect to many computer vision applications spanning from object recognition to visual object tracking. However, most of the recent solutions in feature selection are not robust across different and heterogeneous set of data. In thi…

Cited by 317PDFScholar
2017

Region-Based Correspondence Between 3D Shapes via Spatially Smooth Biclustering

ICCV 2017poster

Region-based correspondence (RBC) is a highly relevant and non-trivial computer vision problem. Given two 3D shapes, RBC seeks segments/regions on these shapes that can be reliably put in correspondence. The problem thus consists both in finding the regions and determining the correspondences betwee…

Cited by 10PDFScholar