Neidio i’r brif dudalen lywio Neidio i chwilio Neidio i’r prif gynnwys

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

  • Manchester Metropolitan University

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid

5 Dyfyniadau (Scopus)
371 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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.
Iaith wreiddiolSaesneg
Tudalennau (o-i)2391-2399
Nifer y tudalennau9
CyfnodolynPattern Recognition
Cyfrol38
Rhif cyhoeddi12
Dyddiad ar-lein cynnar23 Mai 2005
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 01 Rhag 2005

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Similarity K-d tree method for sparse point pattern matching with underlying non-rigidity'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn