Patent US5319722A successfully refreshed from Google Patents.
US5319722A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Neural network for character recognition of rotated characters
Assignee: Sony Electronics Inc
•
Filing: 1992-10-01
•
Granted: 1994-06-07
•
Expires: 2012-10-01
Abstract
Abstract A process for converting characters arranged circularly, as for example about the center hole of a compact disk, into a linear arrangement. Points are assigned to locations on the circular arrangement. These points are mapped to a linear arrangement. The number of points is selected to be greater than those of the original image to enhance the resolution of the resulting image. The location of the points is stored in an address array. The values of the pixels in the original image are then copied to a target array. The pixel values are then converted to binary values serving as input to a recognition neural network and a verification neural network.
Inventors
- 👤 Toru Oki
- 👤 Philip A. Paolella
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:29
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/14; G06V30/146
Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
261 words
A method for transforming a circularly arranged character to a linearly arranged character, comprising the steps of: generating a plurality of address locations for grey scale sampling pixel values making up said circularly arranged character, said address locations being arranged as a polar array of points formed by intersections of arcs and radial lines, said radial lines extending from a center point of the circle about which said circularly arranged character is arranged, and said arcs are constructed about said center point; generating an address array storing addresses of said sampling points; sampling said grey scale pixel values of said circularly arranged character, the number of sampling points being greater than the number of pixels making up the circularly arranged character, and wherein said radial lines are spaced by an integer divisor of the vertical height of a pixel and said arcs are spaced by an integer divisor of one horizontal width of a pixel; storing said sampled grey scale pixel values in a target array; constructing said linearly arranged character from the sampled values; comparing said sampled pixel values with a reference value and assigning binary values to said pixel values on the basis of said comparison; after said comparing step, finding a center of said linearly arranged character and finding an edge of said linearly arranged character; wherein said step of generating address locations includes computing an address location as x and y coordinates and rounding said coordinate off to the nearest pixel address in the circularly arranged image; and applying said linearly arranged character to a neutral network.
Claim 2
Independent Claim
261 words
A method for transforming a circularly arranged character to a linearly arranged character, comprising the steps of: generating a plurality of address locations for grey scale sampling pixel values making up said circularly arranged character, said address locations being arranged as a polar array of points formed by intersections of arcs and radial lines, said radial lines extending from a center point of the circle about which said circularly arranged character is arranged, and said arcs are constructed about said center point; generating an address array storing addresses of said sampling points; sampling said grey scale pixel values of said circularly arranged character, the number of sampling points being greater than the number of pixels making up the circularly arranged character, and wherein said radial lines are spaced by an integer divisor of the vertical height of a pixel and said arcs are spaced by an integer divisor of one horizontal width of a pixel; storing said sampled grey scale pixel values in a target array; constructing said linearly arranged character from the sampled values; comparing said sampled pixel values with a reference value and assigning binary values to said pixel values on the basis of said comparison; after said comparing step, finding a center of said linearly arranged character and finding an edge of said linearly arranged character; wherein said step of generating address locations includes computing an address location as x and y coordinates and rounding said coordinate off to the nearest pixel address in the circularly arranged image; and applying said linearly arranged character to a neutral network.
References Cited (Backward Citations)
US3050711A
Cited
US3701098A
Cited
US3967243A
Cited
US4040009A
Cited
US4267573A
Cited
US4395699A
Cited
US4491960A
Cited
US4922543A
Cited
US4893346A
Cited
US4748676A
Cited
US4972499A
Cited
US4965725B1
Cited
US4965725A
Cited
US5093899A
Cited
US5129039A
Cited
US4933872A
Cited
US5046020A
Cited
US5119438A
Cited
US5060278A
Cited
US5060276A
Cited
US5067164A
Cited
US5048097A
Cited
US5054094A
Cited
US5052043A
Cited
US5161204A
Cited
US5091965A
Cited
US5157738A
Cited
US5105468A
Cited
US5214746A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-06 | 1997-12-06 | 1998-06-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-06 | 2001-12-06 | 2002-06-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-06 | 2005-12-06 | 2006-06-07 | $7700.00 | Window Closed / Lapsed |