US5187751A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Clustering system for optical character reader
Assignee: Sharp Corp
•
Filing: 1991-07-22
•
Granted: 1993-02-16
•
Expires: 2011-07-22
Abstract
Abstract In a clustering system for an optical character reader, feature vectors of character image data to be classified are stored in a first memory. The number of classes, and representative vectors for the respective classes which are previously provided are stored in a second memory. Values of the cosine of each of the feature vectors stored in the first memory and each of the representative vectors stored in the second memory are calculated by a cosine calculating unit. Then, each of the feature vectors is assigned to one of the classes from which the largest cosine value is calculated, and the largest cosine value is stored into a third memory. For each of the thus processed classes, a total sum vector calculating unit calculates a total sum vector from the feature vectors which belong to the respective class, using the largest cosine values for the respective feature vectors stored in the third memory as weights. The resulting weighted total sum vector is stored into the second memory as a new representative vector for the class so as to update the contents of the second memory. The cosine calculating unit, and total sum vector calculating unit are controlled to operate repeatedly, until a convergence judging unit judges that any feature vectors are not exchanged between the classes during the classification.
Inventors
- 👤 Hideaki Tanaka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 17:51
CPC Classifications
G; G06; G06F; G06F18/00; G06F18/20; G06F18/23; G06F18/232; G06F18/2321; G06F18/23213
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
215 words
A clustering system for classifying data into a predetermined number of classes, comprising: first memory means for storing feature vectors of said data; second memory means for storing said predetermined number and representative vectors of said classes, said representative vectors being previously provided; cosine calculating means for calculating the cosine of each of said feature vectors stored in said first memory means and each of said representative vectors stored in said second memory means; classification means for assigning each of said feature vectors into one of said classes which indicates the largest cosine value; third memory means for storing said largest cosine value for each of said feature vectors; total sum vector calculating means for calculating, for each of said classes, a total sum vector from feature vectors of one of said classes, using a weight which is the largest cosine value for each of said feature vectors stored in said third memory means, and for storing said weighted total sum vector into said second means, thereby updating the contents of said second memory means; and convergence judging means for controlling said cosine calculating means, classification means and total sum vector calculating means to operate repeatedly, until no feature vectors are exchanged between the classes as a result of the classification by said classification means.
Claim 2
Dependent Claim
215 words
A clustering system for classifying data into a predetermined number of classes, comprising: first memory means for storing feature vectors of said data; second memory means for storing said predetermined number and representative vectors of said classes, said representative vectors being previously provided; cosine calculating means for calculating the cosine of each of said feature vectors stored in said first memory means and each of said representative vectors stored in said second memory means; classification means for assigning each of said feature vectors into one of said classes which indicates the largest cosine value; third memory means for storing said largest cosine value for each of said feature vectors; total sum vector calculating means for calculating, for each of said classes, a total sum vector from feature vectors of one of said classes, using a weight which is the largest cosine value for each of said feature vectors stored in said third memory means, and for storing said weighted total sum vector into said second means, thereby updating the contents of said second memory means; and convergence judging means for controlling said cosine calculating means, classification means and total sum vector calculating means to operate repeatedly, until no feature vectors are exchanged between the classes as a result of the classification by said classification means.
Claim 3
Dependent Claim
229 words
An optical character reader comprising a clustering system for classifying character image data into a predetermined number of font classes, said clustering system comprising: first memory means for storing feature vectors of said character image data; second memory means for storing said predetermined number and representative vectors of said font classes, said representative vectors being previously provided; cosine calculating means for calculating the cosine of each of said feature vectors stored in said first memory means and each of said representative vectors stored in said second memory means; classification means for assigning each of said feature vectors into one of said classes which indicates the largest cosine value; third memory means for storing said largest cosine value for each of said feature vectors; total sum vector calculating means for calculating, for each of said classes, a total sum vector from feature vectors of one of said classes, using a weight which is the largest cosine value for each of said feature vectors stored in said third memory means, and for storing said weighted total sum vector into said second means, thereby updating the contents of said second memory means; and convergence judging means for controlling said cosine calculating means, classification means and total sum vector calculating means to operate repeatedly, until no feature vectors are exchanged between the classes as a result of the classification by said classification means.
Claim 4
Dependent Claim
229 words
An optical character reader comprising a clustering system for classifying character image data into a predetermined number of font classes, said clustering system comprising: first memory means for storing feature vectors of said character image data; second memory means for storing said predetermined number and representative vectors of said font classes, said representative vectors being previously provided; cosine calculating means for calculating the cosine of each of said feature vectors stored in said first memory means and each of said representative vectors stored in said second memory means; classification means for assigning each of said feature vectors into one of said classes which indicates the largest cosine value; third memory means for storing said largest cosine value for each of said feature vectors; total sum vector calculating means for calculating, for each of said classes, a total sum vector from feature vectors of one of said classes, using a weight which is the largest cosine value for each of said feature vectors stored in said third memory means, and for storing said weighted total sum vector into said second means, thereby updating the contents of said second memory means; and convergence judging means for controlling said cosine calculating means, classification means and total sum vector calculating means to operate repeatedly, until no feature vectors are exchanged between the classes as a result of the classification by said classification means.
Claim 5
Dependent Claim
35 words
An optical character reader according to claim 2, wherein each of said representative vectors of said font classes is indicative of the feature of the font corresponding to the respective one of said font classes.
Claim 6
Dependent Claim
20 words
An optical character reader according to claim 2, wherein said font classes are used in a dictionary for character recognition.
References Cited (Backward Citations)
US3626368A
Cited
US3727193A
Cited
US4752957A
Cited
US4731859A
Cited
US5060277A
Cited
US5142593A
Cited
US4977603A
Cited
US5075896A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-02-16 | 1996-08-17 | 1997-02-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-02-16 | 2000-08-17 | 2001-02-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-02-16 | 2004-08-17 | 2005-02-16 | $7700.00 | Window Closed / Lapsed |