CA2217555C - Clustered halftone dot design process - Google Patents
Clustered halftone dot design process Download PDFInfo
- Publication number
- CA2217555C CA2217555C CA002217555A CA2217555A CA2217555C CA 2217555 C CA2217555 C CA 2217555C CA 002217555 A CA002217555 A CA 002217555A CA 2217555 A CA2217555 A CA 2217555A CA 2217555 C CA2217555 C CA 2217555C
- Authority
- CA
- Canada
- Prior art keywords
- clusters
- levels
- halftone
- image
- screen
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/40—Picture signal circuits
- H04N1/405—Halftoning, i.e. converting the picture signal of a continuous-tone original into a corresponding signal showing only two levels
- H04N1/4055—Halftoning, i.e. converting the picture signal of a continuous-tone original into a corresponding signal showing only two levels producing a clustered dots or a size modulated halftone pattern
Abstract
ABSTRACT OF THE DISCLOSURE
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.
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.
Description
Patent Application Attorney Docket No. D/96512 CLUSTERED HALFTONE DOT DESIGN PROCESS
The present invention is directed to a method and apparatus for designing halftone screens suitable for quantizing gray images represented at a number of levels higher than can be reproduced by an output device.
BACKGROUND OF THE INVENTION
s Printers typically provide a limited number of output possibilities, and are commonly binary, i.e., they produce either a spot or no spot at a given location (although multilevel printers beyond binary are known). Thus, given an image or a separation in a color image having perhaps 256 possible density levels, a set of binary printer signals must be produced representing io the contone effect. In such arrangements, over a given area in the separation having a number of contone pixels therein, each pixel value in an array of contone pixels within the area is compared to one of a set of preselected thresholds as taught, for example, in US-A 4,149,194 to Holladay. The effect of such an arrangement is that, for an area where the image is a contone is (continuous tone image), some of the thresholds will be exceeded, i.e. the image value at that specific location is larger than the value of the threshold for that same location, while others are not. In the binary case, the pixels or . cell elements for which the thresholds are exceeded might be printed as black or some color, while the remaining elements are allowed to remain white or 2o uncolored, dependent on the actual physical quantity described by the data.
The described halftoning or dithering method produces an output pattern that is periodic or quasi-periodic in the spatial coordinates.
Dithering creates problems in color document reproduction where the repeating pattern of a screen through the image, when superposed over similar repeating patterns in multiple separations, can cause moire or other artifacts, particularly in printing systems with less than ideal registration s between separations.
The binary halftone output is the result of the point-to-point comparison. For a dithering screen with a fixed number of elements, N, there are N possible different threshold values, therefore, the halftone image can simulate N+1 different gray levels. In the following discussion we use 1 to N
to to represent the N threshold values and use the following dithering rule:
If the input is less than the threshold, the output is zero, or black; otherwise, the output is one, or white.
The screened output forms a repeating cluster of spots, or a dot.
i5 Since the cluster size defines the line frequency of created halftone images, screens with a single cluster usually are limited in their size and do not provide enough simulated gray levels. One solution is using larger screens with multiple clusters. There are many dual dots and quad dots well designed and widely used. However, the design of halftone screens with a large 2o number of clusters is very difficult by current techniques, which require frequent visual examination of trials and the experience of experts.
One of the advantages of stochastic, or non-periodic screening over periodic screening is the suppression of moire. In this respect, note also, US-A 5,394,252 to Holladay et al.
2s In US-A 5,341,228 to Parker et al., a halftoning system using a stochastic process known as a blue noise mask is described. Briefly, the procedure can be described as follows: 1 ) Starting at one gray level with a chosen dot pattern, or "seed", the process iteratively uses a Fast Fourier Transform (FFT) techniques with a "blue noise" filter to redistribute all spots in dot pattern and eliminate large visual "clumps"; 2) Next, the dot pattern is processed at the next gray level by increasing (or decreasing) certain number of black spots on the previously determined dot pattern. Existing black (or white) spots are not moved. The same filtering technique is used to distribute newly added (or subtracted) dots; 3) Step 2 is then repeated for all gray levels sequentially. At each step, the width of the blue-noise filter varies by an amount corresponding to the current gray level; 4). The summation of dot patterns for each gray levels is the blue noise mask generated. The mask is then used to generate a halftone screen. The result of described sequential io design procedure strongly depends on the choice of the seed pattern. If the output is not a satisfactory one, the design procedure has to start over again by choosing different seed or changing thQ blue noise filter. Since the threshold value of each pixel of the dithering screen is fixed at the gray level when the corresponding dot is added (or eliminated), the freedom to locate is undetermined pixels is getting smaller and smaller while the design sequence is approaching the end. These constraints limit further improvement of the image quality generated by blue noise masks.
US-A 4,485,397 to Scheuter et al. describes a method for generating a non-periodic halftone distribution by determining areas of 2o constant or nearly constant input density and by distributing a precalculated number of print dots inside each area based on a random or pseudo random number and some spatial constraints.
US-A 4,876,611 to Fischer et al. describes another stochastic screening algorithm in which the print/no-print decision is based on a 25 recursive subdivision of the print field maintaining average density over the larger print field.
A non-periodic halftoning scheme based on a pulse-density modulation is taught in "Binarization using a two-dimensional pulse-density modulation", by R. Eschbach and R. Hauck, Journal of the Optical Society of America A, 4, 1873-1878 ( 1987); and "Pulse-density modulation on rastered media: combining pulse-density modulation and error diffusion", by R.
Eschbach, Journal of the Optical Society of America A, 7, 708-716 (1990). In pulse-density modulation a mathematical model is used that guarantees the local density of print pulses as a function of the input image data.
In United States Patent Application Serial No. 08/663,419 by Shen-ge Wang, an idealized stochastic screen is characterized by having all of the predominant color dots (black or white) uniformly distributed. A process is described to approach this optimization by iteratively selecting pairs of threshold levels in the screen matrix, and measuring the approach to the idealized stochastic screen. The threshold values are then swapped in position to determine whether the swap improves the measurement or not. If it does, the swap is maintained. The process is iterated until the desired result is obtained.
SUMMARY OF THE INVENTION
The present invention is directed to a method of designing a halftone screen which is based on a function designed to approach an idealized clustered screen.
In accordance with one aspect of the invention, there is provide a printing system suitable for forming marks on a substrate at one of c possible levels of colorant, and receiving imacae 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 s 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 io 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:
is 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.
In accordance with yet another aspect of the invention, there is provided a method of designing a halftone cell, for converting an image 2o 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 2s 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.
3o 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.
According to another aspect of the present invention, there is provided 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;
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.
Consider a halftone screen with N elements and a constant input with the gray level equal to N/2, or the mean level of the gray-scale input. The binary output pattern should have 50% area in black and 50% in white. All elements in the halftone screen with thresholds greater than N/2 will generate black output pixels and those with thresholds less or equal to N/2 will generate white ones.
Clustered-dot halftone screens gather the output pixels in clusters, black or white. If all black pixels at the mean level are grouped in distinguishable clusters, at any levels above the mean black pixels will be shown only inside the area specified by these clusters. This is also true for white pixels at all levels less than the mean. For example, a 45° rotation screen will generate a checker-board pattern at the mean level. Above mean, white clusters are merged into the white background and black clusters are shrunk in their sizes. The visual appearance of the output above mean depends only on the distribution of the black clusters.
On the other hand, below the mean level, the background is black and the visual appearance depends on the distribution of white clusters. Hence, the distributions of all "visible" black clusters are totally controlled by pixels in black squares of the checker-board, while "visible" white clusters depend only on the distribution of pixels in white squares. Once the checker-board or another black-white pattern is given at the mean, we can divide the screen design into two steps. One process is for white clusters, or the distribution of all thresholds less or equal to the mean, and another is for black clusters, or the distribution of all thresholds greater than the mean. Although in the following discussion we will only describe the design for black clusters, with -6a-little modification the principle and the process can be applied to white clusters as well.
In United States Patent Application Serial No. 08/663,419, we described an optimization technique for stochastic screen design. Briefly, we s swap the threshold values of two randomly chosen pixels in the halftone screen. Evaluation of a merit function is conducted before and after swapping. If the swapping shows improvement with our criterion, we keep the new distribution, otherwise, we restore the values before swapping. This swapping process is repetitively conducted until an interruption is called or io the merit function reaches the goal. We will use a similar optimization technique with a completely different merit function to design the clustered-dot screens.
These and other aspects of the invention will become apparent from the following descriptions used to illustrate a preferred embodiment of is the invention, read in conjunction with the accompanying drawings in which:
Figures 1 and 2 represent a halftoning system in which the present invention finds use; and Figure 3 a flow chart of process for finding the quality measurement;
2o Referring now to the drawings where the showings are for the purpose of describing an embodiment of the invention and not for limiting same, a basic image processing system is shown in Figure. 1. In the present case, gray image data may be characterized as image signals, each pixel of which is defined at a single level or optical density in a set of 'c' optical 2s density levels, the number of members in the set of levels being larger than desired. Each pixel will be processed in the manner described hereinbelow, to redefine each pixel in terms of a new, smaller set of 'd' levels. In this process, 'c' and 'd' are integer values representing pixel depth, or a number of signal levels at which the pixel may appear. One common case of this method includes the conversion of data from a relatively large set of gray levels to one of two legal or allowed binary levels for printing in a binary printer.
s As used herein, the term "dot pattern" refers to a product or an image resulting from a screening process. A "screen cell", as used herein, refers to the set of pixels which together will form the dot pattern, while the term "screen matrix° will be used to describe the set of values which together make up the set of threshold_to be applied. A "pixel° refers to an image signal io associated with a particular position in an image, having a density between white and black. Accordingly, pixels are defined by intensity and position. A
dot pattern is made up of a plurality of pixels. These terms are used for simplification and it should be understood that the appropriate sizing operations have to be performed for images where the input resolution in ~s terms of scan pixels is different from the output resolution in terms of print pixels.
Dots are said to be clustered when spots or pixels forming the dots turn ON in a relationship that tends to group the ON pixels together, in distinction from non-clustered dots which tend to turn ON pixels for 2o successive gray levels as far apart in the dot as possible. Dots may have a plurality of clusters formed throughout a dot, in order to simulate the appearance of a high frequency dot with a dot that has a large number of gray levels.
In a typical color system, color documents are represented by 2s multiple sets of image signals, each set (or separation) represented by an independent channel, which is usually processed more or less independently.
A "color image° as used herein is therefore a document including at least two separations, such as in the Xerox 4850 Highlight Color Printer and commonly _g_ three or four separations, such as in the Xerox 4700 Color Laser Printer, Xerox 5775 Digital Color Copier, or the Xerox 4900 printer, or sometimes more than four separations (a process sometimes called hi-fi color). One possible digital copier (a scanner/printer combination) is described for s example, in US-A 5,014,123 to Imoto, incorporated herein by reference. Each separation provides a set of image signals which will drive a printer to produce one color of the image. In the case of multicolor printers, the separations superposed together form the color image. In this context, we will describe pixels as discrete image signals, which represent optical density of io the document image in a given small area thereof. The term "pixel" will be used to refer to such an image signal in each separation, as distinguished from "color pixel", which is the sum of the color densities of corresponding pixels in each separation. "Gray", as used herein does not refer to a color unless specifically identified as such. Rather, the term refers to image signals ~s which vary between maximum and minimum, irrespective of the color of the separation in which the signals are used.
With reference now to Figure 1, which shows a general system requirement representing the goal of the invention, an electronic representation of an original document (hereinafter, an image) from image 2o input terminal such as scanner 10 derives electronic digital data in some manner, in a format related to the physical characteristics of the device, and commonly with pixels defined at m bits per pixel. Common color scanners, such as, for example, Xerox 5775 Digital Color Copiers, or the Pixelcraft 7650C, produce 8 bitlpixel data, at resolutions acceptable for many purposes.
2s Since this is a color document, the image is defined with two or more separation bitmaps, usually with identical resolution and pixel depth. The electronic image signals are directed through an image processing unit (IPtJ) 16 to be processed so that an image suitable for reproduction on image output terminal or printer 20 is obtained. Image processing unit 16 commonly includes a halftone processor 18 which converts m bit digital image signals to n bit digital image signals, suitable for driving a particular printer, where m and n are integer values. It also well within the contemplation of the present s invention, to derive image's electronically. In such cases, the images may be represented by a page description language file, describing the appearance of the page. In such a case, the IPU might include processing element for decomposition of the page, and color conversions elements for providing appropriate signals for driving a printer.
io Figure 2 shows the halftone processor 18 operational characteristics. In this example, there is illustrated a color processing system, using four separations, C(x, y), M(x,y), Y(x, y), K(x, y), obtained and each processed independently for halftoning purposes to reduce an m-bit input to an n-bit output. It will be appreciated that the invention is also applicable to is the "single separation" or black and white reproduction situation as well.
Accordingly, we show a source of screen matrix information, screen matrix memory 106, which provides one input to each comparator 100. 102, 104, 10fi and 108 for each separation, where the other comparator is the m bit separation bitmap. The output is m bit output, which can be directed to a 2o printer. This illustration is highly simplified, in that distinct screen matrices may be supplied to each comparator. As will become apparent in the ensuing discussion, the invention applies to black and white, as well as color images.
Now, the principle of the present invention will be discussed.
Since we only need to consider the "visible" clusters, we evaluate the black zs clusters above the mean for designing the distribution of the upper-half threshold values. Here, we propose our criterion of "visual pleasure" for halftone images created by cluster screens:
A. At any level of the input, all "visible" clusters should have the same shape and the same size;
-m B. All adjacent "visible" clusters should be equal-distance separated.
Obviously, neither requirement can be realized by halftone screens with finite numbers of elements. However, we can use these requirements to define a merit function, which measures the departure of the real output from the idealized one. Mathematically, we use the following calculations to implement the criterion proposed above:
io 1. Find the centroid of each cluster:
. xo = Exl n, yo = Ey/ n, where E is the summation of the coordinates x, y over all black pixels in the specified cluster;
i5 2. Calculate the momentum of inertia of each cluster:
m = ~(x-~)2 + (Y-Yo)2 , where E is over all black pixels;
The present invention is directed to a method and apparatus for designing halftone screens suitable for quantizing gray images represented at a number of levels higher than can be reproduced by an output device.
BACKGROUND OF THE INVENTION
s Printers typically provide a limited number of output possibilities, and are commonly binary, i.e., they produce either a spot or no spot at a given location (although multilevel printers beyond binary are known). Thus, given an image or a separation in a color image having perhaps 256 possible density levels, a set of binary printer signals must be produced representing io the contone effect. In such arrangements, over a given area in the separation having a number of contone pixels therein, each pixel value in an array of contone pixels within the area is compared to one of a set of preselected thresholds as taught, for example, in US-A 4,149,194 to Holladay. The effect of such an arrangement is that, for an area where the image is a contone is (continuous tone image), some of the thresholds will be exceeded, i.e. the image value at that specific location is larger than the value of the threshold for that same location, while others are not. In the binary case, the pixels or . cell elements for which the thresholds are exceeded might be printed as black or some color, while the remaining elements are allowed to remain white or 2o uncolored, dependent on the actual physical quantity described by the data.
The described halftoning or dithering method produces an output pattern that is periodic or quasi-periodic in the spatial coordinates.
Dithering creates problems in color document reproduction where the repeating pattern of a screen through the image, when superposed over similar repeating patterns in multiple separations, can cause moire or other artifacts, particularly in printing systems with less than ideal registration s between separations.
The binary halftone output is the result of the point-to-point comparison. For a dithering screen with a fixed number of elements, N, there are N possible different threshold values, therefore, the halftone image can simulate N+1 different gray levels. In the following discussion we use 1 to N
to to represent the N threshold values and use the following dithering rule:
If the input is less than the threshold, the output is zero, or black; otherwise, the output is one, or white.
The screened output forms a repeating cluster of spots, or a dot.
i5 Since the cluster size defines the line frequency of created halftone images, screens with a single cluster usually are limited in their size and do not provide enough simulated gray levels. One solution is using larger screens with multiple clusters. There are many dual dots and quad dots well designed and widely used. However, the design of halftone screens with a large 2o number of clusters is very difficult by current techniques, which require frequent visual examination of trials and the experience of experts.
One of the advantages of stochastic, or non-periodic screening over periodic screening is the suppression of moire. In this respect, note also, US-A 5,394,252 to Holladay et al.
2s In US-A 5,341,228 to Parker et al., a halftoning system using a stochastic process known as a blue noise mask is described. Briefly, the procedure can be described as follows: 1 ) Starting at one gray level with a chosen dot pattern, or "seed", the process iteratively uses a Fast Fourier Transform (FFT) techniques with a "blue noise" filter to redistribute all spots in dot pattern and eliminate large visual "clumps"; 2) Next, the dot pattern is processed at the next gray level by increasing (or decreasing) certain number of black spots on the previously determined dot pattern. Existing black (or white) spots are not moved. The same filtering technique is used to distribute newly added (or subtracted) dots; 3) Step 2 is then repeated for all gray levels sequentially. At each step, the width of the blue-noise filter varies by an amount corresponding to the current gray level; 4). The summation of dot patterns for each gray levels is the blue noise mask generated. The mask is then used to generate a halftone screen. The result of described sequential io design procedure strongly depends on the choice of the seed pattern. If the output is not a satisfactory one, the design procedure has to start over again by choosing different seed or changing thQ blue noise filter. Since the threshold value of each pixel of the dithering screen is fixed at the gray level when the corresponding dot is added (or eliminated), the freedom to locate is undetermined pixels is getting smaller and smaller while the design sequence is approaching the end. These constraints limit further improvement of the image quality generated by blue noise masks.
US-A 4,485,397 to Scheuter et al. describes a method for generating a non-periodic halftone distribution by determining areas of 2o constant or nearly constant input density and by distributing a precalculated number of print dots inside each area based on a random or pseudo random number and some spatial constraints.
US-A 4,876,611 to Fischer et al. describes another stochastic screening algorithm in which the print/no-print decision is based on a 25 recursive subdivision of the print field maintaining average density over the larger print field.
A non-periodic halftoning scheme based on a pulse-density modulation is taught in "Binarization using a two-dimensional pulse-density modulation", by R. Eschbach and R. Hauck, Journal of the Optical Society of America A, 4, 1873-1878 ( 1987); and "Pulse-density modulation on rastered media: combining pulse-density modulation and error diffusion", by R.
Eschbach, Journal of the Optical Society of America A, 7, 708-716 (1990). In pulse-density modulation a mathematical model is used that guarantees the local density of print pulses as a function of the input image data.
In United States Patent Application Serial No. 08/663,419 by Shen-ge Wang, an idealized stochastic screen is characterized by having all of the predominant color dots (black or white) uniformly distributed. A process is described to approach this optimization by iteratively selecting pairs of threshold levels in the screen matrix, and measuring the approach to the idealized stochastic screen. The threshold values are then swapped in position to determine whether the swap improves the measurement or not. If it does, the swap is maintained. The process is iterated until the desired result is obtained.
SUMMARY OF THE INVENTION
The present invention is directed to a method of designing a halftone screen which is based on a function designed to approach an idealized clustered screen.
In accordance with one aspect of the invention, there is provide a printing system suitable for forming marks on a substrate at one of c possible levels of colorant, and receiving imacae 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 s 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 io 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:
is 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.
In accordance with yet another aspect of the invention, there is provided a method of designing a halftone cell, for converting an image 2o 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 2s 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.
3o 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.
According to another aspect of the present invention, there is provided 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;
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.
Consider a halftone screen with N elements and a constant input with the gray level equal to N/2, or the mean level of the gray-scale input. The binary output pattern should have 50% area in black and 50% in white. All elements in the halftone screen with thresholds greater than N/2 will generate black output pixels and those with thresholds less or equal to N/2 will generate white ones.
Clustered-dot halftone screens gather the output pixels in clusters, black or white. If all black pixels at the mean level are grouped in distinguishable clusters, at any levels above the mean black pixels will be shown only inside the area specified by these clusters. This is also true for white pixels at all levels less than the mean. For example, a 45° rotation screen will generate a checker-board pattern at the mean level. Above mean, white clusters are merged into the white background and black clusters are shrunk in their sizes. The visual appearance of the output above mean depends only on the distribution of the black clusters.
On the other hand, below the mean level, the background is black and the visual appearance depends on the distribution of white clusters. Hence, the distributions of all "visible" black clusters are totally controlled by pixels in black squares of the checker-board, while "visible" white clusters depend only on the distribution of pixels in white squares. Once the checker-board or another black-white pattern is given at the mean, we can divide the screen design into two steps. One process is for white clusters, or the distribution of all thresholds less or equal to the mean, and another is for black clusters, or the distribution of all thresholds greater than the mean. Although in the following discussion we will only describe the design for black clusters, with -6a-little modification the principle and the process can be applied to white clusters as well.
In United States Patent Application Serial No. 08/663,419, we described an optimization technique for stochastic screen design. Briefly, we s swap the threshold values of two randomly chosen pixels in the halftone screen. Evaluation of a merit function is conducted before and after swapping. If the swapping shows improvement with our criterion, we keep the new distribution, otherwise, we restore the values before swapping. This swapping process is repetitively conducted until an interruption is called or io the merit function reaches the goal. We will use a similar optimization technique with a completely different merit function to design the clustered-dot screens.
These and other aspects of the invention will become apparent from the following descriptions used to illustrate a preferred embodiment of is the invention, read in conjunction with the accompanying drawings in which:
Figures 1 and 2 represent a halftoning system in which the present invention finds use; and Figure 3 a flow chart of process for finding the quality measurement;
2o Referring now to the drawings where the showings are for the purpose of describing an embodiment of the invention and not for limiting same, a basic image processing system is shown in Figure. 1. In the present case, gray image data may be characterized as image signals, each pixel of which is defined at a single level or optical density in a set of 'c' optical 2s density levels, the number of members in the set of levels being larger than desired. Each pixel will be processed in the manner described hereinbelow, to redefine each pixel in terms of a new, smaller set of 'd' levels. In this process, 'c' and 'd' are integer values representing pixel depth, or a number of signal levels at which the pixel may appear. One common case of this method includes the conversion of data from a relatively large set of gray levels to one of two legal or allowed binary levels for printing in a binary printer.
s As used herein, the term "dot pattern" refers to a product or an image resulting from a screening process. A "screen cell", as used herein, refers to the set of pixels which together will form the dot pattern, while the term "screen matrix° will be used to describe the set of values which together make up the set of threshold_to be applied. A "pixel° refers to an image signal io associated with a particular position in an image, having a density between white and black. Accordingly, pixels are defined by intensity and position. A
dot pattern is made up of a plurality of pixels. These terms are used for simplification and it should be understood that the appropriate sizing operations have to be performed for images where the input resolution in ~s terms of scan pixels is different from the output resolution in terms of print pixels.
Dots are said to be clustered when spots or pixels forming the dots turn ON in a relationship that tends to group the ON pixels together, in distinction from non-clustered dots which tend to turn ON pixels for 2o successive gray levels as far apart in the dot as possible. Dots may have a plurality of clusters formed throughout a dot, in order to simulate the appearance of a high frequency dot with a dot that has a large number of gray levels.
In a typical color system, color documents are represented by 2s multiple sets of image signals, each set (or separation) represented by an independent channel, which is usually processed more or less independently.
A "color image° as used herein is therefore a document including at least two separations, such as in the Xerox 4850 Highlight Color Printer and commonly _g_ three or four separations, such as in the Xerox 4700 Color Laser Printer, Xerox 5775 Digital Color Copier, or the Xerox 4900 printer, or sometimes more than four separations (a process sometimes called hi-fi color). One possible digital copier (a scanner/printer combination) is described for s example, in US-A 5,014,123 to Imoto, incorporated herein by reference. Each separation provides a set of image signals which will drive a printer to produce one color of the image. In the case of multicolor printers, the separations superposed together form the color image. In this context, we will describe pixels as discrete image signals, which represent optical density of io the document image in a given small area thereof. The term "pixel" will be used to refer to such an image signal in each separation, as distinguished from "color pixel", which is the sum of the color densities of corresponding pixels in each separation. "Gray", as used herein does not refer to a color unless specifically identified as such. Rather, the term refers to image signals ~s which vary between maximum and minimum, irrespective of the color of the separation in which the signals are used.
With reference now to Figure 1, which shows a general system requirement representing the goal of the invention, an electronic representation of an original document (hereinafter, an image) from image 2o input terminal such as scanner 10 derives electronic digital data in some manner, in a format related to the physical characteristics of the device, and commonly with pixels defined at m bits per pixel. Common color scanners, such as, for example, Xerox 5775 Digital Color Copiers, or the Pixelcraft 7650C, produce 8 bitlpixel data, at resolutions acceptable for many purposes.
2s Since this is a color document, the image is defined with two or more separation bitmaps, usually with identical resolution and pixel depth. The electronic image signals are directed through an image processing unit (IPtJ) 16 to be processed so that an image suitable for reproduction on image output terminal or printer 20 is obtained. Image processing unit 16 commonly includes a halftone processor 18 which converts m bit digital image signals to n bit digital image signals, suitable for driving a particular printer, where m and n are integer values. It also well within the contemplation of the present s invention, to derive image's electronically. In such cases, the images may be represented by a page description language file, describing the appearance of the page. In such a case, the IPU might include processing element for decomposition of the page, and color conversions elements for providing appropriate signals for driving a printer.
io Figure 2 shows the halftone processor 18 operational characteristics. In this example, there is illustrated a color processing system, using four separations, C(x, y), M(x,y), Y(x, y), K(x, y), obtained and each processed independently for halftoning purposes to reduce an m-bit input to an n-bit output. It will be appreciated that the invention is also applicable to is the "single separation" or black and white reproduction situation as well.
Accordingly, we show a source of screen matrix information, screen matrix memory 106, which provides one input to each comparator 100. 102, 104, 10fi and 108 for each separation, where the other comparator is the m bit separation bitmap. The output is m bit output, which can be directed to a 2o printer. This illustration is highly simplified, in that distinct screen matrices may be supplied to each comparator. As will become apparent in the ensuing discussion, the invention applies to black and white, as well as color images.
Now, the principle of the present invention will be discussed.
Since we only need to consider the "visible" clusters, we evaluate the black zs clusters above the mean for designing the distribution of the upper-half threshold values. Here, we propose our criterion of "visual pleasure" for halftone images created by cluster screens:
A. At any level of the input, all "visible" clusters should have the same shape and the same size;
-m B. All adjacent "visible" clusters should be equal-distance separated.
Obviously, neither requirement can be realized by halftone screens with finite numbers of elements. However, we can use these requirements to define a merit function, which measures the departure of the real output from the idealized one. Mathematically, we use the following calculations to implement the criterion proposed above:
io 1. Find the centroid of each cluster:
. xo = Exl n, yo = Ey/ n, where E is the summation of the coordinates x, y over all black pixels in the specified cluster;
i5 2. Calculate the momentum of inertia of each cluster:
m = ~(x-~)2 + (Y-Yo)2 , where E is over all black pixels;
3. For each pair of clusters, calculate the distance 2o between the two centroids:
d.; = sqrtl(~-~)2 + (Y~o Y~o)2J;
d.; = sqrtl(~-~)2 + (Y~o Y~o)2J;
4. Sum m and ni~nj/dij over all levels above the mean and all clusters at each level:
25 Qm = ~ m. QG = En;~n;/d;;, where n is the total number of black pixels in each cluster.
Now, we can translate the proposed criterion in mathematics:
3o A. Minimizing the penalty function Qm, which requires all black pixels grouped in similar clusters;
B. Minimizing the penalty function Qd, which requires all clusters separated in maximal distances.
Accordingly, the design procedure for the upper-half threshold levels in a clustered-dot halftone screen is described as follows, as illustrated in Figure 3:
1 ) At step 100, a black-white cluster pattern, e.g., a checker-s board pattern, is chosen to divide the entire screen into two equal-area regimes: one is for all threshold values greater than the mean, and another is for the rest. This pattern defines the basic structure of the halftone screen in line frequency and its direction. Since the line frequency dominates the appearance of all halftone outputs created by the cluster screen, it is usually io specified prior to the design.
2) At step 102, threshold values, from 1 to N/2, are assigned to one regime defined by step 100, while other values, from NI2+1 to N, are filled into another. This assignment can be a randomly filling, but most likely is copying from previous works, i.e., either from an existing clustered-dot screen i5 or from the result of previous runs of the described automatic design.
3) At step 104, halftone patterns with input levels from N/2+1 to N are generated by the screen assigned. Since the halftone screen is applied periodically, the shortest distance between two clusters is not necessary within one screen. The size of halftone patterns should be large enough to 2o contain at least four screens in a two-by-two arrangement, therefore, the shortest distance can be chosen from all possible combinations.
4) At step 10fi, the quality metric is calculated. In our example, we calculate and store the centroid and the second-order momentum about the centroid for each cluster at each input level.
2s 5) At step 108 pair of pixels is randomly chosen from the regime with upper-half threshold values.
6) At step 110, the thresholds are swapped for two chosen pixels and we calculate the centroid and momentum with swapped values.
7) At step 112, we compare the quality metrics, or find the difference of the penalty functions Qm and Qd defined above caused by the swapping. In our experiments, we take the weighted sum of Qm and Qd as the total penalty and we have found that the optimization result is not sensitive to s the choice of weights. We chose such weights that the changes of penalty functions Qm and Qd from each iteration is approximately equal at beginning of the optimization.
8) At step 114, f swapping results in tower penalty, keep the change at step 116. Otherwise, restore the previous values by resetting the io thresholds at step 118.
9) Repeat the iteration from steps 108-118 until the desired convergence is reached, by checking an iteration metric 120. _If the requirement of the iteration metric is met, we store the values obtained and complete the process.
i5 It is possible that, depending on the obtained value of the merit function, in some percentage of iterations, the changed values are kept even though they do not improve the merit function, a process known as simulated annealing.
Turning now to Figure 3 and an implementation of the invention, 2o the invention is readily implemented in a general purpose computer, programmed to generate the screen matrix values. Once obtained, the screen matrix values may be readily entered and stored into a halftoning device memory, such as that shown in Figure 2.
Typically speaking, threshold screens will be calculated and 2s stored for later distribution as screen matrices of threshold values. Upon later distribution, these matrices can be downloaded in an appropriate manner into device memories for use as required.
The resulting threshold screens may be used for the generation of gray in monochromatic images. They may also be used for the generation of color separations in polychromatic or other multiple separation images. In polychromatic or color images, these clustered screens may be used s exclusively, or in combination with other stochastic or non-stochastic screens, as taught, for example, by US-A 5,394,252 to Holladay et al.
The disclosed method may be readily implemented in software using object oriented software development environments that provide portable source code that can be used on a variety of computer or workstation io hardware platforms. Alternatively, the disclosed image processing system may be implemented partially or fully in hardware using standard logic circuits or specifically on a single chip using VLSI design. Whether software or hardware is used to implement the system varies depending on the speed and efficiency requirements of the system and also the particular function and the is particular software or hardware systems and the particular microprocessor or microcomputer systems being utilized. The image processing system, however, can be readily developed by those skilled in the applicable arts without undue experimentation from the functional description provided herein together with a general knowledge of the computer arts.
2o While this invention has been described in conjunction with a preferred embodiment thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art.
Accordingly, it is intended to embrace all such alternatives, modifications and variations as fall within the spirit and broad scope of the appended claims.
-ia-
25 Qm = ~ m. QG = En;~n;/d;;, where n is the total number of black pixels in each cluster.
Now, we can translate the proposed criterion in mathematics:
3o A. Minimizing the penalty function Qm, which requires all black pixels grouped in similar clusters;
B. Minimizing the penalty function Qd, which requires all clusters separated in maximal distances.
Accordingly, the design procedure for the upper-half threshold levels in a clustered-dot halftone screen is described as follows, as illustrated in Figure 3:
1 ) At step 100, a black-white cluster pattern, e.g., a checker-s board pattern, is chosen to divide the entire screen into two equal-area regimes: one is for all threshold values greater than the mean, and another is for the rest. This pattern defines the basic structure of the halftone screen in line frequency and its direction. Since the line frequency dominates the appearance of all halftone outputs created by the cluster screen, it is usually io specified prior to the design.
2) At step 102, threshold values, from 1 to N/2, are assigned to one regime defined by step 100, while other values, from NI2+1 to N, are filled into another. This assignment can be a randomly filling, but most likely is copying from previous works, i.e., either from an existing clustered-dot screen i5 or from the result of previous runs of the described automatic design.
3) At step 104, halftone patterns with input levels from N/2+1 to N are generated by the screen assigned. Since the halftone screen is applied periodically, the shortest distance between two clusters is not necessary within one screen. The size of halftone patterns should be large enough to 2o contain at least four screens in a two-by-two arrangement, therefore, the shortest distance can be chosen from all possible combinations.
4) At step 10fi, the quality metric is calculated. In our example, we calculate and store the centroid and the second-order momentum about the centroid for each cluster at each input level.
2s 5) At step 108 pair of pixels is randomly chosen from the regime with upper-half threshold values.
6) At step 110, the thresholds are swapped for two chosen pixels and we calculate the centroid and momentum with swapped values.
7) At step 112, we compare the quality metrics, or find the difference of the penalty functions Qm and Qd defined above caused by the swapping. In our experiments, we take the weighted sum of Qm and Qd as the total penalty and we have found that the optimization result is not sensitive to s the choice of weights. We chose such weights that the changes of penalty functions Qm and Qd from each iteration is approximately equal at beginning of the optimization.
8) At step 114, f swapping results in tower penalty, keep the change at step 116. Otherwise, restore the previous values by resetting the io thresholds at step 118.
9) Repeat the iteration from steps 108-118 until the desired convergence is reached, by checking an iteration metric 120. _If the requirement of the iteration metric is met, we store the values obtained and complete the process.
i5 It is possible that, depending on the obtained value of the merit function, in some percentage of iterations, the changed values are kept even though they do not improve the merit function, a process known as simulated annealing.
Turning now to Figure 3 and an implementation of the invention, 2o the invention is readily implemented in a general purpose computer, programmed to generate the screen matrix values. Once obtained, the screen matrix values may be readily entered and stored into a halftoning device memory, such as that shown in Figure 2.
Typically speaking, threshold screens will be calculated and 2s stored for later distribution as screen matrices of threshold values. Upon later distribution, these matrices can be downloaded in an appropriate manner into device memories for use as required.
The resulting threshold screens may be used for the generation of gray in monochromatic images. They may also be used for the generation of color separations in polychromatic or other multiple separation images. In polychromatic or color images, these clustered screens may be used s exclusively, or in combination with other stochastic or non-stochastic screens, as taught, for example, by US-A 5,394,252 to Holladay et al.
The disclosed method may be readily implemented in software using object oriented software development environments that provide portable source code that can be used on a variety of computer or workstation io hardware platforms. Alternatively, the disclosed image processing system may be implemented partially or fully in hardware using standard logic circuits or specifically on a single chip using VLSI design. Whether software or hardware is used to implement the system varies depending on the speed and efficiency requirements of the system and also the particular function and the is particular software or hardware systems and the particular microprocessor or microcomputer systems being utilized. The image processing system, however, can be readily developed by those skilled in the applicable arts without undue experimentation from the functional description provided herein together with a general knowledge of the computer arts.
2o While this invention has been described in conjunction with a preferred embodiment thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art.
Accordingly, it is intended to embrace all such alternatives, modifications and variations as fall within the spirit and broad scope of the appended claims.
-ia-
Claims (11)
1. 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 dotclustering 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.
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 dotclustering 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.
2. 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.
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.
3. The method as defined in claim 2, wherein the selected cluster pattern provides at least four clusters in the halftone cell.
4. The method as defined in claim 2, wherein the initial assignment of the set of threshold signals is random.
5. The method as defined in claim 2 wherein the quality metrics are given by:
a centroid of each cluster where:
x0=.SIGMA.x/n, y0=.SIGMA.y/n, where .SIGMA. 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 = .SIGMA.(x-x0)2 + (y-y0)2, where .SIGMA. is over any black pixels;
a calculated distance between two centroids:
dij = sqrt[(xi0-xj0)2 + (yi0-yj0)2]; and a sum m and ni-nj/dij over any levels above a mean and all clusters at each level:
Qm = .SIGMA.m, Qd = .SIGMA.ni-nj/dij, where n is a total number of black pixels in each cluster.
a centroid of each cluster where:
x0=.SIGMA.x/n, y0=.SIGMA.y/n, where .SIGMA. 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 = .SIGMA.(x-x0)2 + (y-y0)2, where .SIGMA. is over any black pixels;
a calculated distance between two centroids:
dij = sqrt[(xi0-xj0)2 + (yi0-yj0)2]; and a sum m and ni-nj/dij over any levels above a mean and all clusters at each level:
Qm = .SIGMA.m, Qd = .SIGMA.ni-nj/dij, where n is a total number of black pixels in each cluster.
6. The method as defined in claim 2, wherein at least two thresholds are selected for swapping in any swap.
7. 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.
8. The method as defined in claim 7, where the iteration metric is a predetermined number of swaps.
9. The method as defined in claim 7, where the iteration metric is a percentage difference from a preselected quality metric value.
10. A method of generating threshold values appropriately positioned in a halftone cell, for converting an image received at d levels, forreproduction 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;
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.
selecting a number of clusters for a halftone cell;
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.
11. 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.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/749,306 | 1996-11-14 | ||
| US08/749,306 US5787238A (en) | 1996-11-14 | 1996-11-14 | Clustered halftone dot design process |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2217555A1 CA2217555A1 (en) | 1998-05-14 |
| CA2217555C true CA2217555C (en) | 2002-01-22 |
Family
ID=25013184
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002217555A Expired - Fee Related CA2217555C (en) | 1996-11-14 | 1997-10-07 | Clustered halftone dot design process |
Country Status (5)
| Country | Link |
|---|---|
| US (2) | US5787238A (en) |
| EP (1) | EP0843462A3 (en) |
| JP (1) | JPH10164366A (en) |
| BR (1) | BR9705655A (en) |
| CA (1) | CA2217555C (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6020978A (en) * | 1997-09-30 | 2000-02-01 | Lexmark International, Inc. | Method and apparatus for color halftoning using interlocked threshold arrays |
| US6356363B1 (en) | 1997-09-30 | 2002-03-12 | Lexmark International, Inc. | Method for halftoning using interlocked threshold arrays or interlocked dot profiles |
| KR100275690B1 (en) * | 1997-12-29 | 2000-12-15 | 윤종용 | Image processing apparatus using mask |
| US6252679B1 (en) * | 1998-11-18 | 2001-06-26 | Xerox Corporation | Composite halftone screens with stochastically distributed clusters or lines |
| JP3411843B2 (en) * | 1998-12-28 | 2003-06-03 | パナソニック コミュニケーションズ株式会社 | MFP |
| US7092119B1 (en) * | 1999-08-20 | 2006-08-15 | International Business Machines Corporation | Method, system, and program for managing calibration files in a printing system |
| JP3427026B2 (en) * | 1999-12-24 | 2003-07-14 | 大日本スクリーン製造株式会社 | Halftone dot forming method and apparatus |
| US6775029B1 (en) | 2000-10-30 | 2004-08-10 | Xerox Corporation | Method for efficient calibration of printing devices |
| US7088473B2 (en) * | 2001-02-26 | 2006-08-08 | Sony Corporation | System and method for effectively implementing a dither matrix for an electronic printer device |
| US6724501B2 (en) * | 2001-06-22 | 2004-04-20 | Hewlett-Packard Development Company, L.P. | Apparatus and method for dither matrix design for color halftoning using dispersed dot clusters |
| US7025515B2 (en) * | 2003-05-20 | 2006-04-11 | Software 2000 Ltd. | Bit mask generation system |
| US7239429B2 (en) * | 2003-05-29 | 2007-07-03 | Seiko Epson Corporation | Method and apparatus for generating dispersed cluster screen |
| US7446904B2 (en) * | 2004-05-28 | 2008-11-04 | Infoprint Solutions Company, Llc | Methods and apparatus for generating dither mask through interpolation between preferred patterns |
| GB2419250C (en) * | 2004-10-18 | 2008-04-24 | Software 2000 Ltd | Bit mask generation system. |
| US7616347B2 (en) * | 2005-04-29 | 2009-11-10 | International Business Machines Corporation | System and method for multi-bit halftoning |
| US7626730B2 (en) * | 2006-03-31 | 2009-12-01 | Eastman Kodak Company | Method of making a multilevel halftone screen |
| US8934142B2 (en) * | 2013-04-30 | 2015-01-13 | Hewlett-Packard Indigo B.V. | Halftone screen |
| US9811923B2 (en) | 2015-09-24 | 2017-11-07 | Snaptrack, Inc. | Stochastic temporal dithering for color display devices |
| CN112468791B (en) * | 2020-11-25 | 2021-08-27 | 北京理工大学 | Light intensity measurement iterative imaging method based on single-pixel detection |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4149194A (en) * | 1977-07-07 | 1979-04-10 | Xerox Corporation | Variable angle electronic halftone screening |
| EP0074422B1 (en) * | 1981-09-12 | 1985-07-03 | DR.-ING. RUDOLF HELL GmbH | Method for the production of printing plates by means of printing irregularly distributed points |
| US4752822A (en) * | 1983-03-08 | 1988-06-21 | Canon Kabushiki Kaisha | Color halftone image processing apparatus producing various screen angles and having an adaptive color image data conversion look-up table and a small-capacity masking memory |
| DE3634939A1 (en) * | 1986-10-14 | 1988-04-28 | Du Pont Deutschland | METHOD FOR RECORDING QUASI HALFTONE IMAGES |
| JPH02145085A (en) * | 1988-11-25 | 1990-06-04 | Fuji Xerox Co Ltd | Film picture reader |
| US5341228A (en) * | 1990-12-04 | 1994-08-23 | Research Corporation Technologies | Method and apparatus for halftone rendering of a gray scale image using a blue noise mask |
| US5442461A (en) * | 1991-09-03 | 1995-08-15 | Levien; Raphael L. | Screen generation for halftone screening of images with reduction of irrational correction artifacts |
| EP0597596A3 (en) * | 1992-10-15 | 1994-06-15 | Digital Equipment Corp | Imaging system with translated input levels. |
| US5317418A (en) * | 1993-05-11 | 1994-05-31 | Hewlett-Packard Company | Halftone images using special filters |
| US5394252A (en) * | 1994-03-02 | 1995-02-28 | Xerox Corporation | Hybrid quantization method for color document reproduction |
| US5673121A (en) * | 1996-06-17 | 1997-09-30 | Xerox Corporation | Stochastic halftoning screening method |
-
1996
- 1996-11-14 US US08/749,306 patent/US5787238A/en not_active Expired - Lifetime
-
1997
- 1997-10-07 CA CA002217555A patent/CA2217555C/en not_active Expired - Fee Related
- 1997-10-31 JP JP9300311A patent/JPH10164366A/en not_active Abandoned
- 1997-11-04 EP EP97308834A patent/EP0843462A3/en not_active Withdrawn
- 1997-11-13 BR BR9705655A patent/BR9705655A/en not_active IP Right Cessation
-
1998
- 1998-07-14 US US09/114,833 patent/US5978556A/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CA2217555A1 (en) | 1998-05-14 |
| EP0843462A2 (en) | 1998-05-20 |
| EP0843462A3 (en) | 2003-05-21 |
| US5787238A (en) | 1998-07-28 |
| BR9705655A (en) | 1999-03-16 |
| US5978556A (en) | 1999-11-02 |
| JPH10164366A (en) | 1998-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2203448C (en) | Stochastic halftoning screening method | |
| CA2217555C (en) | Clustered halftone dot design process | |
| CA2140410C (en) | Hybrid quantization method for color document reproduction | |
| US5214517A (en) | Digital halftoning with correlated minimum visual modulation patterns | |
| US5859955A (en) | Stochastically clustered dot halftoning system | |
| EP0560285B1 (en) | Method and apparatus for generating simultaneously derived correlated digital halftone patterns | |
| EP0629079B1 (en) | Halftone images using printed symbols modelling | |
| JPH06508007A (en) | Method and apparatus for halftoning grayscale images using a blue noise mask | |
| US6014500A (en) | Stochastic halftoning screening method | |
| US20060197992A1 (en) | Stochastic screens for rendering devices with high-addressability | |
| EP0642259B1 (en) | Method for making a frequency-modulation halftone screen | |
| Lee et al. | Inkjet printer model-based halftoning | |
| EP0514478B1 (en) | Digital halftoning with correlated minimum visual modulation patterns | |
| US4758886A (en) | Optimal color half-tone patterns for raster-scan images | |
| US6917443B1 (en) | Composite halftone screens with stochastically distributed clusters or lines | |
| US6252679B1 (en) | Composite halftone screens with stochastically distributed clusters or lines | |
| JP2009038813A (en) | Modification method of dot cluster halftone screen | |
| EP0642258B1 (en) | Method for generating a frequency modulated halftone image | |
| US6304340B1 (en) | Composite halftone screens with stochastically distributed clusters or lines | |
| JP3187352B2 (en) | Method of halftoning gray value signal of pixel of image and image reproducing apparatus for reproducing image | |
| US7440141B2 (en) | Method for generating a dither mask | |
| US5764810A (en) | Screenless conversion of continuous tone images with alterable dot spacing patterns | |
| US5446561A (en) | Method and apparatus for digital scale halftoning with variable screen structure for electrophotographic printing devices | |
| JP4251119B2 (en) | Image processing apparatus and program | |
| JP2005277766A (en) | Image processer and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |