Pattern Matching for Spatial Point Sets
نویسندگان
چکیده
Two sets of points in -dimensional space are given: a data set consisting of points, and a pattern set or probe consisting of points. We address the problem of determining whether there is a transformation, among a specified group of transformations of the space, carrying into or near (meaning at a small directed Hausdorff distance of) . The groups we consider are translations and rigid motions. Runtimes of approximately log and log respectively are obtained (letting max and omitting the effects of several secondary parameters). For translations, a runtime of approximately 1 log is obtained for the case that a constant fraction 1 of the points of the probe is allowed to fail to match.
منابع مشابه
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises from marker based optical motion capture (Mocap) systems for facial Mocap data. To establish one-to-one identifications, we introduce a forward 3D point pattern matching (PPM) method based on spatial geometric flexib...
متن کاملSimilarity K-d tree method for sparse point pattern matching with underlying non-rigidity
We propose a method for matching non-affinely related sparse model and data point-sets of identical cardinality, similar spatial distribution and orientation. To establish a one-to-one match, we introduce a new similarity K-dimensional tree. We construct the tree for the model set using spatial sparsity priority order. A corresponding tree for the data set is then constructed, following the spa...
متن کاملUsing k-d Trees for Robust 3D Point Pattern Matching
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally non-rigid distribution. This problem arises from markerbased optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying non-rigidity and possible distribution discrepancies, one being a model set (manually identified) and ...
متن کاملLocal Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کاملPoint Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform.We view a point set as a complete graph, establish the relation between the point set and the complete graph, and solve the point pattern matching problem by finding congruent complete graphs. Ex...
متن کاملFast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known to be 3-SUM hard and so unlikely to be solvable exactly in subquadratic time. We present an efficient bit-para...
متن کامل