检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州理工大学计算机与通信学院,兰州730050
出 处:《模式识别与人工智能》2007年第2期261-265,共5页Pattern Recognition and Artificial Intelligence
摘 要:研究印鉴图像姿势纠正及印鉴匹配处理问题.在研究 Delaunay 三角剖分方法与多边形三角剖分方法的基础上,提出一种基于 DT 网格的印鉴识别方法.该方法通过对两种细节点(基于线条的细节点和基于多边形的细节点)的拓扑结构进行 DT 三角划分.用 Delaunay 三角剖分方法对基于线条的细节点集进行三角剖分,对基于多边形的细节点直接进行多边形三角剖分.通过对两种细节点的拓扑结构进行三角划分,把空间上位置相近的细节点按照三角剖分的规则相连,得到 DT 三角形网格.然后基于该网格寻找若干参考点对,并根据获得的参考点对将两幅印鉴图像进行姿势调整.实验结果表明该方法可以获得较多的参考点,确保印鉴旋转、印鉴平移等参数计算结果的准确性,有效提高最终的识别效果.The gesture adjustment and the match of the seal image are studied. An approach for the seal image matching based on DT grid is proposed. After the topological structures of two minutiae which are based on line and polygon are triangulated and the minutiae taken from the template and the query seal images are joined , the DT grid is gained . Firstly , the Delaunay point set triangulation cutting algorithm is used to triangulate the minutiae based on line , while the polygon triangulation cutting algorithm is employed to triangulate the minutiae based on polygon. Then the reference junction pairs are obtained by searching two trigonal nets. Finally, the query seal image is adjusted according to the templated seal image with parameters computed from the reference junction pairs and the match score is caculated using a simply match algorithm. Simulation results show that the proposed method gets more reference points and the accuracy of rotating and translating parameters of the seal imprint is also ensured.
关 键 词:DT网格 印鉴图像 DELAUNAY三角剖分 细节点 多边形三角剖分
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.190.152.109