Patent US5691818A successfully refreshed from Google Patents.
US5691818A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for enhancing edges and the like for engraving
Assignee: Daetwyler Global Tec Holding AG
•
Filing: 1995-09-18
•
Granted: 1997-11-25
•
Expires: 2015-09-18
Abstract
Abstract A method and apparatus for engraving wherein the engraver includes a merge system for merging image data to be engraved in a manner which will reduce or eliminate "halo" and/or "ghost" images. The method utilizes a processor in an engraver for creating image data comprising continuous tone data and line work data. The method further involves the steps of locating transition data corresponding to where the continuous tone data and line work data meet; and processing at least some of the image data to provide processed image data using the transition data located in the locating step. The engraver has an engraving bed; a headstock and a tailstock located on the engraving bed for rotatably supporting a cylinder to be engraved; an engraving head located on the engraving bed for engraving the cylinder; an image data generator coupled to the engraving head, the image data generator being capable of creating image data comprising continuous tone data, line work data and transition data. The image data generator comprises a locator for locating the transition data and a processor associated with the locator for processing at least some of the image data to provide processed image data using the transition data located by the locator. The system and method facilitate selectively enhancing at least one edge or area within a data set, such as either a line work data set or a continuous tone data set, while selectively avoiding enhancing other areas, such as an area between a line work area and continuous tone area of an image.
Inventors
- 👤 Douglas G. Newell
- 👤 Karl F. Seibert
- 👤 David R. Seitz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:25
CPC Classifications
B; B41; B41C; B41C1/00; B41C1/02; B41C1/04; B41C1/045; B44; B44B; B44B3/00; B44B3/009; B44B3/06; B44B3/061; G; G05; G05B; G05B19/00; G05B19/02; G05B19/18; G05B19/401; H; H04; H04N; H04N1/00; H04N1/00002; H04N1/04; H04N1/06; H04N1/0671; H04N1/387; H04N1/3871; H04N1/40; H04N1/40025; H04N1/4005; H04N1/405; H04N1/4055; H04N1/4058; H04N1/409; H04N1/4092; G05B2219/00; G05B2219/30; G05B2219/33; G05B2219/33078; G05B2219/37; G05B2219/37358; G05B2219/37572; G05B2219/37574; G05B2219/45; G05B2219/45163; G05B2219/45178; G05B2219/45212; G05B2219/49; G05B2219/49235; G05B2219/50; G05B2219/50057; H04N1/19
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
195 words
A method for engraving by comprising the steps of: providing an image having a first area represented by a first set of image data and a second area represented by a second set of image data; generating a mask file of data corresponding to said image; rescreening at least one of said first set of image data or said second set of image data to the same resolution as said second set of image data or said first set of image data, respectively; merging said first and second sets of data using said mask file to provide a merged image data file; rescreening said merged image data file to a predetermined resolution; rescreening said mask file of data to a predetermined resolution to provide a rescreened mask file of data, said rescreened mask file of data comprising first mask data corresponding to said first set of image data, second mask data corresponding to said second set of image data and transition data corresponding to a transition area associated with a juncture of said first and second sets of data; generating said processed image data file using said merged image data and said rescreened mask file.
Claim 2
Independent Claim
195 words
A method for engraving by comprising the steps of: providing an image having a first area represented by a first set of image data and a second area represented by a second set of image data; generating a mask file of data corresponding to said image; rescreening at least one of said first set of image data or said second set of image data to the same resolution as said second set of image data or said first set of image data, respectively; merging said first and second sets of data using said mask file to provide a merged image data file; rescreening said merged image data file to a predetermined resolution; rescreening said mask file of data to a predetermined resolution to provide a rescreened mask file of data, said rescreened mask file of data comprising first mask data corresponding to said first set of image data, second mask data corresponding to said second set of image data and transition data corresponding to a transition area associated with a juncture of said first and second sets of data; generating said processed image data file using said merged image data and said rescreened mask file.
Claim 3
Dependent Claim
36 words
The method as recited in claim 1 wherein said method further comprises the step of: selecting a merged image data pixel in said merged image data; identifying a corresponding mask pixel in said rescreened mask file.
Claim 4
Dependent Claim
46 words
The method as recited in claim 2 wherein said method comprises the step of: using said corresponding mask pixel to determine whether said merged image data pixel is associated with said first set of image data, said second set of image data, or said transition data.
Claim 5
Dependent Claim
54 words
The method as recited in claim 3 wherein said method further comprises the step of: determining that said corresponding mask pixel corresponds to said first data set if its density is equal to a first predetermined density or corresponds to said second data set if its density is equal to a second predetermined density.
Claim 6
Dependent Claim
51 words
The method as recited in claim 4 wherein said method further comprises the step of: performing edge enhancing within said first data set or said second data set if it is determined that said corresponding mask pixel corresponds to said first data set or corresponds to said second data set, respectively.
Claim 7
Dependent Claim
39 words
The method as recited in claim 3 wherein said method further comprises the step of: determining that said corresponding mask pixel corresponds to said transition data if said density of said corresponding mask pixel comprises a third predetermined density.
Claim 8
Dependent Claim
18 words
The method as recited in claim 6 wherein said third predetermined density ranges from about 1 to 254.
Claim 9
Dependent Claim
36 words
The method as recited in claim 6 wherein said method further comprises the step of: loading data from said merged image data into said processed image data file for any data corresponding to said transition data.
References Cited (Backward Citations)
US2112010A
Cited
US2160951A
Cited
US2164209A
Cited
US3280252A
Cited
US2441651A
Cited
USRE23914E
Cited
US2925464A
Cited
US3784739A
Cited
US3612753A
Cited
US3770888A
Cited
US3769455A
Cited
US4052739A
Cited
US3918348A
Cited
US3956583A
Cited
US4007362A
Cited
US4126821A
Cited
US4079235A
Cited
US4174527A
Cited
US4259697A
Cited
US4245260A
Cited
US4347785A
Cited
US4451856A
Cited
US4357633A
Cited
US4500929A
Cited
US4450486A
Cited
US4342052A
Cited
US4422101A
Cited
US4484232A
Cited
US4603391A
Cited
US4678976A
Cited
US4688101A
Cited
US4683500A
Cited
US4729037A
Cited
US4944593A
Cited
US4972323A
Cited
US5229861A
Cited
US5029011A
Cited
US5293426A
Cited
US5196942A
Cited
US5329215A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-11-24 | 2001-05-26 | 2001-11-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-11-24 | 2005-05-26 | 2005-11-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-11-24 | 2009-05-26 | 2009-11-25 | $7700.00 | Window Closed / Lapsed |