Corpus ID: 17476298

Realization of a Signature Verification System Based on Morphological Transformation and Using the TMS 320 C 6713 Digital Signal Processor

@inproceedings{Zois2005RealizationOA,
  title={Realization of a Signature Verification System Based on Morphological Transformation and Using the TMS 320 C 6713 Digital Signal Processor},
  author={Elias N. Zois and Evagelos Pikasis and Z. Kotsidimou and P. Tsitouras and Athanasios Nassiopoulos},
  year={2005}
}
In this paper a feature vector, which has been used for curve coding, is evaluated in case of a signature verification scheme using a real time digital signal processor. The feature extraction method is based on morphologically processing the vertical projections of prescaled signature images. Coding of the curve profiles is carried out using morphological opening which explores the pixel allocation along the directions of projection. Various lengths for the structuring element are employed to… Expand

Figures from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Computer Detection of Freehand Forgeries
TLDR
The detection of freehand forgeries of signatures on bank checks makes use of size ratio and slant features derived from Eden's kinematic stroke model for handwriting, which was modified to make it applicable to prewritten material. Expand
Nonlinear shape normalization methods for the recognition of large-set handwritten characters
TLDR
These methods are reviewed from the two points of view: feature projection and feature density equalization and a systematic comparison of them has been made based on the following criteria: recognition rate, processing speed, computational complexity and degree of variation. Expand
Morphological waveform coding for writer identification
TLDR
Both Bayesian classifiers and neural networks are employed to test the efficiency of the proposed feature and the achieved identification success using a long word exceeds 95%. Expand
Automatic signature verification and writer identification - the state of the art
Abstract This paper presents a survey of the literature on automatic signature verification and writer identification by computer, and an overview of achievements in static and dynamic approaches toExpand
Automatic Bankcheck Processing: A New Engineered System
TLDR
A full exploitation of the contextual knowledge, together with a multi-expert approach, have been used both to analyze the complex shape of handwritten text and to design the new bankcheck processing system. Expand
Optical recognition of handwritten Chinese characters: Advances since 1980
TLDR
As an area with sufficient challenge, considerable application potential, and extensive test data, handwritten Chinese character recognition is a good testbed for new recognition algorithms and enables connectionist models to be compared with more traditional recognition methods. Expand
Image Analysis and Mathematical Morphology
TLDR
This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones. Expand
Structural description and classification of signature images
TLDR
A new method is introduced for describing signature images that involves features of the signatures and relations among its parts organized in a hierarchical structure to classify and globally analyse their structure. Expand
Algorithms for Shape Analysis of Contours and Waveforms
  • T. Pavlidis
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1980
Algorithms for shape analysis are reviewed and classified under various criteria, whether they examine the boundary only or the whole area and whether they describe the original picture in terms ofExpand
Properties of contour codes
TLDR
It is shown that the chain code and midcrack code may be derived from the crack code, and relationships between simple measures of perimeter and area as obtained from the different codes and from bit quads are proved. Expand
...
1
2
3
...