Patent US3801644A successfully refreshed from Google Patents.
US5339367A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Identifying curves within a scanned image
Assignee: National Research Council Canada
•
Filing: 1992-12-02
•
Granted: 1994-08-16
•
Expires: 2012-12-02
Abstract
Abstract A method is provided for identifying and locating curves within a digitized image. Digitized images are comprised of points which may represent curves stored as an array of binary coded elements in an memory device. Each addressable memory location in the array represents a single point or pixel. Particular curves within a scanned image are identified by randomly selecting a minimal subset of points which are necessary to generate a general equation for that curve; the equation along with a point on the curve is then used as in input parameter to an incremental curve generation routine which incrementally generates all points which are in a path along that curve. A comparison is made with scanned data to determine how many points exist along the path. This is repeatedly done until the curve with the greatest number of points is located.
Inventors
- 👤 Gerhard Roth
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:00
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/40; G06V10/46; G06V10/478
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
135 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location in a random access memory array, comprising the steps of: a) sampling the binary data in the random access memory array to obtain a plurality of sampled points; b) using a minimal subset of the sampled points as seed values for generating an equation for a curve that intersects the sampled points; c) determining the number of points in the random access memory array that lie on a path of a predetermined width w corresponding to the curve defined by the equation; and, d) repeating steps (a) to (c) and selecting the curve lying on the path of width w having the greatest number of corresponding points determined in step (c).
Claim 2
Independent Claim
135 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location in a random access memory array, comprising the steps of: a) sampling the binary data in the random access memory array to obtain a plurality of sampled points; b) using a minimal subset of the sampled points as seed values for generating an equation for a curve that intersects the sampled points; c) determining the number of points in the random access memory array that lie on a path of a predetermined width w corresponding to the curve defined by the equation; and, d) repeating steps (a) to (c) and selecting the curve lying on the path of width w having the greatest number of corresponding points determined in step (c).
Claim 3
Dependent Claim
19 words
A method as defined in claim 1 wherein the sampling step is performed by randomly sampling the binary data.
Claim 4
Dependent Claim
40 words
A method as defined in claim 1 wherein the step of determining the location of all the addressable memory locations in the array which lie in a path of width w is performed by a method of incremental curve generation.
Claim 5
Dependent Claim
31 words
A method as defined in claim 1 wherein the plurality of samples is comprised of a number corresponding to a minimal number required to define an equation for a particular curve.
Claim 6
Independent Claim
105 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location in a memory array, comprising the steps of: a) generating an equation for a curve using a minimal subset of sampled points; b) determined the number of points in the random access memory array that lie on a path of a predetermined width w, corresponding to the curve defined by the equation; and c) repeating steps (a) to (b) and selecting the curve lying on the path of width w having the greatest number of corresponding points determined in step (b).
Claim 7
Independent Claim
105 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location in a memory array, comprising the steps of: a) generating an equation for a curve using a minimal subset of sampled points; b) determined the number of points in the random access memory array that lie on a path of a predetermined width w, corresponding to the curve defined by the equation; and c) repeating steps (a) to (b) and selecting the curve lying on the path of width w having the greatest number of corresponding points determined in step (b).
Claim 8
Independent Claim
131 words
A method of identifying a curve represented by a plurality of numbers, a difference in any two numbers representing a difference in the brightness in the array, each of the numbers being stored in an addressable location in a random access memory array, the method comprising the steps of: a) generating an equation for a curve; b) determining the location of all the addressable memory locations in the random access memory array which lie on a path corresponding to the curve defined by the equation; c) summing the values of the differences in brightness of the points that lie within the path; and, repeating steps (a) to (c) and selecting a curve defined by points stored in the random access memory corresponding to the the greatest summed value in step (c).
Claim 9
Independent Claim
131 words
A method of identifying a curve represented by a plurality of numbers, a difference in any two numbers representing a difference in the brightness in the array, each of the numbers being stored in an addressable location in a random access memory array, the method comprising the steps of: a) generating an equation for a curve; b) determining the location of all the addressable memory locations in the random access memory array which lie on a path corresponding to the curve defined by the equation; c) summing the values of the differences in brightness of the points that lie within the path; and, repeating steps (a) to (c) and selecting a curve defined by points stored in the random access memory corresponding to the the greatest summed value in step (c).
Claim 10
Independent Claim
126 words
A method of identifying a curve represented by a plurality of numbers, a difference in any two numbers representing a difference in the brightness in the array, each of the numbers being stored in an addressable location in a random access memory array, the method comprising the steps of: a) generating an equation for a curve; b) determining the location of all the addressable memory locations in the random access memory array which lie on a path of width w corresponding to the curve defined by the equation, w being a predetermined number; c) determining the number of points in the array that lie within the path of width w; and, repeating steps (a) to (c) and selecting the path with the greatest number of points.
Claim 11
Independent Claim
126 words
A method of identifying a curve represented by a plurality of numbers, a difference in any two numbers representing a difference in the brightness in the array, each of the numbers being stored in an addressable location in a random access memory array, the method comprising the steps of: a) generating an equation for a curve; b) determining the location of all the addressable memory locations in the random access memory array which lie on a path of width w corresponding to the curve defined by the equation, w being a predetermined number; c) determining the number of points in the array that lie within the path of width w; and, repeating steps (a) to (c) and selecting the path with the greatest number of points.
Claim 12
Independent Claim
130 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location of a random access memory array, comprising the steps of: a) sampling the binary data in the random access memory array to obtain a plurality of indicia corresponding to sampled points; b) generating an equation for a curve which intersects the sampled points; c) determining the number all the addressable memory locations in the array which lie on the curve defined by the equation, wherein the curve is of a predetermined width w; d) determining the number of points in the random access memory array that lie on the curve of width w; and, comparing the number in step (c) with the number in step (d).
Claim 13
Independent Claim
130 words
A method of identifying a curve represented by points, each of the points being stored in a binary form in a unique, addressable location of a random access memory array, comprising the steps of: a) sampling the binary data in the random access memory array to obtain a plurality of indicia corresponding to sampled points; b) generating an equation for a curve which intersects the sampled points; c) determining the number all the addressable memory locations in the array which lie on the curve defined by the equation, wherein the curve is of a predetermined width w; d) determining the number of points in the random access memory array that lie on the curve of width w; and, comparing the number in step (c) with the number in step (d).
Claim 14
Dependent Claim
29 words
A method as defined in claim 8 wherein the comparing in step (d) is done repeatedly until the ratio of the numbers compared are at least a predetermined number.
References Cited (Backward Citations)
US4618989A
Cited
US4771474A
Cited
US4868884A
Cited
US4644583A
Cited
US4949281A
Cited
US5093870A
Cited
US5091976A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-08-15 | 1998-02-14 | 1998-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-08-15 | 2002-02-14 | 2002-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-08-15 | 2006-02-14 | 2006-08-16 | $7700.00 | Window Closed / Lapsed |