e-space
Manchester Metropolitan University's Research Repository

Similarity K-d tree method for sparse point pattern matching with underlying non-rigidity

Li, Baihua and Meng, Qinggang and Holstein, Horst (2005) Similarity K-d tree method for sparse point pattern matching with underlying non-rigidity. Pattern recognition, 38 (12). pp. 2391-2399. ISSN 1873-5142

Full text not available from this repository.

Abstract

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.

Impact and Reach

Statistics

Downloads
Activity Overview
0Downloads
194Hits

Additional statistics for this dataset are available via IRStats2.

Altmetric

Actions (login required)

Edit Item Edit Item