Bi-level and multi-level devices have limited tonal range. Intermediate tones, such as varying shades of gray, must be represented by halftones. Halftoning is a process by which continuous-tone colors are approximated by a pattern of pixels that can achieve only a limited number of discrete colors. The most familiar case of this is the rendering of gray tones with black and white pixels, as in a newspaper photograph.
There are many conventional techniques for halftoning. Dithering, stochastic screens, and error diffusion are all different types of halftoning techniques. When a particular halftoning technique is used, the resulting image is comprised of halftone patterns. In other words, halftone patterns are what the halftoning techniques create.
Contemporary halftoning techniques have parameters specific to each technique. For example, dithering techniques include order and unordered dithering. Error diffusion is an example of unordered dithering. Ordered dithering is usually implemented using a threshold array. Furthermore, ordered dithering can be further sub-categorized into clustered or dispersed dot dithers.
With clustered dot dithering, the arrangement of the gray levels tends to result in the formation of clumps or clusters. With dispersed dot dithering, the successive gray threshold values in the array are spread or dispersed away from each other as much as possible. Stochastic screens are a class of dispersed dot dithering in which the appearance of the halftoned result is similar to that of an unordered dither. Stochastic screens are preferred over unordered dithering in that it has much better computational efficiencies (both in time and in memory usage).
When an image is halftoned, the parameter or parameters (i.e., ordered, threshold array) specific to the halftoning technique remains constant during the halftoning process. For example, the same array is used each time the image is halftoned.
For display devices, such as computer monitors and televisions, images are presented as frames that are refreshed or repeated many times a second. This refreshing or repeating of the image occurs regardless of whether the image itself is changing over time. So, for a picture displayed on a computer monitor, a movie played on television, or a movie played in a theater, each frame is refreshed or repeated many times a second.
However, as discussed earlier, the parameters in contemporary halftoning techniques remain constant while each frame is repeated. This can create artifacts in the image, in that the halftone patterns become visible to the human eye. This is especially true for animated images, because the halftone pattern remains fixed over time while the frames in the image move and change over time.
In accordance with the invention, a system and method for halftoning using a time-variable halftone pattern are provided. Successive frames or images of an input image that are presented to the output device are individually halftoned. A starting location within the input image for tiling one of one or more halftone techniques over the frame or image is determined. The starting location is then offset from the previously used starting location after a certain number of frames or images have been halftoned. Any halftoning technique may be used to halftone the frames or images. The halftoned frames or images are then viewed in a sequence in time.
a illustrates an exemplary image comprised of pixels;
b depicts an exemplary halftone mask comprised of threshold values;
a-3f illustrate an exemplary prior art method for halftoning;
a-5d illustrate an alternative exemplary method for halftoning using a time-variable halftone mask according to the present invention; and
a-6i depict an exemplary sequence of halftoned frames of constant gray of 95% luminance, created by halftoning with a time-variable halftone mask according to the present invention.
To facilitate an understanding of the present invention, it is described hereinafter in the context of a specific embodiment. In particular, reference is made to an implementation of the invention on a computer display where the image being displayed is halftoned using a halftone mask as the halftoning technique. It will be appreciated, however, that the practical applications of the invention are not limited to this particular embodiment. Rather, the invention can be employed in other types of output devices, such as televisions and movie players. Furthermore, the present invention is not limited to the use of halftone masks as the halftoning technique. Other halftoning techniques, such as dithering or error diffusion, can be used.
With reference now to the figures and in particular with reference to
a illustrates an exemplary image comprised of pixels. Image 200 is shown as a 12×12 image comprised of 144 pixels. Pixels are usually arranged on an orthogonal grid, with the pixels placed at evenly spaced lattice points. Typically image 200 is associated with the (x, y) coordinate system, with the rows as the x coordinate and the columns as the y coordinate. Pixel 202 is usually considered the pixel in the (0, 0) location. With pixel 202 at (0, 0), pixel 204 is located at (6, 4) and pixel 206 is positioned at (9, 10) in the image.
Referring to
For example, in order to determine whether pixel 202 is “on” or “off”, an imaging device checks the address of pixel 202, which in this example is (0, 0), determines the tonal value at that address, and compares that tonal value with the threshold value 210 in halftone mask 208. If the tonal value of pixel 202 exceeds the threshold value 210, pixel 202 is turned “on” when the image is displayed.
a-3f illustrate an exemplary prior art method for halftoning. Image 300 is shown as a 9×6 image, comprised of 54 pixels. Threshold array 302 is represented as a 3×3 array, and is comprised of threshold values. Pixel 304 in image 300 (
For a computer monitor, threshold array 302 is tiled over image 300 in a raster pattern. In other words, threshold array 302 is initially placed at the (0, 0) location in image 300. It is then tiled along the first three rows until threshold array 302 reaches the end of the rows. This process is shown in
In this prior art method of halftoning, threshold array 302 remains constant while the image is halftoned. For example, if the image is rendered on a display, the image is halftoned each time the image is drawn to the screen. In this situation, the halftone parameters do not change when the image is drawn and re-drawn to the screen because the same threshold array is used to halftone the images.
This exemplary method is not however, limited to only four halftone masks. Any number of halftone masks can be used. Those skilled in the art will appreciate that the flicker period can be reduced by increasing the number of halftone masks. Furthermore, halftone masks 402, 404, 406, 408 do not have to be stored in memory. They can be calculated in real time.
a-5d depict an alternative exemplary method for halftoning using a time-variable halftone mask according to the present invention. In this example, only one halftone mask is used to generate different halftoned frames, where the frames are combined to create the output image. Different (x, y) offsets are used to place the mask in the input image in order to generate a halftoned frame.
In
Halftone mask 504 is then offset again to location (6, 3), represented in
With reference now to
The halftoned frame shown in
In the embodiment represented in
The present invention, however, is not limited to offsetting the threshold mask. Different rotations, or transformations applied to the halftone mask can be used as an alternative to offsetting the halftone mask.
The image being halftoned by the methods described with reference to
The method used to obtain the halftoned frames, however, is not limited to thresholding by halftone masks. Any spatial halftoning technique, acting on an area larger than a pixel, can be used with the present invention by simply varying the halftoning parameters over time to create different halftone frames to be viewed in sequence. The halftone pattern needs to change from one frame to the next. This causes the visibility of artifacts in the halftone pattern to be reduced when the sequence of frames is displayed.
Furthermore, the process of halftoning according to the present invention does not require the same halftoning technique to be used each time an image is halftoned. Alternatively, the halftoning techniques can be varied each time the image is halftoned. For example, dithering, stochastic screening, and error diffusion techniques can be used on the same image, simply by varying the particular technique used over time.
If the amount of time required to halftone a frame is less than the period between frames, the halftoning process can be performed in real time, regardless of whether the image to be displayed is static or animated. If the amount of time required to halftone a frame is more than the period between frames, an entire sequence of halftoned animated images may have to be pre-computed, stored, and subsequently replayed. For a static image, a sequence of halftoned frames can be stored and replayed in a continuous loop. Since the present invention can be implemented in hardware, software, or a combination of the two, the speed of the halftoning process can be optimized by implementing the invention in a design that is appropriate for a particular system.
And finally, the present invention is not limited to use for images displayed on a computer monitor. Those skilled in the art will appreciate that the present invention can be used in other types of output devices, such as televisions and movie players. The present invention can also be used with computer applications, such as games, movies, and displaying and transmitting images over communication channels, such as the Internet.
This application is a divisional application of U.S. patent application Ser. No. 09/344,826, filed Jun. 25, 1999 now U.S. Pat. No. 7,187,474.
Number | Name | Date | Kind |
---|---|---|---|
3937878 | Judice | Feb 1976 | A |
5394518 | Friedman et al. | Feb 1995 | A |
5543941 | Parker et al. | Aug 1996 | A |
5708518 | Parker et al. | Jan 1998 | A |
6072451 | Mano et al. | Jun 2000 | A |
7123383 | Hattori | Oct 2006 | B2 |
20020080098 | Kim | Jun 2002 | A1 |
20020191220 | Czyszczewski et al. | Dec 2002 | A1 |
Number | Date | Country |
---|---|---|
08044313 | Feb 1996 | JP |
Number | Date | Country | |
---|---|---|---|
20070121167 A1 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09344826 | Jun 1999 | US |
Child | 11698653 | US |