Abstract
The signing process is one of the most important processes used by organizations to ensure the confidentiality of information and to protect it against any unauthorized penetration or access to such information. As organizations and individuals enter the digital world, there is an urgent need for a digital system capable of distinguishing between the original and fraud signature, in order to ensure individuals authorization and determine the powers allowed to them. In this paper, three widely used feature detection algorithms, HARRIS, BRISK (Binary Robust Invariant Scalable Keypoints) and FAST (Features from Accelerated Segment), these algorithms are compared to calculate the run time and accuracy for set of signature images. Three techniques have been applied using (UTSig) dataset; the experiment consisted of four phases: first, applying the techniques on one image, then on four images, then on eight images, finally applying the techniques on ten images where time and accuracy were calculated for each algorithm in the all phases. The results showed that the BRISK algorithm got the best result among the feature detection algorithm in terms of accuracy and the FAST algorithm got the best result among the feature detection algorithm in terms of run time.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Engineering & Technology
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.
