Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
An off-line signature verification system using an extracted displacement function
Pattern Recognition Letters
Fuzzy shape-memory snakes for the automatic off-line signature verification problem
Fuzzy Sets and Systems
Improved Fuzzy Snakes Applied to Biometric Verification Problems
ISDA '09 Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications
Similarity measurement for off-line signature verification
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Automatic Signature Verification: The State of the Art
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Matching of complex patterns by energy minimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
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).