Abstract—We present a purely isometric method that establishes 3D correspondence between two (nearly) isometric shapes. Our method evenly samples high-curvature vertices from the given mesh representations, and then seeks for an injective mapping from one vertex set to the other, that minimizes the isometric distortion. We formulate the problem of shape correspondence as combinatorial optimization over the domain of all possible mappings, which then reduces in a probabilistic setting to a log-likelihood maximization problem that we solve via EM (Expectation-Maximization) algorithm. The EM algorithm is initialized in spectral domain by transforming the sampled vertices via classical MDS (Multidimensional Scaling). Minimization of the isometr...
International audienceWe address the problem of matching two 3D shapes by representing them using th...
In this paper we propose an approach for computing multiple high-quality near-isometric dense corres...
International audienceWe consider the problem of finding meaningful correspondences between 3D model...
Abstract—We present a purely isometric method that establishes 3D correspondence between two (nearly...
We present an automatic method that establishes 3D cor-respondence between isometric shapes. Our goa...
We present a dense correspondence method for isometric shapes, which is accurate yet computationally...
We address the scale problem inherent to isometric shape correspondence in a combinatorial matching ...
We address the scale problem inherent to isometric shape correspondence in a combinatorial matching ...
3B izometrik şekiller arasındaki eşleme problemini ele alıyoruz. Önerdiğimiz yöntem, verilen iki izo...
We present a 3-D correspondence method to match the geometric extremities of two shapes which are pa...
We present a 3D correspondence method to match the geometric extremities of two shapes which are par...
paperID We present a multiple shape correspondence method based on dynamic programming, that compute...
In this work, we introduce two methods to handle nearly isometric shape correspondence problem. The ...
In this work, we introduce two methods to handle nearly isometric shape correspondence problem. The ...
We exploit the permutation creation ability of genetic optimization to find the permutation of one p...
International audienceWe address the problem of matching two 3D shapes by representing them using th...
In this paper we propose an approach for computing multiple high-quality near-isometric dense corres...
International audienceWe consider the problem of finding meaningful correspondences between 3D model...
Abstract—We present a purely isometric method that establishes 3D correspondence between two (nearly...
We present an automatic method that establishes 3D cor-respondence between isometric shapes. Our goa...
We present a dense correspondence method for isometric shapes, which is accurate yet computationally...
We address the scale problem inherent to isometric shape correspondence in a combinatorial matching ...
We address the scale problem inherent to isometric shape correspondence in a combinatorial matching ...
3B izometrik şekiller arasındaki eşleme problemini ele alıyoruz. Önerdiğimiz yöntem, verilen iki izo...
We present a 3-D correspondence method to match the geometric extremities of two shapes which are pa...
We present a 3D correspondence method to match the geometric extremities of two shapes which are par...
paperID We present a multiple shape correspondence method based on dynamic programming, that compute...
In this work, we introduce two methods to handle nearly isometric shape correspondence problem. The ...
In this work, we introduce two methods to handle nearly isometric shape correspondence problem. The ...
We exploit the permutation creation ability of genetic optimization to find the permutation of one p...
International audienceWe address the problem of matching two 3D shapes by representing them using th...
In this paper we propose an approach for computing multiple high-quality near-isometric dense corres...
International audienceWe consider the problem of finding meaningful correspondences between 3D model...