
10-03-2012, 03:53 PM
|
 |
Google Hound
Retired Moderator * Guru *
|
|
Join Date: Nov 2001
Location: Arizona, USA
Posts: 12,378
|
|
|
Is the fingerprint stored as an image?
Are there any index fields in the data table?
To improve lookup speed, you would need to improve (or add) indexes to the underlying data.
With fingerprints, you would need to normalize the images (rotate to a fixed position, and analyze the fingerprint to extract the fingerprint type (whorl/arch/etc.) and generate a set of points based on the fingerprint. Then, build key field data based on the type and points.
At the time of comparison, you would apply the same analysis to the subject fingerprint, then look up by the keyfield.
Think of the soundex algorithm, used to search for english last names. The first letter is saved. vowels are dropped, and double letters are changed to single ocurrances. Then, letters that 'sound' alike are coded numerically with a number from 0 to 9, and the first letter and the next three letter sound codes are used to find names that sound like the target name. If there are less than 4 characters, the soundex code is right padded with zeros.
So, a the last name with a soundex of B250 should sound close to one of B251.
This would be the sound equivalent of a visually-based fingerprint coding scheme.
The approach might be to first, rotate the image until the lines near the finger joint are horizontal. determine the angle of the major axis of the arch or whorl, and the location of the arch tip or whorl center. Then, from the center of the arch tip or whorl center, identify branches (points) in the patterns, (maybe with vector coordinates from the center/arch tip)
|
__________________
Lou
"I have my standards. They may be low, but I have them!" ~ Bette Middler
"It's a book about a Spanish guy called Manual. You should read it." ~ Dilbert
"To understand recursion, you must first understand recursion." ~ unknown
|