US5455892A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for training a neural network for classifying an unknown signal with respect to known signals
Assignee: US Philips Corp
•
Filing: 1992-06-25
•
Granted: 1995-10-03
•
Expires: 2012-06-25
Abstract
Abstract The device includes a neural network with an input layer 3, an internal layer 4, and an output layer 5. This network is designed to classify data vectors to classes, the synaptic weights in the network being determined through programming on the basis of specimens whose classes are known. Each class is defined during programming as corresponding to a set of neurons of which each represents a domain which contains a fixed number of specimens. The network includes a number of neurons and synaptic weights which have been determined as a function of the classes thus defined.
Inventors
- 👤 Joel Minot
- 👤 Philippe Gentric
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 12:38
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/04; G06F; G06F18/00; G06F18/20; G06F18/24; G06F18/241; G06F18/2413; G06F18/24133; G06F18/24137; G06F18/2414; G06F18/245; G06F18/2453; G06N3/0499; G06N3/08; G06N3/082; G06N3/09; G06V; G06V40/00; G06V40/30; G06V40/37; G06V40/394
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
273 words
A method for training a neural network to classify an unknown signal of a known type, comprising the steps of: a) selecting at least one feature from each of a plurality of known signals having at least one feature; b) determining a difference between the selected at least one feature for every different pair of known signals wherein the differences are represented by a plurality of difference-vectors; c) selecting a first one of the differences vectors as a current difference-vector and determining the k nearest difference-vectors from said current difference-vector wherein a decision domain is created including a group of k+1 difference-vectors; d) calculating a distribution probability for the group of difference-vectors in the decision domain; e) introducing a neuron corresponding to the decision domain into an internal layer of neurons of the neural network; f) calculating a weight represented by a ij and a weight represented by b i for each difference-vector connection between an input layer of neurons and the internal layer based upon the distribution probability of the decision domain; and g) selecting a next one of the difference-vectors as a new current difference-vector and repeating steps (c) through (g) until the last difference-vector is processed, and h) inputting a plurality of unknown signal difference-vectors into an input layer of the network and calculating a probability based upon the weighting coefficients a ij and b i that the unknown signal difference-vectors lie within one of the decision domains, whereby the neural network is trained to classify the differences between the unknown signal and the known signals thus indicating the degree of correspondence between the unknown signal and the known signals.
Claim 2
Independent Claim
273 words
A method for training a neural network to classify an unknown signal of a known type, comprising the steps of: a) selecting at least one feature from each of a plurality of known signals having at least one feature; b) determining a difference between the selected at least one feature for every different pair of known signals wherein the differences are represented by a plurality of difference-vectors; c) selecting a first one of the differences vectors as a current difference-vector and determining the k nearest difference-vectors from said current difference-vector wherein a decision domain is created including a group of k+1 difference-vectors; d) calculating a distribution probability for the group of difference-vectors in the decision domain; e) introducing a neuron corresponding to the decision domain into an internal layer of neurons of the neural network; f) calculating a weight represented by a ij and a weight represented by b i for each difference-vector connection between an input layer of neurons and the internal layer based upon the distribution probability of the decision domain; and g) selecting a next one of the difference-vectors as a new current difference-vector and repeating steps (c) through (g) until the last difference-vector is processed, and h) inputting a plurality of unknown signal difference-vectors into an input layer of the network and calculating a probability based upon the weighting coefficients a ij and b i that the unknown signal difference-vectors lie within one of the decision domains, whereby the neural network is trained to classify the differences between the unknown signal and the known signals thus indicating the degree of correspondence between the unknown signal and the known signals.
Claim 3
Dependent Claim
76 words
The method of claim 1 wherein the step of selecting a first one of the differences vectors as a current difference-vector and determining the k nearest difference-vectors from said current difference-vector wherein a decision domain is created including a group of k+1 difference-vectors in conjunction with the step of repeating steps (c) through (g) until the last difference-vector is processed comprises creating a plurality of decision domains each having the same k+1, fixed number of difference-vectors.
Claim 4
Dependent Claim
36 words
The method of claim 1 comprising the step of adding a neuron to an output layer of the neural network wherein each output layer neuron corresponds to a class comprising a group of internal layer neurons.
Claim 5
Dependent Claim
44 words
The method of claim 1 wherein the step of calculating a distribution probability for each of the decision domains comprises determining a covariance matrix of the k closest neighbors, a centroid of the distribution and principal axes of an ellipsoid representing each decision domain.
Claim 6
Dependent Claim
103 words
The method of claim 4 wherein the weights are represented in the equation Σ.sub.ij x.sub.i a.sub.ij x.sub.j +Σ.sub.i x.sub.i b.sub.i -c<S wherein S is a previously determined coefficient that expresses a volume of the decision domain under consideration and a ij , b i and c are determined through identification between the equation and the relation L(X)=-(X-μ).sup.T Γ.sup.-1 (X-μ)-1n|Γ| where μ is the centroid of the distribution, Γ is the covariance matrix of the distribution, X is a vector of coordinates of the unknown signal, L(X) is defined by L(X)<S, and T is a mathematical operator meaning that (X-μ) is a transposed vector.
Claim 7
Dependent Claim
59 words
The method of claim 4 further comprising the step of providing data to the neural network by transforming n input terms into n+n(n+1)/2 output terms representing x i , x j at an input to the neural network and connecting each of the output terms to a corresponding neuron in the input layer of neurons in the neural network.
Claim 8
Dependent Claim
23 words
The method of claim 1 wherein the unknown signals are signatures including authentic and forged signatures and the known signals are correct signatures.
References Cited (Backward Citations)
US5092343A
Cited
US5153923A
Cited
US5214745A
Cited
US5274714A
Cited
US5179596A
Cited
US5259039A
Cited
US5333209A
Cited
US5343251A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-10-02 | 1999-04-03 | 1999-10-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-10-02 | 2003-04-03 | 2003-10-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-10-02 | 2007-04-03 | 2007-10-03 | $7700.00 | Window Closed / Lapsed |