基于贪心算法与多边形剖分的印鉴匹配算法  

Seal identification based on cupidity algorithm and polygon triangulation cutting algorithm

作　　者：谷斌 靳艳峰[1] 王力娟 耿科明 庞贵法 

机构地区：[1]中国邮政集团商函研究中心,河北石家庄050021

出　　处：《计算机工程与设计》2008年第12期3136-3138,共3页Computer Engineering and Design

摘　　要：将计算几何中平面点集的三角剖分方法之一贪心算法与多边形三角剖分方法引入印鉴匹配,研究了一种基于三角网格(用贪心算法进行平面点集的三角剖分)的印鉴匹配方法。用贪心算法对基于线条的细节点集进行三角剖分,而对于基于多边形的细节点直接进行多边形的三角剖分。通过对两种细节点(基于线条的细节点和基于多边形的细节点)的拓扑结构进行三角划分,把空间上位置相近的细节点按照一定的规则相连,得到三角形网格。然后基于该网格寻找若干参考点对,并根据获得的参考点对将两幅印鉴图像进行姿势调整。最后使用获得的参考点对实现基于点模式的印鉴匹配,经分析该方法是一种行之有效的印鉴识别方法。A method for seal identification is proposed, which based on cupidity algorithm and polygon triangulation cutting algorithm in computational geometry. At first, the cupidity algorithm is used to triangulate the detail points based on line and the polygon triangulation cutting algorithm is used to triangulate the detail points based on polygon. Then reference junction pairs are obtained by searching two trigonal net. Finally, the query seal image is adjusted according to the templated seal image with parameters computed from reference junction pairs and match score is caculated using a simply match algorithm. The results of the experiments prove the validity of the method.

关 键 词：印鉴 贪心算法 细节点 印鉴识别 三角剖分 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]