Computational geometry: an introduction
Computational geometry: an introduction
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Object recognition by computer: the role of geometric constraints
Object recognition by computer: the role of geometric constraints
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Iterative point matching for registration of free-form curves and surfaces
International Journal of Computer Vision
Estimating 3-D rigid body transformations: a comparison of four major algorithms
Machine Vision and Applications - Special issue on performance evaluation
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
A general method for partial point set matching
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Multidimensional access methods
ACM Computing Surveys (CSUR)
Animation from observation: Motion capture and motion editing
ACM SIGGRAPH Computer Graphics
Multidimensional binary search trees used for associative searching
Communications of the ACM
Geometric Hashing: An Overview
IEEE Computational Science & Engineering
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional Binary Search Trees in Database Applications
IEEE Transactions on Software Engineering
Articulated pose identification with sparse point features
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Similarity Invariant Delaunay Graph Matching
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
| Hi-index | 0.01 |
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 sparsity information embedded in the model tree. A matching sequence between the two point sets is generated by traversing the identically structured trees. Experiments on synthetic and real data confirm that this method is applicable to robust spatial matching of sparse point-sets under moderate non-rigid distortion and arbitrary scaling, thus contributing to non-rigid point-pattern matching.