Patent US5204915A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5204915A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of extracting feature from line pattern and line pattern recognition method using the same

Assignee: Ricoh Co Ltd
•
Filing: 1990-09-19
•
Granted: 1993-04-20
•
Expires: 2010-09-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of extracting a feature from a line pattern comprising the steps of (a) extracting a thinned line from the line pattern, (b) finding one or a plurality of singular points which are formed on the thinned line, (c) decomposing each of the singular points into a plurality of vertices, (d) generating strokes due to the finding of pairs of the vertices, obtained by the step (c), which are regarded as identical to each other, (e) converting each of the strokes into a primitive sequence obtained by a concatenation of primitives, and (f) generating a binary relation between each two primitive sequences obtained by the step (e), so that the line pattern is featured by a combination of primitive sequences obtained by the step (e) and the binary relation between each of the primitive sequences.

Inventors

  • 👤 Hirobumi Nishida

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 13:15
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/40; G06V10/44; G06V30/00; G06V30/10

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 216 words
A method of extracting a feature from a line pattern comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; and (d) selecting vertices regarded as being identical to each other from the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches including the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; wherein the line pattern is characterized by the singular points and a connection relation of said strokes with respect to each of the singular points.
Claim 2
Independent Claim 216 words
A method of extracting a feature from a line pattern comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; and (d) selecting vertices regarded as being identical to each other from the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches including the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; wherein the line pattern is characterized by the singular points and a connection relation of said strokes with respect to each of the singular points.
Claim 3
Independent Claim 268 words
A method of extracting a feature from a line pattern comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; (d) selecting vertices regarded as being identical to each other from the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches including the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; (e) converting each of the strokes into a primitive sequence obtained by a concatenation of primitives, each of which is a monotone curve, said monotone curve being a curve which is either non-increasing or non-decreasing; and (f) generating a binary relation between each two primitive sequences obtained by said step (e); wherein the line pattern is characterized by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences.
Claim 4
Independent Claim 268 words
A method of extracting a feature from a line pattern comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; (d) selecting vertices regarded as being identical to each other from the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches including the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; (e) converting each of the strokes into a primitive sequence obtained by a concatenation of primitives, each of which is a monotone curve, said monotone curve being a curve which is either non-increasing or non-decreasing; and (f) generating a binary relation between each two primitive sequences obtained by said step (e); wherein the line pattern is characterized by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences.
Claim 5
Dependent Claim 89 words
A method of extracting a feature from a line pattern as claimed in claim 2, wherein there are four types of said primitive, a first primitive being a y-constant curve which is a horizontal line segment, a second primitive being an xy-changing curve which increases in the right direction and decreases in the left direction, a third primitive being an x-constant curve which is a vertical line segment, and a fourth primitive being a xy-reverse changing curve which increases in the left direction and decrease in the right direction.
Claim 6
Dependent Claim 26 words
A method extracting a feature from a line pattern as claimed in claim 2, wherein said binary relation has a connection relation between two primitive sequences.
Claim 7
Dependent Claim 32 words
A method extracting a feature from a line pattern as claimed in claim 2, wherein said binary relation has a connection relation between two primitive sequences at each of said singular points.
Claim 8
Dependent Claim 350 words
A line pattern recognition method comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; (d) selecting vertices regarded as being identical to each other form the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches include the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; (e) converting each of the strokes into a primitive sequence obtained by a concatenation of primitives, each of which is a monotone curve, said monotone curve being a curve which is either non-increasing or non-decreasing; (f) generating a binary relation between each two primitive sequences obtained by said step (e), so that the line pattern is featured by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences; and (g) comparing a line pattern featured by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences obtained by said step (f), with each of the standard models describing primitive sequences and the binary relation between each two primitive sequences, so that a matching of said line pattern and said standard models is performed on the basis of structural matching; wherein a result of said matching is a result of a recognition of said line pattern.
Claim 9
Dependent Claim 350 words
A line pattern recognition method comprising the steps of: (a) extracting a thinned line from the line pattern, said thinned line being represented by branches which are partitioned from each other by vertices; (b) finding one or a plurality of singular points which are formed on said thinned line, each of said singular points being defined as a vertex to which three or more branches are connected; (c) decomposing each of said singular points into a number of vertices that is the same as the number of branches connected thereto, based on a presumption that each of said singular points is included in all the branches connected to each of said singular points, wherein each of said vertices has the same coordinate as a corresponding singular point; (d) selecting vertices regarded as being identical to each other form the vertices obtained in said step (c), based on conditions in which the branches are connected to each of said singular points, wherein branches include the selected vertices are connected to each other, so that strokes are generated, each stroke having branches successively connected to each other; (e) converting each of the strokes into a primitive sequence obtained by a concatenation of primitives, each of which is a monotone curve, said monotone curve being a curve which is either non-increasing or non-decreasing; (f) generating a binary relation between each two primitive sequences obtained by said step (e), so that the line pattern is featured by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences; and (g) comparing a line pattern featured by a combination of primitive sequences obtained by said step (e) and said binary relation between each of the primitive sequences obtained by said step (f), with each of the standard models describing primitive sequences and the binary relation between each two primitive sequences, so that a matching of said line pattern and said standard models is performed on the basis of structural matching; wherein a result of said matching is a result of a recognition of said line pattern.
Claim 10
Dependent Claim 70 words
A line pattern recognition method as claimed in claim 6 further comprising the steps of; (h) extracting one or a plurality of parameters describing a shape of said line pattern when said line pattern matches a plurality of said standard models, and (i) adaptively applying a statistical analysis to said parameters, so that one of said standard models is limited on the basis of a result of said step (i).

References Cited (Backward Citations)

US4040009A Cited
US4777651A Cited
US4748443A Cited
US4685124A Cited
US4718103A Cited
US4878249A Cited
US4891750A Cited
US4905295A Cited
US4987603A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag