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

Image coding method for coding characters using a modified Bezier curve

Assignee: Ricoh Co Ltd
•
Filing: 1991-09-12
•
Granted: 1993-08-03
•
Expires: 2011-09-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An image coding method extracts a contour of a bi-level image, segments the contour into a plurality of segments by fitting a predetermined generation curve on each of the segments, where the predetermined generation curve is described by control points which include end control points and direction control points, the end control points indicate ends of each segment and the direction control points indicate directions of each segment at the two ends of each segment, and codes the control points.

Inventors

  • 👤 Noboru Murayama

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 08:22
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/20; G06V; G06V30/00; G06V30/10; G06V30/18; G06V30/182

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 230 words
An image coding method comprising the steps of: a) extracting an original vertical-horizontal contour of a bi-level image; b) segmenting the contour into a plurality of segments by fitting a predetermined generation curve on each of the segments, said predetermined generation curve being described by control points which include: 1) end control points indicating ends of each segment; and 2) direction control points indicating directions of the fitted curve of each segment at the two ends of each segment; wherein the predetermined generation curve is described by a polynomial MB, in which: ##EQU8## wherein 1) MB denotes a generation point; 2) P0 denotes a starting end control point which indicates a start point of each segment; 3) P1 denotes a start direction control point which indicates a direction of each segment at the start point; 4) P2 denotes an end direction control point which indicates a direction of each segment at an end point of each segment; 5) P3 denotes an ending control point which indicates the end point of each segment; 6) t is a parameter, 0≦t≦1.0; and 7) c and d are arbitrary real numbers; c) coding the control points; d) selecting an optimum curve by choosing particular values for the arbitrary real numbers c and d; and e) determining particular values for control points after the choice of particular values for the real numbers c and d.
Claim 2
Dependent Claim 230 words
An image coding method comprising the steps of: a) extracting an original vertical-horizontal contour of a bi-level image; b) segmenting the contour into a plurality of segments by fitting a predetermined generation curve on each of the segments, said predetermined generation curve being described by control points which include: 1) end control points indicating ends of each segment; and 2) direction control points indicating directions of the fitted curve of each segment at the two ends of each segment; wherein the predetermined generation curve is described by a polynomial MB, in which: ##EQU8## wherein 1) MB denotes a generation point; 2) P0 denotes a starting end control point which indicates a start point of each segment; 3) P1 denotes a start direction control point which indicates a direction of each segment at the start point; 4) P2 denotes an end direction control point which indicates a direction of each segment at an end point of each segment; 5) P3 denotes an ending control point which indicates the end point of each segment; 6) t is a parameter, 0≦t≦1.0; and 7) c and d are arbitrary real numbers; c) coding the control points; d) selecting an optimum curve by choosing particular values for the arbitrary real numbers c and d; and e) determining particular values for control points after the choice of particular values for the real numbers c and d.
Claim 3
Dependent Claim 65 words
The image coding method as claimed in claim 1 wherein said step of segmenting the contour sets said end control point on a middle segment out of three consecutive segments which form an approximate U-shape such that a direction of the three consecutive segments changes by approximately 180°, and sets said end control point on both ends of a segment which has a predetermined length.
Claim 4
Dependent Claim 31 words
The image coding method as claimed in claim 2 wherein said predetermined length is set to at least 1/4 a full length of a coordinate used to describe the bi-level image.
Claim 5
Dependent Claim 38 words
The image coding method as claimed in claim 1 wherein said step of coding the control points codes the control points in a sequence of the control points P0, P1, P2 and P3 with respect to one contour.
Claim 6
Dependent Claim 25 words
The image coding method as claimed in claim 4 wherein each of said control points are located on an original contour of the bi-level image.
Claim 7
Dependent Claim 34 words
The image coding method as claimed in claim 4 wherein each of said control points are located on an original contour of the bi-level image except for control points of an approximate S-shape segment.
Claim 8
Dependent Claim 44 words
The image coding method as claimed in claim 1 wherein said step of segmenting the contour regards an ending control point of a first one of two consecutive segments identical to a starting control point of a second one of the two consecutive segments.
Claim 9
Dependent Claim 37 words
The image coding method as claimed in claim 7 wherein said step of coding the control points codes the control points in a sequence of the control points P0, P1 and P2 with respect to one contour.
Claim 10
Dependent Claim 62 words
The image coding method as claimed in claim 7 wherein said step of segmenting the contour assigns X and Y coordinates to an address of each of said control points, and said step of coding the control points codes an address difference of the control point sin a sequence of the control points P0, P1 and P2 with respect to one contour.

References Cited (Backward Citations)

US4675831A Cited
US4698778A Cited
US4771474A Cited
US4698691A Cited
US4688182A Cited
GB2203613A Cited
US5091976A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-08-02 1997-02-01 1997-08-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-08-02 2001-02-01 2001-08-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-08-02 2005-02-01 2005-08-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag