• DocumentCode
    2330791
  • Title

    Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms

  • Author

    Flores-Mendez, Alejandro ; Bernal-Urbina, Manuel

  • fYear
    2010
  • fDate
    18-23 July 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    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.
  • Keywords
    digital signatures; genetic algorithms; handwriting recognition; learning (artificial intelligence); biometric verification; dynamic signature verification; genetic algorithm; longest common subsequence problem; online signature verification; Azimuth; Finite element methods; Forgery; Genetic algorithms; Polynomials; Proposals;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2010 IEEE Congress on
  • Conference_Location
    Barcelona
  • Print_ISBN
    978-1-4244-6909-3
  • Type

    conf

  • DOI
    10.1109/CEC.2010.5586312
  • Filename
    5586312
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2330791