Hierarchical Random Graph Model for Off-line Handwritten Signatures Recognition

  • Authors:
  • Marcin Piekarczyk

  • Affiliations:
  • -

  • Venue:
  • CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The article presents the approach based on the usage of syntactic methods for the static analysis of handwritten signatures. The graph linguistic formalisms applied, such as the IE graph and ETPL(k) grammar, are characterised by considerable descriptive strength and a polynomial membership problem of the syntactic analysis. For the purposes of representing the analysed handwritten signatures, new hierarchical (two-layer) HIE graph structures based on IE graphs have been defined. The two-layer graph description makes it possible to take into consideration both local and global features of the signature. The usage of attributed graphs enables the storage of additional semantic information (in the form of a set of parameters) describing the properties of individual signature strokes. Information about the shapes of specimen signatures is presented in the form of a language based on random IE graphs and stochastic class ETPL(k) grammars, which makes it possible to take into consideration the natural variability of the shape of specimen signatures. The verification and recognition of a signature consists in analysing the affiliation of its graph description to the language describing the specimen database. Initial assessments display a precision of the method at a average level of about 17%.