[1]龙占超 蔡超.一种新的指纹细化算法[J].计算机技术与发展,2007,(03):147-149.
　LONG Zhan-chao,CAI Chao.A New Fingerprint Thinning Algorithm[J].,2007,(03):147-149.
点击复制

一种新的指纹细化算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2007年03期
页码:
147-149
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
A New Fingerprint Thinning Algorithm
文章编号:
1673-629X（2007）03-0147-03
作者:
龙占超 蔡超
华中科技大学电子与信息工程系
Author(s):
LONG Zhan-chao;  CAI Chao
Electronics and Infomation Department, Huazhong University of Science ＆ Technology
关键词:
指纹细化; 最小生成树; 剪枝算法
Keywords:
fingerprint thinning;  minimum cost spanning tree;  pruning algorithm
分类号:
TP391.41
文献标志码:
A
摘要:
一般指纹细化算法处理结果存在毛刺过多，对纹线上的孔洞效果较差的缺点．容易导致为特征点的出现。为了减少毛刺的出现和提高对孔洞处理效果，分析了两种常见的细化算法——快速细化算法和改进的OPTA算法．找出了与毛刺产生和对孔洞处理效果相关的因素，并在此基础上提出了一种新的指纹细化算法。实验表明，该算法能够较好地满足细化要求，细化后的指纹图像保持了原有的拓扑结构和细节特征，细化后指纹光滑无毛刺，而且对孔洞的效果较好
Abstract:
The processed result of common fingerprint thinning algorithm has the disadvantages of too many burrs and dissatisfied effect on holes. In order to decrease the burrs and improve the effect on holes, both the quick thinning algorithm and the improved OPTA thinning algorithm are analyzed in the paper firstly, then the factors correlated with the burrs and holes are found out. A new thinning algorithm is presented based on the results. As is shown from theexperiment, this algorithm has been proved to have many advantages such as maintenance of minutia and architect.ure, smooth skeleton, good effects on holes and .so on

相似文献/References:

[1]唐启涛 陶滔 伍海波.基于最小生成树的LEACH路由算法研究[J].计算机技术与发展,2009,(04):109.
　TANG Qi-tao,TAO Tao,WU Hai-bo.Study of Minimum Spanning Tree Routing Algorithm in LEACH[J].,2009,(03):109.
[2]尹松 周永权 李陶深.基于稀疏差异度的聚类方法在信息分类中的应用[J].计算机技术与发展,2006,(01):117.
　YIN Song,ZHOU Yong-quan,LI Tao-shen.Research of Sparse Feature Difference-Based Clustering Method Applied to Information Classifying[J].,2006,(03):117.
[3]黄永丽 朱会东 徐华.基于层次性断层数据的三维重构技术[J].计算机技术与发展,2006,(08):60.
　HUANG Yong-li,ZHU Hui-dong,XU Hua.Technology of 3D Reconstruction Based on Layering Cross - Sections Data[J].,2006,(03):60.
[4]孙宪丽 王敏 李颖.求解TSP问题的一种启发式算法[J].计算机技术与发展,2010,(10):70.
　SUN Xian-li,WANG Min,LI Ying.A Heuristic Algorithm to Solve Travelling Salesman Problem[J].,2010,(03):70.
[5]赵林[],朱桂斌[],玉强[],等. 基于最小生成树的规则图像碎片复原算法[J].计算机技术与发展,2016,26(06):69.
　ZHAO Lin[],ZHU Gui-bin[],WEN Yu-qiang[],et al. A Restoration Algorithm for Square Image Pieces Based on MST[J].,2016,26(03):69.
[6]彭智东,宣士斌.融合最小生成树和四叉树的图割图像分割方法[J].计算机技术与发展,2018,28(12):102.[doi:10．3969/j． issn．1673－629X．2018．12．022]
　PENG Zhidong,XUAN Shibin.Image Segmentation Method Based on Graph Cut Combining Minimum Spanning Tree and Quadtree[J].,2018,28(03):102.[doi:10．3969/j． issn．1673－629X．2018．12．022]
[7]辛壮,万良,李均涛.改进的聚类算法在网络异常行为检测中的应用[J].计算机技术与发展,2019,29(03):111.[doi:10.3969/ j. issn.1673-629X.2019.03.024]
　XIN Zhuang,WAN Liang,LI Jun-tao.Application of Improved Clustering Algorithm in Network Abnormal Behavior Detection[J].,2019,29(03):111.[doi:10.3969/ j. issn.1673-629X.2019.03.024]
[8]王 诚,高兴东.基于最小生成树的密度聚类算法研究[J].计算机技术与发展,2022,32(02):45.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 007]
　WANG Cheng,GAO Xing-dong.Research on Density Clustering Algorithm Based on MST[J].,2022,32(03):45.[doi:10. 3969 / j. issn. 1673-629X. 2022. 02. 007]

备注/Memo

备注/Memo:
龙占超（1965-），男，湖南人，副教授，硕士生导师，研究方向为指纹识别算法、MIMO-OFOM无线通信系统中的最佳接收
更新日期/Last Update: 1900-01-01