Patent ID: 7773811
Filing Date: 2010-08-10
Classification: G06K

Abstract:
1. A method for searching a database of graphical data, said data including a plurality of reference images, comprising: (a) generating a matrix of similarity scores of the reference images, each reference image forming a unity diagonal matrix element and similarity scores of the reference images one versus another forming non-diagonal matrix elements; (b) determining a similarity score of a query image versus a reference image; (c1) if the similarity score defined at the step (b) is greater than a pre-selected threshold: (c2) if the similarity score defined at the step (b) is smaller than the pre-selected threshold: (d) determining a similarity score of the query image with a reference image used for generating the matrix element defined at the step (c2); (e1) if the similarity score defined at the step (d) is greater than the pre-selected threshold: (e2) if the similarity score defined at the step (d) is smaller than the pre-selected threshold: wherein the similarity score is defined as a complement to a pictorial edit distance, which is asserted as a weighted sum of a 2D representation of Insertion, Deletion, and Substitution Error terms of the Levenshtein algorithm for matching or searching one-dimensional data strings.