Dynamic Signature Verification System Using Statistics Analysis
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 7
Abstract
In this paper, a new technique for dynamic signature modeling and classification framework is proposed. Raw dynamic data obtained from a digitizer are analyzed using statistic tools. The variation within the same person signatures is obtained for effective signature training and accurate classification of genuine signature against all kind of forgeries. The proposed system is robust enough to prevent forgery of dynamic ignatures. It has False Rejection Rate (FRR) of 0.2% for genuine signatures and False Acceptance Rate (FAR) of 0.25%, 0% and 0% for skilled, simple and random forgeries respectively. These results are better in comparison with the results obtained from previous systems.
Authors and Affiliations
Dr. S. A Daramola. , Prof. T. S Ibiyemi
DYNAMIC WAVELENGTH ALLOCATION IN WDM OPTICAL NETWORKS
This paper investigates the problem of dynamic wave length allocation and fairness control in WDM optical networks. A f network topology, wih a two-hop path network, is studied for three classes of traffic. Each class co...
PERFORMANCE CONTRIBUTION BASED SCHEDULING FRAMEWORK FOR PRECEDENCE CONSTRAINT TASKS IN REAL TIME SYSTEM
It is quite possible that in a process set, process may be having earliest deadline but its performance contribution is low in process set. Scheduling such processes with highest priority does not carry any meaning. Majo...
A Realistic Approach: RTST to Reduce Cost & Time
Regression testing is the most expensive technique, but this technique gives confidence that whatever changes has been incorporated they are not making any adverse affect to the output. In Regression Test Selection Techn...
Two Phase Data Reduction for Hough Transformation to Detect Skew
An important pre-processing task in an automated document image processing system is detection of skew in the image. Skew detection and correction is the first step in the document analysis and understanding processing s...
Co-Recursively Enumerable Triods with Computable Endpoints
Recursive sets in the Euclidean space are those sets which an be effectively approximated by finitely many points for an arbitrary given precision. On the other hand, co-recursively enumerable sets are those sets whose...