高级检索
张洁琳, 王瑞雪, 于颖娟, 陈汇. 3D多对称图形特征匹配算法[J]. 计算机辅助设计与图形学学报, 2023, 35(12): 1985-1992. DOI: 10.3724/SP.J.1089.2023.2023-00008
引用本文: 张洁琳, 王瑞雪, 于颖娟, 陈汇. 3D多对称图形特征匹配算法[J]. 计算机辅助设计与图形学学报, 2023, 35(12): 1985-1992. DOI: 10.3724/SP.J.1089.2023.2023-00008
Zhang Jielin, Wang Ruixue, Yu Yingjuan, Chen Hui. New Algorithm for Feature Matching of 3D Multi-Symmetric Graphics[J]. Journal of Computer-Aided Design & Computer Graphics, 2023, 35(12): 1985-1992. DOI: 10.3724/SP.J.1089.2023.2023-00008
Citation: Zhang Jielin, Wang Ruixue, Yu Yingjuan, Chen Hui. New Algorithm for Feature Matching of 3D Multi-Symmetric Graphics[J]. Journal of Computer-Aided Design & Computer Graphics, 2023, 35(12): 1985-1992. DOI: 10.3724/SP.J.1089.2023.2023-00008

3D多对称图形特征匹配算法

New Algorithm for Feature Matching of 3D Multi-Symmetric Graphics

  • 摘要: 3D图形匹配在计算机视觉领域有着广泛的应用,其中对称图形因其几何特征十分相似,难以区分,其匹配问题一直是难点之一.针对多节肢动物模型,提出一种基于几何特征的多对称图形匹配的新算法.主要步骤为:首先选取特征点,即在热核信号极值点的基础上,采用最远点采样法和融合算法对特征点个数进行调整,得到特征点集;然后对特征点进行分类,引入对称差异度和支持点对的概念将特征点分为对称点和非对称点,再利用测地距离将对称点进一步分侧,以提高后期的匹配准确率;最后进行图形匹配,通过算法在非对称点集中确定一个参考点,利用对称点与该参考点的距离排序完成初始匹配,针对可能出现的左右交叉错误问题,对初始匹配结果进行调整,即确定模型的正方向,通过判断对称点与参考点所成向量的外积方向与正方向是否一致,将交叉错误的匹配结果进行矫正,得到正确的匹配结果.在TOSCA数据库中Ant和Spider数据集上的实验结果表明,与已有算法相比,所提算法的正确率和运行效率均有所提高,Ant模型的正确率达到了100%,Spider模型的正确率达到了80%.

     

    Abstract: Three-dimensional shape matching has a wide range of applications in the field of computer vision, among which symmetric shape matching has always been one of the difficult problems because its geometric features are very similar and difficult to distinguish. Focused on the matching problem of 3D multi-symmetric shape, a new algorithm of multi-symmetric shape matching is proposed with a multi-arthropod model as the research object. The main steps are: First, select the feature points, that is, based on the extreme value point of the Heat Kernel Signature, the farthest point sampling and fusion algorithm is used to adjust the number of feature points to obtain the feature point set; Then, classify the feature points, the concept of symmetry difference and supporting point pairs is introduced to divide feature points into symmetric points and asymmetric points, and then geodesic distance is used to further divide the symmetric points to improve the matching accuracy in the later stage; Finally, conduct the shape matching, the algorithm is given to determine a reference point in the set of asymmetric points, using the distance ordering of the symmetry point from the reference point to complete the initial matching, In order to adjust the possible left-right cross error problem, the normal of shape is determined, and by judging whether the cross product direction of the vector formed by the symmetry point and the reference point is consistent with the normal to obtain the correct matching result. The experimental results of this algorithm in Ant and Spider dataset of TOSCA database show that the correctness and operation efficiency of this algorithm are improved compared with the existing algorithms, the accuracy of Ant model is 100% and the Spider model is 80%.

     

/

返回文章
返回