The performances of parametric and reference-pattern-based features (RPBFs) in static signature verification are compared. It is shown that RPBFs significantly improve the results and result in a verification rate of about 90% on skilled forgeries using only shape features. The proposed extension of the concept of RPBFs to the two-dimensional form has led to an important achievement in signature verification, where approximately 100% elimination of skilled forgeries in offline systems has been made possible using only shape features.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Maan Ammar (2002) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: