US5058179A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hierarchical constrained automatic learning network for character recognition
Assignee: Nokia Bell Labs
•
Filing: 1990-01-31
•
Granted: 1991-10-15
•
Expires: 2010-01-31
Abstract
Abstract Highly accurate, reliable optical character recognition is afforded by a hierarchically layered network having several layers of parallel constrained feature detection for localized feature extraction followed by several fully connected layers for dimensionality reduction. Character classification is also performed in the ultimate fully connected layer. Each layer of parallel constrained feature detection comprises a plurality of constrained feature maps and a corresponding plurality of kernels wherein a predetermined kernel is directly related to a single constrained feature map. Undersampling is performed from layer to layer.
Inventors
- 👤 John S. Denker
- 👤 Richard E. Howard
- 👤 Lawrence D. Jackel
- 👤 Yann LeCun
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 05:55
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/0464; G06N3/08; G06N3/09; G06V; G06V30/00; G06V30/10; G06V30/18; G06V30/1801; G06V30/18019; G06V30/18038; G06V30/18048; G06V30/18057
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
114 words
A massively parallel computation network for recognition of a character included in an image map, said network including a first constrained feature detection layer for extracting features from said image map and for undersampling said image, a second constrained feature detection layer for extracting features from said first constrained feature detection layer and for undersampling said first feature detection layer, first dimensionality reduction layer substantially fully connected to and responsive to said second constrained feature detection layer, and second dimensionality reduction layer substantially fully connected to and responsive to said first dimensionality reduction layer for classifying the character recognized by the network and generating an indication representative of the character recognized by the network.
Claim 2
Dependent Claim
114 words
A massively parallel computation network for recognition of a character included in an image map, said network including a first constrained feature detection layer for extracting features from said image map and for undersampling said image, a second constrained feature detection layer for extracting features from said first constrained feature detection layer and for undersampling said first feature detection layer, first dimensionality reduction layer substantially fully connected to and responsive to said second constrained feature detection layer, and second dimensionality reduction layer substantially fully connected to and responsive to said first dimensionality reduction layer for classifying the character recognized by the network and generating an indication representative of the character recognized by the network.
Claim 3
Dependent Claim
22 words
The computation network defined in claim 1 wherein said image map includes a substantially constant predetermined background surrounding an original character image.
Claim 4
Dependent Claim
56 words
The computation network defined in claim 1 wherein said first constrained feature detection layer includes M groups of m units arranged as independent feature maps and said second constrained feature detection layer includes N groups of n units arranged as independent feature maps, and M, N, m, and n are positive integers where M≧N and m≧n.
Claim 5
Dependent Claim
13 words
The computation network defined in claim 3 wherein N and M are equal.
Claim 6
Dependent Claim
50 words
The computation network as defined in claim 3 wherein said first dimensionality reduction layer comprises L groups of one unit each, said second dimensionality reduction layer comprises K groups of one unit each, where K and L are positive integers and K is greater than N and less than L.
Claim 7
Dependent Claim
13 words
The computation network defined in claim 5 wherein N and M are equal.
Claim 8
Dependent Claim
188 words
The computation network defined in claim 3 wherein substantially each unit has associated therewith a corresponding computational element for generating a value for the associated unit, each said computational element having a weighting kernel associated therewith and being responsive to a plurality of substantially neighboring units from at least a predetermined other layer for mapping a dot product of said associated weighting kernel with said predetermined plurality of substantially neighboring units into an output value in accordance with a selected nonlinear criterion, each said computation element responsive to a different plurality of substantially neighboring units than each other computation element associated with the same map, said first constrained feature detection layer responsive to image units, said second constrained feature detection layer responsive to units responsive to units from at least one feature map in said first constrained feature detection layer, each unit in said first dimensionality reduction layer responsive to substantially every unit in said second constrained feature detection layer representative of the character recognized by the network, and each unit in said second dimensionality reduction layer responsive to substantially every unit in said first dimensionality reduction layer.
Claim 9
Dependent Claim
16 words
The computation network defined in claim 7 wherein the selected nonlinear criterion includes a sigmoidal function.
Claim 10
Dependent Claim
17 words
The computation network defined in claim 7 wherein the selected nonlinear criterion includes a piecewise nonlinear function.
Claim 11
Dependent Claim
13 words
The computation network defined in claim 7 wherein N and M are equal.
Claim 12
Dependent Claim
50 words
The computation network as defined in claim 7 wherein said first dimensionality reduction layer comprises L groups of one unit each, said second dimensionality reduction layer comprises K groups of one unit each, where K and L are positive integers and K is greater than N and less than L.
Claim 13
Dependent Claim
13 words
The computation network defined in claim 11 wherein N and M are equal.
Claim 14
Dependent Claim
16 words
The computation network defined in claim 12 wherein the selected nonlinear criterion includes a sigmoidal function.
Claim 15
Dependent Claim
17 words
The computation network defined in claim 12 wherein the selected nonlinear criterion includes a piecewise nonlinear function.
References Cited (Backward Citations)
US3275986A
Cited
US3295103A
Cited
US3701095A
Cited
US4750211A
Cited
US4918742A
Cited
US4933872A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-14 | 1995-04-15 | 1995-10-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-14 | 1999-04-15 | 1999-10-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-14 | 2003-04-15 | 2003-10-15 | $7700.00 | Window Closed / Lapsed |