基于轮廓曲线和特征区域的秦俑碎块匹配算法

Terracotta Warrior Blocks Matching Algorithm Based on Contour Curve and Feature Region

  • 摘要: 为了提高秦俑碎块匹配的精度和速度,提出了基于轮廓曲线和特征区域的碎块匹配算法.提取碎块的断裂面及其轮廓曲线,并将轮廓曲线进行分段,再采用最长公共子序列算法将轮廓曲线进行匹配,以实现碎块的粗匹配;根据体积积分不变量计算碎块断裂面上所有顶点的凹凸性,并将断裂面划分为一系列或凹或凸的特征区域;计算断裂面上各个特征区域的质心,并采用改进的迭代最近点算法对质心进行匹配,以实现断裂面的细匹配.实验采用了3种匹配算法对秦俑碎块数据进行匹配,结果表明基于轮廓曲线和特征区域的匹配算法能更加精确地完成碎块断裂面的完全匹配和部分匹配,并在细匹配阶段取得了更高的迭代收敛速度.

     

    Abstract: A Terracotta Warrior blocks matching algorithm based on contour curve and feature region was proposed here in order to improve the matching accuracy and convergence rate. Firstly, the fracture surfaces and their contour curves were extracted, and each contour curve was divided into several parts, then the longest common subsequence algorithm was used to match the contour curves, achieving a coarse matching of the blocks. Secondly, the concavity or convexity of vertexes on fracture surface was calculated by volume integral invariant, and the fracture surface was divided into a number of concave and convex feature regions. Finally, the centroids of the feature regions were calculated and used to achieve fine matching of blocks with improved ICP algorithm. In the experiment, three types of algorithms were used to match the Terracotta Warrior blocks. The matching results show that the blocks matching algorithm based on contour curve and feature region can achieve complete matching and partial matching of Terracotta Warrior blocks much more accurately, and obtain a much higher iterative convergence rate in fine matching stage.

     

/

返回文章
返回