• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Weng Dawei, Yin Yilong, Yang Gongping, and Qi Xiuyan. Singular Point Extraction from Fingerprint Based on Gaussian-Hermite Moment and Improved Poincare Index[J]. Journal of Computer Research and Development, 2008, 45(11): 1974-1984.
Citation: Weng Dawei, Yin Yilong, Yang Gongping, and Qi Xiuyan. Singular Point Extraction from Fingerprint Based on Gaussian-Hermite Moment and Improved Poincare Index[J]. Journal of Computer Research and Development, 2008, 45(11): 1974-1984.

Singular Point Extraction from Fingerprint Based on Gaussian-Hermite Moment and Improved Poincare Index

More Information
  • Published Date: November 14, 2008
  • It is very important to extract singular points accurately and reliably for classification and matching of fingerprints. To deal with the difficulty in extracting singular points from fingerprint image of low quality, a two-phase algorithm for singular points extraction is presented in this paper. In the first phase, to heighten anti-noise capability of traditional Poincare index and reduce false singularities, an improved algorithm for Poincare index is proposed, and then it is used to extract candidate singularities. In the second phase, based on the characteristic that Gaussian-Hermite moment attribution between singular region and ordinary region is different, it is along the direction orthogonal local ridge orientation in ordinary area while along all the directions in singular region. Gaussian-Hermite moment attribution for each candidate in its round neighborhood is calculated to determine whether it is true singularity or not. Because this two-phase method effectively assembles information of ridge orientation and coherence in singularitys neighborhood,it can extract singularities in a comparatively accurate and reliable way. Experimental results show its effectiveness and robusticity. 500 fingerprint images from the NIST-4 database are used for an experimental test, and the accuracy rate on identifying singular points is 93.05% (96.93% for core points and 86.43% for delta points).
  • Related Articles

    [1]LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650. DOI: 10.7544/issn1000-1239.2016.20148258
    [2]Xu Yuming, Zhu Ningbo, Ouyang Aijia, and Li Kenli. A Double-Helix Structure Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems[J]. Journal of Computer Research and Development, 2014, 51(6): 1240-1252.
    [3]Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
    [4]Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
    [5]Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
    [6]Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
    [7]Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
    [8]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [9]Zhao Baohua, Guo Xionghui, QianLan, and Qu Yugui. On the Problem of How to Place the Observers in Passive Testing[J]. Journal of Computer Research and Development, 2005, 42(10): 1815-1819.
    [10]Zhou Huaqi, Lu Mingming, and Zhu Hong. A Preemptive Scheduling Problem with Different Interrupted Time Cost on Identical Parallel Machines[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views (1126) PDF downloads (467) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return