US5274744A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Neural network for performing a relaxation process
Assignee: Transpacific IP Ltd
•
Filing: 1992-01-21
•
Granted: 1993-12-28
•
Expires: 2012-01-21
Abstract
Abstract In accordance with the present invention, a neural network comprising an array of neurons (i.e. processing nodes) interconnected by synapses (i.e. weighted transmission links) is utilized to carry out a probabilistic relaxation process. The inventive neural network is especially suited for carrying out a variety of image processing tasks such as thresholding.
Inventors
- 👤 Shiaw-Shian Yu
- 👤 Wen-Hsiang Tsai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 22:35
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/044
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
285 words
A neural network for implementing a probabilistic relaxation process comprising a plurality of interconnected processing nodes, each node generating an output signal representing the time evolution of a probability that a particular object in a set of objects is a member of a particular class in a set of classes, said nodes being interconnected by weighted connection paths such that each node receives a time dependent input signal including a sum of weighted input signals of a plurality of said nodes and an externally generated input signal, the weighting of a connection path connecting two particular nodes being dependent on a compatibility that the corresponding objects of the nodes will be in the corresponding classes of the nodes. each of said processing nodes having a transfer function characteristic so that its output signal is a monotonic non-linear function of its input signal, wherein when the output signal of each node is first set to an initial estimated value of the probability that a particular object in a set of objects is a member of a particular class in a set of classes, said output signal of each node evolves over time due to the interconnection between said nodes to a constant final value indicative of whether or not a particular object is in a particular class, wherein said neural network has an energy function ##EQU18## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k. V u is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
Claim 2
Dependent Claim
285 words
A neural network for implementing a probabilistic relaxation process comprising a plurality of interconnected processing nodes, each node generating an output signal representing the time evolution of a probability that a particular object in a set of objects is a member of a particular class in a set of classes, said nodes being interconnected by weighted connection paths such that each node receives a time dependent input signal including a sum of weighted input signals of a plurality of said nodes and an externally generated input signal, the weighting of a connection path connecting two particular nodes being dependent on a compatibility that the corresponding objects of the nodes will be in the corresponding classes of the nodes. each of said processing nodes having a transfer function characteristic so that its output signal is a monotonic non-linear function of its input signal, wherein when the output signal of each node is first set to an initial estimated value of the probability that a particular object in a set of objects is a member of a particular class in a set of classes, said output signal of each node evolves over time due to the interconnection between said nodes to a constant final value indicative of whether or not a particular object is in a particular class, wherein said neural network has an energy function ##EQU18## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k. V u is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
Claim 3
Dependent Claim
50 words
The neural network of claim 1 wherein the output signal of each node represents the probability that a particular pixel in an image has a particular gray scale value and the weighting signal of each connection path represents the compatibility of two particular pixels having two particular gray scale values.
Claim 4
Dependent Claim
16 words
The neural network of claim 1, wherein each of said processing nodes is an analog circuit.
Claim 5
Dependent Claim
41 words
The neural network of claim 3 wherein each of said processing nodes comprises amplifier means for generating a positive output signal and a negative output signal and wherein each of said weighted connection paths comprises a conductive path including a resistor.
Claim 6
Dependent Claim
57 words
The neural network of claim 1 wherein the weighting connection between said node with index ij and said node with index hk is given by T.sub.(ij)(hk) =Ac(i,j; h,k)-Bδ.sub.ij where δ ij =1 for i=h and δ ij =0 for i≠h, and wherein said externally generated input signal I ij of a node with index ij is B.
Claim 7
Dependent Claim
273 words
In a neural network comprising a plurality of processing nodes interconnected by weighted interconnection paths, wherein the input signal to each processing node includes a weighted sum of the output signals of a plurality of said processing nodes and an external signal, wherein the output signal of each processing node is a probability that a particular object in a set of objects is a member of a particular class in a set of classes, and is a non-linear monotonic function of the input signal, and wherein the weight of each interconnection path between two nodes is dependent on a compatibility that the corresponding objects of the two nodes are in the corresponding classes, a method for carrying out a probabilistic relaxation comprising, setting the output signal of each node to an initial estimated value of the probability that a particular object in a set of objects is in a particular class in a set of classes, and causing the output signal of each of said nodes to evolve in time because of the transmission of signals via the interconnection paths between said nodes to a final state indicative of whether or not the particular object of each node is in the particular class, wherein wherein said neural network has an energy function ##EQU19## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k, V ij is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
Claim 8
Dependent Claim
273 words
In a neural network comprising a plurality of processing nodes interconnected by weighted interconnection paths, wherein the input signal to each processing node includes a weighted sum of the output signals of a plurality of said processing nodes and an external signal, wherein the output signal of each processing node is a probability that a particular object in a set of objects is a member of a particular class in a set of classes, and is a non-linear monotonic function of the input signal, and wherein the weight of each interconnection path between two nodes is dependent on a compatibility that the corresponding objects of the two nodes are in the corresponding classes, a method for carrying out a probabilistic relaxation comprising, setting the output signal of each node to an initial estimated value of the probability that a particular object in a set of objects is in a particular class in a set of classes, and causing the output signal of each of said nodes to evolve in time because of the transmission of signals via the interconnection paths between said nodes to a final state indicative of whether or not the particular object of each node is in the particular class, wherein wherein said neural network has an energy function ##EQU19## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k, V ij is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
Claim 9
Dependent Claim
39 words
The method of claim 6 wherein said step of setting the output signal of each node comprises setting the input signal of each node so that the output signal of each node is set to said initial probability estimate.
Claim 10
Dependent Claim
241 words
An electronic network comprising electronic means for generating a plurality of time dependent output signals, each of said output signals initially representing a first estimated value of the probability that a particular object in a set of objects is a member of a particular class in a set of classes and evolving in time to a final state which indicates definitively whether the particular object is in the particular class, said electronic means comprising a plurality of processing nodes, each of which generates one of said output signals, and means for forming an input signal for each of said nodes by multiplying the output signal of each of a plurality of said nodes by a compatibility coefficient indicative of the compatibility between the object and class of the node from which the output signal is taken and the object and class of the node for which the input signal is being generated and summing the resulting products, each of said nodes having a non-linear transfer function between its input and its output, wherein said neural network has an energy function ##EQU20## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k, V ij is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
Claim 11
Dependent Claim
241 words
An electronic network comprising electronic means for generating a plurality of time dependent output signals, each of said output signals initially representing a first estimated value of the probability that a particular object in a set of objects is a member of a particular class in a set of classes and evolving in time to a final state which indicates definitively whether the particular object is in the particular class, said electronic means comprising a plurality of processing nodes, each of which generates one of said output signals, and means for forming an input signal for each of said nodes by multiplying the output signal of each of a plurality of said nodes by a compatibility coefficient indicative of the compatibility between the object and class of the node from which the output signal is taken and the object and class of the node for which the input signal is being generated and summing the resulting products, each of said nodes having a non-linear transfer function between its input and its output, wherein said neural network has an energy function ##EQU20## wherein A and B are positive numbers c(i,j; h,k) is the compatibility that an object i is in a class j and an object h is in a class k, V ij is the output signal of a node with index ij V hk is the output signal of a node with index hk n is the number of objects.
References Cited (Backward Citations)
US5014219A
Cited
US5148513A
Cited
US4926064A
Cited
US5073867A
Cited
US5134685A
Cited
US5157738A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-12-27 | 1997-06-28 | 1997-12-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-12-27 | 2001-06-28 | 2001-12-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-12-27 | 2005-06-28 | 2005-12-28 | $7700.00 | Window Closed / Lapsed |