Comparing Elastic Alignment Algorithms for the Off-Line Signature Verification Problem
This paper systematically compares two elastic graph matching methods for off-line signature verification: shape-memory snakes and parallel segment matching, respectively. As in many practical applications (i.e. those related to bank environments), the number of sample signatures to train the system must be very reduced, we selected these two methods which hold that property. Both methods also share some other similarities since they use graph models to perform the verification task and require a registration pre-processing. Experimental results on the same database and using the same evaluation metrics have shown that the shape-memory snakes clearly outperformed to the parallel segment matching approach on the same signature dataset (9% EER compared to 24% EER, respectively).
Keywordsoff-line signature verification snakes graph matching elastic alignment pattern recognition fuzzy sets.
Unable to display preview. Download preview PDF.
- 11.Phillips, P.J., Martin, A., Wilson, C.L., Przybocki, M.: An Introduction to Evaluating Biometric Systems. IEEE Computer, 56–63 (2000)Google Scholar
- 12.Vélez, J., Sánchez, A., Fernández, F.: Improved Fuzzy Snakes Applied to Biometric Verification Problems. In: Proc. 9th Intl. Conf. on Intelligent System Design and Applications, pp. 158–163. IEEE Press, Los Alamitos (2009)Google Scholar
- 14.Vélez, J.F., Sánchez, A., Moreno, A.B.: Robust off-line signature verification using compression networks and positional cuttings. In: Proc. IEEE 13th Intl. Workshop on Neural Networks for Signal Processing, pp. 627–636. IEEE Press, Los Alamitos (2003)Google Scholar