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 条
  • [1] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM
    HIRSCHBERG, DS
    JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675
  • [2] Dynamic programming algorithms for the mosaic longest common subsequence problem
    Huang, Kuo-Si
    Yang, Chang-Biau
    Tseng, Kuo-Tsung
    Peng, Yung-Hsing
    Ann, Hsing-Yen
    INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 99 - 103
  • [3] Parallel algorithms for the longest common subsequence problem
    Babu, KN
    Saxena, S
    FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, : 120 - 125
  • [4] PARALLEL ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LU, M
    LIN, H
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 835 - 848
  • [5] A genetic algorithm for the longest common subsequence problem
    Hinkemeyer, Brenda
    Julstrorn, Bryant A.
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 609 - +
  • [6] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Jansen, Thomas
    Weyland, Dennis
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 939 - +
  • [7] Algorithms for computing variants of the longest common subsequence problem
    Iliopoulos, Costas S.
    Rahman, A. Sohel
    THEORETICAL COMPUTER SCIENCE, 2008, 395 (2-3) : 255 - 267
  • [8] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Thomas Jansen
    Dennis Weyland
    Algorithmica, 2010, 57 : 170 - 186
  • [9] Heuristic algorithms for the Longest Filled Common Subsequence Problem
    Mincu, Radu Stefan
    Popa, Alexandru
    2018 20TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2018), 2019, : 449 - 453
  • [10] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Jansen, Thomas
    Weyland, Dennis
    ALGORITHMICA, 2010, 57 (01) : 170 - 186
12345