Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence
نویسندگان
چکیده
منابع مشابه
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence
We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse-to-fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solut...
متن کاملCoarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
We address the symmetric flip problem that is inherent to multiresolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry...
متن کاملAlgorithms for 3D Isometric Shape Correspondence
There are many pairs of objects in the digital world that need to be related before performing any comparison, transfer, or analysis in between. The shape correspondence algorithms essentially address this problem by taking two shapes as input with the aim of finding a mapping that couples similar or semantically equivalent surface points of the given shapes. We focus on computing correspondenc...
متن کاملCoarse-to-fine Planar Regularization for Dense Monocular Depth Estimation
Simultaneous localization and mapping (SLAM) using the whole image data is an appealing framework to address shortcoming of sparse feature-based methods – in particular frequent failures in textureless environments. Hence, direct methods bypassing the need of feature extraction and matching became recently popular. Many of these methods operate by alternating between pose estimation and computi...
متن کاملScale Normalization for Isometric Shape Matching
We address the scale problem inherent to isometric shape correspondence in a combinatorial matching framework. We consider a particular setting of the general correspondence problem where one of the two shapes to be matched is an isometric (or nearly isometric) part of the other up to an arbitrary scale. We resolve the scale ambiguity by finding a coarse matching between shape extremities based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2011
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2011.02020.x