作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (8): 228-230. doi: 10.3969/j.issn.1000-3428.2011.08.079

• 图形图像处理 • 上一篇    下一篇

一种高效的三维轮廓曲线匹配算法

ZHANG Hai-chao, WANG Ya-tao, ZHANG Fang-fang   

  1. (河南科技大学电子信息工程学院,河南 洛阳 471003)
  • 出版日期:2011-04-20 发布日期:2012-10-31
  • 作者简介:张海朝(1963-),男,副教授,主研方向:图形图像处理,多媒体通信,系统工程;王亚涛、张芳芳,硕士研究生
  • 基金资助:

    洛阳市科技攻关计划基金资助项目(0701041A)

Efficient Matching Algorithm for 3D Contour Curve

ZHANG Hai-chao, WANG Ya-tao, ZHANG Fang-fang   

  1. (Institute of Electronic Information Engineering, Henan University of Science & Technology, Luoyang 471003, China)
  • Online:2011-04-20 Published:2012-10-31

摘要:

针对三维碎片自动拼接中的碎片匹配问题,提出一种高效的轮廓曲线匹配算法。用B-样条曲线表示三维空间曲线,并计算轮廓曲线上各个点的曲率、挠率和法矢,在匹配过程中,对轮廓特征点按其邻域曲面片进行分类,根据特征点类型标志及特征段之间的欧式距离对不同轮廓上的特征段进行相似性度量,再利用法矢对相似性较高的轮廓段进行可匹配性验证。实验结果证明该算法是稳定、高效的。

关键词: 轮廓匹配, 三维轮廓曲线, 曲率, B-样条, 特征向量

Abstract:

Aiming at the problem of fragment matching in 3D fragment reassembly, this paper proposes a rapid contour curve matching algorithm. In the algorithm, the curve is expressed by B-spline curve, and curvature, torsion and normal vector are calculated. In the matching process, the type of feature point is classified according to its neighbor surface, and the similarity of the two feature section is measured according to the Euclidean distance of the feature points. The normal vector is used to verify the matching probability of similar space curves. Experimental results show that the algorithm is stable and efficient.

Key words: contour matching, 3D contour curve, curvature, B-spline, feature vector

中图分类号: