Ahmad Jaini, Azhar (2010) Stroke-to-stroke matching in on-line signature verification. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems.
|
PDF
- Submitted Version
Restricted to Repository staff only 1252Kb | |
|
PDF
1010Kb | |
|
PDF
1019Kb | |
|
PDF
1015Kb |
Abstract
On-line Signature Verification is a field of verifying the time series signature data that normally obtained from the tablet-based device. Unlike common signature image, the on-line signature image data consists of points that are arranged in sequence based on time. The aim of this research is to develop a new approach to map the strokes in both test and reference signatures as well as to verify the originality of the test signatures. Current methods make use of the DTW algorithm and its variant to segment them before comparing each of its data dimension. This project suggesting a modified DTW algorithm with the proposed Missed Nodes Recovery Algorithm aims to improve the mapping performance, hence the development of stroke to stroke signature comparison is possible. This project is also proposing a method to compare the strokes with its similar strokes in on-line signature. All algorithm and experiments will be carried out using Matlab. The output of this research project is an algorithm that can be used to map strokes as well as to compare similarity of strokes in on-line signature.
| Item Type: | Thesis (Masters) |
|---|---|
| Additional Information: | Thesis (Sarjana Sains (sains Komputer)) - Universiti Teknologi Malaysia, 2010 |
| Uncontrolled Keywords: | on-line signature verification, signature data, DTW algorithm |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Computer Science and Information System |
| ID Code: | 11063 |
| Deposited By: | Ms Zalinda Shuratman |
| Deposited On: | 25 Nov 2010 02:38 |
| Last Modified: | 05 Jul 2012 07:05 |
Repository Staff Only: item control page

