Efficient Deformable Shape Correspondence via Kernel Matching
نویسندگان
چکیده
We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming.
منابع مشابه
Meaningful Correspondence, Local Contex and Shape Statistics in Deformable Templates
The paper presents a variational framework to compute first and second order statistics of an ensemble of shapes undergoing deformations. Geometrically “meaningful” correspondence between shapes is established via a kernel descriptor that characterizes local shape properties. Such a descriptor allows retaining geometric features such as high-curvature structures in the average shape, unlike con...
متن کاملA Correspondence-Less Approach to Matching of Deformable Shapes
Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-...
متن کاملEigen-css Shape Matching and Recognizing Fish in Underwater Video
This thesis presents work on shape matching and object recognition. First, we describe Eigen-CSS, a faster and more accurate approach to representing and matching the curvature scale space (CSS) features of shape silhouette contours. Phase-correlated marginal-sum features and PCA eigenspace decomposition via SVD differentiate our technique from earlier work. Next, we describe a deformable templ...
متن کاملDeformable prototypes for encoding shape categories in image databases
We describe a method for shape-based image database search that uses deformable prototypes to represent categories. Rather than directly comparing a candidate shape with all shape entries in the database, shapes are compared in terms of the types of nonrigid deformations (differences) that relate them to a small subset of representative prototypes. To solve the shape correspondence and alignmen...
متن کاملBayesian Inference of Bijective Non-Rigid Shape Correspondence
Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a postprocessing stage in the functional correspondence framework. In this paper, we show that such frequently used techniques in practice suffer from lack of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.08991 شماره
صفحات -
تاریخ انتشار 2017