检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:魏鸿磊[1] 欧宗瑛[1] 甘树坤[1] 张海东[1]
机构地区:[1]大连理工大学精密与特种加工教育部重点实验室,大连116024
出 处:《计算机辅助设计与图形学学报》2006年第6期832-837,共6页Journal of Computer-Aided Design & Computer Graphics
摘 要:为将2个细节点集高效而准确地配准,首先利用与细节点相关联的短脊线对细节点组合进行初选,然后采用局部特征结构匹配精选出5对细节点作为配准的候选对应点·在2个细节点集配准后的匹配中,针对采用弹性匹配算法经常出现的细节点错配的情况,提出根据匹配可信度对各匹配对的匹配分值进行加权处理,以降低其对匹配精度的影响·采用FVC2002公布的指纹库进行对比实验,结果表明该算法在匹配效率和准确性上都有明显的提高·Fingerprint matching is an extremely difficult problem, mainly due to the large variability in different impressions of the same finger. In this paper, a robust fingerprint matching algorithm has been developed. In the alignment stage, short ridges and invariant groups of local feature vectors are used to select corresponding minutiae for the alignment of two minutiae sets efficiently and accurately. In the following stage of matching aligned minutial, a coarse matching set is achieved by the elastic matching algorithm, but there are always some false matching pairs. In order to decrease the effect of false matching pairs to the final result, a novel method is introduced to weight the matching scores, and a more reliable similarity is achieved. Experiments on four databases of FVC2002 show that this fingerprint matching technique is more accurate and efficient compared with the conventional approach.
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117