← Back to Patent Explorer
US5056147A Expired / Lapsed US ⏱️ 0.0 years remaining

Recognition procedure and an apparatus for carrying out the recognition procedure

Assignee: Products From Ideas Ltd
•
Filing: 1990-05-09
•
Granted: 1991-10-08
•
Expires: 2010-05-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Apparatus and methods are disclosed for recognizing patterns, i.e., comparing a stored pattern with a pattern to be measured. The apparatus is taught a stored or reference pattern by assigning a first binary value to each of a plurality of addressable data stores at locations selected by applying respective sets of values to the stores, the values representing characteristics of the stored pattern. A second binary value is assigned to all locations not selected. The pattern to be measured has sets of values representing characteristics thereof applied to respective addresses of the addressable data stores. The contents of the selected addresses are read and the binary values from the selected addresses are applied to a network capable of providing an output signal representing a selected binary value only when the first binary value is read from all selected locations. The output signal represents the result of the measurement and may provide a measure of the closeness of the stored and observed patterns.

Inventors

  • 👤 Stephen J. Turner
  • 👤 John B. Lilley

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 05:48
CPC Classifications
G; G07; G07F; G07F7/00; G07F7/08; G07F7/10; G07F7/1008; G06; G06F; G06F7/00; G06F7/02; G06F7/023; G06Q; G06Q20/00; G06Q20/30; G06Q20/34; G06Q20/341; G06Q20/38; G06Q20/40; G06Q20/401; G06Q20/4014; G06Q20/40145; G07C; G07C9/00; G07C9/20; G07C9/22; G07C9/25; G07C9/257

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 258 words
A recognition procedure including the steps of teaching a reference pattern to a machine-based recognition system by writing a first binary digit to each of a plurality of addressable data stores, each of which has a plurality of addressable data storage locations, at locations selected by applying respective sets of values as addresses to the addressable data stores, where the sets of values represent characteristics of parts of the reference pattern, writing a second binary digit to all locations not selected in the addressable data stores, and of measuring another pattern against the reference pattern by applying, as addresses, to the addressable data stores, sets of values representing characteristics of parts of the other pattern, where the parts correspond to the said parts of the reference pattern, reading the contents of those locations selected, applying the binary digits read from the selected locations to a network that provides an output signal representing one binary digit as its output only when the first binary digit is obtained from each selected location, and which provides an output signal representing the other binary digit if one second binary digit is obtained from the selected locations, forming at least one sum of the total number of occurrences of the first binary digit at selected positions within the network, and providing a result signal indicating the result of the measurement, where the result signal is determined by the output signal from the network and the sum of the total number of occurrences of the first binary digit at selected positions within the network.
Claim 2
Dependent Claim 258 words
A recognition procedure including the steps of teaching a reference pattern to a machine-based recognition system by writing a first binary digit to each of a plurality of addressable data stores, each of which has a plurality of addressable data storage locations, at locations selected by applying respective sets of values as addresses to the addressable data stores, where the sets of values represent characteristics of parts of the reference pattern, writing a second binary digit to all locations not selected in the addressable data stores, and of measuring another pattern against the reference pattern by applying, as addresses, to the addressable data stores, sets of values representing characteristics of parts of the other pattern, where the parts correspond to the said parts of the reference pattern, reading the contents of those locations selected, applying the binary digits read from the selected locations to a network that provides an output signal representing one binary digit as its output only when the first binary digit is obtained from each selected location, and which provides an output signal representing the other binary digit if one second binary digit is obtained from the selected locations, forming at least one sum of the total number of occurrences of the first binary digit at selected positions within the network, and providing a result signal indicating the result of the measurement, where the result signal is determined by the output signal from the network and the sum of the total number of occurrences of the first binary digit at selected positions within the network.
Claim 3
Dependent Claim 32 words
A recognition procedure as claimed in claim 1, wherein the first binary digit is a logical 1, and the network for providing the output signal is a network of logical AND gates.
Claim 4
Dependent Claim 83 words
A recognition procedure as claimed in claim 1, wherein the first binary digit is a logical 1, and the network includes a logic element capable of performing an AND operation on values presented to it, associated latches for storing respective input and output values for the logic element, and counters for controlling the grouping, and circulation, of successive input and output values, through the logic element, in group sizes, and for a number of times, as set by initial settings of the counters.
Claim 5
Dependent Claim 63 words
A recognition procedure as claimed in claim 1, which includes the steps of forming a sum of the total number of times that the first binary value is read from the addressable data stores during the measuring of the other pattern against the reference pattern, and taking the total number into account in providing an output signal indicating the result of the measurement.
Claim 6
Dependent Claim 49 words
A recognition procedure as claimed in claim 4, including the steps of forming sums of the total number of occurrences of the first binary value at selected positions within the network and taking those further sums into account in providing an output signal indicating the result of the measurement
Claim 7
Dependent Claim 36 words
A recognition procedure as claimed in claim 1, wherein the values representing characteristics of the reference pattern are encoded for application to the addressable data stores, and the encoding algorithm is different for each reference pattern.
Claim 8
Dependent Claim 17 words
A recognition procedure as claimed in claim 1, wherein the reference pattern relates to a human face.
Claim 9
Dependent Claim 24 words
A recognition procedure as claimed in claim 1, wherein the reference pattern is written to addressable data stores located in a machine-readable data carrier.
Claim 10
Dependent Claim 55 words
A recognition procedure as claimed in claim 1, which comprises making a pattern from a biometric determination of a person to be identified, reading a machine-readable data carrier having a reference pattern made from the same biometric determination of a person, comparing the two patterns, and indicating the identity or otherwise of the two patterns.
Claim 11
Independent Claim 360 words
An apparatus for carrying out a recognition procedure in which a reference pattern is memorized and a pattern to be examined is compared with the reference pattern, including: a plurality of addressable data stores each having a plurality of addressable data storage locations, address ports, data input and output ports, and a read/write control port, input means for receiving input values representing characteristics of a pattern to be memorized or examined and for presenting the input values as a plurality of sets of values to the address ports of respective ones of the addressable data stores, a network of logic elements connected to the data output ports of the addressable data stores, the network being such as to provide one binary digit as its output only when a first binary digit is obtained from each data output port of the addressable data stores, and to provide the other binary digit if one second binary digit is obtained from the data output ports, and, summation means connected to selected groups of logic elements in the network of logic elements for forming at least one total of the number of times the first binary digit appears at selected positions of the logic network, the apparatus being operable, when a pattern is being memorized, to load one location of each addressable data store with a first binary digit and to load all other locations with a second binary digit, where the locations that receive the first binary digit are selected by respective sets of the input values representing the characteristics of parts of the pattern being memorized, and when a pattern is being examined, to read the contents of one location of each addressable data store, where the locations that are read are selected by respective sets of the input values representing the characteristics of parts of the pattern being examined, where the parts correspond to the said parts of the memorized pattern, to apply the data read from the addressable data stores to the network of logic elements, and, to provide a result signal determined by the output signal from the network of logic elements and the output of the summation means.
Claim 12
Independent Claim 360 words
An apparatus for carrying out a recognition procedure in which a reference pattern is memorized and a pattern to be examined is compared with the reference pattern, including: a plurality of addressable data stores each having a plurality of addressable data storage locations, address ports, data input and output ports, and a read/write control port, input means for receiving input values representing characteristics of a pattern to be memorized or examined and for presenting the input values as a plurality of sets of values to the address ports of respective ones of the addressable data stores, a network of logic elements connected to the data output ports of the addressable data stores, the network being such as to provide one binary digit as its output only when a first binary digit is obtained from each data output port of the addressable data stores, and to provide the other binary digit if one second binary digit is obtained from the data output ports, and, summation means connected to selected groups of logic elements in the network of logic elements for forming at least one total of the number of times the first binary digit appears at selected positions of the logic network, the apparatus being operable, when a pattern is being memorized, to load one location of each addressable data store with a first binary digit and to load all other locations with a second binary digit, where the locations that receive the first binary digit are selected by respective sets of the input values representing the characteristics of parts of the pattern being memorized, and when a pattern is being examined, to read the contents of one location of each addressable data store, where the locations that are read are selected by respective sets of the input values representing the characteristics of parts of the pattern being examined, where the parts correspond to the said parts of the memorized pattern, to apply the data read from the addressable data stores to the network of logic elements, and, to provide a result signal determined by the output signal from the network of logic elements and the output of the summation means.
Claim 13
Dependent Claim 42 words
An apparatus as claimed in claim 10, wherein the logic network consists of a cascade of groups of AND gates, in which the number of AND gates in each group is half the number of AND gates in the immediately preceding group.
Claim 14
Dependent Claim 39 words
An apparatus as claimed in claim 10, including a summation means for forming a sum of the total number of times that the first binary value is read from the addressable data stores during the examination of a pattern.
Claim 15
Dependent Claim 22 words
An apparatus as claimed in claim 12, including first summation means connected to the data output ports of the addressable data stores.
Claim 16
Dependent Claim 45 words
An apparatus as claimed in claim 13, including further summation means connected to selected groups of logic elements in the network of logic elements for forming further totals of the number of times the first binary value appears at selected parts of the logic network.
Claim 17
Independent Claim 36 words
An apparatus as claimed in claims 10, wherein the input means is capable of encoding the input values for application to the addresses of the addressable data stores, and is capable of changing its encoding algorithm.
Claim 18
Independent Claim 56 words
An apparatus as claimed in claims 10, which is capable of accepting a machine-readable data carrier in which is memorised a reference pattern relating to human biometric characteristics, of generating, as input values, values representing biometric characteristics of a subject presented for examination, and of performing the recognition procedure on the reference and generated biometric characteristics.
Claim 19
Independent Claim 32 words
An apparatus as claimed in claims 10, including means for making a biometric determination, means for encoding the biometric determination, and means for applying the encoded data to a machine-readable data carrier.
Claim 20
Dependent Claim 29 words
A machine-readable data carrier, produced by an apparatus as claimed in claim -7, including a plurality of addressable data stores, holding a reference pattern relating to human biometric characteristics.

References Cited (Backward Citations)

US3382482A Cited
US3639902A Cited
US3652991A Cited
US3868635A Cited
GB1605262A Cited
GB2112194A Cited
EP0251504A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-10-07 1995-04-08 1995-10-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-10-07 1999-04-08 1999-10-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-10-07 2003-04-08 2003-10-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag