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

Clustered halftone dot design process

Assignee: Xerox Corp
•
Filing: 1996-11-14
•
Granted: 1998-07-28
•
Expires: 2016-11-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An idealized clustered screen is characterized spot clustering which is optimized so that clusters are about the same size and shape as they grow and are approximately equally distanced though an image. Pixels are swapped within the screen to vary its appearance. An optimization process iteratively checks a quality metric based on the optimum conditions, as pixels are swapped until an optimum screen appearance is obtained.

Inventors

  • 👤 Shen-ge Wang

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 19:53
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/405; H04N1/4055

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 208 words
A printing system suitable for forming marks on a substrate at one of c possible levels of colorant, and receiving image signals represented at d possible levels, where d>c, and having a halftone processor to reduce the number of levels at which the image is represented from d levels to c levels in order to replicate gray level printing, including: a memory, storing a set of halftone threshold level signals, each threshold signal corresponding to a unique location in a halftone cell; a comparator, receiving said image signal and one of the halftone threshold signals from the memory, and producing an output signal at one of c possible levels, varying according to the comparison of said halftone threshold signal to said image signal to cause marking at a selected location on a substrate; said set of threshold level signals together forming a screen matrix arranged for use with respect to the image to generate multiple clusters of printed spots within a single repetition of the screen and generated by a dot clustering optimization process which optimizes the screen by approximating a condition where: A. At any level of the input, all clusters have the same shape and the same size; and B. All adjacent clusters are equal-distance separated.
Claim 2
Dependent Claim 208 words
A printing system suitable for forming marks on a substrate at one of c possible levels of colorant, and receiving image signals represented at d possible levels, where d>c, and having a halftone processor to reduce the number of levels at which the image is represented from d levels to c levels in order to replicate gray level printing, including: a memory, storing a set of halftone threshold level signals, each threshold signal corresponding to a unique location in a halftone cell; a comparator, receiving said image signal and one of the halftone threshold signals from the memory, and producing an output signal at one of c possible levels, varying according to the comparison of said halftone threshold signal to said image signal to cause marking at a selected location on a substrate; said set of threshold level signals together forming a screen matrix arranged for use with respect to the image to generate multiple clusters of printed spots within a single repetition of the screen and generated by a dot clustering optimization process which optimizes the screen by approximating a condition where: A. At any level of the input, all clusters have the same shape and the same size; and B. All adjacent clusters are equal-distance separated.
Claim 3
Independent Claim 152 words
A method of designing a halftone cell, for converting an image received at d levels, for reproduction at two levels, said cell having elements each corresponding to a pixel in a discrete area of an image the method including the steps: a) choosing a desired cluster pattern for said halftone cell; b) assigning threshold values to the halftone cell; c) generating halftone screens; d) calculating a quality metric, by measuring divergence from the conditions: 1. At any level of the input, all clusters have the same shape and the same size; and 2. All adjacent clusters are equal-distance separated; e) randomly choosing a limited set of threshold values and swapping the threshold values; f) recalculating the quality metric and determining whether the quality metric has improved; g) determining whether to keep the swap or returning the screen to its initial state based on the determination of whether the quality metric has improved.
Claim 4
Independent Claim 152 words
A method of designing a halftone cell, for converting an image received at d levels, for reproduction at two levels, said cell having elements each corresponding to a pixel in a discrete area of an image the method including the steps: a) choosing a desired cluster pattern for said halftone cell; b) assigning threshold values to the halftone cell; c) generating halftone screens; d) calculating a quality metric, by measuring divergence from the conditions: 1. At any level of the input, all clusters have the same shape and the same size; and 2. All adjacent clusters are equal-distance separated; e) randomly choosing a limited set of threshold values and swapping the threshold values; f) recalculating the quality metric and determining whether the quality metric has improved; g) determining whether to keep the swap or returning the screen to its initial state based on the determination of whether the quality metric has improved.
Claim 5
Dependent Claim 21 words
The method as defined in claim 2, wherein the selected cluster pattern provides at least four clusters in the halftone cell.
Claim 6
Dependent Claim 19 words
The method as defined in claim 2, wherein the initial assignment of the set of threshold signals is random.
Claim 7
Dependent Claim 106 words
The method as defined in claim 2 wherein the quality metrics are given by: a centroid of each cluster where: x.sub.0 =Σx/n,y.sub.0 =Σy/n, where Σ is a summation of a set of coordinates x, y over any black pixels in a specified cluster; a momentum of inertia of each cluster where: m=Σ(x-x.sub.0)2+(y-y.sub.0)2, where Σ is over any black pixels; a calculated distance between two centroids: d.sub.ij =sqrt (x.sub.i0 -x.sub.j0)2+(y.sub.i0 -y.sub.j0)2!; and a sum m and ni·nj/dij over any levels above a mean and all clusters at each level: Q.sub.m =Σ.sub.m, Q.sub.d =Σn.sub.i ·n.sub.j /d.sub.ij, where n is a total number of black pixels in each cluster.
Claim 8
Dependent Claim 19 words
The method as defined in claim 2, wherein at least two thresholds are selected for swapping in any swap.
Claim 9
Dependent Claim 25 words
The method as defined in claim 2, where a process defined in e), f) and g) is repeated iteratively until an iteration metric is reached.
Claim 10
Dependent Claim 17 words
The method as defined in claim 7, where the iteration metric is a predetermined number of swaps.
Claim 11
Dependent Claim 21 words
The method as defined in claim 7, where the iteration metric is a percentage difference from a preselected quality metric value.
Claim 12
Independent Claim 126 words
A method of generating threshold values appropriately positioned in a halftone cell, for converting an image received at d levels, for reproduction at c levels, where c is less than d, said cell having N elements each corresponding to a pixel in a discrete area of an image the method including the steps: selecting a number of clusters for a halftone cell; a determining a threshold values between 1 and N corresponding to each elements; measuring a quality metric for the halftone cell, as a function of uniformity of shape and size of clusters, and distance between clusters; making at least one swap of threshold values between elements; re-measuring the quality metric; reversing the swap of threshold values if the quality metric change is not appropriate.
Claim 13
Independent Claim 126 words
A method of generating threshold values appropriately positioned in a halftone cell, for converting an image received at d levels, for reproduction at c levels, where c is less than d, said cell having N elements each corresponding to a pixel in a discrete area of an image the method including the steps: selecting a number of clusters for a halftone cell; a determining a threshold values between 1 and N corresponding to each elements; measuring a quality metric for the halftone cell, as a function of uniformity of shape and size of clusters, and distance between clusters; making at least one swap of threshold values between elements; re-measuring the quality metric; reversing the swap of threshold values if the quality metric change is not appropriate.
Claim 14
Dependent Claim 33 words
The method as defined in claim 10, wherein the steps of making at least one swap, measuring the quality metric and reversing the swap are repeated iteratively until an iteration metric is met.

References Cited (Backward Citations)

US4149194A Cited
US4485397A Cited
US4876611A Cited
US5014123A Cited
US5341228A Cited
US5442461A Cited
US5394252A Cited
US5673121A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-07-27 2002-01-26 2002-07-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-07-27 2006-01-26 2006-07-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-07-27 2010-01-26 2010-07-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag