Legal claims defining the scope of protection, as filed with the USPTO.
2. The method of claim 1 , wherein: the random matrix includes: a size including a raw template dimension by a transformed template dimension; and values of 0 or 1, wherein a probability of a particular element of the random matrix being 1 is a particular probability.
3. The method of claim 1 , wherein the first transformed biometric template and the second transformed biometric template are members of a vector space having a transformed template dimension.
4. The method of claim 1 , wherein the approximate matching is based on a hamming distance between the first transformed biometric template and the second transformed template.
5. The method of claim 1 , further comprising receiving initialization data including a first hamming value, a second hamming value, and a transformed hamming threshold, wherein: the first hamming value is less than the second hamming value; the second hamming value is less than a transformed template dimension; when a hamming distance between the first raw biometric template and the second raw biometric template less than the first hamming value, then a probability of a hamming distance between the first transformed biometric template and the second transformed biometric template being greater than the transformed hamming threshold is less than 1 in 10,000; and when the hamming distance between the first raw biometric template and the second raw biometric template is greater than the second hamming value, then a probability of the transformed hamming distance between the first transformed biometric template and the second transformed biometric template being less than or equal to the transformed hamming threshold is less than 1 in 10,000.
6. The method of claim 1 , wherein: the first raw biometric template is defined according to an expression X T ε{0,1} n ; the second raw biometric template is defined according to an expression Y T ε{0,1} n ; the first transformed biometric template is defined according to an expression X T′ =RX T ε{0,1} k ; the second transformed biometric template is defined according to an expression Y T′ =RY T ε{0,1} k , in which: Y T represents the second raw biometric template; {0,1} k represents a vector space having a dimension that includes the first transformed template dimension; and Y T′ represents the second transformed biometric template.
8. The non-transitory computer-readable medium of claim 7 , wherein: the random matrix includes: a size including a raw template dimension by a transformed template dimension; and values of 0 or 1, wherein a probability of a particular element of the random matrix being 1 is a particular probability.
9. The non-transitory computer-readable medium of claim 7 , wherein the first transformed biometric template and the second transformed biometric template are members of a vector space having a transformed template dimension.
10. The non-transitory computer-readable medium of claim 7 , wherein the approximate matching is based on a hamming distance between the first transformed biometric template and the second transformed template.
11. The non-transitory computer-readable medium of claim 7 , wherein: the operations further comprise receiving initialization data including a first hamming value, a second hamming value, and a transformed hamming threshold; the first hamming value is less than the second hamming value; the second hamming value is less than a transformed template dimension; when a hamming distance between the first raw biometric template and the second raw biometric template less than the first hamming value, then a probability of a hamming distance between the first transformed biometric template and the second transformed biometric template being greater than the transformed hamming threshold is less than 1 in 10,000; and when the hamming distance between the first raw biometric template and the second raw biometric template is greater than the second hamming value, then a probability of the transformed hamming distance between the first transformed biometric template and the second transformed biometric template being less than or equal to the transformed hamming threshold is less than 1 in 10,000.
12. The non-transitory computer-readable medium of claim 7 , wherein: the first raw biometric template is defined according to an expression X T ε{0,1} n ; the second raw biometric template is defined according to an expression Y T ε{0,1} n ; the first transformed biometric template is defined according to an expression X T′ =RX T ε{0,1} k ; the second transformed biometric template is defined according to an expression Y T′ =RY T ε{0,1} k , in which: Y T represents the second raw biometric template; {0,1} k represents a vector space having a dimension that includes the first transformed template dimension; and Y T′ represents the second transformed biometric template.
14. The method of claim 13 , wherein the random matrix includes: a size including a raw template dimension by a transformed template dimension; and values of 0 or 1, wherein a probability of a particular element of the random matrix being 1 is a particular probability.
15. The method of claim 13 , further comprising: in response to the hamming distance being above the transformed hamming threshold, not communicating the authentication signal to the user device.
16. The method of claim 13 , wherein: the first transformed biometric template and the second transformed biometric template are members of a vector space having a transformed template dimension.
17. The method of claim 13 , further comprising selecting the transformed hamming threshold and the initialization data including a first hamming value, a second hamming value, and a transformed hamming threshold, wherein: the first hamming value is less than the second hamming value; the second hamming value is less than a transformed template dimension; when a hamming distance between the first raw biometric template and the second raw biometric template less than the first hamming value, then a probability of a hamming distance between the first transformed biometric template and the second transformed biometric template being greater than the transformed hamming threshold is less than 1 in 10,000; and when the hamming distance between the first raw biometric template and the second raw biometric template is greater than the second hamming value, then a probability of the transformed hamming distance between the first transformed biometric template and the second transformed biometric template being less than or equal to the transformed hamming threshold is less than 1 in 10,000.
18. The method of claim 13 , wherein: the first raw biometric template is defined according to an expression X T ε{0,1} n ; the second raw biometric template is defined according to an expression Y T ε{0,1} n ; the first transformed biometric template is defined according to an expression X T′ =RX T ε{0,1} k ; the second transformed biometric template is defined according to an expression Y T′ =RY T ε{0,1} k , in which: Y T represents the second raw biometric template; {0,1} k represents a vector space having a dimension that includes the first transformed template dimension; and Y T′ represents the second transformed biometric template.
19. The method of claim 13 , further comprising encrypting the registration template.
21. The non-transitory computer-readable medium of claim 20 , wherein the random matrix includes: a size including a raw template dimension by a transformed template dimension; and values of 0 or 1, wherein a probability of a particular element of the random matrix being 1 is a particular probability.
22. The non-transitory computer-readable medium of claim 20 , wherein the operations further comprise: in response to the hamming distance being above the transformed hamming threshold, not communicating the authentication signal to the user device.
23. The non-transitory computer-readable medium of claim 20 , wherein: the first transformed biometric template and the second transformed biometric template are members of a vector space having a transformed template dimension.
24. The non-transitory computer-readable medium of claim 20 , wherein: the operations further comprise selecting the transformed hamming threshold and the initialization data including a first hamming value and a second hamming value; the first hamming value is less than the second hamming value; the second hamming value is less than a transformed template dimension; when a hamming distance between the first raw biometric template and the second raw biometric template less than the first hamming value, then a probability of a hamming distance between the first transformed biometric template and the second transformed biometric template being greater than the transformed hamming threshold is less than 1 in 10,000; and when the hamming distance between the first raw biometric template and the second raw biometric template is greater than the second hamming value, then a probability of the transformed hamming distance between the first transformed biometric template and the second transformed biometric template being less than or equal to the transformed hamming threshold is less than 1 in 10,000.
25. The non-transitory computer-readable medium of claim 20 , wherein: the first raw biometric template is defined according to an expression X T ε{0,1} n ; the second raw biometric template is defined according to an expression Y T ε{0,1} n ; the first transformed biometric template is defined according to an expression X T′ =RX T ε{0,1} k ; the second transformed biometric template is defined according to an expression Y T′ =RY T ε{0,1} k , in which: Y T represents the second raw biometric template; {0,1} k represents a vector space having a dimension that includes the first transformed template dimension; and Y T′ represents the second transformed biometric template.
26. The non-transitory computer-readable medium of claim 20 , wherein the operations further comprise encrypting the registration template.
Unknown
September 26, 2017
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.