EP0328861A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A parallel, multi-unit, adaptive pattern classification system using inter-unit correlations and an intra-unit class separator methodology
Assignee: Nestor Inc
•
Filing: 1989-01-05
•
Granted: —
•
Expires: 2009-01-05
Abstract
Abstract A system is disclosed for separating and identifying classes of patterns or events which are not necessarily linearly separable. The patterns are represented by an input signal S. The system comprises (1) a plurality of classification units, connected in parallel to receive the input signal S, and (2) a class selection device, responsive to the output signals produced by the classification units, for producing a single output response R representing the class of each respective pattern. At least some of the pattern classification units include generalizer units having a memory for storing a number of generalizer "prototypes" and a comparator for comparing the vector location of an input pattern with each of the generalizer prototypes.
Inventors
- 👤 Douglas L. Reilly
- 👤 Christopher L. Scofield
- 👤 Leon N. Cooper
- 👤 Charles Elbaum
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 11:30
CPC Classifications
G; G06; G06F; G06F18/00; G06F18/20; G06F18/25; G06F18/254
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
331 words
In a system for classification and identification of patterns, each pattern being represented by an input signal S, said system comprising: (a) a plurality of classification units U₁, U₂...U i ...U k , each unit including: (1) pattern feature encoding means, responsive to said signal S, for producing an intermediate signal F, comprised of signal components F₁, F₂...F i ...F k , representative of features contained in the pattern represented by said signal S; and (2) pattern classification means, responsive to said intermediate signal F, for producing an output signal R i (R₁, R₂...R i ...R k ), representative of a proposed respective class of said pattern represented by said signal S as identified by the features represented by said intermediate signal F; and (b) class selection means, responsive to all of said output signals R i produced by said classification units U i , for producing a single output response R representing the class of said pattern, the improvement wherein at least some of said pattern classification means include generalizer means comprising: (i) generalizer memory means for storing a plurality of generalizer prototypes within a multi-dimensional pattern space, each generalizer prototype including, as prototype information stored in said generalizer memory means; a vector location in said pattern space; a scalar distance, in a given range between a minimum and maximum value, defining the size of a region of influence about said vector location of said generalizer prototype; and a particular class with which said generalizer prototype is associated; and (ii) means for comparing the vector location of an input pattern, represented by said intermediate signal F, with each of said generalizer prototypes stored in said generalizer memory means to determine whether said input pattern location falls within a region of influence of at least one of said generalizer prototypes, and for producing an output classification response R i , indicative of the class associated with such generalizer prototype, if said input pattern location falls within the region of influence thereof.
Claim 2
Dependent Claim
331 words
In a system for classification and identification of patterns, each pattern being represented by an input signal S, said system comprising: (a) a plurality of classification units U₁, U₂...U i ...U k , each unit including: (1) pattern feature encoding means, responsive to said signal S, for producing an intermediate signal F, comprised of signal components F₁, F₂...F i ...F k , representative of features contained in the pattern represented by said signal S; and (2) pattern classification means, responsive to said intermediate signal F, for producing an output signal R i (R₁, R₂...R i ...R k ), representative of a proposed respective class of said pattern represented by said signal S as identified by the features represented by said intermediate signal F; and (b) class selection means, responsive to all of said output signals R i produced by said classification units U i , for producing a single output response R representing the class of said pattern, the improvement wherein at least some of said pattern classification means include generalizer means comprising: (i) generalizer memory means for storing a plurality of generalizer prototypes within a multi-dimensional pattern space, each generalizer prototype including, as prototype information stored in said generalizer memory means; a vector location in said pattern space; a scalar distance, in a given range between a minimum and maximum value, defining the size of a region of influence about said vector location of said generalizer prototype; and a particular class with which said generalizer prototype is associated; and (ii) means for comparing the vector location of an input pattern, represented by said intermediate signal F, with each of said generalizer prototypes stored in said generalizer memory means to determine whether said input pattern location falls within a region of influence of at least one of said generalizer prototypes, and for producing an output classification response R i , indicative of the class associated with such generalizer prototype, if said input pattern location falls within the region of influence thereof.
Claim 3
Dependent Claim
181 words
The system defined in claim 1, wherein said pattern classification means which comprise generalizer means further include separator means comprising: (i) separator memory means for storing a plurality of separator prototypes within said pattern space, each separator prototype including, as prototype information stored in said separator memory means; a vector location in said pattern space; a scalar distance defining the size of a region of influence about said vector location of said separator prototype; a particular class with which said separator prototype is associated; and the identity of a pair of generalizer prototypes with which said separator prototype is associated; and (ii) means for comparing the location of an input pattern, represented by said intermediate signal F, with each of said separator prototypes stored in said separator memory means to determine whether said input pattern location falls within a region of influence of at least one of said separator prototypes, and for producing an output classification response R i , indicative of the class associated with such separator prototype, if said input pattern location falls within the region of influence thereof.
Claim 4
Dependent Claim
42 words
The system defined in claim 1, where said generalizer means further include means for modifying said scalar distance defining the size of a region of influence of each generalizer prototype, within said given range, when said system is in a training mode.
Claim 5
Dependent Claim
31 words
The system defined in claim 1, wherein said maximum value defines a region of influence for the respective generalizer prototype of approximately five percent to fifty percent of said pattern space.
Claim 6
Dependent Claim
106 words
The system defined in claim 1, wherein each generalizer prototype further includes, as prototype information stored in said generalizer memory means, a set of weighting factors (W₁, W₂...W i ...W k ), one for each respective component (F₁, F₂...F i ...F k ) of said intermediate signal F, and wherein said pattern classification means further include means for multiplying each intermediate signal component F i by the respective associated weighting factor W i or means for performing a bit comparison between the input signal F i and the weighting factor W i to produce a weighted signal component F′ i for comparison by said comparing means.
Claim 7
Dependent Claim
33 words
The system defined in claim 8, further comprising means for adjusting said generalizer weighting factors, when in a training mode, to modify the output classification response R i of said pattern classification means.
Claim 8
Dependent Claim
38 words
The system defined in claim 2, wherein said separator means further include means for modifying said scalar distance defining the size of a region of influence of each separator prototype, when said system is in a training mode.
Claim 9
Dependent Claim
107 words
The system defined in claim 2, wherein each separator prototype further includes, as prototype information stored in said separator memory means, a set of weighting factors (W₁,W₂...W i ...W k ), one for each respective component (F₁, F₂...F i ...F k ) of said intermediate signal F, and wherein said pattern classification means further include means for multiplying each intermediate signal component F i by the respective, associated weighting factor W i , or means for performing a bit comparison between the input signal F i and the weighting factor W i , to produce a weighted signal component F′ i for comparison by said comparing means.
Claim 10
Dependent Claim
33 words
The system defined in claim 8, further comprising means for adjusting said separator weighting factors, when in a training mode, to modify the output classification response R i of said pattern classification means.
Claim 11
Dependent Claim
33 words
The system defined in claim 2, wherein each pattern classification means which comprise generalizer means and separator means further include means for determining the pair of generalizer prototypes associated with each separator prototype.
Claim 12
Independent Claim
218 words
A method for classification and identification of patterns in a system comprising input means for receiving an input signal F comprised of signal components F₁, F₂...F i ...F k representing each input pattern as a location in a multi-dimensional pattern space, memory means for storing information, and computer means connected to said input means and to said memory means, said method comprising the steps of: (a) storing in said memory means a plurality of generalizer prototypes within said multi-dimensional pattern space, each generalizer prototype including, as prototype information stored in said memory means; a vector location in said pattern space; a scalar distance, in a range between minimum and maximum value, defining the size of a region of influence about said vector location of said generalizer prototype; and a particular class with which said generalizer prototype is associated; (b) comparing the location of an input pattern, represented by said input signal F, with each of said generalizer prototypes stored in said memory means to determine whether said input pattern location falls within a region of influence of at least one of said generalizer prototypes; and (c) producing an output classification response R i , indicative of the class associated with said at least one generalizer prototype, if said input pattern location falls within the region of influence thereof.
Claim 13
Independent Claim
218 words
A method for classification and identification of patterns in a system comprising input means for receiving an input signal F comprised of signal components F₁, F₂...F i ...F k representing each input pattern as a location in a multi-dimensional pattern space, memory means for storing information, and computer means connected to said input means and to said memory means, said method comprising the steps of: (a) storing in said memory means a plurality of generalizer prototypes within said multi-dimensional pattern space, each generalizer prototype including, as prototype information stored in said memory means; a vector location in said pattern space; a scalar distance, in a range between minimum and maximum value, defining the size of a region of influence about said vector location of said generalizer prototype; and a particular class with which said generalizer prototype is associated; (b) comparing the location of an input pattern, represented by said input signal F, with each of said generalizer prototypes stored in said memory means to determine whether said input pattern location falls within a region of influence of at least one of said generalizer prototypes; and (c) producing an output classification response R i , indicative of the class associated with said at least one generalizer prototype, if said input pattern location falls within the region of influence thereof.
Claim 14
Dependent Claim
171 words
The method defined in claim 11, further comprising the steps of: (d) storing in said memory means a plurality of separator prototypes within said pattern space, each separator prototype including, as prototype information stored in said separator memory means: a vector location in said pattern space; a scalar distance defining the size of a region of influence about said vector location of said separator prototype; a particular class with which said separator prototype is associated and the identity of a pair of generalizer prototypes with which said separator prototype is associated; (e) comparing the location of an input pattern, represented by said input signal F, with each of said separator prototypes stored in said memory means to determine whether said input pattern location falls within a region of influence of at least one of said separator prototypes; and (f) producing an output classification response R i , indicative of the class associated with said at least one separator prototype, if said input pattern location falls within the region of influence thereof.
Claim 15
Dependent Claim
36 words
The method defined in claim 11, further comprising the step of modifying said scalar distance defining the size of a region of influence of each generalizer prototype, within said given range, while in a training mode.
Claim 16
Dependent Claim
31 words
The method defined in claim 11, wherein said maximum value defines a region of influence for the respective generalizer prototype of approximately five percent to fifty percent of said pattern space.
Claim 17
Dependent Claim
102 words
The method defined in claim 11, wherein each generalizer prototype further includes, as prototype information stored in said memory means, a set of generalizer weighting factors (W₁, W₂...W i ...W k ), one for each respective component (F₁, F₂...F i ...F k ) of said input signal F, and wherein said method further comprises the steps of multiplying each input signal F i by the respective, associated, generalizer weighting factor W i or of performing a bit comparison between the input signal F i and the weighting factor W i to produce a weighted signal F′₁ for utilization in said comparing step.
Claim 18
Dependent Claim
21 words
The method defined in claim 15, further comprising the step of adjusting said generalizer weighting factors, when in a training mode.
Claim 19
Dependent Claim
31 words
The method defined in claim 12, further comprising the step of modifying said scalar distance defining the size and region of influence of each separator prototype, when in a training mode.
Claim 20
Dependent Claim
104 words
The method defined in claim 12, wherein each separator prototype further includes, as prototype information stored in said memory means, a set of separator weighting factors (W₁, W₂...W i ...W k ), one for each respective component (F₁, F₂...F i ...F k ) of said input signal F, and wherein said method further includes the step of multiplying each input signal component F i by the respective, associated, separator weighting factor W i or of performing a bit comparison between the input signal F i and the weighting factor W i to produce a weighted signal component F′₁ for utilization in said comparing step.
Claim 21
Dependent Claim
21 words
The method defined in claim 18, further comprising the step of adjusting said separation weighting factors, when in a training mode.
Claim 22
Dependent Claim
22 words
The method defined in claim 12, further comprising the step of determining the pair of generalizer prototypes associated with each separator prototype.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.