K-nearest neighbour and dynamic time warping for online signature verification
Online signatures are one of the most commonly used biometrics. Several verification systems and public databases were presented in this field. This paper presents a combination of k-nearest neighbor and dynamic time warping algorithms as a verification system using the recently published DeepSignDB database. Our algorithm was applied on both finger and stylus input signatures which represent both office and mobile scenarios. The system was first tested on the development set of the database. It achieved an error rate of 6.04% for the stylus input signatures, 5.20% for the finger input signatures, and 6.00% for a combination of both types. The system was also applied to the evaluation set of the database and achieved very promising results, especially for finger input signatures.
Code (0)
등록된 구현이 없습니다.
Tasks
Dynamic Time WarpingSimilar Papers 제목 키워드 기반
An Experimental Evaluation of Nearest Neighbour Time Series Classification
Data mining research into time series classification (TSC) has focussed on alternative distance measures for nearest neighbour classifiers. It is standard practice to use 1-NN with Euclidean or dynamic time warping (DTW)…
ClassificationDynamic Time WarpingGeneral ClassificationTime Series+3A Case-Study on the Impact of Dynamic Time Warping in Time Series Regression
It is well understood that Dynamic Time Warping (DTW) is effective in revealing similarities between time series that do not align perfectly. In this paper, we illustrate this on spectroscopy time-series data. We show th…
Dynamic Time WarpingregressionTime SeriesTime Series Analysis+1Discovery of Important Subsequences in Electrocardiogram Beats Using the Nearest Neighbour Algorithm
The classification of time series data is a well-studied problem with numerous practical applications, such as medical diagnosis and speech recognition. A popular and effective approach is to classify new time series in …
ClassificationDynamic Time WarpingGeneral ClassificationMedical Diagnosis+4Approximate Nearest Neighbour Search on Dynamic Datasets: An Investigation
Approximate k-Nearest Neighbour (ANN) methods are often used for mining information and aiding machine learning on large scale high-dimensional datasets. ANN methods typically differ in the index structure used for accel…
Making the Dynamic Time Warping Distance Warping-Invariant
The literature postulates that the dynamic time warping (dtw) distance can cope with temporal variations but stores and processes time series in a form as if the dtw-distance cannot cope with such variations. To address …
Dynamic Time WarpingTime SeriesTime Series Analysis