CA2655306A1 - Method and apparatus for image manipulation via a dither matrix - Google Patents
Method and apparatus for image manipulation via a dither matrix Download PDFInfo
- Publication number
- CA2655306A1 CA2655306A1 CA002655306A CA2655306A CA2655306A1 CA 2655306 A1 CA2655306 A1 CA 2655306A1 CA 002655306 A CA002655306 A CA 002655306A CA 2655306 A CA2655306 A CA 2655306A CA 2655306 A1 CA2655306 A1 CA 2655306A1
- Authority
- CA
- Canada
- Prior art keywords
- image data
- dither matrix
- colour
- contone image
- levels
- 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.)
- Abandoned
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/407—Control or modification of tonal gradation or of extreme levels, e.g. background level
- H04N1/4072—Control or modification of tonal gradation or of extreme levels, e.g. background level dependent on the contents of the original
- H04N1/4074—Control or modification of tonal gradation or of extreme levels, e.g. background level dependent on the contents of the original using histograms
-
- 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/40087—Multi-toning, i.e. converting a continuous-tone signal for reproduction with more than two discrete brightnesses or optical densities, e.g. dots of grey and black inks on white paper
-
- 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
Abstract
Efficiently processing contone image data by determining one or more characteristics of the image data and using these characteristics to manipulate the dither matrix so that the printed image is enhanced.
Description
METHOD AND APPARATUS FOR IMAGE MANIPULATION VIA A DITHER
MATRIX
FIELD OF THE INVENTION
The present invention relates to digital image processing. In particular, the invention relates to enhancing digital colour images while processing them for printing to a media substrate.
CROSS REFERENCES TO RELATED APPLICATIONS
Various methods, systems and apparatus relating to the present invention are disclosed in the following US Patents/ Patent Applications filed by the applicant or assignee of the present invention:
MATRIX
FIELD OF THE INVENTION
The present invention relates to digital image processing. In particular, the invention relates to enhancing digital colour images while processing them for printing to a media substrate.
CROSS REFERENCES TO RELATED APPLICATIONS
Various methods, systems and apparatus relating to the present invention are disclosed in the following US Patents/ Patent Applications filed by the applicant or assignee of the present invention:
The disclosures of these applications and patents are incorporated herein by reference.
BACKGROUND OF THE INVENTION
A market has developed for inkjet printers that can dock directly with digital cameras.
These printers are expected to download and print the photographs quickly and with a minimum of user input. A significant part of the delay between docking the camera and printing the photographs, is the processing time needed to prepare the image data for the printhead.
BACKGROUND OF THE INVENTION
A market has developed for inkjet printers that can dock directly with digital cameras.
These printers are expected to download and print the photographs quickly and with a minimum of user input. A significant part of the delay between docking the camera and printing the photographs, is the processing time needed to prepare the image data for the printhead.
The major processing tasks are JPEG decompression, colour space conversion, image rotation and halftoning to convert the colour values into dots. These tasks are briefly explained below.
Colour can be specified using three independent variables. The variables are essentially coordinates in a colour space. The same colour can be specified in different colour spaces using different variables. Each colour space has a particular use or application. RGB (red, green, blue) is the natural colour space for devices that emit light such as television screens or computer monitors. CMY (cyan, magenta, yellow) is the natural colour space for devices that display images with reflected light such as printed images from a printer.
YCRCB (luminance, chrominance red, chrominance blue) separates the luminance from the chrominance (usually abbreviated to `chroma') channels for more convenient data compression. Humans are more sensitive to luminance than chroma so any change in chrominance resulting from compression and subsequent decompression will be less noticeable than an equivalent change in luminance. This means both chroma channels can be heavily compressed as long as the luminance is lightly compressed. With two of the three channels heavily compressed, YCC image data is more efficiently handled by the processor.
Digital cameras capture images natively in RGB. For efficient storage, the images are converted to YCC and compressed. hnage data downloaded from a camera is typically in sYCC which is a widely recognized standard form of YCC. This must then be colour space converted when it is output to a screen or printer.
If the image is downloaded to a printer, the data is converted to the pritner's colour space and the separate colour channels are halftoned with a dither matrix.
Halftoning exploits the eye's perception of a spatial average of printed dots to reproduce contone (continuous tone) images. Inkjet printers can either print a dot at any one of the addressable locations 5 on the media, or not. However, dots dispersed over area of white (say) paper, will appear to eye as a contone shade somewhere between white and the dot colour, depending on the number of dots.
The dither matrix covers a small area of the image at a time. The matrix has a range of threshold values dispersed throughout its sites. The contone colour levels for each pixel are compared to the spatially corresponding threshold values within the matrix. If the contone level exceeds the threshold value, a dot of that colour is printed (or equivalently, a dot is printed if the contone level is greater than or equal to the threshold, or less than, or less than or equal to the threshold value). This will produce many micro-differences between the contone and halftone image, but the eye is largely insensitive to these high frequency differences.
To produce a colour image, the separate halftoned images for each of the three colour channels are superimposed by the printer on the media. Printers typically have cyan, magenta, yellow and sometimes black (to conserve the other inks and provide a`truer' black). This is abbreviated to CMYK Ccyan, Magenta, Yellow and b1acK). If the print resolution, or dots per inch (dpi) is high enough, halftoning can reproduce any colour in the printer's gamut (palette of printable colours). Accordingly, the individual dots in CMY(K) space are colour averaged by the eye to reproduce the colours of the original image.
Colour can be specified using three independent variables. The variables are essentially coordinates in a colour space. The same colour can be specified in different colour spaces using different variables. Each colour space has a particular use or application. RGB (red, green, blue) is the natural colour space for devices that emit light such as television screens or computer monitors. CMY (cyan, magenta, yellow) is the natural colour space for devices that display images with reflected light such as printed images from a printer.
YCRCB (luminance, chrominance red, chrominance blue) separates the luminance from the chrominance (usually abbreviated to `chroma') channels for more convenient data compression. Humans are more sensitive to luminance than chroma so any change in chrominance resulting from compression and subsequent decompression will be less noticeable than an equivalent change in luminance. This means both chroma channels can be heavily compressed as long as the luminance is lightly compressed. With two of the three channels heavily compressed, YCC image data is more efficiently handled by the processor.
Digital cameras capture images natively in RGB. For efficient storage, the images are converted to YCC and compressed. hnage data downloaded from a camera is typically in sYCC which is a widely recognized standard form of YCC. This must then be colour space converted when it is output to a screen or printer.
If the image is downloaded to a printer, the data is converted to the pritner's colour space and the separate colour channels are halftoned with a dither matrix.
Halftoning exploits the eye's perception of a spatial average of printed dots to reproduce contone (continuous tone) images. Inkjet printers can either print a dot at any one of the addressable locations 5 on the media, or not. However, dots dispersed over area of white (say) paper, will appear to eye as a contone shade somewhere between white and the dot colour, depending on the number of dots.
The dither matrix covers a small area of the image at a time. The matrix has a range of threshold values dispersed throughout its sites. The contone colour levels for each pixel are compared to the spatially corresponding threshold values within the matrix. If the contone level exceeds the threshold value, a dot of that colour is printed (or equivalently, a dot is printed if the contone level is greater than or equal to the threshold, or less than, or less than or equal to the threshold value). This will produce many micro-differences between the contone and halftone image, but the eye is largely insensitive to these high frequency differences.
To produce a colour image, the separate halftoned images for each of the three colour channels are superimposed by the printer on the media. Printers typically have cyan, magenta, yellow and sometimes black (to conserve the other inks and provide a`truer' black). This is abbreviated to CMYK Ccyan, Magenta, Yellow and b1acK). If the print resolution, or dots per inch (dpi) is high enough, halftoning can reproduce any colour in the printer's gamut (palette of printable colours). Accordingly, the individual dots in CMY(K) space are colour averaged by the eye to reproduce the colours of the original image.
Downloaded images can be manipulated and enhanced on a computer prior to printing.
However, if downloaded directly from a camera to a photo printer, the user does not have an opportunity to manually enhance and view the images prior to printing. Even so, it is possible to incorporate some relatively basic image enhancement into the printer that can be automatically and uniformly applied to the images prior to printing.
One common and relatively basic image enhancement technique is histogram expansion.
It improves the colour contrast by expanding the range of colours present in the raw image data so that it is more evenly spread across the entire range of available colours. To do this, it is necessary to collect image statistics and build histograms for each colour channel.
This involves the collection of the three colour levels for each pixel and recording the number of pixels that fall into a range of discrete colour level intervals to build the histograms. Usually the original image will have histograms with at least one sparsely populated region. By re-assigning all the pixels in the sparsely populated region into one of the colour levels, the rest of the histogram can expand into the vacated region.
Spreading the pixels more evenly across the histogram improves the colour contrast. As the number of pixels in the sparsely populated regions is insignificant, reassigning them to a single colour level has little, if any, detrimental effect on the image. So in the vast majority of cases, the net effect of histogram expansion is an enhancement of the image.
Unfortunately, the processing tasks associated with histogram expansion can delay printing. In some printing applications, there is an expectation that the printer will start printing the downloaded images almost instantly. Photograph printers that dock directly with the camera are one such example. The captured images will typically download from the camera upon docking and automatically print the images to 6 inch by 4 inch photo grade paper. Users prefer, if not expect, to see their photos being printed within a few seconds. More importantly, users expect good quality prints, but, as discussed above, computationally intensive image enhancement is counter to quickly initiating the printing of downloaded photos.
SUMMARY OF THE INVENTION
According to a first aspect, the present invention provides a method of manipulating contone image data to be halftoned with a dither matrix, the method comprising:
determining at least one characteristic of the contone image data;
using the at least one characteristic to derive a secondary dither matrix from a predetermined primary dither matrix; and, halftoning the contone image data with the secondary dither matrix.
Manipulating the dither matrix can be equivalent to performing image enhancement manipulations to the input image data. However, it far less computationally intensive to manipulate the dither matrix instead of all the raw image data. For example, if the dither matrix is (say) 64 x 64, with each element being an 8 bit value, it has roughly 4 kilobytes of data. By comparison, a digital photograph (6 inches by 4 inches) at 3 mega-pixel native resolution, is about 10 megabytes of data. So, in this example, the number of manipulations to the dither matrix is about three orders of magnitude less than that needed for the image data to achieve the same net effect. As discussed above, histogram expansions are a very common image enhancement technique and simply compressing the range of threshold values in the dither matrix as an inverse to the desired expansion of the histogram provides an equivalent result with far less processing. Furthermore, as the data in the dither matrix is a tiny fraction of the input data, the dither matrix can be given added complexity, or granularity, in order to achieve a better result than a normal histogram expansion, while still providing greater computation efficiency.
According to a second aspect, the present invention provides a print engine controller for an inkjet printer, the print engine controller comprising:
a processor for receiving contone image data;
memory storing a predetermined primary dither matrix; wherein, the processor is configured to determine at least one characteristic of the contone image data and derive a secondary dither matrix from the primary dither matrix using the at least one characteristic of the contone image data; such that, the contone image data is halftoned with the secondary dither matrix prior to printing.
Preferably, the contone image data has colour level values for pixels in the image, the colour level values having a certain distribution within a predetermined range of discrete colour levels, and, the at least one characteristic of the contone image data relates to said certain distribution.
Preferably, the primary dither matrix has a range of threshold values and the secondary dither matrix has a compressed range of threshold values for comparison to the colour level values of the contone image data during halftoning.
In a further preferred form, the at least one characteristic related to the certain distribution is the minimum number of contiguous discrete colour levels containing a predetermined portion of the pixels, divided by the total number of levels in the predetermined range of discrete colour levels. In some embodiments, the predetermined portion of the pixels is greater than 90%.
Optionally, the at least one characteristic related to the certain distribution is:
(Lmax - Lmin)/Ltotal Where:
Lm,,, is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
Lm;,, is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, Ltotal is the total number of levels in the range of discrete colour levels.
In these embodiments, the top-most portion may be the highest 5% of the colour level values of the contone image data. Likewise, the bottom-most portion may be the lowest 5% of the colour level values of the contone image data. In a less aggressive enhancement, the top and bottom-most portions may be 1 10.
In preferred embodiments, the threshold values in the compressed range in the secondary matrix are determined in accordance with the following algorithm:
Tri. = Lin + To1d=(Lmax - Lmin)/Ltotal where:
TneW is the compressed threshold values in the secondary dither matrix; and, Told is the threshold value in the primary dither matrix.
Optionally, at least some of the thresholds in the primary dither matrix are not whole numbers and the compressed threshold values in the secondary matrix are rounded or truncated to the nearest whole numbers. In other options, the threshold values occur in the primary dither matrix a predetermined number of times and the compressed threshold 5 values occur in the secondary dither matrix a greater number of times, the greater number being approximately equal to Ltocal/(LmaX Lõi) multiplied by the predetermined number associated with the threshold values of the primary matrix, or only one of two colliding threshold values from the primary matrix, that correspond to the compressed threshold.
However, if downloaded directly from a camera to a photo printer, the user does not have an opportunity to manually enhance and view the images prior to printing. Even so, it is possible to incorporate some relatively basic image enhancement into the printer that can be automatically and uniformly applied to the images prior to printing.
One common and relatively basic image enhancement technique is histogram expansion.
It improves the colour contrast by expanding the range of colours present in the raw image data so that it is more evenly spread across the entire range of available colours. To do this, it is necessary to collect image statistics and build histograms for each colour channel.
This involves the collection of the three colour levels for each pixel and recording the number of pixels that fall into a range of discrete colour level intervals to build the histograms. Usually the original image will have histograms with at least one sparsely populated region. By re-assigning all the pixels in the sparsely populated region into one of the colour levels, the rest of the histogram can expand into the vacated region.
Spreading the pixels more evenly across the histogram improves the colour contrast. As the number of pixels in the sparsely populated regions is insignificant, reassigning them to a single colour level has little, if any, detrimental effect on the image. So in the vast majority of cases, the net effect of histogram expansion is an enhancement of the image.
Unfortunately, the processing tasks associated with histogram expansion can delay printing. In some printing applications, there is an expectation that the printer will start printing the downloaded images almost instantly. Photograph printers that dock directly with the camera are one such example. The captured images will typically download from the camera upon docking and automatically print the images to 6 inch by 4 inch photo grade paper. Users prefer, if not expect, to see their photos being printed within a few seconds. More importantly, users expect good quality prints, but, as discussed above, computationally intensive image enhancement is counter to quickly initiating the printing of downloaded photos.
SUMMARY OF THE INVENTION
According to a first aspect, the present invention provides a method of manipulating contone image data to be halftoned with a dither matrix, the method comprising:
determining at least one characteristic of the contone image data;
using the at least one characteristic to derive a secondary dither matrix from a predetermined primary dither matrix; and, halftoning the contone image data with the secondary dither matrix.
Manipulating the dither matrix can be equivalent to performing image enhancement manipulations to the input image data. However, it far less computationally intensive to manipulate the dither matrix instead of all the raw image data. For example, if the dither matrix is (say) 64 x 64, with each element being an 8 bit value, it has roughly 4 kilobytes of data. By comparison, a digital photograph (6 inches by 4 inches) at 3 mega-pixel native resolution, is about 10 megabytes of data. So, in this example, the number of manipulations to the dither matrix is about three orders of magnitude less than that needed for the image data to achieve the same net effect. As discussed above, histogram expansions are a very common image enhancement technique and simply compressing the range of threshold values in the dither matrix as an inverse to the desired expansion of the histogram provides an equivalent result with far less processing. Furthermore, as the data in the dither matrix is a tiny fraction of the input data, the dither matrix can be given added complexity, or granularity, in order to achieve a better result than a normal histogram expansion, while still providing greater computation efficiency.
According to a second aspect, the present invention provides a print engine controller for an inkjet printer, the print engine controller comprising:
a processor for receiving contone image data;
memory storing a predetermined primary dither matrix; wherein, the processor is configured to determine at least one characteristic of the contone image data and derive a secondary dither matrix from the primary dither matrix using the at least one characteristic of the contone image data; such that, the contone image data is halftoned with the secondary dither matrix prior to printing.
Preferably, the contone image data has colour level values for pixels in the image, the colour level values having a certain distribution within a predetermined range of discrete colour levels, and, the at least one characteristic of the contone image data relates to said certain distribution.
Preferably, the primary dither matrix has a range of threshold values and the secondary dither matrix has a compressed range of threshold values for comparison to the colour level values of the contone image data during halftoning.
In a further preferred form, the at least one characteristic related to the certain distribution is the minimum number of contiguous discrete colour levels containing a predetermined portion of the pixels, divided by the total number of levels in the predetermined range of discrete colour levels. In some embodiments, the predetermined portion of the pixels is greater than 90%.
Optionally, the at least one characteristic related to the certain distribution is:
(Lmax - Lmin)/Ltotal Where:
Lm,,, is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
Lm;,, is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, Ltotal is the total number of levels in the range of discrete colour levels.
In these embodiments, the top-most portion may be the highest 5% of the colour level values of the contone image data. Likewise, the bottom-most portion may be the lowest 5% of the colour level values of the contone image data. In a less aggressive enhancement, the top and bottom-most portions may be 1 10.
In preferred embodiments, the threshold values in the compressed range in the secondary matrix are determined in accordance with the following algorithm:
Tri. = Lin + To1d=(Lmax - Lmin)/Ltotal where:
TneW is the compressed threshold values in the secondary dither matrix; and, Told is the threshold value in the primary dither matrix.
Optionally, at least some of the thresholds in the primary dither matrix are not whole numbers and the compressed threshold values in the secondary matrix are rounded or truncated to the nearest whole numbers. In other options, the threshold values occur in the primary dither matrix a predetermined number of times and the compressed threshold 5 values occur in the secondary dither matrix a greater number of times, the greater number being approximately equal to Ltocal/(LmaX Lõi) multiplied by the predetermined number associated with the threshold values of the primary matrix, or only one of two colliding threshold values from the primary matrix, that correspond to the compressed threshold.
10 In some preferred embodiments the processor only samples a portion of the pixels of the contone image data to determine Lm;,, and Lma,,.
Optionally, the colour levels values are an eight bit binary number such that there are 256 (28) levels in the range of discrete colour levels. Optionally, the dither matrix is 64 x 64 and the threshold levels range from 1 to 255 prior to compression.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention will now be described, by way of example only, with reference to the preferred embodiments shown in the accompanying drawings in which:
Figure 1 shows a print engine pipeline in accordance with the present invention;
Figure 2 shows a dither matrix partially completed with threshold values;
Figure 3 shows a histogram of the image data for one of the colour channels;
Optionally, the colour levels values are an eight bit binary number such that there are 256 (28) levels in the range of discrete colour levels. Optionally, the dither matrix is 64 x 64 and the threshold levels range from 1 to 255 prior to compression.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention will now be described, by way of example only, with reference to the preferred embodiments shown in the accompanying drawings in which:
Figure 1 shows a print engine pipeline in accordance with the present invention;
Figure 2 shows a dither matrix partially completed with threshold values;
Figure 3 shows a histogram of the image data for one of the colour channels;
Figure 4 shows the histogram of Figure 3 expanded to enhance colour contrast;
Figure 5 shows the dither matrix with compressed threshold values calculated to two decimal places; and, Figure 6 shows the dither matrix with compressed threshold values rounded to the nearest whole number.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
As discussed in the Background to the Invention, photograph printers have recently been developed that dock directly with a digital camera and automatically printed the captured images. They are expected to print the images quickly and with photographic quality.
Furthermore, these printers will only offer rudimentary image enhancement options, if any at all. Users that want more complex image enhancement of their photos will download the images to desktops or laptops and manipulate them with PhotoShopTM or similar software (note that PhotoShop is a trademark of Adobe Systems Inc).
As the present invention offers basic image enhancement with computational efficiency, it is well suited to photo printers. In light of this, it will be described with specific reference to this application. However, skilled workers will readily appreciate that the invention is not limited to photo printers and is suitable for a wide range of applications.
Figure 1 shows a print engine pipeline for the image data from the camera 1 to the printhead 13. When the camera docks with the printer, the images are downloaded to the print engine controller (PEC) 2 as EXIF (exchangeable image file data) JPEG
(joint photographic expert group) files in sYCC colour space (or standard YCC colour space).
Figure 5 shows the dither matrix with compressed threshold values calculated to two decimal places; and, Figure 6 shows the dither matrix with compressed threshold values rounded to the nearest whole number.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
As discussed in the Background to the Invention, photograph printers have recently been developed that dock directly with a digital camera and automatically printed the captured images. They are expected to print the images quickly and with photographic quality.
Furthermore, these printers will only offer rudimentary image enhancement options, if any at all. Users that want more complex image enhancement of their photos will download the images to desktops or laptops and manipulate them with PhotoShopTM or similar software (note that PhotoShop is a trademark of Adobe Systems Inc).
As the present invention offers basic image enhancement with computational efficiency, it is well suited to photo printers. In light of this, it will be described with specific reference to this application. However, skilled workers will readily appreciate that the invention is not limited to photo printers and is suitable for a wide range of applications.
Figure 1 shows a print engine pipeline for the image data from the camera 1 to the printhead 13. When the camera docks with the printer, the images are downloaded to the print engine controller (PEC) 2 as EXIF (exchangeable image file data) JPEG
(joint photographic expert group) files in sYCC colour space (or standard YCC colour space).
The PEC 2 decompresses the images with a contone decoder unit (CDU) 3. If the image is too large 4, it is downsampled 5 as it is decoded.
As the pixel data from each JPEG MCU (minimum coding unit) becomes available, it is rotated and converted to the specific CMY colour space 7 of the printhead 13.
Once the data is in the CMY space, the PEC 2 can collect image statistics and build a histogram S. The collection of image statistics involves building a histogram of the number of occurrences of each color level. Once the histograms for the image are known, the degree of histogram expansion can be determined. This can be done in any number of ways and one particular method will be discussed below with reference to Figures 3 and 4.
Expanding the histogram requires new maximum and minimum colour levels to be determined 9. That is, a minimum level, "- , is determined and mapped to 0.
All levels between 0 and LII,;n are also mapped to 0. Likewise, Lna,, is determined and mapped to the highest colour level value. For example, if the colour levels are 8 bit numbers, the highest is 255. Every level between ",, and 255 is also mapped to 255.
However, as the present invention manipulates the dither matrix to enhance the image rather than the colour levels in the image data, the only characteristic of the histogram that the PEC 2 needs is the degree of histogram expansion that would be caused by the Lm; and Lm. determined by the chosen method. There is no need to map any of the colour levels in the image data to new levels.
As the pixel data from each JPEG MCU (minimum coding unit) becomes available, it is rotated and converted to the specific CMY colour space 7 of the printhead 13.
Once the data is in the CMY space, the PEC 2 can collect image statistics and build a histogram S. The collection of image statistics involves building a histogram of the number of occurrences of each color level. Once the histograms for the image are known, the degree of histogram expansion can be determined. This can be done in any number of ways and one particular method will be discussed below with reference to Figures 3 and 4.
Expanding the histogram requires new maximum and minimum colour levels to be determined 9. That is, a minimum level, "- , is determined and mapped to 0.
All levels between 0 and LII,;n are also mapped to 0. Likewise, Lna,, is determined and mapped to the highest colour level value. For example, if the colour levels are 8 bit numbers, the highest is 255. Every level between ",, and 255 is also mapped to 255.
However, as the present invention manipulates the dither matrix to enhance the image rather than the colour levels in the image data, the only characteristic of the histogram that the PEC 2 needs is the degree of histogram expansion that would be caused by the Lm; and Lm. determined by the chosen method. There is no need to map any of the colour levels in the image data to new levels.
The histogram is expanded by a factor of 255/(Lmax-Lm;n). Hence, the corresponding compression of the range of threshold values in the dither matrix is given by:
Tnew = Lmin + Totd=(Lmax - Lmin)/255 EQ(l) Where:
Tnew is the compressed threshold; and, Told is the original threshold value.
If the dither matrix size is 64 x 64, then compressing the threshold values involves the manipulation of about 4kB of data, whereas the equivalent expansion of the input colour levels is a manipulation of about 10MB of data, or possibly more depending on image resolution. Compressing the dither matrix is more computationally efficient than expanding the image data by several orders of magnitude. This can dramatically reduce any delay between docking the camera and printing the downloading images, and it also allows more complex image enhance techniques via the dither matrix while still remaining far less computationally intensive than performing equivalent techniques on the input data.
Once the compressed dither matrix values have been calculated 10, the CMY
colour values determined at stage 7 of the print engine pipeline, are compared directly with the compressed threshold values of the dither matrix to produce a halftone image of each colour channel 11. It will be appreciated that the same matrix can be used for each channel, or separate dither matrices derived from respective histograms could be used for each colour channel.
The halftoned images are sent to the printhead 13 for printing 12 to complete the pipeline.
Tnew = Lmin + Totd=(Lmax - Lmin)/255 EQ(l) Where:
Tnew is the compressed threshold; and, Told is the original threshold value.
If the dither matrix size is 64 x 64, then compressing the threshold values involves the manipulation of about 4kB of data, whereas the equivalent expansion of the input colour levels is a manipulation of about 10MB of data, or possibly more depending on image resolution. Compressing the dither matrix is more computationally efficient than expanding the image data by several orders of magnitude. This can dramatically reduce any delay between docking the camera and printing the downloading images, and it also allows more complex image enhance techniques via the dither matrix while still remaining far less computationally intensive than performing equivalent techniques on the input data.
Once the compressed dither matrix values have been calculated 10, the CMY
colour values determined at stage 7 of the print engine pipeline, are compared directly with the compressed threshold values of the dither matrix to produce a halftone image of each colour channel 11. It will be appreciated that the same matrix can be used for each channel, or separate dither matrices derived from respective histograms could be used for each colour channel.
The halftoned images are sent to the printhead 13 for printing 12 to complete the pipeline.
Figure 2 shows an example of a 64 by 64 dither matrix. For simplicity, it is only partially completed with the range of threshold values. If the threshold values are 8 bit (corresponding to 8 bit colour levels), there are 255 thresholds. All 255 threshold levels appear in the matrix a number of times and the number of times a particular threshold occurs depends on the characteristics of the printhead and the aim to achieve a perceptually uniform colour space.
As discussed above, the dither matrix is repeatedly tiled across the contone image and the separate colour levels for pixel are compared to a corresponding threshold in the dither matrix. If the colour level exceeds the threshold, the printhead will eject a drop (of that particular colour) at that location, and if it is less than the threshold, no drop is ejected.
Because the eye spatially averages the colour, it does not see the high frequency differences between the contone image and the halftoned image.
Referring now to Figure 4, the histogram for input image data is shown. Lm;,l and L~,,ax can be derived in any number of ways. For example, many images will not have a pixel at level 0, or a pixel at leve1256. In this case, Lmi,l and Lax can simply be the highest and lowest colour levels sampled. However, this does not take into account the tendency for the highest and lowest sampled colour levels to be outliers from the histogram distribution.
Hence, using outliers as Lõffi and Lmax usually means the histogram is not expanded as much as it should.
A better approach is to select a portion of the pixels at either end of the histogram and set the highest of the low end portion to be L., and the lowest of the high end portion to be L. Some experimentation may be required to optimize for each print engine pipeline, but taking the top and bottom 1/256 (or approximately 0.4%) of the histogram will usually account for any outliers. In other words, 0.4% of the samples are below L. and 0.4% of the samples are above L... This approach is likely to provide visually better results than simply taking the extreme levels however, it is slightly more computationally intensive.
5 There is also a risk of over expansion by taking a percentage from the top and bottom of the histogram. Too much expansion can introduce visible contouring in areas of with a ramped colour gradient (because of the large colour differences between adjacent pixels after expansion). To guard against this, the processor might impose a maximum allowable expansion.
Once L. and Lm. have been determined, any samples at L. or below are mapped to 0, and any sample at Lmax or more are mapped to 256. As shown in Figure 5, the remainder of the histogram is then expanded between 0 and 255. There are spikes at 0 and 256 because they now contain all the original L,,; and La' samples, as well as the outliers. However, this is not likely to have any detrimental effect on image quality.
Traditionally, histrogram expansion has been done with the level mapping function given by:
L new = 256.(Loia - Lmin)/(Lmax-l-min) EQ(2) This function would be applied to the input levels to determine the expanded levels, the expanded levels then compared to the threshold values of the dither matrix.
Therefore, it is equivalent and computationally easier to compress the range of threshold values by the inverse of the expansion that would otherwise be performed on the histogram.
The algorithm for mapping each of the original threshold values to new threshold values is given by equation 1 discussed above.
Figure 5 shows the dither matrix of Figure 2 compressed in accordance with equation 1.
Unfortunately, the compressed threshold values must be rounded or truncated to whole numbers as the hardware requires the dithering process to be a whole number comparison.
Hence the threshold values of Figure 2 are rounded to give the whole number thresholds shown in Figure 6.
Manipulating the input levels via the dither matrix also presents an opportunity to improve the image enhancement beyond that offered by histogram expansion.
During histogram expansion, mapping the old levels to new levels via equation 2 involves rounding as the new levels need to be integers (because of the printer hardware). Hence, some of the levels in the expanded histogram have no samples in them. As shown in Figure 4, these appear as gaps in the histogram. The colour difference between samples on either side of a gap is greater than the difference between the same samples in the unexpanded histogram. These increased colour differences are more likely to produce visible contouring in the printed image.
Likewise, rounding (or truncating) the compressed threshold values in the dither matrix causes some of the thresholds to collide. For example, the shaded thresholds in the compressed matrix of Figure 6 are pairs of equal value whereas, the corresponding threshold in the original matrix (see Figure 2) were not equal. Consequently, the number of dots added when moving from one tone level to the next will not be smooth.
Again, this increases the risk of visible contouring in the printed image.
Increasing the granularity of the dither matrix (that is, using threshold values greater than 8 bits), would avoid collisions and smooth out the number of dots added to the halftone image with each subsequent tone level. Unfortunately, in most printers, the comparison of the dither matrix with the contone CMY levels is a hardware function that requires the threshold values to be 8 bit integers only.
Alternatively, the software can reconstruct the original dither matrix at a higher granularity for a perceptually smooth transition between tone levels. This will effectively add sub-levels to each threshold so any collisions will between 2 sub-levels and consequently involve far fewer dots.
The problem of threshold collision and the solution of higher granularity are illustrated in the tables below. Firstly, Table 1 shows the number of times some threshold values appear in the original matrix and the compressed matrix. The 64 by 64 matrix has 4096 elements so each of the 1 to 255 original threshold values will occur 4096/255, or about 16 times in the original matrix. When the matrix is compressed, rounding causes some of the original thresholds to map to the same compressed threshold. These colliding thresholds appear 32 times in the compressed matrix (e.g. compressed threshold 38 in Figure 6). So the number of dots added when moving from tone level 37 to 38, will be twice that of moving 38 to 39, or 36 to 37. Hence the increased risk of visually perceptible contouring.
Original Threshold Occurrences in Compressed Occurrences in Original Matrix Threshold Compressed Matrix (Rounded) Table 1: Inconsistent Occurrences of Compressed Thresholds because of Threshold Collision For the purposes of this example, we will assume the thresholds in the compressed matrix should occur 21 times each (4096/(Lmax-Lmin) = 21.005 - so one threshold would occur 22 times) for least risk of visible contours. By adding granularity to the original matrix, the occurrences of the compressed thresholds can be more uniform. For example, if the original threshold values are 12 bit (or rather 8.2 bit) the original matrix essentially gains extra threshold levels. Table 2 sets out the finer grained original thresholds and the smoothing effect this has on the compressed matrix.
Original Threshold Occurrences in Compressed Occurrences in Original Matrix Threshold Compressed Matrix (Rounded) 35.00 4 47 20 35.25 4 47 35.50 4 47 35.75 4 47 36.00 4 47 36.25 4 48 20 36.50 4 48 36.75 4 48 37.00 4 48 37.25 4 48 37.50 4 49 20 37.75 4 49 38.00 4 49 38.25 4 49 38.50 4 49 38.75 4 50 24 39.00 4 50 39.25 4 50 39.50 4 50 39.75 4 50 40.00 4 50 With the increased granularity, there are smaller inconsistencies in the number of times the compressed thresholds appear in the final matrix. Most compressed thresholds occur 20 times with about a quarter appearing 24 times. Therefore, moving from one tone level to the next is smoother and there is far less likelihood of any visible contouring.
Instead of increasing the granularity of the original matrix, it may be simpler to multiply the number of times each threshold appears in the original matrix by the inverse of the compression to determine the number of times the compressed threshold appears in the final matrix. Referring again to the above example, the inverse of the compression is 256/(LmaX - Lm;,,) = 1.313. If an original threshold occurred 16 times in the matrix, the compressed threshold might ideally occur 1.313x16 = 21 (with one threshold occurring 22 5 times). Of course, if two original thresholds are colliding at a single compressed threshold, the occurrences of only one of the original thresholds should be used to determine how many times the compressed threshold occurs.
Enhancing the image by manipulating the dither matrix means that gathering image 10 statistics can be reasonably heavily optimized because the impact of granularity issues on the final matrix (and therefore the printed image) is relatively minor. For example, in some applications, the histogram need not have 2561evels. 641evels (6 bit) may be adequate. When building the histogram, it may not be necessary to collect statistics for every pixel. Sampling as little as 1 in 256 pixels can be within acceptable output errors.
As discussed above, the dither matrix is repeatedly tiled across the contone image and the separate colour levels for pixel are compared to a corresponding threshold in the dither matrix. If the colour level exceeds the threshold, the printhead will eject a drop (of that particular colour) at that location, and if it is less than the threshold, no drop is ejected.
Because the eye spatially averages the colour, it does not see the high frequency differences between the contone image and the halftoned image.
Referring now to Figure 4, the histogram for input image data is shown. Lm;,l and L~,,ax can be derived in any number of ways. For example, many images will not have a pixel at level 0, or a pixel at leve1256. In this case, Lmi,l and Lax can simply be the highest and lowest colour levels sampled. However, this does not take into account the tendency for the highest and lowest sampled colour levels to be outliers from the histogram distribution.
Hence, using outliers as Lõffi and Lmax usually means the histogram is not expanded as much as it should.
A better approach is to select a portion of the pixels at either end of the histogram and set the highest of the low end portion to be L., and the lowest of the high end portion to be L. Some experimentation may be required to optimize for each print engine pipeline, but taking the top and bottom 1/256 (or approximately 0.4%) of the histogram will usually account for any outliers. In other words, 0.4% of the samples are below L. and 0.4% of the samples are above L... This approach is likely to provide visually better results than simply taking the extreme levels however, it is slightly more computationally intensive.
5 There is also a risk of over expansion by taking a percentage from the top and bottom of the histogram. Too much expansion can introduce visible contouring in areas of with a ramped colour gradient (because of the large colour differences between adjacent pixels after expansion). To guard against this, the processor might impose a maximum allowable expansion.
Once L. and Lm. have been determined, any samples at L. or below are mapped to 0, and any sample at Lmax or more are mapped to 256. As shown in Figure 5, the remainder of the histogram is then expanded between 0 and 255. There are spikes at 0 and 256 because they now contain all the original L,,; and La' samples, as well as the outliers. However, this is not likely to have any detrimental effect on image quality.
Traditionally, histrogram expansion has been done with the level mapping function given by:
L new = 256.(Loia - Lmin)/(Lmax-l-min) EQ(2) This function would be applied to the input levels to determine the expanded levels, the expanded levels then compared to the threshold values of the dither matrix.
Therefore, it is equivalent and computationally easier to compress the range of threshold values by the inverse of the expansion that would otherwise be performed on the histogram.
The algorithm for mapping each of the original threshold values to new threshold values is given by equation 1 discussed above.
Figure 5 shows the dither matrix of Figure 2 compressed in accordance with equation 1.
Unfortunately, the compressed threshold values must be rounded or truncated to whole numbers as the hardware requires the dithering process to be a whole number comparison.
Hence the threshold values of Figure 2 are rounded to give the whole number thresholds shown in Figure 6.
Manipulating the input levels via the dither matrix also presents an opportunity to improve the image enhancement beyond that offered by histogram expansion.
During histogram expansion, mapping the old levels to new levels via equation 2 involves rounding as the new levels need to be integers (because of the printer hardware). Hence, some of the levels in the expanded histogram have no samples in them. As shown in Figure 4, these appear as gaps in the histogram. The colour difference between samples on either side of a gap is greater than the difference between the same samples in the unexpanded histogram. These increased colour differences are more likely to produce visible contouring in the printed image.
Likewise, rounding (or truncating) the compressed threshold values in the dither matrix causes some of the thresholds to collide. For example, the shaded thresholds in the compressed matrix of Figure 6 are pairs of equal value whereas, the corresponding threshold in the original matrix (see Figure 2) were not equal. Consequently, the number of dots added when moving from one tone level to the next will not be smooth.
Again, this increases the risk of visible contouring in the printed image.
Increasing the granularity of the dither matrix (that is, using threshold values greater than 8 bits), would avoid collisions and smooth out the number of dots added to the halftone image with each subsequent tone level. Unfortunately, in most printers, the comparison of the dither matrix with the contone CMY levels is a hardware function that requires the threshold values to be 8 bit integers only.
Alternatively, the software can reconstruct the original dither matrix at a higher granularity for a perceptually smooth transition between tone levels. This will effectively add sub-levels to each threshold so any collisions will between 2 sub-levels and consequently involve far fewer dots.
The problem of threshold collision and the solution of higher granularity are illustrated in the tables below. Firstly, Table 1 shows the number of times some threshold values appear in the original matrix and the compressed matrix. The 64 by 64 matrix has 4096 elements so each of the 1 to 255 original threshold values will occur 4096/255, or about 16 times in the original matrix. When the matrix is compressed, rounding causes some of the original thresholds to map to the same compressed threshold. These colliding thresholds appear 32 times in the compressed matrix (e.g. compressed threshold 38 in Figure 6). So the number of dots added when moving from tone level 37 to 38, will be twice that of moving 38 to 39, or 36 to 37. Hence the increased risk of visually perceptible contouring.
Original Threshold Occurrences in Compressed Occurrences in Original Matrix Threshold Compressed Matrix (Rounded) Table 1: Inconsistent Occurrences of Compressed Thresholds because of Threshold Collision For the purposes of this example, we will assume the thresholds in the compressed matrix should occur 21 times each (4096/(Lmax-Lmin) = 21.005 - so one threshold would occur 22 times) for least risk of visible contours. By adding granularity to the original matrix, the occurrences of the compressed thresholds can be more uniform. For example, if the original threshold values are 12 bit (or rather 8.2 bit) the original matrix essentially gains extra threshold levels. Table 2 sets out the finer grained original thresholds and the smoothing effect this has on the compressed matrix.
Original Threshold Occurrences in Compressed Occurrences in Original Matrix Threshold Compressed Matrix (Rounded) 35.00 4 47 20 35.25 4 47 35.50 4 47 35.75 4 47 36.00 4 47 36.25 4 48 20 36.50 4 48 36.75 4 48 37.00 4 48 37.25 4 48 37.50 4 49 20 37.75 4 49 38.00 4 49 38.25 4 49 38.50 4 49 38.75 4 50 24 39.00 4 50 39.25 4 50 39.50 4 50 39.75 4 50 40.00 4 50 With the increased granularity, there are smaller inconsistencies in the number of times the compressed thresholds appear in the final matrix. Most compressed thresholds occur 20 times with about a quarter appearing 24 times. Therefore, moving from one tone level to the next is smoother and there is far less likelihood of any visible contouring.
Instead of increasing the granularity of the original matrix, it may be simpler to multiply the number of times each threshold appears in the original matrix by the inverse of the compression to determine the number of times the compressed threshold appears in the final matrix. Referring again to the above example, the inverse of the compression is 256/(LmaX - Lm;,,) = 1.313. If an original threshold occurred 16 times in the matrix, the compressed threshold might ideally occur 1.313x16 = 21 (with one threshold occurring 22 5 times). Of course, if two original thresholds are colliding at a single compressed threshold, the occurrences of only one of the original thresholds should be used to determine how many times the compressed threshold occurs.
Enhancing the image by manipulating the dither matrix means that gathering image 10 statistics can be reasonably heavily optimized because the impact of granularity issues on the final matrix (and therefore the printed image) is relatively minor. For example, in some applications, the histogram need not have 2561evels. 641evels (6 bit) may be adequate. When building the histogram, it may not be necessary to collect statistics for every pixel. Sampling as little as 1 in 256 pixels can be within acceptable output errors.
15 When calculating LlõaX and L., portions of the image that can no longer have any impact on the end points of the histogram, may be ignored. Likewise, reasonable results may be obtained by computing or looking up a minimum and maximum value from each colour point, rather than each of the individual CMY values. All these optimizations serve to reduce the processing burden on the PEC, and so shorten the time between docking the 20 camera and printing the images.
The invention has been described here by way of example only. Skilled workers in this field will readily recognize many variations and modifications that do not depart from the spirit and scope of the broad inventive concept.
The invention has been described here by way of example only. Skilled workers in this field will readily recognize many variations and modifications that do not depart from the spirit and scope of the broad inventive concept.
Claims (20)
1. A method of manipulating contone image data to be halftoned with a dither matrix, the method comprising:
determining at least one characteristic of the contone image data;
using the at least one characteristic to derive a secondary dither matrix from a predetermined primary dither matrix; and, halftoning the contone image data with the secondary dither matrix.
determining at least one characteristic of the contone image data;
using the at least one characteristic to derive a secondary dither matrix from a predetermined primary dither matrix; and, halftoning the contone image data with the secondary dither matrix.
2. A method according to claim 1 wherein the contone image data has colour level values for pixels in the image, the colour level values having a certain distribution within a predetermined range of discrete colour levels, and, the at least one characteristic of the contone image data relates to said certain distribution.
3. A method according to claim 2 wherein the primary dither matrix has a range of threshold values and the secondary dither matrix has a compressed range of threshold values for comparison to the colour level values of the contone image data during halftoning.
4. A method according to claim 2 wherein the at least one characteristic related to the certain distribution is the minimum number of contiguous discrete colour levels containing a predetermined portion of the pixels, divided by the total number of levels in the predetermined range of discrete colour levels.
5. A method according to claim 4 wherein the predetermined portion of the pixels is greater than 90%.
6. A method according to claim 2 wherein the at least one characteristic related to the certain distribution is:
(L max - L min/L total where:
L max is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
L min is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, L total is the total number of levels in the range of discrete colour levels.
(L max - L min/L total where:
L max is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
L min is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, L total is the total number of levels in the range of discrete colour levels.
7. A method according to claim 6 wherein the top-most portion are the highest 5% of the colour level values of the contone image data and the bottom-most portion may be the lowest 5% of the colour level values of the contone image data.
8. A method according to claim 7 wherein the top and bottom-most portions are 1% of the colour level values of the contone image data.
9. A method according to claim 7 wherein the threshold values in the compressed range in the secondary matrix are determined in accordance with the following algorithm:
T new = L min + T old.cndot.(L max - L min)/L total where:
T new is the compressed threshold values in the secondary dither matrix; and, T old is the threshold value in the primary dither matrix.
T new = L min + T old.cndot.(L max - L min)/L total where:
T new is the compressed threshold values in the secondary dither matrix; and, T old is the threshold value in the primary dither matrix.
10. A method according to claim 9 wherein at least some of the thresholds in the primary dither matrix are not whole numbers and the compressed threshold values in the secondary matrix are rounded or truncated to the nearest whole numbers. In other options, the threshold values occur in the primary dither matrix a predetermined number of times and the compressed threshold values occur in the secondary dither matrix a greater number of times, the greater number being approximately equal to L total/(L max-L
min) multiplied by the predetermined number associated with the threshold values of the primary matrix, or only one of two colliding threshold values from the primary matrix, that correspond to the compressed threshold.
min) multiplied by the predetermined number associated with the threshold values of the primary matrix, or only one of two colliding threshold values from the primary matrix, that correspond to the compressed threshold.
11. A print engine controller for an inkjet printer, the print engine controller comprising:
a processor for receiving contone image data;
memory storing a predetermined primary dither matrix; wherein, the processor is configured to determine at least one characteristic of the contone image data and derive a secondary dither matrix from the primary dither matrix using the at least one characteristic of the contone image data; such that, the contone image data is halftoned with the secondary dither matrix prior to printing.
a processor for receiving contone image data;
memory storing a predetermined primary dither matrix; wherein, the processor is configured to determine at least one characteristic of the contone image data and derive a secondary dither matrix from the primary dither matrix using the at least one characteristic of the contone image data; such that, the contone image data is halftoned with the secondary dither matrix prior to printing.
12. A print engine controller according to claim 11 wherein the contone image data has colour level values for pixels in the image, the colour level values having a certain distribution within a predetermined range of discrete colour levels, and, the at least one characteristic of the contone image data relates to said certain distribution.
13. A print engine controller according to claim 12 wherein the primary dither matrix has a range of threshold values and the secondary dither matrix has a compressed range of threshold values for comparison to the colour level values of the contone image data during halftoning.
14. A print engine controller according to claim 13 wherein the at least one characteristic related to the certain distribution is the minimum number of contiguous discrete colour levels containing a predetermined portion of the pixels, divided by the total number of levels in the predetermined range of discrete colour levels.
15. A print engine controller according to claim 13 wherein the at least one characteristic related to the certain distribution is:
(L max - L min)/L total where:
L max is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
L min is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, L total is the total number of levels in the range of discrete colour levels.
(L max - L min)/L total where:
L max is the maximum number of discrete colour levels if a top-most portion of the colour level values of the contone image data is disregarded;
L min is the minimum number of discrete colour levels that contain a bottom-most number of the colour level values of the contone image data; and, L total is the total number of levels in the range of discrete colour levels.
16. A print engine controller according to claim 15 wherein the top-most portion are the highest 5% of the colour level values of the contone image data and the bottom-most portion are the lowest 5% of the colour level values of the contone image data.
17. A print engine controller according to claim 13 wherein the threshold values in the compressed range in the secondary matrix are determined in accordance with the following algorithm:
T new = L min + T old.cndot.(L max - L min)/L total where:
T new is the compressed threshold values in the secondary dither matrix; and, T old is the threshold value in the primary dither matrix.
T new = L min + T old.cndot.(L max - L min)/L total where:
T new is the compressed threshold values in the secondary dither matrix; and, T old is the threshold value in the primary dither matrix.
18. A print engine controller according to claim 13 wherein at least some of the thresholds in the primary dither matrix are not whole numbers and the compressed threshold values in the secondary matrix are rounded or truncated to the nearest whole numbers.
19. A print engine controller according to claim 15 wherein the threshold values occur in the primary dither matrix a predetermined number of times and the compressed threshold values occur in the secondary dither matrix a greater number of times, the greater number being approximately equal to L total/(L max-L min) multiplied by the predetermined number associated with the threshold values of the primary matrix, or only one of two colliding threshold values from the primary matrix, that correspond to the compressed threshold.
20. A print engine controller according to claim 15 wherein the processor only samples a portion of the pixels of the contone image data to determine L min and L
max.
max.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/AU2006/000975 WO2008006131A1 (en) | 2006-07-10 | 2006-07-10 | Method and apparatus for image manipulation via a dither matrix |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2655306A1 true CA2655306A1 (en) | 2008-01-17 |
Family
ID=38922825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002655306A Abandoned CA2655306A1 (en) | 2006-07-10 | 2006-07-10 | Method and apparatus for image manipulation via a dither matrix |
Country Status (6)
| Country | Link |
|---|---|
| EP (1) | EP2044571A4 (en) |
| KR (1) | KR101000601B1 (en) |
| CN (1) | CN101496060B (en) |
| AU (1) | AU2006346021B2 (en) |
| CA (1) | CA2655306A1 (en) |
| WO (1) | WO2008006131A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010050850A (en) * | 2008-08-22 | 2010-03-04 | Ricoh Co Ltd | Image processing device, image processing method, image forming apparatus, program, and recording medium |
| US9760971B2 (en) | 2013-06-13 | 2017-09-12 | Hewlett-Packard Development Company, L.P. | Establish image pipeline |
| GB2582966A (en) * | 2019-04-11 | 2020-10-14 | Xaar Technology Ltd | Methods, apparatus and control systems for droplet deposition apparatus |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5710828A (en) * | 1995-03-30 | 1998-01-20 | Fuji Photo Film Co., Ltd. | Method and apparatus for converting a threshold matrix which is then used to binarize image signals |
| US6515770B1 (en) * | 1999-03-16 | 2003-02-04 | International Business Machines Corporation | Dither mask generation with calibration-independent number of threshold levels |
| US7064869B2 (en) * | 2001-06-22 | 2006-06-20 | Eastman Kodak Company | Method for halftoning a multi-channel digital color image having at least one group of similar color channels |
| JP2003110852A (en) * | 2001-10-02 | 2003-04-11 | Dainippon Printing Co Ltd | Halftone processing method and processor |
| JP2004336163A (en) * | 2003-04-30 | 2004-11-25 | Minolta Co Ltd | Apparatus, method, and program for image processing |
-
2006
- 2006-07-10 CN CN2006800552744A patent/CN101496060B/en not_active Expired - Fee Related
- 2006-07-10 CA CA002655306A patent/CA2655306A1/en not_active Abandoned
- 2006-07-10 KR KR20097002006A patent/KR101000601B1/en active IP Right Grant
- 2006-07-10 AU AU2006346021A patent/AU2006346021B2/en not_active Ceased
- 2006-07-10 EP EP06760845A patent/EP2044571A4/en not_active Withdrawn
- 2006-07-10 WO PCT/AU2006/000975 patent/WO2008006131A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| AU2006346021B2 (en) | 2010-08-19 |
| KR20090025376A (en) | 2009-03-10 |
| KR101000601B1 (en) | 2010-12-10 |
| CN101496060A (en) | 2009-07-29 |
| WO2008006131A1 (en) | 2008-01-17 |
| EP2044571A4 (en) | 2011-07-06 |
| AU2006346021A1 (en) | 2008-01-17 |
| EP2044571A1 (en) | 2009-04-08 |
| CN101496060B (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6608926B1 (en) | Image processing method, image processing apparatus and recording medium | |
| US8040569B2 (en) | Image processing apparatus and method for contrast processing and intermediate color removal | |
| US5710827A (en) | Halftone dither cell with integrated preferred color matching | |
| JPH07193715A (en) | Method and apparatus for cascading ntural scene picture | |
| US7411707B2 (en) | Image processing apparatus and method thereof | |
| JP3339610B2 (en) | Improved method and apparatus for reducing warm in halftone images using gray balance correction | |
| US20060203280A1 (en) | Image printing apparatus and image printing method | |
| JP3309944B2 (en) | Improved method and apparatus for performing vivid color correction in a binary printing device | |
| US7733535B2 (en) | Method and apparatus for image manipulation via a dither matrix | |
| JP2004135313A (en) | Device and method for image processing | |
| EP1437678B1 (en) | Colorimetric ink depletion processing for printers | |
| AU2006346021B2 (en) | Method and apparatus for image manipulation via a dither matrix | |
| JP4226278B2 (en) | Image processing apparatus, image forming apparatus, image processing method, image processing program, and recording medium recording the same | |
| JPH11112823A (en) | Method for deciding ink color generating quantity in inking, its device and medium recording its program | |
| JP4078264B2 (en) | Image processing apparatus and method | |
| JP2015122619A (en) | Information processing device, information processing method, and program | |
| US6693731B1 (en) | Image processing apparatus and method | |
| US8373901B2 (en) | Image-processing apparatus and image-processing method | |
| JP4524578B2 (en) | Image processing apparatus, image processing method, program, and recording medium | |
| US7434906B2 (en) | Method for converting printing data and device using the same | |
| JP2001352456A (en) | Image-processing method and image-processing unit, and image-forming device provided with them | |
| JPH11355593A (en) | Image processor, image processing method and control method for the processor | |
| JP2015122618A (en) | Information processing device, information processing method, and program | |
| JP2003309732A (en) | Image processing apparatus, image forming apparatus, image processing method, computer program, and recording medium | |
| JP2000307867A (en) | Device and method for image processing and computer- readable recording medium with image processing program recorded thereon |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |
Effective date: 20150710 |