Cross-Collection Map Inference by Intrinsic Alignment of Shape Spaces
نویسندگان
چکیده
Inferring maps between shapes is a long standing problem in geometry processing. The less similar the shapes are, the harder it is to compute a map, or even define criteria to evaluate it. In many cases, shapes appear as part of a collection, e.g. an animation or a series of faces or poses of the same character, where the shapes are similar enough, such that maps within the collection are easy to obtain. Our main observation is that given two collections of shapes whose “shape space” structure is similar, it is possible to find a correspondence between the collections, and then compute a cross-collection map. The cross-map is given as a functional correspondence, and thus it is more appropriate in cases where a bijective point-to-point map is not well defined. Our core idea is to treat each collection as a point-sampling from a low-dimensional shape-space manifold, and use dimensionality reduction techniques to find a low-dimensional Euclidean embedding of this sampling. To measure distances on the shape-space manifold, we use the recently introduced shape differences, which lead to a similar low-dimensional structure of the shape spaces, even if the shapes themselves are quite different. This allows us to use standard affine registration for point-clouds to align the shape-spaces, and then find a functional cross-map using a linear solve. We demonstrate the results of our algorithm on various shape collections and discuss its properties.
منابع مشابه
An intrinsic characterization of the shape of paracompacta by means of non-continuous signle-valued maps
In this paper we give a new description of the shape of paracompact spaces. We introduce the intrinsic notion of an approximate net between two spaces and we prove that two paracompacta have the same shape if and only if they are isomorphic objects in the category HANp whose objects are paracompact spaces and whose morphisms are homotopy classes of approximate nets.
متن کاملFast Bayesian Shape Matching Using Geometric Algorithms
We present a Bayesian approach to comparison of geometric shapes with applications to classification of the molecular structures of proteins. Our approach involves the use of distributions defined on transformation invariant shape spaces and the specification of prior distributions on bipartite matchings. Here we emphasize the computational aspects of posterior inference arising from such model...
متن کاملLASR 2013 — Statistical Models and Methods for non-Euclidean Data with Current Scientific Applications
For inference on non-Euclidean data, ideally the data space is at least locally approx-imated by a Euclidean space; for a manifold by a chart, say. If suitable data descriptorslie asymptotically in such a common Euclidean neighborhood, one would expect a normalcentral limit theorem to hold. Already for locally flat spaces like the circle there are excep-tions causing smeariness....
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملShape Analysis Methods for 3D Brain and Skull Imaging
We present a framework for shape alignment that generalizes several existing methods for parametric registration. We assume that the shape is a closed genus zero surface. Our framework requires a diffeomorphic surface mapping to the 2-sphere which preserves rotation. The registration is based on maximizing spherical cross-correlation function of surface-intrinsic scalar attributes, weighted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 33 شماره
صفحات -
تاریخ انتشار 2014