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

@article{FloresMndez2010DynamicSV,
  title={Dynamic signature verification through the Longest Common Subsequence Problem and Genetic Algorithms},
  author={Alejandro Flores-M{\'e}ndez and Manuel Bernal-Urbina},
  journal={IEEE Congress on Evolutionary Computation},
  year={2010},
  pages={1-6}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Using Adapted Levenshtein Distance for On - Line Signature Verification

S. Vielhauer Shimke, J. C. Dittmann
Proceedings of the 17 th International Conference on Pattern Recognition • 2004

The Complexity of Some Problems on Subsequences and Supersequences

D. Maier
ACM . Jacme . • 1978

Similar Papers

Loading similar papers…