System for encoding signatures for compressed storage using a signature encoding algorithm

• US 20070065021A1
• Filed: 07/13/2006
• Published: 03/22/2007
• Est. Priority Date: 07/14/2005
• Status: Abandoned Application

• Current Assignee: US Biometrics Corporation
• Original Assignee: US Biometrics Corporation
• Inventors: Shaver, Jason, Delgrosso, David, Orr, Fraser
• Application Number:
  US11/486,444
• Publication Number:
  US 20070065021A1
• Time in Patent Office: Days
• US Class Current: 382/232
• CPC Class Codes: G06V 40/30 Writer recognition; Reading and verifying signatures

Abstract

A method of encoding markings, such as handwritten signatures includes the steps of mapping the markings for each line by creating a line profile for each line, sorting the line profiles into at least two arrays distinguished from each other by at least one characteristic contained in each line profile, optimizing the at least two arrays by reducing redundant line profiles, and converting the at least two arrays into code.

Claims

1. A method of encoding markings having a plurality of lines therein comprising the steps of:

a) mapping the markings;

b) sorting the mapped markings;

c) optimizing the sorted mapped markings to reduce redundant information; and

,

d) converting the optimized and sorted mapped markings into code.

2. The method of claim 1 wherein the markings includes handwriting.

3. The method of claim 1 wherein the markings includes a handwritten signature.

4. The method of claim 1 wherein the step of mapping the markings includes the steps of producing:

i) a first data set of line directions for each line,

ii) a second data set of start location coordinates for each line and line direction, and

iii) a third data set of lengths for each line, each line direction, and each start location coordinates.

5. The method of claim 4 wherein the step of sorting the mapped markings includes the step of producing at least two arrays distinguished from one another by at least one characteristic contained in one of the data sets, with each array containing data from the first, second and third data sets.

6. The method of claim 5 wherein the step of optimizing the sorted mapped markings includes the steps of:

i) ranking the at least two arrays so as to create a first array and at least one other array,

ii) removing data from the at least one other array based upon a first pre-established criteria,

iii) removing data from the first array duplicated in the at least one other array and is based upon a second pre-established criteria, and

iv) removing data from the at least one other array duplicated in the first array.

7. The method of claim 6 wherein the step of converting the optimized and sorted mapped markings into a code includes the steps of:

i) sorting each array based upon data in the third data set,

ii) combining the arrays to create a single array,

iii) converting the data to a plurality of bit strings based upon the following criteria;

a) creating first bit strings based upon data in the first data set,

b) generating second bit strings based upon data in the third data set, and

c) generating third bit strings based upon data in the second data set,

iv) combining the first bit strings, second bit strings and third bit strings for the single array to create a cumulative bit string,

v) grouping the cumulative bit string into separate substrings, and

vi) converting the separate substrings into ASCII code.

8. The method of claim 1 wherein:

a) the step of mapping the markings includes the steps of producing;

i) a first data set of line directions for each line,

ii) a second data set of start location coordinates for each line and line direction, and

iii) a third data set of lengths for each line, each line direction, and each start location coordinates;

b) the step of sorting the mapped markings includes the step of producing;

i) at least two arrays distinguished from one another by at least one characteristic contained in one of the data sets, with each array containing data from the first, second and third data sets;

c) the step of optimizing the sorted mapped markings includes the steps of;

i) ranking the at least two arrays so as to create a first array and at least one other array,

ii) removing data from the at least one other array based upon a first pre-established criteria,

iii) removing data from the first array duplicated in the at least one other array and is based upon a second pre-established criteria, and

iv) removing data from the at least one other array duplicated in the first array; and

,

d) the step of converting the optimized and sorted mapped markings into a code includes the steps of;

i) sorting each array based upon data in the third data set,

ii) combining the arrays to create a single array,

iii) converting the data to a plurality of bit strings based upon the following criteria;

a) creating first bit strings based upon data in the first data set,

b) generating second bit strings based upon data in the third data set, and

c) generating third bit strings based upon data in the second data set,

iv) combining the first bit strings, second bit strings and third bit strings for the single array to create a cumulative bit string,

v) grouping the cumulative bit string into separate substrings, and

vi) converting the separate substrings into ASCII code.

9. A method of encoding markings having a plurality of lines therein comprising the steps of:

a) mapping the markings for each line by creating a line profile for each line;

b) sorting the line profiles into at least two arrays distinguished from each other by at least one characteristic contained in each line profile;

c) optimizing the at least two arrays by reducing redundant line profiles; and

,

d) converting the at least two arrays into code.

10. The method of claim 9 wherein the markings includes handwriting.

11. The method of claim 9 wherein the markings includes a handwritten signature.

12. The method of claim 9 wherein:

a) each line profile comprises a line direction, a line start location coordinates and a line length;

b) the one characteristic is the line direction so that each array includes line profiles having the same line directions; and

c) the step of optimizing the at least two arrays by reducing redundant line profiles includes the steps of

i) ranking the at least two arrays so as to create a primary array and at least one secondary array,

ii) removing each line profile from the secondary array(s) having a line length of one,

iii) removing each line profile from the primary array having a line length of one and is duplicated in the secondary array(s), and

iv) removing each line profile from the secondary array(s) that is duplicated in the primary array.

13. The method of claim 12 wherein the step of converting the at least two arrays into code includes the steps of:

i) sorting each array based upon line length,

ii) combining the arrays by stacking the primary array and then the secondary array(s) to create a single array,

iii) converting the line profiles to a plurality of bit patterns of a pre-selected length,

iv) combining the bit patterns of the single array to create a cumulative bit string,

v) grouping the cumulative bit string into separate substrings, and

vi) converting the separate substrings into ASCII code.

14. The method of claim 9 wherein:

a) each line profile comprises a line direction, a line start location coordinates and a line length;

b) the one characteristic is the line direction so that each array includes line profiles having the same line directions;

c) the step of optimizing the at least two arrays by reducing redundant line profiles includes the steps of;

i) ranking the at least two arrays so as to create a primary array and at least one secondary array,

ii) removing each line profile from the secondary array(s) having a line length of one,

iii) removing each line profile from the primary array having a line length of one and is duplicated in the secondary array(s), and

iv) removing each line profile from the secondary array(s) that is duplicated in the primary array; and

,

d) the step of converting the at least two arrays into code includes the steps of

i) sorting each array based upon line length,

ii) combining the arrays by stacking the primary array and then the secondary array(s) to create a single array,

iii) converting the line profiles to a plurality of bit patterns of a pre-selected length,

iv) combining the bit patterns of the single array to create a cumulative bit string,

v) grouping the cumulative bit string into separate substrings, and

vi) converting the separate substrings into ASCII code.