147 research outputs found

    Learning Representations from Persian Handwriting for Offline Signature Verification, a Deep Transfer Learning Approach

    Full text link
    Offline Signature Verification (OSV) is a challenging pattern recognition task, especially when it is expected to generalize well on the skilled forgeries that are not available during the training. Its challenges also include small training sample and large intra-class variations. Considering the limitations, we suggest a novel transfer learning approach from Persian handwriting domain to multi-language OSV domain. We train two Residual CNNs on the source domain separately based on two different tasks of word classification and writer identification. Since identifying a person signature resembles identifying ones handwriting, it seems perfectly convenient to use handwriting for the feature learning phase. The learned representation on the more varied and plentiful handwriting dataset can compensate for the lack of training data in the original task, i.e. OSV, without sacrificing the generalizability. Our proposed OSV system includes two steps: learning representation and verification of the input signature. For the first step, the signature images are fed into the trained Residual CNNs. The output representations are then used to train SVMs for the verification. We test our OSV system on three different signature datasets, including MCYT (a Spanish signature dataset), UTSig (a Persian one) and GPDS-Synthetic (an artificial dataset). On UT-SIG, we achieved 9.80% Equal Error Rate (EER) which showed substantial improvement over the best EER in the literature, 17.45%. Our proposed method surpassed state-of-the-arts by 6% on GPDS-Synthetic, achieving 6.81%. On MCYT, EER of 3.98% was obtained which is comparable to the best previously reported results

    Active Transfer Learning for Persian Offline Signature Verification

    Full text link
    Offline Signature Verification (OSV) remains a challenging pattern recognition task, especially in the presence of skilled forgeries that are not available during the training. This challenge is aggravated when there are small labeled training data available but with large intra-personal variations. In this study, we address this issue by employing an active learning approach, which selects the most informative instances to label and therefore reduces the human labeling effort significantly. Our proposed OSV includes three steps: feature learning, active learning, and final verification. We benefit from transfer learning using a pre-trained CNN for feature learning. We also propose SVM-based active learning for each user to separate his genuine signatures from the random forgeries. We finally used the SVMs to verify the authenticity of the questioned signature. We examined our proposed active transfer learning method on UTSig: A Persian offline signature dataset. We achieved near 13% improvement compared to the random selection of instances. Our results also showed 1% improvement over the state-of-the-art method in which a fully supervised setting with five more labeled instances per user was used

    Poisoning Attacks on Learning-Based Keystroke Authentication and a Residue Feature Based Defense

    Get PDF
    Behavioral biometrics, such as keystroke dynamics, are characterized by relatively large variation in the input samples as compared to physiological biometrics such as fingerprints and iris. Recent advances in machine learning have resulted in behaviorbased pattern learning methods that obviate the effects of variation by mapping the variable behavior patterns to a unique identity with high accuracy. However, it has also exposed the learning systems to attacks that use updating mechanisms in learning by injecting imposter samples to deliberately drift the data to impostors’ patterns. Using the principles of adversarial drift, we develop a class of poisoning attacks, named Frog-Boiling attacks. The update samples are crafted with slow changes and random perturbations so that they can bypass the classifiers detection. Taking the case of keystroke dynamics which includes motoric and neurological learning, we demonstrate the success of our attack mechanism. We also present a detection mechanism for the frog-boiling attack that uses correlation between successive training samples to detect spurious input patterns. To measure the effect of adversarial drift in frog-boiling attack and the effectiveness of the proposed defense mechanism, we use traditional error rates such as FAR, FRR, and EER and the metric in terms of shifts in biometric menagerie

    ICFHR 2020 Competition on Short answer ASsessment and Thai student SIGnature and Name COMponents Recognition and Verification (SASIGCOM 2020)

    Full text link
    This paper describes the results of the competition on Short answer ASsessment and Thai student SIGnature and Name COMponents Recognition and Verification (SASIGCOM 2020) in conjunction with the 17th International Conference on Frontiers in Handwriting Recognition (ICFHR 2020). The competition was aimed to automate the evaluation process short answer-based examination and record the development and gain attention to such system. The proposed competition contains three elements which are short answer assessment (recognition and marking the answers to short-answer questions derived from examination papers), student name components (first and last names) and signature verification and recognition. Signatures and name components data were collected from 100 volunteers. For the Thai signature dataset, there are 30 genuine signatures, 12 skilled and 12 simple forgeries for each writer. With Thai name components dataset, there are 30 genuine and 12 skilfully forged name components for each writer. There are 104 exam papers in the short answer assessment dataset, 52 of which were written with cursive handwriting; the rest of 52 papers were written with printed handwriting. The exam papers contain ten questions, and the answers to the questions were designed to be a few words per question. Three teams from distinguished labs submitted their systems. For short answer assessment, word spotting task was also performed. This paper analysed the results produced by their algorithms using a performance measure and defines a way forward for this subject of research. Both the datasets, along with some of the accompanying ground truth/baseline mask will be made freely available for research purposes via the TC10/TC11

    Multiple generation of Bengali static signatures

    Get PDF
    Handwritten signature datasets are really necessary for the purpose of developing and training automatic signature verification systems. It is desired that all samples in a signature dataset should exhibit both inter-personal and intra-personal variability. A possibility to model this reality seems to be obtained through the synthesis of signatures. In this paper we propose a method based on motor equivalence model theory to generate static Bengali signatures. This theory divides the human action to write mainly into cognitive and motor levels. Due to difference between scripts, we have redesigned our previous synthesizer [1,2], which generates static Western signatures. The experiments assess whether this method can approach the intra and inter-personal variability of the Bengali-100 Static Signature DB from a performance-based validation. The similarities reported in the experimental results proof the ability of the synthesizer to generate signature images in this script

    Validation of dynamic signature for identity verification

    Get PDF
    Machine based identity validation is extremely important to determine the authenticity of documents, for financial transactions, and for e-communication. Recent explosion of frauds have demonstrated the ineffectiveness of password, personal identification numbers and biometrics. This thesis presents a signature verification technique which is inexpensive, user friendly, robust against impostors and is reliable, and insensitive to factors such as users’ exposure to emotional stimuli. This work has addressed three important issues which are: • The selection of appropriate features for dynamic and static signatures. • The suitable classifier for classification of the features. • The impact of emotional stimuli on the natural handwriting and signatures of the subjects. The thesis reports a comparison of the dynamic and static signatures and demonstrates that while the dynamic signature technique has a small increase in the rejection of the authentic user (92% compared with 94%), the system is far more discerning regarding the acceptance of the impostors (1% compared with 21%). The work also demonstrates that the use of ’unknown’ as a class reduces the rejection to zero, by putting those into a class who would be asked to repeat the experiment. This thesis has also studied the impact of emotional stimuli on peoples’ handwriting and signatures and has determined that while the signatures are insensitive to these stimuli, the handwriting is affected by these stimuli. This outcome may be of importance for people who conduct graphology analysis on people because this suggests that while general handwriting is affected by short term emotional changes of people, signatures are a more robust indicator of the person and hence their personality

    Automatic Signature Verification: The State of the Art

    Full text link
    corecore