Analysis of patterns
First Claim
1. A computer implemented method of comparing a first pattern (A) represented by a first ordered set of elements (xi) each having a value with a second pattern (B) represented by a second ordered set of element (ui) each having a value, comprising iteratively performing the steps of:
- using at least one computer with accessible input/output to perform the following steps;
(i) selecting a plurality of elements from the first ordered set;
(ii) for each selected element of the first ordered set, selecting an element from the second ordered set, such that the selected elements of the second ordered set have, within the second ordered set, a set of positional relationships relative to each other that is a transformation of, the set of positional relationships that the selected plurality of elements of the first ordered set have relative to each other,(iii) comparing the value of each of the selected elements of the first ordered set with the value of the correspondingly positioned selected element of the second ordered set in accordance with a predetermined match criterion to produce a decision that the selected plurality of elements of the first ordered set does or does not match the selected plurality of elements of the second ordered set;
(iv) in the event of a match, updating at least one similarity score (SAB);
wherein the step of selecting the elements of the second ordered set comprises choosing a value for at least one parameter (R, β
, α
) and selecting elements having a set of positional relationships (di′
, di″
) that is transformed from the positional relationship set (di) of the selected elements of the first ordered set in accordance with the parameter(s)wherein the said parameter (R) determines whether or not a reflection should be applied to the positional relationships.
1 Assignment
0 Petitions
Accused Products
Abstract
A first pattern (A) is represented by a first ordered set of elements (xi) each having a value whilst a second pattern (B) is represented by a second ordered set of element (ui) each having a value. The patterns are analysed by iteratively performing the steps of: selecting (e.g. at random) a plurality m of elements from the first ordered set; for each selected element xi of the first ordered set, selecting an element ui from the second ordered set, such that the selected elements of the second ordered set have, within the second ordered set, a set of positional relationships relative to each other that is the same as, or a transformation of, the set of positional relationships that the selected plurality of elements of the first ordered set have relative to each other, comparing the value of each of the selected elements of the first ordered set with the value of the correspondingly positioned selected element of the second ordered set in accordance with a predetermined match criterion to produce a decision that the selected plurality of elements of the first ordered set does or does not match the selected plurality of elements of the second ordered set; and in the event of a match, updating at least one similarity score (SAB). In the selection of the elements of the second ordered set, one chooses (e.g. at random) at least one parameter (R, β, α) and selects elements having a set of positional relationships (di′, di″)) that is transformed from the positional relationship set di of the selected elements of the first ordered set in accordance with the parameter(s). This transformation may include one or more of rotation, reflection or scaling. Other aspects include biasing the selection of the elements of the first ordered set towards a large extent, and of introducing variations in the number of elements selected, with the similarity score being updated by an amount that is a function of the number of elements. The method may also be applied to a single image.
-
Citations
17 Claims
-
1. A computer implemented method of comparing a first pattern (A) represented by a first ordered set of elements (xi) each having a value with a second pattern (B) represented by a second ordered set of element (ui) each having a value, comprising iteratively performing the steps of:
-
using at least one computer with accessible input/output to perform the following steps; (i) selecting a plurality of elements from the first ordered set; (ii) for each selected element of the first ordered set, selecting an element from the second ordered set, such that the selected elements of the second ordered set have, within the second ordered set, a set of positional relationships relative to each other that is a transformation of, the set of positional relationships that the selected plurality of elements of the first ordered set have relative to each other, (iii) comparing the value of each of the selected elements of the first ordered set with the value of the correspondingly positioned selected element of the second ordered set in accordance with a predetermined match criterion to produce a decision that the selected plurality of elements of the first ordered set does or does not match the selected plurality of elements of the second ordered set; (iv) in the event of a match, updating at least one similarity score (SAB); wherein the step of selecting the elements of the second ordered set comprises choosing a value for at least one parameter (R, β
, α
) and selecting elements having a set of positional relationships (di′
, di″
) that is transformed from the positional relationship set (di) of the selected elements of the first ordered set in accordance with the parameter(s)wherein the said parameter (R) determines whether or not a reflection should be applied to the positional relationships. - View Dependent Claims (3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17)
-
-
2. A computer implemented method of analysing a pattern (A) represented by an ordered set of elements (xi) each having a value, comprising iteratively performing the steps of:
-
using at least one computer with accessible input/output to perform the following steps; (i) selecting a first plurality of elements from the ordered set; (ii) for each selected element of the ordered set, selecting a further element from the ordered set, such that the selected further elements of the ordered set have, within the ordered set, a set of positional relationships relative to each other that is a transformation of, the set of positional relationships that the selected first plurality of elements of the ordered set have relative to each other, (iii) comparing the value of each of the first selected elements of the ordered set with the value of the correspondingly positioned selected further element of the ordered set in accordance with a predetermined match criterion to produce a decision that the selected first plurality of elements of the ordered set does or does not match the selected further plurality of elements of the ordered set; (iv) in the event of a match, updating at least one similarity score (SAA); wherein the step of selecting the further elements of the ordered set comprises choosing a value for at least one parameter (R, β
, α
) and selecting elements having a set of positional relationships (di′
, di″
) that is transformed from the positional relationship set (di) of the selected first elements of the ordered set in accordance with the parameter(s)wherein the said parameter (R) determines whether or not a reflection should be applied to the positional relationships.
-
-
9. A computer implemented method of comparing a first pattern represented by a first ordered set of elements each having a value with a second pattern represented by a second ordered set of element each having a value, comprising iteratively performing the steps of:
-
using at least one computer with accessible input/output to perform the following steps; (i) selecting a plurality of elements from the first ordered set; (ii) for each selected element of the first ordered set, selecting an element from the second ordered set, such that the selected elements of the second ordered set have, within the second ordered set, a set of positional relationships relative to each other that is a transformation of, the set of positional relationships that the selected plurality of elements of the first ordered set have relative to each other, (iii) comparing the value of each of the selected elements of the first ordered set with the value of the correspondingly positioned selected element of the second ordered set in accordance with a predetermined match criterion to produce a decision that the selected plurality of elements of the first ordered set does or does not match the selected plurality of elements of the second ordered set; (iv) in the event of a match, updating at least one similarity score; wherein the selections of elements in the first ordered set is such that their extent, within the ordered set, is biased towards a small extent rather than a large extent wherein a parameter (R) associated with the second ordered set determines whether or not a reflection should be applied to the positional relationships.
-
-
12. A computer implemented method of comparing a first pattern represented by a first ordered set of elements each having a value with a second pattern represented by a second ordered set of element each having a value, comprising iteratively performing the steps of:
-
using at least one computer with accessible input/output to perform the following steps; (i) selecting a plurality of elements from the first ordered set; (ii) for each selected element of the first ordered set, selecting an element from the second ordered set, such that the selected elements of the second ordered set have, within the second ordered set, a set of positional relationships relative to each other that is a transformation of, the set of positional relationships that the selected plurality of elements of the first ordered set have relative to each other, (iii) comparing the value of each of the selected elements of the first ordered set with the value of the correspondingly positioned selected element of the second ordered set in accordance with a predetermined match criterion to produce a decision that the selected plurality of elements of the first ordered set does or does not match the selected plurality of elements of the second ordered set; (iv) in the event of a match, updating at least one similarity score; in which, on each iteration, the number of elements (m) to be selected from the first ordered set is selected at random, and in which the step of updating the score increments the score by an amount which is a monotonically increasing function (f(m)) of the number (m) of elements wherein a parameter (R) associated with the second ordered set determines whether or not a reflection should be applied to the positional relationships.
-
Specification