Dynamic Signature Verification through the Longest Common Subsequence Problem and Genetic Algorithms

被引：0
|
作者：
Flores-Mendez, Alejandro [1 ]
Bernal-Urbina, Manuel [2 ]
机构：
[1] IPN, CINVESTAV, Dept Math, Mexico City, DF, Mexico
[2] Ijam Consult, Mexico City, DF, Mexico
来源：
2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2010年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The following paper includes an automated system that shows the use of signature data for biometric verification. The verification uses the dynamic distinctiveness of the signature, thus this method lies within those referred as dynamic or on-line signature verification. This proposal makes use of a variation of the Longest Common Subsequence Problem together with Genetic Algorithm for this purpose.
引用
收藏
页数：6
相关论文
共 50 条
  • [41] BOUNDS ON COMPLEXITY OF LONGEST COMMON SUBSEQUENCE PROBLEM
    AHO, AV
    HIRSCHBERG, DS
    ULLMAN, JD
    JOURNAL OF THE ACM, 1976, 23 (01) : 1 - 12
  • [42] An improved algorithm for the longest common subsequence problem
    Mousavi, Sayyed Rasoul
    Tabataba, Farzaneh
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 512 - 520
  • [43] Improved Dynamic Algorithms for Longest Increasing Subsequence
    Kociumaka, Tomasz
    Seddighin, Saeed
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 640 - 653
  • [44] A Hybrid Metaheuristic for the Longest Common Subsequence Problem
    Lozano, Manuel
    Blum, Christian
    HYBRID METAHEURISTICS, 2010, 6373 : 1 - +
  • [45] Efficient algorithms for finding a longest common increasing subsequence
    Chan, WT
    Zhang, Y
    Fung, SPY
    Ye, DS
    Zhu, H
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 665 - 674
  • [46] Efficient algorithms for finding a longest common increasing subsequence
    Wun-Tat Chan
    Yong Zhang
    Stanley P. Y. Fung
    Deshi Ye
    Hong Zhu
    Journal of Combinatorial Optimization, 2007, 13 : 277 - 288
  • [47] CONSTRAINED LONGEST COMMON SUBSEQUENCE COMPUTING ALGORITHMS IN PRACTICE
    Deorowicz, Sebastian
    Obstoj, Joanna
    COMPUTING AND INFORMATICS, 2010, 29 (03) : 427 - 445
  • [48] New refinement techniques for longest common subsequence algorithms
    Bergroth, L
    Hakonen, H
    Väisänen, J
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2003, 2857 : 287 - 303
  • [49] Efficient algorithms for finding a longest common increasing subsequence
    Chan, Wun-Tat
    Zhang, Yong
    Fung, Stanley P. Y.
    Ye, Deshi
    Zhu, Hong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 13 (03) : 277 - 288
  • [50] Online signature verification based on signatures turning angle representation using longest common subsequence matching
    Barkoula, K.
    Economou, G.
    Fotopoulos, S.
    INTERNATIONAL JOURNAL ON DOCUMENT ANALYSIS AND RECOGNITION, 2013, 16 (03) : 261 - 272
12345