{"search_session":{},"preferences":{"l":"en","queryLanguage":"en"},"patentId":"US_8417655_B2","frontPageModel":{"patentViewModel":{"ref":{"entityRefType":"PATENT","entityRefId":"108-139-061-253-179"},"entityMetadata":{"linkedIds":{"empty":true},"tags":[],"collections":[{"id":10791,"type":"PATENT","title":"The Hebrew University of Jerusalem - Patent Portfolio","description":"","access":"OPEN_ACCESS","displayAvatar":true,"attested":false,"itemCount":7593,"tags":[],"user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"notes":[{"id":8259,"type":"COLLECTION","user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"text":"
Search Applicants and Owners separately: \"hebrew univ* jerusalem\"; \"hebrew univ* jerus*\"
Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1457
Search Applicants and Owners separately: \"hebrew univ* jerusalem\"; \"hebrew univ* jerus*\"
Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1457
generating a set of decisions associated with values (k,n) for determining whether the images match, where k, is a number of non similar pixels from a sample of size, n, of the pixels;\n
constraining the decisions so that a probability of providing a false negative decision that there is no match when in fact there is a match is less than or equal to a predetermined upper bound α and that a Bayesian probability of providing a false positive decision that there is a match, when there is no match, is less than or equal to a predetermined upper bound β;\n
configuring the association of decisions and pairs (k,n) to minimize a loss function responsive to a running time of a computer programmed to use the set of decisions in a sequential series of statistical hypothesis test to determine whether there is a match, wherein the loss function comprises a sum of an expected running time, a weighted probability of providing a false positive decision."],"number":1,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the set of decisions comprises:\n
a decision, NS, that the images do not match associated with each of a first set of pairs of values (k,n) and having a probability less than or equal to α; and\n
a decision, C, for each of a second set of pairs of values (k,n) that the sample n must be increased to determine whether the images match."],"number":2,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the probability of being wrong and providing a false negative decision is determined responsive to a prior probability for frequency of occurrence of regions that are not similar."],"number":3,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 2 wherein the set of decisions comprises a decision, S, associated with a third set of pairs of values (k,n) that the images match."],"number":4,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 4 wherein S has a probability of being incorrect and providing a false positive decision that there is a match when in fact there isn't, has a probability less than or equal to a predetermined upper bound β."],"number":5,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 5 wherein the probability of a decision S being wrong is determined responsive to a prior probability for frequency of occurrence of pixels that are not similar."],"number":6,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 4 and comprising a decision E to determine how many non-similar homologous pixels there are from among all the homologous pixels associated with a fourth set of values (k,n)."],"number":7,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 7 wherein all the decisions NS, S and E are associated with pairs of values (k,n) having a same n."],"number":8,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 and comprising a decision E to determine how many non-similar pixels there are from among all the pixels associated with a fourth set of values (k,n)."],"number":9,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the association of decisions and pairs (k,n) are configured to minimize a loss function responsive to the running time."],"number":10,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 10 wherein the loss function comprises a sum of an expected running time, a weighted probability of providing a false negative decision and a weighted probability of providing a false positive decision."],"number":11,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 11 wherein the weight for the false negative probability is less than or equal to RE(0)/[αP(D≦t)] where RE(0) is a running time for the computer to determine how many non-similar pixels from among all the pixels and P(D≦t) is a probability that the patterns in fact match."],"number":12,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 12 wherein the weight for the false positive probability is less than or equal to RE(0)/[βP(D>t) where P(D>t) is a probability that the patterns in fact do not match."],"number":13,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions for determining whether first and second images having a plurality of pixels match responsive to a number, k, of non similar pixels from a sample of size, n, of the pixels, the set of decisions comprising:\n
a computer processor;\n
a memory;\n
a decision, NS, that the second images do not match associated with each of a first set of pairs of values (k,n) and having a probability less than or equal to a predetermined upper bound a of being wrong and providing a false negative decision when in fact there is a match; and\n
a decision, C, for each of a second set of pairs of values (k,n) that the sample n must be increased to determine whether the second images match,\n
wherein the decisions are constrained so that a Bayesian probability of providing a false negative decision that there is no match when in fact there is a match is less than or equal to a predetermined upper bound α and that a Bayesian probability of providing a false positive decision that there is a match, when there is no match, is less than or equal to a predetermined upper bound β,\n
wherein the association of decisions and pairs (k,n) is configured to minimize a loss function responsive to a running time of a computer programmed to use the set of decisions in a sequential series of statistical hypothesis test to determine whether there is a match, wherein the loss function comprises a sum of an expected running time, a weighted probability of providing a false positive decision, and\n
wherein the decisions are stored on the memory and are executed by the computer processor."],"number":14,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions according to claim 14 and comprising a decision E to determine how many non-similar pixels there are from among all the the pixels associated with a third set of values (k,n)."],"number":15,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions according to claim 15 wherein all the decisions NS, E, and a decision, S that the second images match, associated with a fourth set of pairs of values (k,n), are associated with pairs of values (k,n) having a same n."],"number":16,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions according to claim 14 wherein the images are images comprised in a temporal sequence of events."],"number":17,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 17 wherein the sequence of events comprises an audio stream."],"number":18,"annotation":false,"title":false,"claim":true},{"lines":["A non-transitory computer readable medium containing a set of decisions in accordance with claim 14 for programming a processor to determine if two images match."],"number":19,"annotation":false,"title":false,"claim":true},{"lines":["A non-transitory computer readable medium containing a set of instructions for programming a processor to determine if two images match in accordance with claim 1."],"number":20,"annotation":false,"title":false,"claim":true},{"lines":["A non-transitory computer readable medium containing a set of instructions for determining if two images match in accordance with claim 1."],"number":21,"annotation":false,"title":false,"claim":true}]}},"filters":{"npl":[],"notNpl":[],"applicant":[],"notApplicant":[],"inventor":[],"notInventor":[],"owner":[],"notOwner":[],"tags":[],"dates":[],"types":[],"notTypes":[],"j":[],"notJ":[],"fj":[],"notFj":[],"classIpcr":[],"notClassIpcr":[],"classNat":[],"notClassNat":[],"classCpc":[],"notClassCpc":[],"so":[],"notSo":[],"sat":[]},"sequenceFilters":{"s":"SEQIDNO","d":"ASCENDING","p":0,"n":10,"sp":[],"si":[],"len":[],"t":[],"loc":[]}}