{"search_session":{},"preferences":{"l":"en","queryLanguage":"en"},"patentId":"021-290-188-779-36X","frontPageModel":{"patentViewModel":{"ref":{"entityRefId":"021-290-188-779-36X","entityRefType":"PATENT"},"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;
constraining the decisions 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 in fact there is no match, is less than or equal to a predetermined upper bound β;
configuring the association of decisions and pairs (k,n) to minimize a loss function comprising a term relating to the running time of a computer programmed to use the set of decisions in a sequential series of statistical hypotheses tests to determine whether there is a match;
wherein the loss function comprises a sum of the term relating to expected running time, a weighted probability of providing a false negative decision and a weighted probability of providing a false positive decision."],"number":1,"annotation":false,"claim":true,"title":false},{"lines":["A method according to claim 1 wherein the set of decisions comprises:
a decision, NS, that the images do not match associated with each of a first set of pairs of values (k,n); and
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,"claim":true,"title":false},{"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":3,"annotation":false,"claim":true,"title":false},{"lines":["A method according to of claims 1-3 and comprising a decision E associated with a fourth set of values (k,n) to determine a number of non-similar homologous pixels there are from among all the homologous pixels."],"number":4,"annotation":false,"claim":true,"title":false},{"lines":["A method according to claim 4 wherein all the decisions are associated with pairs of values (k,n) having a same n."],"number":5,"annotation":false,"claim":true,"title":false},{"lines":["A method according to any of the preceding claims wherein images are considered to match in fact if a number of non-similar pixels from among all the homologous pixels is less than or equal to a predetermined threshold, t, and in fact not to match if the number of non-similar pixels is greater than t."],"number":6,"annotation":false,"claim":true,"title":false},{"lines":["A method according to any of the preceding claims wherein a 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 homologous pixels there are from among all the homologous pixels, and P(D≤t) is a probability that the images in fact match."],"number":7,"annotation":false,"claim":true,"title":false},{"lines":["A method according to any of the preceding claims wherein a 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 images in fact do not match."],"number":8,"annotation":false,"claim":true,"title":false},{"lines":["A computer readable medium containing a set of instructions for programming a processor to determine if two images match in accordance with any of the preceding claims."],"number":9,"annotation":false,"claim":true,"title":false}]}},"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":[]}}