کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
533842 870177 2005 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Similarity K-d tree method for sparse point pattern matching with underlying non-rigidity
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
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 KK-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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 38, Issue 12, December 2005, Pages 2391–2399
نویسندگان
, , ,