Using geometric extrema for segment-to-segment characteristics comparison in online signature verification
A signature verification algorithm based on a segment-to-segment matching is described, in which a new approach for finding segment-to-segment correspondence is proposed. In the proposed method, geometric extrema are used as segmenting boundaries with two reasons: (1) extrema are reproduced with high stability and (2) the properties of extrema are useful in finding segment-to-segment correspondence. In this paper, a set of rules for legitimate correspondence between extrema is defined based on their properties, which is utilized for the similarity evaluation between segments. Dynamic programming is then applied to find an optimal correspondence map. Through experiments, the proposed algorithm is assessed to be effective in improving discriminative ability. We also showed that the overall performance is further improved by combining the proposed method with the traditional global parametric algorithm.
segmentation signature verification segment-to-segment correspondence dynamic programming biometrics security