← Back to Patent Explorer
US4034344A Expired / Lapsed US ⏱️ 0.0 years remaining

Character thinning apparatus

Assignee: US Philips Corp
•
Filing: 1975-11-03
•
Granted: 1977-07-05
•
Expires: 1995-11-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Character thinning apparatus for use in recognizing characters comprising means for applying a compound operator in cycles to each point of the binarized character on a first matrix, and means for rewriting, in each cycle, character points to which the compound operator is applied into corresponding positions in a second matrix in accordance with a compound test criterion.

Inventors

  • 👤 Peter Saraga
  • 👤 Pieter Reijnierse

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 02:42
CPC Classifications
B; B23; B23Q; B23Q11/00; B23Q11/02; G; G06; G06V; G06V30/00; G06V30/10; G06V30/16; G06V30/168

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 400 words
Character rewriting apparatus for use in recognizing binarized characters made up of points on a matrix of regular rows and columns, comprising: machine means for applying a compound operator in predetermined cycles to each point of the binarized character on a first matrix, said compound operator having an operative center surrounded by a sub-matrix of points defining an operative area fitting said first matrix; and machine means for rewriting, in each one of said predetermined cycles ones of said character points to which said compound operator is applied into corresponding positions on a second matrix in accordance with a predetermined compound test criterion applied by said compound operator, said compound operator comprising a set of operators, each operator of said set being applied to all of the four orientations in which said operator fits said first matrix, each operator being adapted to apply, in each of said four orientations, a predetermined binary logic function, for each one of said operators, to the binary values of the character points found in coincidence with the sub-matrix points, said compound test criterion being defined so that a character point at the operative center is omitted by said machine means on second matrix if any one of the binary logic functions so applied is satisfied, wherein a binary logic function being satisfied is defined as when those points in the operator defined herein as black or as white are all in coincidence with character points or background points respectively; each operator of said set of operators having sides of three operator points parallel to said rows and columns, said compound operator comprising: (a) all operators of a first kind having at least two but not more than five black points forming a chain of adjacent black points occupying not more than two adjacent sides of the operator, and (b) all operators of a second kind having at least five but not more than seven black points forming a chain of adjacent black points occupying three sides of the operator, all remaining points in the operators of both kinds being white, and the operators of the second kind having an additional external adjacent black point when applied in at least two of the adjacent orientations in which said operator sub-matrix fits said matrix points, said additional black point being located on the center of the side remote from the side having a central white point.
Claim 2
Dependent Claim 400 words
Character rewriting apparatus for use in recognizing binarized characters made up of points on a matrix of regular rows and columns, comprising: machine means for applying a compound operator in predetermined cycles to each point of the binarized character on a first matrix, said compound operator having an operative center surrounded by a sub-matrix of points defining an operative area fitting said first matrix; and machine means for rewriting, in each one of said predetermined cycles ones of said character points to which said compound operator is applied into corresponding positions on a second matrix in accordance with a predetermined compound test criterion applied by said compound operator, said compound operator comprising a set of operators, each operator of said set being applied to all of the four orientations in which said operator fits said first matrix, each operator being adapted to apply, in each of said four orientations, a predetermined binary logic function, for each one of said operators, to the binary values of the character points found in coincidence with the sub-matrix points, said compound test criterion being defined so that a character point at the operative center is omitted by said machine means on second matrix if any one of the binary logic functions so applied is satisfied, wherein a binary logic function being satisfied is defined as when those points in the operator defined herein as black or as white are all in coincidence with character points or background points respectively; each operator of said set of operators having sides of three operator points parallel to said rows and columns, said compound operator comprising: (a) all operators of a first kind having at least two but not more than five black points forming a chain of adjacent black points occupying not more than two adjacent sides of the operator, and (b) all operators of a second kind having at least five but not more than seven black points forming a chain of adjacent black points occupying three sides of the operator, all remaining points in the operators of both kinds being white, and the operators of the second kind having an additional external adjacent black point when applied in at least two of the adjacent orientations in which said operator sub-matrix fits said matrix points, said additional black point being located on the center of the side remote from the side having a central white point.
Claim 3
Dependent Claim 27 words
Apparatus as claimed in claim 1, in which the operators of the second kind have said additional external adjacent black point in all four of said orientations.
Claim 4
Dependent Claim 17 words
Apparatus as claimed in claim 2, wherein the compound operator comprises operators having only one black point.
Claim 5
Dependent Claim 21 words
Apparatus as claimed in claim 3 wherein a shift register matrix store is used to apply the operators to the character.

References Cited (Backward Citations)

US3196398A Cited
US3753229A Cited
US3899771A Cited
US3940737A Cited
US3846754A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1980-07-04 1981-01-03 1981-07-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1984-07-04 1985-01-03 1985-07-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1988-07-04 1989-01-03 1989-07-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag