Penlift Insertion Reconciliation Technique for Signature Verification
Original Publication Date: 1985-Jan-01
Included in the Prior Art Database: 2005-Feb-18
Previously known signature verification algorithms have described a technique for reconciling the number of segments of two signatures when one signature contains more segments than the other. The procedure involves deleting penlifts, or equivalently joining together two adjacent segments, from the signature with the greater number of segments. The algorithm computes the value of the sum of the squares of the difference of corresponding segment lengths. This value is compared for all combinations of deleted penlifts, and the combination that produces the minimum value is selected. The method described below uses the information provided in the sum to determine the appropriate segments that are missing a penlift in the signature with the smaller number of segments. These segments are then split apart, simulating a penlift.