International audienceCycle consistency has long been exploited as a powerful prior for jointly optimizing maps within a collection of shapes. In this paper, we investigate its utility in the approaches of Deep Functional Maps, which are considered state-of-the-art in non-rigid shape matching. We first justify that under certain conditions, the learned maps, when represented in the spectral domain, are already cycle consistent. Furthermore, we identify the discrepancy that spectrally consistent maps are not necessarily spatially, or point-wise, consistent. In light of this, we present a novel design of unsupervised Deep Functional Maps, which effectively enforces the harmony of learned maps under the spectral and the point-wise representati...
Classical formulations of the shape matching problem involve the definition of a matching cost that ...
This paper provides a novel framework that learns canonical embeddings for non-rigid shape matching....
International audienceWe consider the problem of non-rigid shape matching using the functional map f...
Cycle consistency has long been exploited as a powerful prior for jointly optimizing maps within a c...
In traditional deep functional maps for non-rigid shape correspondence, estimating a functional map ...
NeurIPS 2022. Code and data: https://github.com/craigleili/AttentiveFMapsInternational audienceIn th...
International audienceA variety of deep functional maps have been proposed recently, from fully supe...
Shape correspondence is a fundamental problem in computer vision, computer graphics, and related fie...
We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existin...
International audienceWe present a novel method for computing correspondences across 3D shapes using...
International audienceWe present a novel learning-based approach for computing correspondences betwe...
International audienceIn this paper, we propose a novel method, which we call CONSISTENT ZOOMOUT, fo...
We introduce a new framework for learning dense correspondence between deformable geometric domains ...
International audienceState-of-the-art fully intrinsic networks for non-rigid shape matching often s...
Alignment between non-rigid stretchable structures is one of the most challenging tasks in computer ...
Classical formulations of the shape matching problem involve the definition of a matching cost that ...
This paper provides a novel framework that learns canonical embeddings for non-rigid shape matching....
International audienceWe consider the problem of non-rigid shape matching using the functional map f...
Cycle consistency has long been exploited as a powerful prior for jointly optimizing maps within a c...
In traditional deep functional maps for non-rigid shape correspondence, estimating a functional map ...
NeurIPS 2022. Code and data: https://github.com/craigleili/AttentiveFMapsInternational audienceIn th...
International audienceA variety of deep functional maps have been proposed recently, from fully supe...
Shape correspondence is a fundamental problem in computer vision, computer graphics, and related fie...
We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existin...
International audienceWe present a novel method for computing correspondences across 3D shapes using...
International audienceWe present a novel learning-based approach for computing correspondences betwe...
International audienceIn this paper, we propose a novel method, which we call CONSISTENT ZOOMOUT, fo...
We introduce a new framework for learning dense correspondence between deformable geometric domains ...
International audienceState-of-the-art fully intrinsic networks for non-rigid shape matching often s...
Alignment between non-rigid stretchable structures is one of the most challenging tasks in computer ...
Classical formulations of the shape matching problem involve the definition of a matching cost that ...
This paper provides a novel framework that learns canonical embeddings for non-rigid shape matching....
International audienceWe consider the problem of non-rigid shape matching using the functional map f...