Patent US6807307B2 successfully refreshed from Google Patents.
US6807307B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Clustering method for rosette scan imges
Assignee: Individual
•
Filing: 2001-06-05
•
Granted: 2004-10-19
•
Expires: 2021-06-05
Abstract
Abstract The present invention relates to a clustering method for rosette scan images, comprising the steps of: (a) obtaining a subject image according to its rosette pattern; (b) converting the location information among the data of the subject image and arraying the converted information into a two-dimensional memory; (c) reading the image data arrayed in the two-dimensional memory from the first row and defining a portion of the data with continuous 1's as a partial cluster; (d) storing multiple partial clusters created upon the completion of the step (c) with respect to the said two-dimensional memory to the end; (e) examining the adjacency among the created multiple partial clusters; and (f) binding the adjacent partial clusters detected in the step (e) as an independent cluster.
Inventors
- 👤 Surng Gahb Jahng
- 👤 Hyun Ki Hong
- 👤 Jong Soo Choi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 08:00
CPC Classifications
G; G06; G06T; G06T7/00; G06T7/60; G06V; G06V10/00; G06V10/10; G06V10/12; G06V10/14; G06V10/147; G06F; G06F18/00; G06F18/20; G06F18/23; G06F18/232; G06F18/2321; G06F18/23211; G06V10/20; G06V10/255
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
116 words
A clustering method for rosette scan images, comprising the steps of: (a) obtaining a subject image according to a rosette pattern; (b) arraying the obtained image data into a two-dimensional memory by converting the location information of the data; (c) reading the image data stored in the two-dimensional memory in an orderly manner from the first row and defining partial clusters if the data have ones (1s) continuously as their values; (d) storing the partial clusters created upon the complete performance of said step (c) until the end of the two-dimensional memory; (e) examining the adjacency among the created partial clusters; and (f) binding the adjacent clusters detected in said step (e) into one independent cluster.
Claim 2
Dependent Claim
116 words
A clustering method for rosette scan images, comprising the steps of: (a) obtaining a subject image according to a rosette pattern; (b) arraying the obtained image data into a two-dimensional memory by converting the location information of the data; (c) reading the image data stored in the two-dimensional memory in an orderly manner from the first row and defining partial clusters if the data have ones (1s) continuously as their values; (d) storing the partial clusters created upon the complete performance of said step (c) until the end of the two-dimensional memory; (e) examining the adjacency among the created partial clusters; and (f) binding the adjacent clusters detected in said step (e) into one independent cluster.
Claim 3
Dependent Claim
44 words
The clustering method for rosette scan images according to claim 1 , further comprising the step (g) of rearranging the clusters bound in said step (f) according to the x and y coordinates of the subject image and determining the center of each cluster.
Claim 4
Dependent Claim
175 words
The clustering method for rosette scan images according to claim 1 , wherein said step (b) of arraying the subject image into a two-dimensional memory further comprises the steps of: determining the relevant row in the two-dimensional memory for the image data, through the instantaneous location θ(t) of the image data obtained said step (a) and the total number of leaves of the rosette pattern, by a mathematical formula of [ θ ( t ) N π ] + 1 in the event of θ(t)≧0, or [ θ ( t ) N π + 2 π ] + 1 in the event of θ(t)<0; and determining the relevant column in the two-dimensional memory for the image data, where each sample point is N j and D equals [ N j 2 k ] , by a mathematical formula of (1+D)2 k −N j +1 in the event that D is an odd number or N j −2 k D in the event that D is an even number.
Claim 5
Dependent Claim
25 words
The clustering method for rosette scan images according to claim 1 , wherein the partial clusters are defined for each row of the two-dimensional memory.
Claim 6
Dependent Claim
42 words
The clustering method for rosette scan images according to claim 1 , wherein said step (e) of examining the adjacency is performed by examining whether the partial clusters defined in each row are adjacent to other partial clusters in the neighboring rows.
Claim 7
Dependent Claim
42 words
The clustering method for rosette scan images according to claim 4 , wherein said step (e) of examining the adjacency is performed by examining whether the partial clusters defined in each row are adjacent to other partial clusters in the neighboring rows.
References Cited (Backward Citations)
US4009393A
Cited
US6198564B1
Cited
US4014000A
Cited
USRE33228E
Cited
US6121606A
Cited
US5088659A
Cited
US5572600A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-10-19 | 2008-04-19 | 2008-10-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-10-19 | 2012-04-19 | 2012-10-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-10-19 | 2016-04-19 | 2016-10-19 | $7700.00 | Window Closed / Lapsed |