Abstract

The security of handwritten documents is very important in authentication systems. In this paper, a forgery detection method is proposed for verifying handwritten documents. This method proposes two types of novel features: macro and micro. Macro features extract the structure of handwritten while micro features extract more detailed information. Also, the micro features try to extract some properties similar to online properties from offline data such as pen pressure and velocity. After extracting those features a PCA is applied to them which resulted in reducing the feature vector. A simple positive classifier is used separately to detect forgeries. It is very important that the weights of this classifier have been adjusted based on positive data because it is not possible to use forgery samples in adjusting phase. To test the proposed method a Persian handwritten data set was prepared using four kinds of forgeries; random, unskilled, skilled, and mimic. This data set consists of numbers written by text as reference words. The method performance using these different reference words showed the best result in correct rejection was 87 % while the correct acceptance was 97 %. We believe the proposed method can be applied to other languages by adjusting some parameters but because it is very important to have the data in high resolution format (e.g. 1,200 dpi) and none of databases have such resolution, the method was only applied to the dataset we gathered.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.