Patent US5263107A successfully refreshed from Google Patents.
US5263107A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Receptive field neural network with shift-invariant pattern recognition
Assignee: Sharp Corp
•
Filing: 1991-01-31
•
Granted: 1993-11-16
•
Expires: 2011-01-31
Abstract
Abstract A neural network system and method of operating same wherein input data are initialized, then mapped onto a predetermined array for learning or recognition. The mapped information is divided into sub-input data or receptive fields, which are used for comparison of the input information with prelearned information having similar features, thereby allowing for correct classification of the input information. The receptive fields are shifted before the classification process, in order to generate a closest match between features which may be shifted at the time of input, and weights of the input information are updated based upon the closest-matching shifted position of the input information.
Inventors
- 👤 Toru Ueda
- 👤 Fumio Togawa
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 14:38
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/18; G06V30/1801; G06V30/18019; G06V30/18038; G06V30/18048; G06V30/18057; G06F; G06F18/00; G06F18/20; G06F18/24; G06F18/241; G06F18/2413; G06F18/24133; G06F18/24137; G06V30/28; G06V30/287
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
108 words
A method for updating weights relating to previously learned information input into a neural network, the network having a database of learned information mapped onto an array, including the steps of: (1) mapping the input information onto the array; (2) isolating a predetermined subset of the array; (3) shifting the predetermined subset in at least one dimension; (4) comparing the predetermined subset in both unshifted and shifted positions with a corresponding subset of the learned information; and (5) based upon the comparison of step (4), determining an optimal shift for the input information; and (6) updating a weight relating to the learned information based upon the optimal shift.
Claim 2
Independent Claim
108 words
A method for updating weights relating to previously learned information input into a neural network, the network having a database of learned information mapped onto an array, including the steps of: (1) mapping the input information onto the array; (2) isolating a predetermined subset of the array; (3) shifting the predetermined subset in at least one dimension; (4) comparing the predetermined subset in both unshifted and shifted positions with a corresponding subset of the learned information; and (5) based upon the comparison of step (4), determining an optimal shift for the input information; and (6) updating a weight relating to the learned information based upon the optimal shift.
Claim 3
Dependent Claim
16 words
The method of claim 1, wherein step 3 includes shifting the input information in two dimensions.
Claim 4
Dependent Claim
13 words
The method of claim 1, wherein step 3 includes rotating the input information.
Claim 5
Dependent Claim
142 words
The method of claim 1, wherein the array comprises a matrix of pixels having a first dimension and a second dimension, and wherein step 3 includes the steps of: (7) shifting the input information a predetermined first number of pixels in each of a negative direction and a positive direction in the first dimension without shifting in the second dimension; (8) shifting the input information a predetermined second number of pixels in each of a negative direction and a positive direction in the second dimension without shifting in the first dimension; and (9) shifting the input information the predetermined first number of pixels in each of the negative direction and the positive direction in the first dimension while shifting the input information the predetermined second number of pixels in each of the negative direction and the positive direction in the second dimension.
Claim 6
Independent Claim
83 words
A method for learning information input in a neural network, where the input information corresponds to a feature stored in the neural network, including the steps of: (1) mapping the information onto at least one receptive field in an unshifted position; (2) shifting the mapped information into a plurality of shifted positions; (3) determining which of the plurality of shifted positions matches the stored feature most closely; and (4) based upon closest matching shifted position, updating a weight relating to the stored feature.
Claim 7
Independent Claim
83 words
A method for learning information input in a neural network, where the input information corresponds to a feature stored in the neural network, including the steps of: (1) mapping the information onto at least one receptive field in an unshifted position; (2) shifting the mapped information into a plurality of shifted positions; (3) determining which of the plurality of shifted positions matches the stored feature most closely; and (4) based upon closest matching shifted position, updating a weight relating to the stored feature.
Claim 8
Independent Claim
126 words
An apparatus for updating weights relating to information which has been learned in a neural network, the network including a database of leaned information mapped onto an array, comprising: means for mapping the input information onto the array; means coupled to the mapping means for isolating a plurality of predetermined subarrays of the mapped input information; means in communication with the isolating means for shifting the isolated subarrays of information in at least one dimension; means for storing the shifted subarrays; means in communication with the storing means for determining a closest match between each of the respective shifted subarrays and learned information corresponding thereto; and means in communication with the determining means for updating weights for the learned information based upon the determined closest matches.
Claim 9
Independent Claim
126 words
An apparatus for updating weights relating to information which has been learned in a neural network, the network including a database of leaned information mapped onto an array, comprising: means for mapping the input information onto the array; means coupled to the mapping means for isolating a plurality of predetermined subarrays of the mapped input information; means in communication with the isolating means for shifting the isolated subarrays of information in at least one dimension; means for storing the shifted subarrays; means in communication with the storing means for determining a closest match between each of the respective shifted subarrays and learned information corresponding thereto; and means in communication with the determining means for updating weights for the learned information based upon the determined closest matches.
Claim 10
Dependent Claim
20 words
The apparatus of claim 6, wherein the shifted, isolated subarrays include subarrays which are shifted in each of two dimensions.
Claim 11
Dependent Claim
19 words
The apparatus of claim 6, wherein the shifted, isolated subarrays include rotated subarrays which are shifted about an axis.
Claim 12
Dependent Claim
143 words
The apparatus of claim 6, wherein the array comprises a matrix of pixels having a first dimension and a second dimension, and wherein the shifted, isolated subarrays include: first shifted subarrays which are shifted a predetermined first number of pixels in each of a negative direction and a positive direction in the first dimension without shifting in the second dimension; second shifted subarrays which are shifted a predetermined second number of pixels in each of a negative direction and a positive direction in the second dimension without shifting in the first dimension; and third shifted subarrays which are shifted the predetermined first number of pixels in each of the negative direction and the positive direction in the first dimension, and are also shifted the predetermined second number of pixels in each of the negative direction and the positive direction in the second dimension.
Claim 13
Independent Claim
123 words
An apparatus for learning input patterns in a neural network, wherein the patterns belong to classes of patterns, comprising: means for mapping at least one portion of each input pattern onto an input image area which is larger than the mapped portion; means in communication with the mapping means for shifting the portion of the pattern within the input image area to each one of a plurality of predetermined positions for comparison with prelearned portions of other patterns; and means in communication with the shifting means for generating weight vector outputs from the neural network based upon a best match between the shifted portion of the pattern at one of the predetermined positions and one of the prelearned portions of the other patterns.
Claim 14
Independent Claim
123 words
An apparatus for learning input patterns in a neural network, wherein the patterns belong to classes of patterns, comprising: means for mapping at least one portion of each input pattern onto an input image area which is larger than the mapped portion; means in communication with the mapping means for shifting the portion of the pattern within the input image area to each one of a plurality of predetermined positions for comparison with prelearned portions of other patterns; and means in communication with the shifting means for generating weight vector outputs from the neural network based upon a best match between the shifted portion of the pattern at one of the predetermined positions and one of the prelearned portions of the other patterns.
Claim 15
Dependent Claim
45 words
The apparatus of claim 10, wherein the weight vector generating means includes means for changing a weight vector with the largest-valued output relating to a class other than a class to which the input pattern belongs farther away from input vector in the best-match position.
Claim 16
Dependent Claim
21 words
The apparatus of claim 10, wherein the weight vector generating means includes means for correlating unknown input patterns with prelearned patterns.
Claim 17
Independent Claim
241 words
A method for learning distinguishing characteristics of patterns input into a neural network, including the steps of: (1) mapping an input pattern onto an array, the array comprising a predetermined number of tiles; (2) generating values for weights relating to each of the tiles; (3) repeating steps 1 and 2 for each of a plurality of patterns; (4) generating contributive values from the weight values based upon a correlation of the weight values for each of the tiles with weight values of corresponding tiles of other patterns; (5) correlating the contributive values for determining which of the contributive values relate to regions of the array wherein patterns of the class differ most from one another; (6) generating a set of sums of contributive values from sets of tiles; (7) determining at least one subset of the set of sums which is higher than other sums; (8) mapping the determined subset onto the array for generating at least one receptive field for comparison among different ones of said patterns, the receptive field relating to a region representing features of the patterns which are distinct from one another; (9) defining an input image area which is larger than the generated receptive field; (10) shifting data of each input pattern within the input image area for determining a best correspondence of the shifted data and a previously learned weight relating to the receptive field; and (11) updating the weights based upon the shifted data.
Claim 18
Independent Claim
241 words
A method for learning distinguishing characteristics of patterns input into a neural network, including the steps of: (1) mapping an input pattern onto an array, the array comprising a predetermined number of tiles; (2) generating values for weights relating to each of the tiles; (3) repeating steps 1 and 2 for each of a plurality of patterns; (4) generating contributive values from the weight values based upon a correlation of the weight values for each of the tiles with weight values of corresponding tiles of other patterns; (5) correlating the contributive values for determining which of the contributive values relate to regions of the array wherein patterns of the class differ most from one another; (6) generating a set of sums of contributive values from sets of tiles; (7) determining at least one subset of the set of sums which is higher than other sums; (8) mapping the determined subset onto the array for generating at least one receptive field for comparison among different ones of said patterns, the receptive field relating to a region representing features of the patterns which are distinct from one another; (9) defining an input image area which is larger than the generated receptive field; (10) shifting data of each input pattern within the input image area for determining a best correspondence of the shifted data and a previously learned weight relating to the receptive field; and (11) updating the weights based upon the shifted data.
References Cited (Backward Citations)
US4136332A
Cited
DE2910854A1
Cited
US4760604A
Cited
DE3711872A1
Cited
US5048100A
Cited
US5060276A
Cited
US5067164A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-11-15 | 1997-05-17 | 1997-11-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-15 | 2001-05-17 | 2001-11-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-15 | 2005-05-17 | 2005-11-16 | $7700.00 | Window Closed / Lapsed |