Patent Grant
7518754
The present invention relates generally to halftoning of an image using error diffusion, such as in preparation for printing. More particularly, it concerns a method for halftoning in which dither is added to the input image and to the thresholding matrix used in the error diffusion step.
Halftoning provides a way to represent a continuous-tone image on a device, such as a printer or display, that can physically produce only a finite number of tone levels. The illusion of multiple tone levels is created by forming a high-frequency pattern of dots, dot clusters, or lines.
Halftoning techniques may be broadly split into two categories: point operators and area operators. When using point operators, only one input pixel must be considered to determine the corresponding output pixel. Thus, point operators are very fast. In contrast, area operators must consider an area of the input image (i.e., multiple input pixels) in order to determine each output pixel. Area operators require more time, but they typically yield better quality output.
The most common point operator is a halftone screen, also known as a threshold array or dither array. A halftone screen is a two-dimensional array of numeric threshold values. A halftone screen of size N×M pixels may be used on an input image of size P×Q pixels, where P may be several times larger than N, and Q may be several times larger than M. Conceptually, the N×M screen is replicated, or “tiled” both horizontally and vertically to cover the entire input image. Each input pixel is matched to its corresponding threshold value. If the input pixel's value exceeds this threshold, the corresponding output pixel will be marked with a dot. Otherwise, the output pixel will be blank.
Halftone screens may be classified according to the size and arrangement of the dot clusters that they tend to form. Dots may be grouped together into clusters, or they may remain separate or dispersed. In either case, the dots or clusters may be arranged in an ordered or periodic pattern, or they may be arranged in a non-periodic, somewhat random pattern, often called “stochastic.”
Isolated dots provide better quality, since they can produce higher spatial frequencies. However, many printing devices have difficulty rendering isolated dots consistently. Clustered dots are much more tolerant of such physical limitations, providing better stability on such devices.
Ordered patterns are usually simpler to design and allow smaller threshold arrays, as compared to stochastic patterns. However, ordered patterns are periodic, which can cause prominent and objectionable periodic moiré when interacting with other periodic signals (such as periodic content in the image itself). Although periodic moiré is possible with stochastic screens, such “stochastic moiré” is spread across a range of spatial frequencies and, therefore, may be much less objectionable.
The earliest halftoning method used an ordered clustered-dot screen. Such screens are stable and well-understood, and they persist throughout the commercial printing industry. The first ordered, dispersed-dot screen (Bayer Screen), developed in 1973, was able to minimize low frequency textures but nevertheless produced distinct periodic patterns.
Stochastic screens became popular in the 1990's, offering the better quality of dispersed dots without the periodic artifacts of a Bayer screen. However, the individual dots are difficult to render for many printers. Later, clustered stochastic screens addressed the rendering problem, although the aperiodic distribution of clusters can still be more difficult to control than the uniform, periodic clusters of ordered, clustered-dot screens.
While screens provide a fast halftoning solution, area operators offer better quality. The predominant method in this category of halftoning is error diffusion. Halftone transformation results, on a pixel-by-pixel basis for all image pixels, in the replacement of an original non-binary, or tone level or “gray-level” value of, e.g., 8 bits, with a reduced bit value after comparison with some threshold. Oftentimes, the original number of bits is reduced to a single bit to form a binary image, but it may be reduced to any number of bits less than the original number. The term “gray-level” in this context may refer to a non-binary value, which can pertain to either a ‘non-color’ (“black and white”) image or to a certain plane in a color image.
The threshold itself may vary dynamically depending on the original pixel value (“tone-dependent threshold”) and other factors. During binary thresholding, the original 8-bit value at each pixel is substituted by either a “0” (representing an 8-bit value of 0) or a “1” (representing an 8-bit value of 255). The consequence of such a transformation at a pixel is that the overall “brightness” of the image is changed. To mitigate this, the change, or “error”, may be diff-used to nearby, as-yet-untransformed pixels through a technique known as error diffusion.
Error diffusion works by spreading the inaccuracy, or error, of the halftone decision at one pixel in the output image among nearby pixels, thereby creating a visually superior transformation. Each original pixel value is adjusted based on the error contributed by adjacent and nearby pixels, and these contributions are taken into account in calculating the correct transformed value for the pixel.
There are a number of error diffusion techniques, each of which uses a different combination of thresholding approaches, collection of nearby pixels to which the error is spread, error weightings to each of these nearby pixels, and other factors. The Floyd-Steinberg algorithm, developed in 1975 and known to those skilled in the art, is one of the more well-known implementations of error diffusion. This algorithm generates a series of error values for each image element as an image line is transformed. These error values are calculated by taking a fraction of nearby pixel error values and adding them together to represent a pixel location.
With reference to
b shows receipt of partial errors from the perspective of a pixel 450 that is about to be transformed using Floyd-Steinberg error diffusion. Soon-to-be transformed pixel 450 receives a portion of the error from each of four nearby, previously transformed pixels 452, 454, 456 and 458, using error spread weights of 7/16, 1/16, 5/16 and 3/16, respectively. Of these, pixels 454, 456 and 458 are on the previous line (“above”), while recently-transformed pixel 452 is immediately to the left of untransformed pixel 450, on the current line. From the perspective of untransformed pixel 450, error is received from “Previous Back” pixel 454 (with “receive backward coefficient” 1/16), “Previous Above” pixel 456 (with “receive above coefficient” 5/16), “Previous Forward” pixel 458 (with “receive forward coefficient” 3/16), and “Current Left” pixel 452 (with “receive left coefficient” 7/16). In the foregoing nomenclature, the prefix “Previous” refers to the previous line from which the corresponding errors are received.
From the foregoing description, it can be seen that in the Floyd-Steinberg algorithm, the error created from transforming a pixel is spread to four adjacent pixels. Furthermore, prior to transformation, each pixel receives a portion of the error from each of the four adjacent pixels that have previously been transformed. The Floyd-Steinberg algorithm typically operates in row-order (sometimes called “line-order”). That is, an entire row, or line, of an image is transformed before the next row or line is transformed. Transformation of a row results in the storage of a large number of error values. For instance, if an image has a resolution of 600 pixels per inch (PPI), and each row of the image is 9 inches wide, then 5400 pixels worth of error data, each error datum comprising anywhere from 1 color (for a black & white printer) to 3 or more colors (for a color printer), may need to be stored.
Originally, Floyd-Steinberg-type error diffusion was implemented in software with data being read from, and written to a main memory having ample space. More recently, however, high-speed ASIC-based hardware implementations using integer arithmetic have been realized.
The system 500 includes a general purpose microprocessor 510 that is connected to a main memory 504. Main memory 504 typically stores the input pixel data 506 of an image whose pixels are to be transformed from a non-binary format to a binary format using error diffusion.
The microprocessor 510 is part of an Application Specific Integrated Circuit (ASIC) 502 (represented by the dashed line) configured to implement error diffusion. The dotted arrows represent connections between the microprocessor 510 and the other components of the ASIC, through data buses, control buses and other structures known to those skilled in the art of integrated circuit design. A second microprocessor off the ASIC (not shown) may be used for overall control by enabling/disabling the ASIC or components thereof, setting various coefficients and parameters such as image dimensions and pixel line addresses, and the like.
In addition to the microprocessor 510, the ASIC 502 includes an error diffusion processor 520, an error spread coefficient subsystem 530, threshold generation logic or circuitry 540, and an error buffer 550.
The error diffusion processor 520 receives pixel data 506 from the main memory 504, error spread coefficients 532 from the error spread coefficient system 530, and threshold information 542 from threshold generation circuitry 540. The error diffusion processor 520 uses this information, along with previous line running error data 524 from an error buffer 550 to transform the pixel data 506 into error diffused pixel data 526 which is stored in the main memory 504. Control signals 521 are sent from the error diffusion processor 520 to the error spread coefficient system 530 for requesting coefficients and performing other functions.
The error spread coefficient system 530 receives input 512 from the microprocessor 510. It may also receive pixel data 506 in the case of data-driven determinations of the error spread coefficients 532. The error spread coefficient system 530 provides the error diffusion processor 520 with the error spread coefficients 532 to be used in allocating the error from a transformed pixel. As discussed further below, the error spread coefficient system 530 may be implemented in a number of different ways.
The threshold generation circuitry 540 creates a threshold 542 that is used to compare with each adjusted non-binary (e.g., 8-bit) gray level pixel datum to determine whether the corresponding pixel is to be set to “0” or “1”. The threshold generation circuitry 540 is under the control of the microprocessor 510 and may take on any number of forms. As seen in
People skilled in the art are familiar with implementing tone-dependent thresholds. In simple implementations of tone-dependent thresholds, contiguous ranges of input pixels are mapped onto a single threshold value. One way to do this is to ignore the ‘k’ lowest bits of the input pixel value and use this as the threshold. Thus, if the k=5 last bits are ignored, then input pixel values between, say, 64 (binary ‘01000000’) and 95 (‘binary ‘01011111’) use a threshold of 64. An offset may be added to this to help ensure that the threshold is set to a value between these extremes. For instance, the threshold ‘algorithm’ may be given as “ignore the last five bits and add 16”. In such case, input pixel values 0-31 are mapped onto a threshold value of 16; input pixel values 32-63 are be mapped onto a threshold value of 48, etc. Other paradigms are also possible.
As is known to those skilled in the art, the error diffusion processor 520 typically processes image pixel data in line-order—each pixel belonging to one line of an image is error diffused before pixels of the next line are processed. The error buffer 550 receives partial errors 522 from the error diffusion processor 520 for use in distributing the error from an immediately preceding row of image data and provides these partial errors 524 back to the error diffusion processor 520 for use in adjusting a current pixel value of a pixel in a current row of image data. It is understood that in some prior art embodiments, the error buffer 550 may be instantiated in main memory 504 when memory bandwidth suffices to support the pixel rate. In other prior art embodiments, circuitry for implementing the error buffer 550 may simply be integral to the error diffusion processor 520.
While in the prior art embodiment of
Since its initial introduction, error diffusion has attracted considerable attention, and numerous variants of the algorithm exist. The raster lines of the image may be processed in several directions, including ordinary left-to-right, alternating direction (serpentine), pseudo-random alternating, and space-filling paths. The diffusion weights have been extended to a larger area, optimized, randomized, and adjusted to the tone level of the image. Printer models have been incorporated, edges have been enhanced, clustered dots have been formed, and various refinements have been made to improve the quality of certain tone levels.
Threshold modulation is another aspect of error diffusion that offers much flexibility. Thresholds have been adjusted with random noise, “colored” random noise, one-dimensional signals, two-dimensional signals, and halftoning screens, as well as according to the tone level of the image. Much of this effort is directed at reducing artifacts in the output image, such as the artifacts arising from the error diffusion process.
In one aspect, the present invention is directed to a method of halftoning an original input image having gray-level values to thereby form a reduced-bit value output image. The inventive method comprises adding a first type of passband dither to input pixels of the original input image to form dithered input pixels, and performing error diffusion on the dithered input pixels using threshold values comprising at least one component, where the at least one component is based on a second type of passband dither.
In this inventive method, the first type of passband dither may be tiled across the image, each tile having substantially zero-mean, “substantially” being interpreted in light of the pixel values in the tile. The first type of passband dither may have a dynamic range less than the dynamic range of the input pixel values. The first component of the threshold values may comprise a tone-dependent threshold indexed by the original pixel value or by the dithered pixel value. The second type of passband dither, which may form a second component of the threshold values, may be the same as the first type of passband dither. The second component may be a scaled multiple of the first component, the scaled multiple being less than 1.
The first type of passband dither may have least 99% of its spectral energy confined to spatial frequencies between 0.05 times a maximum possible spatial frequency and 0.90 times said maximum possible spatial frequency, in each of two spectral dimensions. The method may further comprise determining whether at least one edge is present in a region proximate to a pixel of interest and suspending addition of the first type of passband dither to input pixels, if at least one edge is present. The method may further comprise determining an average pixel value in a region proximate to a pixel of interest and adding very low frequency passband dither, if the average pixel value is either less than a first predetermined level or greater than a second predetermined level.
In another aspect, the present invention is directed to a method of halftoning an original input image having gray-level values to thereby form a reduced-bit value output image. The inventive method comprises adding a first type of passband dither to input pixels of the original input image to form dithered input pixels and then performing error diffusion on the dithered input pixels using tone-dependent threshold values without adding further dither to the tone-dependent threshold values.
In this second aspect, the first type of passband dither may be tiled across the image, each tile having zero-mean. It will be appreciated that “zero mean” and “substantially zero mean” dither may also include a non-zero-mean dither where the error diffusion adjusts for this same or substantially the same non-zero-mean value in another part of the algorithm. The first type of passband dither may have a dynamic range less than the dynamic range of the input pixel values. The tone-dependent threshold values may be indexed by the original pixel value or by the dithered pixel value.
The first type of passband dither may have least 99% of its spectral energy confined to spatial frequencies between 0.05 times a maximum possible spatial frequency and 0.90 times said maximum possible spatial frequency, in each of two spectral dimensions. The method may further comprise determining whether at least one edge is present in a region proximate to a pixel of interest and suspending addition of the first type of passband dither to input pixels, if at least one edge is present. The method may further comprise determining an average pixel value in a region proximate to a pixel of interest and adding very low frequency passband dither, if the average pixel value is either less than a first predetermined level or greater than a second predetermined level.
In yet another aspect, the present invention is directed to an application specific integrated circuit (ASIC) for performing error diffusion. The ASIC in accordance with the present invention is configured to add a first type of passband dither to pixels of the original input image to form dithered input pixels, and then perform error diffusion on the dithered input pixels using predetermined tone-dependent threshold values without adding further dither to the tone-dependent threshold values.
In the inventive ASIC, the first type of passband dither may have a dynamic range less than the dynamic range of the input pixel values. The tone-dependent threshold values may be indexed by the original pixel value or by the dithered pixel value.
a and 4b depict conventional error diffusion, showing exemplary error diffusion coefficients.
It is to be understood that the invention is not limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments and of being practiced or of being carried out in various ways. Also, it is to be understood that the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. The use herein of “including,” “comprising,” or “having” and variations thereof is meant to encompass the items listed thereafter and equivalents thereof as well as additional items. Unless limited otherwise, the terms “connected,” “coupled,” and “mounted,” and variations thereof herein are used broadly and encompass direct and indirect connections, couplings, and mountings. In addition, the terms “connected” and “coupled” and variations thereof are not restricted to physical or mechanical connections or couplings.
In addition, it should be understood that embodiments of the invention include both hardware and electronic components or modules that, for purposes of discussion, may be illustrated and described as if the majority of the components were implemented solely in hardware. However, one of ordinary skill in the art, and based on a reading of this detailed description, would recognize that, in at least one embodiment, the electronic based aspects of the invention may be implemented in software and/or firmware. As such, it should be noted that a plurality of hardware and software-based devices, as well as a plurality of different structural components may be utilized to implement the invention. Furthermore, and as described in subsequent paragraphs, the specific configurations illustrated in the drawings are intended to exemplify embodiments of the invention and that other alternative configurations are possible.
The term output as used herein encompasses output from any printing device such as a copier, a printer, or a so-called “all-in-one device” which incorporates multiple functions such as scanning, copying, faxing, and printing capabilities in one device. Such printing devices may utilize ink jet, dot matrix, dye sublimation, laser, and any other suitable print formats.
The present invention is directed to halftoning an input image using error diffusion, such as for use in a printer, copier, all-in-one (AIO) or other output device. In a typical scenario, the input image is either 8-bit black and white, or 24-bit color, with three 8-bit RGB color planes, and in the latter case, each 8-bit plane is treated separately. Passband dither is added either to the input image or to both the input image and also to the thresholding matrix used in the error diffusion process.
In all embodiments of the present invention, a first type of passband dither is added to the input pixel values which are to be error diffused.
In step 110, an original input image having original pixel values Io[x,y] is received. The original input image is of size P×Q pixels, where P represents the number of rows and Q represents the number of pixels (nominally P=5400 and Q=7200, for 600 dpi resolution and a 9″×12″ image).
In step 112, a pixel Io[x,y] of the original input image is modified to form a modified pixel value Im[x,y]. This is done by adding passband dither and the partial errors from the error diffusion process:
In[x,y]=Io[x,y]+a1*D1[x mod M1,y mod N1] (Eq. 1)
Im[x,y]=In[x,y]+E[x,y] (Eq. 2)
where:
In[x,y] represents the dithered pixel values;
D1[x mod M1, y mod N1] is an M1×N1 matrix of zero-mean passband dither of a first type; M1≦P; N1≦Q;
a1 is a first scale factor;
Im[x,y] represents the modified pixel values including the partial errors; and
E[x,y] is the sum total of the partial errors received by pixel [x,y] from pixels that have been previously diffused.
While Im[x,y] is shown as being formed using separate equations or steps, it is understood that a modified pixel value may be created in a single sum.
The dither matrix may be of a size as large as the input image (i.e., M1=P; N1=Q). More preferably, however, M1<P, N1<Q, and the dither matrix is tiled across the image, in a known manner. In an exemplary embodiment, M1=N1=128, and so the dither matrix is 128×128.
In step 114, the modified pixel undergoes error diffusion and halftoning using values from a tone dependent threshold array Tn[Io[x,y]]. Thus, if the original input pixels are 8-bit and are in the range [0, 255] the tone-dependent threshold array Tn[] has 256 entries. In one embodiment, the tone-dependent threshold array Tn[] is implemented as a look-up table indexed by the input pixel value Io[x,y]. In another embodiment, the tone-dependent threshold array Tn[] is indexed by information based on the dithered input pixel value In[x,y]. In such case, those skilled in the art know how to populate such lookup tables, as discussed above in the Background section.
Also with regard to step 114, it is understood that in any practical implementation, error diffusion on an input image with original pixel values Io[x,y] is typically done one row at a time, and so steps 112 and 114 are repeated, as indicated by the double arrows 116.
In a preferred embodiment in accordance with
In step 210, an original input image Io[x,y] is received. Again, the original input image is of size P×Q pixels, where P represents the number of rows and Q represents the number of pixels (nominally P=5400 and Q=7200, for 600 dpi resolution and a 9″×12″ image).
In step 212, a pixel of the input image Io[x,y] is modified to form a modified pixel value Im[x,y]. This is done by adding zero-mean passband dither and the partial errors from the error diffusion process:
In[x,y]=Io[x,y]+b1*D1[x mod M1, y mod N1] (Eq. 3)
Im[x,y]=In[x,y]+E[x,y] (Eq. 4)
where:
In[ x,y] represents the dithered pixel values;
D1[x mod M1, y mod N1] is an M1×N1 matrix of zero-mean passband dither of a first type; M1≦P; N1≦Q;
b1 is a first scale factor;
Im[x,y] represents the modified pixels including the partial errors; and
E[x,y] is the sum total of the partial errors received by pixel [x,y] from pixels that have been previously diffused.
In step 214, the modified pixel undergoes error diffusion and halftoning using values from a modified tone dependent threshold matrix Tm[x,y].
Tm[x,y]=Tn[Io[x,y]]+b2*D2[x mod N2, y mod M2] (Eq. 5)
where:
Tm[x,y] represents the modified tone-dependent threshold values;
Tn[Io[x,y]] is a tone-dependent threshold array having as many entries as unique input pixel values (256 for 8-bit input pixels);
D2[x mod M2, y mod N2] is an M2×N2 matrix of zero-mean passband dither of a second type; M2≦P; N2≦Q; though D2 may have the same spectral characteristics as D1; and
b2 is a second scale factor.
It can be seen from equations (4) and (5) that when D1=D2, the passband dither added to a particular input pixel is correlated with the dither added to the corresponding tone-dependent threshold value used in the error diffusion step for that pixel. Moreover, the dither added to the tone-dependent threshold value is a scaled multiple f=b2/b1 times that added to the corresponding input values.
Again, it is understood that the tone-dependent threshold array Tn[] is typically implemented as a look-up table of 256 values, for 8-bit input pixels. Again, in one embodiment, the tone-dependent threshold array Tn[] is indexed by the original input pixel value Io[x,y] while in another embodiment, the tone-dependent threshold array Tn[] is indexed by the dithered input pixel value In[x,y].
The modified threshold values Tm[] thus comprise two components. A first component is a tone-dependent threshold (indexed by either the input pixel value or the dithered input pixel value, as discussed above) while a second component comprises the zero-mean passband dither.
Again, since error diffusion is typically performed in row order, steps 212 and 214 are repeated, as indicated by the double arrows 216.
A wide range of periodic signals may be used in accordance with the present invention to serve as the passband dither. These include simple two-dimensional sinusoidal waveforms, with or without certain types of noise added, among others. An exemplary embodiment of the zero-mean passband dither that is added to the input pixel values in the present invention is now described.
The shaded area 602 in the plot 600 delimits the spatial frequency of the passband dither. The point at spatial frequency (u,v)=(0,0) designated by reference numeral 630 does not fall in the shaded area 600, since this is a DC component of the dither. Similarly, the point at spatial frequency (u,v)=umax, vmax, designated by reference numeral 632 also does not fall in the shaded area 602, since this the highest possible two-dimensional frequency. Accordingly, the passband dither contemplated in the present invention has the vast majority of its power falling somewhere between these two extremes.
As seen in
In one embodiment, the passband dither may take the form of a two-dimensional sinusoid, which may be represented as:
D′[x,y]=sin([2π/C1]x+[2π/C2]y+θ) (Eq. 6)
where:
D′[x,y] represent the dither values prior to de-meaning;
C1 & C2 are the number of pixels before the sinusoidal pattern repeats in the corresponding direction; and
θ is an angular offset, which may be zero.
In the spectral plot of
In one embodiment for a particular 600 dpi laser printer, C1=C2=7 pixels. In other words, the dither matrix principally comprises a two-dimensional symmetric sinusoid where the peaks and valleys are repeated at roughly every 7 pixels. Generally speaking, it is believed that values of C1 and C2 in the range of 5-9 pixels gives agreeable results for that particular 600 dpi laser printer. For a 1200 dpi laser printer, acceptable values for C1 and C2 may range from a cycle of 10 pixels to a cycle of 20 pixels although other values may be used as well.
In the case of tiling, a small dither matrix D′[x,y] of size M×N (nominally M=128, N=128) may be created with an original dynamic range of [0,255]. If the matrix, when created, has a mean of μ, then μ can be subtracted from each value in the matrix to force the mean to zero. This de-meaned small matrix may then be tiled across the image after being adjusted by the scale factor b1, which preferably is less than 1.0.
The dither matrix need not be limited to a single two-dimensional sinusoid, represented by a single point within the area 602. It may, for example, constitute a sum of a plurality of such two-dimensional sinusoids, in which case the dither matrix is manifested in the spatial frequency domain as a corresponding plurality of dots. In other embodiments, band limited noise, whose spatial frequency is limited to the shaded area 602, may be added to such sinusoidal dither, or may be used, by itself, as the dither. An example of such band limited noise may be the “green noise” disclosed in U.S. Pat. No. 6,493,112, whose contents are incorporated by reference.
It can be seen from the foregoing that suitable dithers can be created with a variety of amplitude statistics and spectral characteristics. Thus, at one extreme, the added dither may take the form of a two-dimensional sinusoid and so be periodic in both the x-direction and the y-direction. At another extreme, the dither may be broadband to the extent of the two-dimension shaded passband region 602 in
While in one embodiment, the dither may be created and reside in memory, in another embodiment, it may be dynamically generated “on the fly”. In the latter case, the microprocessor, or other circuitry, implements the function used to create the dither, in conjunction with information about the x and y indices of the input pixel in question. In this vein, colored noise, perhaps tone-dependent, may be added on the fly to a two-dimensional sinusoidal dither.
Furthermore, the dither that is added may depend on characteristics of the input pixel values. Exemplary characteristics that may be used to determine the nature of the passband dither include the presence of edges and the presence of mean pixel values that are either low or high within a contiguous J×K region of the image. The contiguous J×K region is centered about a particular pixel in question within a row that is being error diffused.
In one particular embodiment using a 5×5 region (J=K=5), the presence of edges is used to determine whether to add dither. As is known to those skilled in the art, edges are detected when there is a transition in the image from light to dark, or vice versa, and established techniques such as using Sobel operators and the like are well-known for edge detection. When edges are detected in a region, it may be desirable to turn off addition of passband dither or, at a minimum, limit the dither to having spectral characteristic at the lower left corner of the shaded area 602 in
In this same embodiment using the 5×5 region, if the mean pixel value m is less than some predetermined reference value μL, or greater than some predetermined reference value μH, then low frequency dither (still within the passband dither region represented by the shaded region of
In an exemplary embodiment following
Meanwhile, the second scaling factor b2 may be 0.5, and so the dither added to the threshold values is a scaled multiple f= 0.5/0.586 of the dither added to the input pixel values. As can be seen in this example, the scaled multiple f is less than 1 when the first and second types of dithers are the same. It is understood, however, that these values are exemplary, and that the scaled multiple f is not necessarily limited to values less than 1.0.
While the above described inventive method has been described without reference to the manner of implementation, it is contemplated that the invention can be implemented in an application specific integrated circuit (ASIC).
Like the ASIC 502 in prior art system 500, the ASIC 302 includes a microprocessor 310, an error diffusion processor 320, an error spread coefficient subsystem 330, threshold generation logic 340, and an error buffer 350. In the embodiment shown, these components are substantially the same as in the prior art ASIC 302 and so are not elaborated upon here.
The principal differences between ASIC 302 and prior art ASIC 502 are the features included to accommodate the addition of passband dither to the input image pixels and to the threshold. However, is to be remembered that in some embodiments of the ASIC 302, much as in the case of the prior art ASIC 302 discussed in the Background section, the microprocessor 310 implements much of the passband dithering of the input pixels in software. Similarly, in other embodiments, no microprocessor is present, and the entire passband dithering and error diffusion processes are implemented in an ASIC devoid of a microprocessor. This can be done with an appropriate combination of dedicated state machines, registers, logic and controls, as is known to those skilled in the art of ASIC design.
As seen
The first coefficient b1 and D[x,y] are input to a first multiplier 376, and this first product is forwarded to first adder 372. At first adder 372, this first product is added to the input pixel value Io[x,y] 305 to form the dithered pixel data In[x,y] 307. Preferably, first coefficient b1 is less than 1.0 so that the output of multiplier 376 (i.e., the passband dither) has a smaller dynamic range than original input pixel values Io[x,y] 305. The second coefficient b2 and the dither value D[x,y] are input to a second multiplier 378, and this second product is forwarded to second adder 374. At second adder 374, this second product is added to the tone-dependent threshold value Tn[Io[x,y]] 342 to produce modified threshold value Tm[x,y] 343, which is then input to the error diffusion processor 320.
It is noted that while ASIC 302 shows that the original input pixel data Io[x,y] 305 is used to index the threshold values in the threshold generation logic 340, one may instead connect the dithered pixel data In[x,y] 307 to the threshold generation logic 340 to thereby use information from the dithered input pixel values to index the threshold values.
It is also noted that in the ASIC implementation of
Furthermore, the microprocessor, or other hardware, can be configured to produce or otherwise provide the various passband dither signals discussed above; look for edges in a region proximate to a pixel of interest and, if appropriate, suspend addition of the first type of passband dither; and determine an average pixel value in a region proximate to a pixel of interest and, if appropriate, take any necessary action, all as discussed above.
In the implementation of ASIC 302, the dithered input pixel values In[x,y] 307 are computed with hardware adders and multipliers. This requires an ASIC with a circuitry slightly different from the prior art ASIC seen in
The foregoing description of some embodiments of the present invention has been presented for purposes of illustration. It is not intended to be exhaustive or to limit the invention to the precise steps and/or forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be defined by the claims appended hereto.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4924322 | Kurosawa et al. | May 1990 | A |
| 5243443 | Eschbach | Sep 1993 | A |
| 6271936 | Yu et al. | Aug 2001 | B1 |
| 6563957 | Li et al. | May 2003 | B1 |
| 7369276 | Couwenhoven et al. | May 2008 | B2 |
| 20030133160 | Sharma et al. | Jul 2003 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20070041053 A1 | Feb 2007 | US |
