Patent Grant
8130415
1. Field of the Invention
The present invention relates to an image processing apparatus, image forming apparatus, and control method thereof and, more particularly, to an image processing apparatus, image forming apparatus, and control method thereof, which form an image using the number of tones smaller than that of an input image.
2. Description of the Related Art
As image output apparatuses for wordprocessors, personal computers, facsimile apparatuses, and the like, printing apparatuses which print information of desired text, images, and the like on sheet-like printing media such as paper sheets, films, and the like are used. Such printing apparatuses adopt various printing schemes. Of these schemes, schemes for forming an image on a printing medium by attachment of printing agents are popularly put into practical use. As a representative example of such schemes, an ink-jet printing scheme is known.
A printing apparatus, which adopts the ink-jet printing scheme, comprises a nozzle group prepared by integrally arraying a plurality of ink ejection ports (nozzles) that can eject ink with an identical color and density, so as to attain improvement of the printing speed and higher image quality. Furthermore, in order to attain higher image quality, some printing apparatuses comprise a nozzle group which can eject ink with an identical color but different densities, and a nozzle group which can eject ink with an identical color and density by changing an ejection amount in some levels.
In such printing apparatus, as a scheme for converting multi-valued input image data into a binary (or N-ary: N is an integer equal to or larger than 2, which corresponds to the number of tones smaller than that of the input image data) image as a dot printing signal, an error diffusion method is known. According to the error diffusion method, pseudo tone expression is implemented by diffusing a binary error (or an N-ary error) produced at a given pixel to a plurality of subsequent pixels.
In addition to the aforementioned error diffusion method, as a means for converting multi-valued input image data as a binary (or N-ary) image as a dot recording signal, a dither matrix method is known. According to the dither matrix method, pseudo tone expression is implemented by executing N-ary processing by comparing a threshold matrix prepared in advance with the multi-valued input data. Since the dither matrix method requires processing simpler than the error diffusion method, it can achieve higher-speed processing.
In order to improve image quality upon actually forming an image, the number of tones of which has been converted by the error diffusion method or dither matrix method, on a printing medium, a technique for determining the formation order and allocations has been proposed (for example, see Japanese Patent Laid-Open No. 2000-103088 (patent reference 1)). According to this technique, by applying the error diffusion method for each scan, even when registrations of respective scans have varied, an image quality drop due to density nonuniformity can be suppressed. More specifically, a plurality of main scans are made on an identical main scan printing region using different nozzle groups, and a binary (or N-ary) image is formed by the error diffusion method for respective main scans. When a binary (N-ary) images is generated by executing the error diffusion method for respective main scans, the dispersiveness of dot allocations in the main scan becomes high and uniform. Therefore, upon forming an image by a plurality of main scans, even when physical registrations such as the feed amounts of a printing medium, the positions of printing elements, and the like have varied, the graininess hardly changes. Since the dot allocations among the plurality of main scans have low correlation, even when the registrations have varied, a change in dot coverage with respect to the sheet surface is reduced, thus greatly relaxing density nonuniformity.
However, with the scheme described in aforementioned patent reference 1, since the dot allocations among the main scans have low correlation, low frequency components of an image generated by the plurality of scans are unwantedly emphasized. These low frequency components are emphasized more with increasing number of scans, and are recognized as graininess which is visually obtrusive.
The present invention has been made to solve such problems, and has as its object to provide an image forming apparatus having the following functions and a control method thereof. That is, N-ary processing is executed for each main scan based on constraining condition information which is updated real-time based on the N-ary result (N is an integer equal to or larger than 2) in the previous scan, thus suppressing deterioration of graininess depending on the low frequency components of an image, and allowing formation of a high-quality image.
The present invention has been made in consideration of the aforementioned problems, and has as its object to solve one or more of the aforementioned problems.
According to one aspect of the present invention, there is provided an image forming apparatus which forms an image by scanning a printing head, comprising a plurality of printing elements, on a printing medium, comprises: an input unit adapted to input image data; a calculation unit adapted to calculate printing amounts for the respective printing elements for each main scan of the printing head in accordance with the image data; an N-ary unit adapted to generate a dot pattern to be formed by applying N-ary processing (N is an integer not less than 2) to the printing amounts calculated by the calculation unit based on predetermined constraining condition information; and a generation unit adapted to generate the constraining condition information to be referred to by the N-ary unit at the time of a next main scan based on the printing amounts calculated by the calculation unit and the dot pattern output from the N-ary unit, wherein the generation unit generates the constraining condition information so that a phase of the dot pattern to be generated by the N-ary unit has an opposite phase relationship in a low frequency region with respect to a dot pattern already printed on an identical region on the printing medium.
According to another aspect of the present invention, there is provided an image processing apparatus which outputs a dot pattern to an image forming apparatus that forms an image by scanning a printing head, comprising a plurality of printing elements, on a printing medium, comprises: an input unit adapted to input image data; a calculation unit adapted to calculate printing amounts for the respective printing elements for each main scan of the printing head; an N-ary unit adapted to generate a dot pattern to be formed by applying N-ary processing to the printing amounts calculated by the calculation unit based on predetermined constraining condition information; and a generation unit adapted to generate the constraining condition information to be referred to by the N-ary unit at the time of a next main scan based on the printing amounts calculated by the calculation unit and the dot pattern output from the N-ary unit, wherein the generation unit generates the constraining condition information so that a phase of the dot pattern to be generated by the N-ary unit has an opposite phase relationship in a low frequency region with respect to a dot pattern already printed on an identical region on the printing medium.
According to still another aspect of the present invention, there is provided a method of controlling an image forming apparatus which forms an image by scanning a printing head, comprising a plurality of printing elements, on a printing medium, comprises: an input step of causing an input unit to input image data; a calculation step of causing a calculation unit to calculate printing amounts for the respective printing elements for each main scan of the printing head in accordance with the image data; an N-ary step of causing an N-ary unit to generate a dot pattern to be formed by applying N-ary processing based on predetermined constraining condition information to the printing amounts calculated in the calculation step; and a generation step of causing a generation unit to generate the constraining condition information to be referred to by the N-ary unit at the time of a next main scan based on the printing amounts calculated in the calculation step and the dot pattern output from the N-ary step, wherein in the generation step, the constraining condition information is generated so that a phase of the dot pattern to be generated by the N-ary unit has an opposite phase relationship in a low frequency region with respect to a dot pattern already printed on an identical region on the printing medium.
According to yet another aspect of the present invention, there is provided a method of controlling an image processing apparatus which outputs a dot pattern to an image forming apparatus that forms an image by scanning a printing head, comprising a plurality of printing elements, on a printing medium, comprises: an input step of causing an input unit to input image data; a calculation step of causing a calculation unit to calculate printing amounts for the respective printing elements for each main scan of the printing head in accordance with the image data; an N-ary step of causing an N-ary unit to generate a dot pattern to be formed by applying N-ary processing based on predetermined constraining condition information to the printing amounts calculated in the calculation step; and a generation step of causing a generation unit to generate the constraining condition information to be referred to by the N-ary unit at the time of a next main scan based on the printing amounts calculated in the calculation step and the dot pattern output from the N-ary step, wherein in the generation step, the constraining condition information is generated so that a phase of the dot pattern to be generated by the N-ary unit has an opposite phase relationship in a low frequency region with respect to a dot pattern already printed on an identical region on the printing medium.
According to the present invention, N-ary processing is executed for each main scan based on constraining condition information which is updated real-time based on the N-ary result (N is an integer equal to or larger than 2) in the previous scan, thus suppressing deterioration of graininess depending on the low frequency components of an image, and allowing formation of a high-quality image.
Further features of the present invention will become apparent from the following description of exemplary embodiments with reference to the attached drawings.
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.
The preferred embodiments of the present invention will be described in detail hereinafter with reference to the accompanying drawings. Note that the arrangements to be described in the following embodiments are merely examples, and the present invention is not limited to the illustrated arrangements.
The image processing apparatus 1 and printer 2 are connected to each other via a printer interface or circuit. The image processing apparatus 1 receives image data to be printed from an image data input terminal 101, and stores it in an input image buffer 102. A color separation processor 103 separates the input image data into ink colors the printer 2 uses. Upon execution of this color separation processing, the processor 103 looks up a color separation lookup table (LUT) 104. A scan duty setting unit 105 further converts ink color values separated by the color separation processor 103 into those for each scan, and stores the converted data in a scan duty buffer 107. Scan duty data in this embodiment indicates a printing ink amount for each scan.
A halftone processor 108 converts multi-tone (three or more tones) values of respective colors for each scan, which are obtained by the scan duty setting unit 105, into binary image data based on values accumulated in a constraining condition information buffer 109 (to be described below).
The constraining condition information buffer 109 accumulates information indicating whether or not a dot is easily formed at an address on an image to be printed. Note that the constraining condition information buffer 109 is assured for each ink color.
A halftone image storage buffer 110 stores binary image data of each color obtained by the halftone processor 108. A constraining condition information calculation unit 111 generates constraining condition information by making predetermined calculations based on the binary image data stored in the halftone image storage buffer 110 and the scan duty data stored in the scan duty buffer 107, and updates the contents of the constraining condition information buffer 109.
The binary image data stored in the halftone image storage buffer 110 is output to the printer 2 via an output terminal 112.
The printer 2 forms the binary image data formed by the image processing apparatus 1 on a printing medium 202 by vertically and horizontally moving a printing head 201 relative to the printing medium 202. As the printing head 201, any of heads of a thermal transfer scheme, electrophotography scheme, ink-jet scheme, and the like can be used, and the printing head 201 of any of these schemes has one or more printing elements (nozzles in case of the ink-jet scheme). A moving unit 203 moves the printing head 201 under the control of a head controller 204. A convey unit 205 conveys a printing medium under the control of the head controller 204. An ink color selector 206 selects an ink color from those mounted in the printing head 201 based on the binary image data for respective colors formed by the image processing apparatus 1.
Note that
The image forming processing in the image processing apparatus 1 of this embodiment with the aforementioned functional arrangement will be described below with reference to the flowchart of
Multi-tone color input image data is input from the input terminal 101, and is stored in the input image buffer 102 (S101). Note that the input image data includes three color components, i.e., red (R), green (G), and blue (B) to form color image data.
The color separation processor 103 applies color separation processing from R, G, and B to C, M, Y, K, Lc, and Lm color ink planes to the multi-tone color input image data stored in the input image buffer 102 (S102). In this embodiment, each pixel data after the color separation processing is handled as 8 bits. However, conversion to the number of tones more than 8 bits may be made.
As described above, the printing head 201 of this embodiment has six different ink colors. For this reason, R, G, and B color input image data are converted into image data of a total of six planes, i.e., C, M, Y, K, Lc, and Lm planes. That is, image data of six different planes corresponding to six different ink colors are generated.
Details of the color separation processing of this embodiment will be described below with reference to
C=C_LUT—3D(R′,G′,B′) (1)
M=M_LUT—3D(R′,G′,B′) (2)
Y=Y_LUT—3D(R′,G′,B′) (3)
K=K_LUT—3D(R′,G′,B′) (4)
Lc=Lc_LUT—3D(R′,G′,B′) (5)
Lm=Lm_LUT—3D(R′,G′,B′) (6)
Note that respective functions defined in the right-hand sides of equations (1) to (6) correspond to the contents of the color separation LUT 104. The color separation LUT 104 defines the output values of respective ink colors from the three input values, i.e., red, green, and blue. Since this embodiment comprises six colors C, M, Y, K, Lc, and Lm, the LUT configuration that obtains six output values from the three input values is adopted.
With the aforementioned processing, the color separation processing of this embodiment is complete.
Referring back to
The method of setting the color separation data cut position Y-coordinate Ycut will be explained below taking as an example a case of 4-pass printing which uses the head comprising 16 nozzle arrays and forms an image on an identical main scan printing region on an image by four scans.
In general, in case of 4-pass printing, as shown in
Upon normalizing the aforementioned color separation data cut position Ycut(k), Ycut(k) is given by:
Ycut(k)=−Nzzl+(Nzzl/Pass)×k (7)
where Nzzl is the number of nozzle arrays, Pass is the number of passes, and k is the scan number.
After Ycut(k) is set as described above, the scan duty setting unit 105 sets duty values for respective scans based on the scan duty setting LUT 106 and image data of the respective color separation processing planes (S104).
According to the scan duty setting LUT 106, values shown in
P1+P2+P3+P4=1.0 (8)
Note that the values held as the scan duty setting LUT 106 are not limited to those set by the aforementioned setting method. For example, more inflection points may be set, or values may be directory set for respective nozzles.
The scan duty values to be set in step S104 are set as the products of the scan duty setting LUT 106 and color separation data, as shown in
In this embodiment, when a corresponding nozzle is located at a coordinate outside the region of image Y addresses, a scan duty value is set to be zero. For example, at the scan number k=1, since ¾ nozzle arrays from the upper end have negative image Y addresses, as shown in
Since the color separation data cut position Ycut(k) is determined by the scan number k, in case of scan numbers k=1 to 7, the scan duty values are determined, as shown in
In this embodiment, the scan duty values are separated, as shown in
The aforementioned scan duty settings in the scan duty setting unit 105 are described by the following formulas while limiting to, e.g., cyan C(X, Y). Note that C_d(X, Y) represents a scan duty at an address (X, Y), and S_LUT(Y) represents the value of the scan duty setting LUT 106 at an address Y. Also, 0≦nx<image X size, and 0≦ny<Nzzl (the number of nozzle arrays: 16 in this case). Furthermore, as duty separation thresholds, D_Th2 and D_Th1 indicating smaller thresholds (D_Th3>D_Th2>D_Th1) are defined in addition to D_Th3 described above.
When C(nx, Ycut(k)+ny)>D_Th3,
C—d(nx,ny)=C(nx,Ycut(k)+ny)×S_LUT(ny) (9)
When C(nx, Ycut(k)+ny)≦D_Th1,
for “scan numbers k=1, 5, . . . , 4n+1 (n is an integer equal to or larger than 0)”,
C—d(nx,ny)=C(nx,Ycut(k)+ny) (10)
for “scan numbers other than above numbers”,
C—d(nx,ny)=0 (11)
When C(nx, Ycut(k)+ny)≦D_Th2,
for “scan numbers k=1, 5, . . . , 4n+1” and
“scan numbers k=2, 6, . . . , 4n+2”,
C—d(nx,ny)=C(nx,Ycut(k)+ny)/2 (12)
for “scan numbers other than above numbers”,
C—d(nx,ny)=0 (13)
When C(nx, Ycut(k)+ny) D_Th3,
for “scan numbers k=1, 5, . . . , 4n+1”
“scan numbers k=2, 6, . . . , 4n+2”, and
“scan numbers k=3, 7, . . . , 4n+3”,
C—d(nx,ny)=C(nx,Ycut(k)+ny)/3 (14)
for “scan numbers other than above numbers”,
C—d(nx,ny)=0 (15)
Formula (9) expresses normal duty separation processing, and formulas (10) to (15) express exceptional duty separation processes. When the color separation data value is smaller than D_Th1, image formation is made by one scan, as described in formulas (10) and (11). When the color separation data value is smaller than D_Th2, image formation is made by two scans, as described in formulas (12) and (13). When the color separation data value is smaller than D_Th3, image formation is made by three scans, as described in formulas (14) and (15).
The same applies to Lc(X, Y), M(X, Y), Lm(X, Y), Y(X, Y), and K(X, Y) to attain separation to the scan duty values using the above formulas.
Since this embodiment has been described taking 4-pass printing as an example, the exceptional duty separation processes are set, as described in formulas (10) to (15). Likewise, in case of 8-pass printing as well, duty separation thresholds D_Th1 to D_Th7 need to be set to execute exceptional duty separation processes.
The scan duty data set by the scan duty setting unit 105 as described above are stored in the scan duty buffer 107 (S105). That is, the scan duty buffer 107 stores, for respective colors, scan duty data values of a band shape, the vertical direction of which corresponds to the number of nozzles and the horizontal direction of which corresponds to the X size of an image, as shown in
The halftone processor 108 then executes halftone processing for converting the total value of the scan duty data stored in the scan duty buffer 107 and constraining condition information data stored in the constraining condition information buffer 109 into a tone value of two levels (binary data) (S106).
The constraining condition information buffer 109 also stores, for respective colors, constraining condition information data values of a band shape, the vertical direction of which corresponds to the number of nozzles and the horizontal direction of which corresponds to the X size of an image, as shown in
C—r(nx,ny)=0 (16)
Lc—r(nx,ny)=0 (17)
M—r(nx,ny)=0 (18)
Lm—r(nx,ny)=0 (19)
Y—r(nx,ny)=0 (20)
K—r(nx,ny)=0 (21)
For this reason, actually, when the scan number k≧2, the contents of the constraining condition information buffer 109 are updated by significant constraining condition information. As the constraining condition information value is smaller, a dot is harder to be formed at that position; as the value is larger, a dot is easier to be formed. Note that respective values are stored in the constraining condition information buffer 109 independently of the timing of any scan number, so that the average value of the stored values becomes zero. More specifically, a positive value is stored when a dot is easy to be formed at that position, and a negative value is stored when a dot is hard to be formed at that position. Details of updating of the constraining condition information will be described later.
The halftone processing of this embodiment uses a known error diffusion method as the processing for converting multi-valued input image data into a binary image (or an image having the number of tones equal to or larger than a binary value and smaller than the number of input tones). The halftone processing of this embodiment will be described in detail below with reference to the block diagram of
In step S201 shown in
Ic=C—d+C—r (22)
Note that the constraining condition information C_r includes all zeros when the scan number k=1.
In step S202, an accumulated error is added for error diffusion processing. The addition processing of an accumulated error will be described in detail below.
In this embodiment, assume that four coefficients K1 to K4 are set as error diffusion coefficients for the error diffusion processing, as shown in
In order to diffuse and accumulate an error using these error diffusion coefficients, the halftone processor 108 assures four accumulated error line buffers 402 to 405 for cyan, and switches the accumulated error line buffer to be used for each scan number as follows:
“When the scan numbers k=1, 5, . . . , 4n+1 (n is an integer equal to or larger than 0)”,
use cyan (4n+1) accumulated error line buffer 402
“When the scan numbers k=2, 6, . . . , 4n+2”,
use cyan (4n+2) accumulated error line buffer 403
“When the scan numbers k=3, 7, . . . , 4n+3”,
use cyan (4n+3) accumulated error line buffer 404
“When the scan numbers k=4, 8, . . . , 4n+4”,
use cyan (4n+4) accumulated error line buffer 405
Note that the cyan accumulated error line buffers 402, 403, 404, and 405 respectively include four sets of storage areas 1501 to 1504 in
In this embodiment, since the aforementioned four accumulated error line buffers are required per color, these buffers need to be prepared for six colors. That is, a total of 24 (=4×6) line buffers are required.
In this case, assume that the error diffusion processing is executed using the cyan (4n+1) accumulated error line buffer 402 so as to exemplify the halftone processing for the scan number k=1.
That is, an accumulated error adder 406 adds an error Ec1(x) corresponding to a horizontal pixel position x of input pixel data to the input data value as the total of the scan duty and constraining condition information. That is, let Ic be input data of interest, and Ic′ be data after addition of an accumulated error. Then, we have:
Ic′=Ic+Ec1(x) (23)
In step S203, a threshold selector 407 selects a threshold T. The threshold T is set, for example, by:
T=128 (24)
Alternatively, in order to avoid any dot generation delay, the threshold T may be finely changed according to C_d to reduce an average quantization error, as given by:
T=f(C—d) (25)
In step S204, a quantizer 408 compares the pixel data Ic′ after error addition with the threshold T to determine Out_c as a binarization result of the dot. This rule is as follows.
When Ic′<T,
Out_c=0 (26)
When Ic′≧T,
Out_c=255 (27)
In step S205, an error calculation unit 409 calculates a difference Err_c between the pixel data Ic′ obtained by adding an error to the pixel IC of interest, and the output pixel value Out_c by:
Err—c(x)=Ic′−Out—c (28)
In step S206, an error diffusion unit 410 diffuses an error. That is, the unit 410 executes diffusion processing of the error Err_c(x) according to the horizontal pixel position x using the cyan (4n+1) accumulated error line buffer 402 as follows:
Ec1(x+1)←Ec1(x+1)+Err—c(x)× 7/16(x<W)
Ec1(x−1)←Ec1(x−1)+Err—c(x)× 3/16(x>1)
Ec1(x)←Ec1—0+Err—c(x)× 5/16(1<x<W)
Ec1(x)←Ec1—0+Err—c(x)× 8/16(x=1)
Ec1(x)←Ec1—0+Err—c(x)× 13/16(x=W)
Ec1—0←Err—c(x)× 1/16(x<W)
Ec1—0←0(x=W) (29)
In this way, binarization (quantization value 0, 255) for one cyan pixel of the scan number k=1 is complete.
By repeating the aforementioned processes in steps S201 to S206 for addresses (0, 0) to (W−1, Nzzl−1) in the band (S207), the dot positions of halftone image data, i.e., ON/OFF of dots can be determined.
Note that the processing for the scan number k=1 has been described above. For the scan numbers k=2 to 4, the halftone processing is executed using the cyan accumulated error line buffers 403 to 405, respectively. The processing for the scan number k=5 uses the same cyan (4n+1) accumulated error line buffer 402 as that for the scan number k=1 intact without initializing (substituting all zeros in) that buffer. This is because the preserved accumulated errors are applied intact to the lower neighboring region since the print regions of the scan numbers k=1 and 5 neighbor vertically, as shown in
Referring back to
With the above processing, the halftone processing for the scan number k=1 is complete. As a result, a binary image to be formed by a single head operation for each color is stored in the halftone image storage buffer 110 for each color.
Band data, which is stored in each halftone image storage buffer 110, and the vertical direction of which corresponds to the number of nozzles (Nzzl) and the horizontal direction of which corresponds to the X size (W) of the image, is output from the image output terminal 112 (S108).
Then, the constraining condition information calculation unit 111 calculates constraining condition information (S109). The constraining condition information calculation processing of this embodiment will be described in detail below with reference to the block diagram of
As described above, the constraining condition information of this embodiment is information which is referred to upon determining the dot allocations of a halftone image for the scan number k=2 next to the current scan number k=1, and indicates whether or not a dot is easily formed.
In step S301 shown in
C—df=C—d*F—m (30)
where * is a convolution operation to calculate C_df.
Note that the filter F_m of this embodiment will be described as an isotropic weighted average filter 2401 in
In step S302, a halftone data filter processor 502 applies, to Out_c, filter processing using a predetermined low-pass filter LPF_b by:
Out—c_LPF=Out—c*LPF—b (31)
to calculate Out_c_LPF.
The coefficients of LPF_b of this embodiment will also be described as an isotropic weighted average filter 2402 in
In step S303, a scan duty data shifter 504 shifts the data C_df output from the scan duty filter processor 501 upward by one paper feed amount LF=Nzzl/Pass=16/4=4.
C′—df(nx,ny)=C—df(nx,ny+LF) (32)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (32), when ny+LF≧Nzzl, C′_df(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
Likewise, in step S304 a halftone data shifter 505 shifts the data Out_c_LPF upward by the paper feed amount.
Out′—c_LPF(nx,ny)=Out—c_LPF(nx,ny+LF) (33)
for 0≦nx<image X size and 0≦ny<Nzzl
As in equation (32), in equation (33), when ny+LF≧Nzzl, Out′_c_LPF(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
Likewise, in step S305 a pre-update constraining condition information data shifter 503 shifts the constraining condition information data C_r before update upward by the paper feed amount. Shifted constraining condition information data C′_r is calculated by:
C′—r(nx,ny)=C—r(nx,ny+LF) (34)
for 0≦nx<image X size and 0≦ny<Nzzl
As in equation (32), in equation (34), when ny+LF≧Nzzl, C′_r(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
The reason why the respective buffer data are shifted by the paper feed amount LF in steps S303 to S305 is that halftone dot allocations to be formed at the next scan number are relatively shifted by the paper feed amount LF on the printing medium.
In step S306, a subtractor 506 subtracts the data calculated by the halftone data shifter 505 from the data calculated by the scan duty data shifter 504. In step S307, a weight multiplier 507 multiplies the difference data by a weighting coefficient h (real number).
In step S308, an adder 508 adds the data calculated by the weight multiplier 507 and the cyan constraining condition information shifted by the pre-update constraining condition information data shifter 503 to calculate updated constraining condition information C_r. A formula of the updated constraining condition information C_r calculated in steps S306 to S308 is described by:
C—r←(−Out′—c_LPF+C′—df)′h+C′—r (35)
The calculated constraining condition information C_r is saved in the constraining condition information buffer 109 as that for the halftone processing of the next scan number k=2 and the subsequent scan numbers (i.e., a scan number k+1 with respect to the current scan number k).
Formula (35) that describes the update method of the constraining condition information in this embodiment will be described in detail below.
Out′_c_LPF in formula (35) is data obtained by extracting low frequency components from the halftone image of the scan number k using the LPF_b by the halftone data filter processor 502. Formula (35) appends a minus sign to Out′_c_LPF as −Out′_c_LPF, and subtracts it from the constraining condition information before update, thus setting the data from which the low frequency components are removed, i.e., (−Out′_c_LPF+C′_df) to be a negative value. In this way, dots are hardly formed at the next scan number k+1 and subsequent scan numbers. That is, with this processing, an effect of setting the low frequency components of the halftone image formed at the next scan number k+1 and subsequent scan numbers after the scan number k to be in opposite phase can be provided.
In this way, −Out′_c_LPF sets the low frequency components of dots allocated by the immediately preceding scan in opposite phase. The effect of setting only the low frequency components in opposite phase will be described below with reference to
On the other hand, as for a low frequency region of a printed image, when the density distributions are in opposite phase, as denoted by reference numeral 2603, low frequency components which are visually obstructive are reduced, and deterioration of graininess is suppressed. Furthermore, since the relationship between the upper and lower peaks of the distributions scarcely changes even when a registration error has occurred slightly, the density resistance is high. However, when the density distributions of the low frequency components have no correlation, as denoted by reference numeral 2604, since the low frequency components appear on an image irrespective of the occurrence of any registration error, the graininess deteriorates.
As described above, as can be seen from
The actual dot allocations at the scan numbers k and k+1 will be described below taking as an example a case of the scan numbers 1 and 2, the number of nozzles=170, and the number of passes=2.
The dot allocations formed on an identical printing medium coordinate system of the scan numbers k and k+1 at that time are respectively shown in (a) and (b) of
This is because the constraining condition information becomes data obtained by subtracting the low frequency components of a halftone image formed by the ½ nozzles from the lower end of the scan number k, and that constraining condition information data is added by equation (22) and is passed to the halftone processing of the scan number k+1.
This example has explained the characteristics between neighboring scans of the scan numbers k and k+1. However, such characteristics are established between arbitrary scans.
Formula (35) subtracts Out′_c_LPF calculated by the halftone data filter processor 502 to obtain an effect of setting low frequency components in opposite phase. Furthermore, since high frequency components are not considered at all as constraining condition information, they can be set to have no correlation.
In formula (35), C′_df will be focused next. C′_df in formula (35) is data obtained by applying filtering to the duty data of the scan number k using F_m by the scan duty filter processor 501. In formula (35), this C′_df is added for the following two reasons.
The first reason is to always maintain the average of the constraining condition information C_r to be zero by setting the average value in the parentheses to be zero, and to make the scan duty density and the density of the halftone processing approach each other. This is because when only the data which becomes the negative value due to −Out′_c_LPF as the constraining condition information, Ic given by equation (22) becomes smaller than C_d, and the number of dots in the halftone processing becomes small. Since the error diffusion method works to set the input and output densities to always be equal to each other, C_r must always maintain zero average. Hence, since C′_df is the same density as Out′_c_LPF, C_r can always maintain zero average by adding C′_df.
The second reason is to execute spatial frequency characteristic control of an output image. As described above, since the average value in the parentheses of formula (35) must be zero, if only Out′_c_LPF is multiplied by LPF_b, Out′_c_LPF and C′_df in the parentheses are reduced in terms of spatial frequencies, thus generating edge emphasis. In other words, if subtraction is made by applying blurring processing to only Out_c without applying any blurring processing to C_d, processing equivalent to unsharp masking is executed, thus causing edge emphasis. Hence, by applying the same filter as Out_c to C_d, edge emphasis can be suppressed.
When non-coated paper such as plain paper, matte paper, or the like is used as a printing medium, since the image contour tends to be blurred, the same processing need not to be applied to both the data. For example, in order to intentionally cause edge emphasis, the degree of spread of F_m may be narrowed.
Formula (35) can further adjust the strength of the constraining condition information by the weighting coefficient h. For example, when h=1.0, the constraining condition information calculated by the filters can be output intact; when h=0.0, an output equivalent no calculations of the constraining condition information can be obtained. Since the value in the parentheses in formula (35) is zero average, the average value “0” is maintained independently of the value of h.
In this way, the constraining condition information calculation processing in step S109 in
In step S110, the contents of the constraining condition information buffer 109 are updated by the calculation result of the constraining condition information. The constraining condition information updated in this way is referred to as information required to determine the dot allocation of the next scan number and subsequent numbers (the next scan number is k+1 if the current scan number is k).
Updating of the constraining condition information buffer 109 will be described in detail below with reference to region 1 of
In this embodiment, the halftone processing at the scan number k=2 need to set the low frequency components of a dot pattern in region 1 formed by the scan number k=1 to be in opposite phase. For this purpose, formulas (30) to (35) shift the data by one paper feed amount LF=Nzzl/Pass=16/4=4 to define the shifted data as the constraining condition information of the scan number k=2, as described above.
However, formulas (30) to (35) are not limited to “setting low frequency components in opposite phase” in the neighboring relationship of the scan numbers k=1 and k=2. For example, as shown in
Likewise, the halftone processing of the scan number k=4 sets low frequency components in opposite phase with respect to a total dot pattern of region 1 formed by the scan numbers k=1, 2, and 3.
That is, according to this embodiment, a dot pattern for each scan is formed to always set the low frequency components of an already recorded total dot pattern on an identical region on the printing medium. As a result, good graininess can always be assured irrespective of the presence/absence of the occurrence of any registration error, and density nonuniformity due to a registration error can be eliminated.
Referring back to
It is then checked in step S112 if all scans are complete. If all scans are complete, a series of image forming processes are complete; otherwise, the process returns to step S103. As described above, all the processes are complete.
As described above, according to this embodiment, in a printing method that executes binarization processing for each main scan, the following effects are further obtained upon suppressing deterioration of graininess with respect to a registration error by providing high dispersiveness to the output dot allocations formed within a single main scan. That is, in the output dot allocations between a plurality of main scans, by setting low frequency components in opposite phase, good graininess is assured irrespective of the presence/absence of the occurrence of a registration error. Furthermore, by providing randomness while reducing correlation for high frequency components, density nonuniformity due to a registration error can be eliminated.
More specifically, a dot pattern for each scan is formed by the error diffusion method so as to always set low frequency components of an identical color dot pattern, which is already printed, to be in opposite phase on an identical region on a printing medium. That is, as given by equation (22), by reflecting the constraining condition information C_r obtained by extracting the low frequency components of the dot pattern already formed at an identical position on the printing medium to the input data C_d, the low frequency components are set in opposite phase, and high frequency components are set to have no correlation. In this way, a strong density nonuniformity resistance against any registration error on a printed image and good graininess can be assured.
Note that implementation of setting the low frequency components to be in opposite phase and the high frequency components to have no correlation is not limited to the method of this embodiment. As another method, the constraining condition information obtained by extracting low frequency components may be reflected to, e.g., a threshold or quantization error.
In the example of this embodiment, the error diffusion method is used as the halftone processing. Instead, a minimized average error method may be used.
The second embodiment according to the present invention will be described hereinafter. The first embodiment has exemplified a case in which the halftone processor 108 executes the error diffusion processing. The second embodiment will exemplify a case in which the dither matrix method is used in place of the error diffusion method. As described above, since the dither matrix method can speed up the processing compared to the error diffusion method, the second embodiment can attain high-speed processing. Furthermore, since only low frequency components are used as the constraining condition information as in the first embodiment, the second embodiment can obtain the same effects as in the first embodiment.
The detailed arrangement of the image forming apparatus of the second embodiment is the same as that in the first embodiment, except for the halftone processor 108. For the sake of simplicity, details of cyan halftone processing for 4-pass printing and the scan number k=1 as in the first embodiment will be described with reference to the block diagram of
In step S401 shown in
Ic=C—d+C—r (36)
Note that the constraining condition information at the scan number k=1 includes all zeros.
A quantizer 603 compares I_c with a corresponding element value of a threshold matrix 602 in step S402, and outputs binary data in step S403.
When I_c≦Th,Out_c=0 (37)
When Th<I_c,Out_c=255 (38)
where Th is a threshold group corresponding to addresses on the printed image, as shown in
As Th in the second embodiment, a known threshold matrix may be used. For example, a Bayer matrix, dot concentration type matrix, or blue noise mask matrix may be used. Also, the threshold matrix 602 may use different matrices for respective scan numbers or may always use an identical matrix.
In step S404, the halftone processor 108 repeats the aforementioned processes in steps S401 to S403 from addresses (0, 0) to (W−1, Nzzl−1) in a band, thus determining dot positions of halftone data. In this way, the halftone processing for the scan number k=1 is complete, and a binary image to be formed by a single head operation for each color is stored in the halftone image storage buffer 110 for each color.
As described above, according to the second embodiment, since the halftone processing is executed based on the dither matrix method in place of the error diffusion, the higher-speed processing can be attained compared to the first embodiment, and high-quality image formation having a resistance to any registration error can be implemented as in the first embodiment.
The third embodiment according to the present invention will be described hereinafter. Since the detailed arrangement of the image forming apparatus according to the third embodiment is the same as the first embodiment, a description thereof will not be repeated.
The aforementioned first embodiment has exemplified the case in which the constraining condition information buffer 109 is independently assured for each color, and the error diffusion processing is applied to the total value of that constraining condition information and the scan duty data. In the aforementioned first embodiment, a dot pattern for each scan is formed to set the low frequency components of the already printed dot pattern for an identical color in opposite phase. In this way, good graininess is assured irrespective of the presence/absence of the occurrence of a registration error, and density nonuniformity due to a registration error can be eliminated.
The third embodiment is characterized in that the constraining condition information is shared by two or more colors in the halftone processing, and the error diffusion processing for one color is executed to follow the processing result for the other color. In this way, the number of constraining condition information buffers can be reduced, and low frequency components can be set in opposite phase between colors, thus preventing graininess from deteriorating due to generation of dark blue dots resulting from overlapping of cyan and magenta dots.
The halftone processing of the third embodiment will be described below with reference to the flowchart of
In step S506, the halftone processor 108 executes cyan halftone processing for converting the total value of cyan data in the scan duty buffer 107 and the constraining condition information in the constraining condition information buffer 109 into a tone value of two levels (binary data). Note that the constraining condition information buffer 109 of the third embodiment has band-shaped constraining condition information data, the vertical direction of which corresponds to the number of nozzles (Nzzl) and the horizontal direction of which corresponds to the X size (W) of an image, and which is shared by cyan and magenta.
The constraining condition information buffer 109 stores constraining condition information indicating whether or not a binary image is easily formed at each address of an image to be printed, and updates the contents for each scan number k. At the beginning of the processing at the scan number k=1, all zeros are substituted as an initial value.
That is, upon sharing constraining condition information by cyan and magenta, five pieces of constraining condition information CM_r(X, Y), Lc_r(X, Y), Lm_r(X, Y), Y_r(X, Y), and K_r(X, Y) are to be stored at an address (X, Y), and their initial values are described by:
CM—r(nx,ny)=0 (39)
Lc—r(nx,ny)=0 (40)
Lm—r(nx,ny)=0 (41)
Y—r(nx,ny)=0 (42)
K—r(nx,ny)=0 (43)
for 0≦nx<image X size and 0≦ny<Nzzl (the number of nozzle arrays: 16 in this case)
For this reason, each of constraining condition information Lc_r, Lm_r, Y_r, and K_r is updated to significant constraining condition information when the scan number k≧2. However, the constraining condition information CM_r shared by cyan and magenta is updated within an identical scan number. Details about updating of CM_r will be described later.
The halftone processing of the third embodiment uses error diffusion processing as processing for converting multi-valued input image data into a binary image (or a binary or more image having the number of tones smaller than the number of input tones), as in the first embodiment. Of course, a minimized average error method or the dither matrix method described in the second embodiment may be used instead.
For the sake of simplicity, details of the cyan halftone processing for 4-pass printing and the scan number k=1 will be described below with reference to the block diagram of
In step S601 shown in
Ic=C—d+CM—r (44)
Note that constraining condition information CM_r includes all zeros when the scan number k=1.
In step S602, an accumulated error is added for error diffusion processing. The addition processing of an accumulated error of the third embodiment will be described in detail below.
In the third embodiment as well, assume that four coefficients K1 to K4 are set as error diffusion coefficients for the error diffusion processing, as shown in
In order to diffuse and accumulate an error using these error diffusion coefficients, the halftone processor 108 assures four accumulated error line buffers 702 to 705 for cyan, and switches the accumulated error line buffer to be used for each scan number as follows:
“When the scan numbers k=1, 5, . . . , 4n+1 (n is an integer equal to or larger than 0)”,
use cyan (4n+1) accumulated error line buffer 702
“When the scan numbers k=2, 6, . . . , 4n+2”,
use cyan (4n+2) accumulated error line buffer 703
“When the scan numbers k=3, 7, . . . , 4n+3”,
use cyan (4n+3) accumulated error line buffer 704
“When the scan numbers k=4, 8, . . . , 4n+4”,
use cyan (4n+4) accumulated error line buffer 705
Note that the cyan accumulated error line buffers 702, 703, 704, and 705 respectively include four sets of storage areas 3301 to 3304 shown in
When the scan number k=1, error diffusion processing using the cyan (4n+1) accumulated error line buffer 702 is executed. That is, an accumulated error adder 706 adds an error Ec1(x) corresponding to a horizontal pixel position x of input pixel data to the input data value as the total of the cyan scan duty data and CM constraining condition information. That is, let Ic be input data of interest, and Ic′ be data after addition of an accumulated error. Then, we have:
Ic′=Ic+Ec1(x) (45)
In step S603, a threshold selector 707 selects a threshold T. The threshold T is set, for example, by:
T=128 (46)
Alternatively, in order to avoid any dot generation delay, the threshold T may be finely changed according to C_d to reduce an average quantization error, as given by:
T=f(C—d) (47)
In step S604, a quantizer 708 compares the pixel data Ic′ after error addition with the threshold T to determine Out_c as a binarization result of the dot. This rule is as follows.
When Ic′<T,
Out_c=0 (48)
When Ic′≧T,
Out_c=255 (49)
In step S605, an error calculation unit 709 calculates a difference Err_c between the pixel data Ic′ obtained by adding an error to the pixel Ic of interest, and the output pixel value Out_c by:
Err—c(x)=Ic′−Out—c (50)
In step S606, an error diffusion unit 710 diffuses an error. That is, the unit 710 executes diffusion processing of the error Err_c(x) according to the horizontal pixel position x using the cyan (4n+1) accumulated error line buffer 702 as follows:
Ec1(x+1)←Ec1(x+1)+Err—c(x)×7/16(x<W)
Ec1(x−1)←Ec1(x−1)+Err—c(x)×3/16(x>1)
Ec1(x)←Ec1—0+Err—c(x)×5/16(1<x<W)
Ec1(x)←Ec1—0+Err—c(x)×8/16(x=1)
Ec1(x)←Ec1—0+Err—c(x)×13/16(x=W)
Ec1—0←Err—c(x)×1/16(x<W)
Ec1—0←0(x=W) (51)
In this way, binarization (quantization value 0, 255) for one cyan pixel of the scan number k=1 is complete.
By repeating the aforementioned processes in steps S601 to S606 for addresses (0, 0) to (W−1, Nzz−1) in the band (S607), the dot positions of halftone image data, i.e., ON/OFF of cyan dots can be determined.
Referring back to
Next, band data of cyan halftone data, which is stored in the halftone image storage buffer 110, and the vertical direction of which corresponds to the number of nozzles (Nzzl) and the horizontal direction of which corresponds to the X size (W) of the image, is output from the image output terminal 112 (S508).
Then, the constraining condition information calculation unit 111 calculates CM constraining condition information based on cyan dot allocations (S509). As will be described in detail later, in the third embodiment, CM constraining condition information is calculated based on the cyan dot allocations, and then magenta dot allocations are determined based on that CM constraining condition information. The CM constraining condition information is updated based on the determined magenta dot allocations, and is used as that corresponding to the next scan number.
The CM constraining condition information calculation processing based on the cyan dot allocations in step S509 will be described in detail below with reference to the block diagram of
In step S701 shown in
C—df=C—d*F—m (52)
where * is a convolution operation to calculate C_df.
Note that the filter F_m of the third embodiment will be described as an isotropic weighted average filter 2401 in
In step S702, a halftone data filter processor 802 applies, to Out_c, filter processing using a predetermined low-pass filter LPF_b by:
Out—c_LPF=Out—c*LPF—b (53)
to calculate Out_c_LPF.
The coefficients of LPF_b of this embodiment will also be described as an isotropic weighted average filter 2402 in
In step S703, a subtractor 803 subtracts the data calculated by the halftone data filter processor 802 from the data calculated by the scan duty filter processor 801. In step S704, a weight multiplier 804 multiplies the difference data by a weighting coefficient h1 (real number).
In step S705, an adder 805 adds the data calculated by the weight multiplier 804 and the CM constraining condition information before update to calculate constraining condition information CM_r after reflection of cyan data, and saves the information CM_r as constraining condition information for magenta halftone processing.
A formula of the constraining condition information CM_r after reflection of cyan data calculated in steps S703 to S705 is described by:
CM—r←(−Out—c_LPF+C—df)×h1+CM—r (54)
In this way, the CM constraining condition information calculation processing based on the cyan dot allocations in step S509 in
In step S510, the constraining condition information buffer 109 shared by cyan and magenta is updated by the calculation result of the constraining condition information.
As described above, in the third embodiment, the constraining condition information is not relatively shifted upward by the paper feed amount LF in this stage unlike in the first embodiment. This is because a magenta halftone image of the same scan number is not processed yet, and the constraining condition information is used for the processing of magenta halftone data. In the third embodiment, since the constraining condition information is shared by cyan and magenta, the constraining condition information is not shifted until the magenta dot allocations of the same scan number are determined.
In step S511, the halftone processor 108 executes magenta halftone processing for converting the total value of magenta data in the scan duty buffer 107 and the contents of the constraining condition information buffer 109 into a tone value of two levels (binary data). Note that the constraining condition information buffer 109 of the third embodiment has the aforementioned buffer format shown in
Details of the magenta halftone processing will be described below with reference to the block diagram of
In step S801 shown in
Im=M—d+CM—r (55)
Note that the cyan constraining condition information has already been reflected by formula (54) to the input constraining condition information CM_r.
In step S802, an accumulated error is added for error diffusion processing. The addition processing of an accumulated error of the third embodiment will be described in detail below. In this case as well, assume that four coefficients K1 to K4 are set as error diffusion coefficients for the error diffusion processing, as shown in
“When the scan numbers k=1, 5, . . . , 4n+1 (n is an integer equal to or larger than 0)”,
use magenta (4n+1) accumulated error line buffer 902
“When the scan numbers k=2, 6, . . . , 4n+2”,
use magenta (4n+2) accumulated error line buffer 903
“When the scan numbers k=3, 7, . . . , 4n+3”,
use magenta (4n+3) accumulated error line buffer 904
“When the scan numbers k=4, 8, . . . , 4n+4”,
use magenta (4n+4) accumulated error line buffer 905
Note that the magenta accumulated error line buffers 902, 903, 904, and 905 respectively include four sets of storage areas 3305 to 3308 shown in
When the scan number k=1, error diffusion processing using the magenta (4n+1) accumulated error line buffer 902 is executed. That is, an accumulated error adder 906 adds an error Em1(x) corresponding to a horizontal pixel position x of input pixel data to the input data value as the total of the magenta scan duty data and CM constraining condition information. That is, let Im be input data of interest, and Im′ be data after addition of an accumulated error. Then, we have:
Im′=Im+Em1(x) (56)
In step S803, a threshold selector 907 selects a threshold T. The threshold T is set, for example, by:
T=128 (57)
Alternatively, in order to avoid any dot generation delay, the threshold T may be finely changed according to M_d to reduce an average quantization error, as given by:
T=f(M—d) (58)
In step S804, a quantizer 908 compares the pixel data Im′ after error addition with the threshold T to determine Out_m as a binarization result of the dot. This rule is as follows.
When Im′<T,
Out_m=0 (59)
When Im′≧T,
Out_m=255 (60)
In step S805, an error calculation unit 909 calculates a difference Err_m between the pixel data Im′ obtained by adding an error to the pixel Im of interest, and the output pixel value Out_m by:
Err—m(x)=Im′−Out—m (61)
In step S806, an error diffusion unit 910 diffuses an error. That is, the unit 910 executes diffusion processing of the error Err_m(x) according to the horizontal pixel position x using the magenta (4n+1) accumulated error line buffer 902 as follows:
Em1(x+1)←Em1(x+1)+Err—m(x)×7/16(x<W)
Em1(x−1)←Em1(x−1)+Err—m(x)×3/16(x>1)
Em1(x)←Em1—0+Err—m(x)×5/16(1<x<W)
Em1(x)←Em1—0+Err—m(x)×8/16(x=1)
Em1(x)←Em1—0+Err—m(x)×13/16(x=W)
Em1—0←Err—m(x)×1/16(x<W)
Em1—0←0(x=W) (62)
In this way, binarization (quantization value 0, 255) for one magenta pixel of the scan number k=1 is complete.
By repeating the aforementioned processes in steps S801 to S806 for all pixels in the band (S807), the dot positions of magenta halftone data, i.e., ON/OFF of magenta dots can be determined.
Referring back to
Next, band data of magenta halftone data, which is stored in the halftone image storage buffer 110, and the vertical direction of which corresponds to the number of nozzles (Nzzl) and the horizontal direction of which corresponds to the X size (W) of the image, is output from the image output terminal 112 (S513).
Then, the constraining condition information calculation unit 111 calculates CM constraining condition information based on magenta dot allocations (S514). The CM constraining condition information calculation processing based on the magenta dot allocations in step S514 will be described in detail below with reference to the block diagram of
In step S901 shown in
M—df=M—d*F—m (63)
where * is a convolution operation to calculate M_df.
Note that the filter F_m in this process may use the same filter as that in the cyan processing, but may use other filters.
In step S902, a halftone data filter processor 1002 applies, to Out_m, filter processing using a predetermined low-pass filter LPF_b by:
Out—m_LPF=Out—m*LPF—b (64)
to calculate Out_m_LPF.
Note that LPF_b of this embodiment may use either the same filter as in the cyan processing or other filters.
In step S903, a scan duty data shifter 1003 shifts the data M_df output from the scan duty filter processor 1001 upward by one paper feed amount LF=Nzzl/Pass=16/4=4.
M′—df(nx,ny)=M—df(nx,ny+LF) (65)
for 0≦nx<image X size and 0≦ny<Nzz
In equation (65), when ny+LF≧Nzzl, M′_df(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing. Likewise, in step S904 a halftone data shifter 1004 shifts the data Out_m_LPF upward by the paper feed amount.
Out′—m_LPF(nx,ny)=Out—m_LPF(nx,ny+LF) (66)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (66) as well, when ny+LF≧Nzzl, Out′_m_LPF(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
Likewise, in step S905 a pre-update constraining condition information data shifter 1005 shifts the constraining condition information data CM_r after reflection of the cyan data upward by the paper feed amount. Shifted constraining condition information data CM′_r is calculated by:
CM′—r(nx,ny)=CM—r(nx,ny+LF) (67)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (67) as well, when ny+LF≧Nzzl, CM′_r(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
As described above, in order to calculate the constraining condition data for the next scan number, the information must be relatively shifted upward by the paper feed amount LF, and zero must be substituted in lower end LF nozzles. The reason why the buffer data are shifted by the paper feed amount LF in the magenta processing is that both the cyan and magenta halftone images at the same scan number have already been processed. Furthermore, in the third embodiment, since the constraining condition information is shared by cyan and magenta, after both the cyan and magenta dot allocations at the same scan number are determined, the constraining condition information is shifted upward by LF.
In step S906, a subtractor 1006 subtracts the data calculated by the halftone data shifter 1004 from the data calculated by the scan duty data shifter 1003. In step S907, a weight multiplier 1007 multiplies the difference data by a weighting coefficient h2 (real number).
In step S908, an adder 1008 adds the data calculated by the weight multiplier 1007 and the shifted CM constraining condition information to calculate constraining condition information CM_r after reflection of the cyan and magenta data.
A formula of the constraining condition information CM_r after reflection of the cyan and magenta data calculated in steps S906 to S908 is described by:
CM—r←(−Out′—m_LPF+M′—df)×h2+CM′—r (68)
In this way, the CM constraining condition information calculation processing based on the magenta dot allocations in step S514 in
In step S515, the constraining condition information buffer 109 is updated by the calculation result of the CM constraining condition information. The updated CM constraining condition information is referred to as information required to determine the dot allocations for the next scan number k+1 and subsequent scan numbers.
In the third embodiment, with the aforementioned processing, a dot pattern is formed for each scan so as to set low frequency components of an already printed dot pattern to be in opposite phase on an identical region on a printing medium, as in the first embodiment. However, in the first embodiment, dot patterns are formed to set low frequency components in opposite phase for dots of an identical color. However, the third embodiment is characterized in that dot patterns are formed to set low frequency components in opposite phase by shared constraining condition information.
Therefore, according to the third embodiment, not only the number of constraining condition information buffers can be reduced, but also since low frequency components are set in opposite phase between different colors, a trouble such as deterioration of graininess due to formation of dark blue dots resulting from overlapping of cyan and magenta dots can be prevented.
In step S516, the printer 2 which received the halftone data selects ink colors that match the image data, and starts a print operation. In step S516, a main scan for printing an image on the printing medium by driving respective nozzles at a predetermined drive interval while moving the printing head 201 from the left to the right with respect to the printing medium is made once. Upon completion of the main scan, a sub-scan as a scan perpendicular to the main scan is made once.
It is then checked in step S517 if all scans are complete. If all scans are complete, a series of image forming processes are complete; otherwise, the process returns to step S503. As described above, all the processes are complete.
As described above, according to the third embodiment, since the constraining condition information is shared by two or more colors, low frequency components can be set in opposite phase and high frequency components can be set to have no correlation not only for an identical colors in the first embodiment but also between different colors. In this manner, in addition to a reduction of the number of constraining condition information buffers, deterioration of graininess due to overlapping of different color dots especially in a low frequency region can be prevented.
The fourth embodiment according to the present invention will be described hereinafter. Since the detailed arrangement of the image forming apparatus according to the fourth embodiment is the same as that in the first embodiment described above, a repetitive description thereof will be avoided.
The first to third embodiments described above have exemplified the case in which the constraining condition information buffer 109 is updated always using the same filters irrespective of the image density. However, in general, since the spatial frequency characteristics of a halftone-processed image change depending on the density, if the constraining condition information is generated always using the same filters, the following problems may occur. For example, even for an image which poses no problem in a low density region, graininess may become conspicuous in a high density region. Conversely, for an image which poses no problem in a high density region, nonuniformity may become conspicuous in a low density region.
The fourth embodiment is characterized in that filters are changed according to the density values of an image. In this way, optimal processing can be executed according to the density, and the aforementioned deterioration of image quality depending on the density can be prevented.
The halftone processing of the fourth embodiment will be described below. This processing is basically the same as that in the flowchart of
In step S109, constraining condition information is calculated. For the sake of simplicity, details of calculations of cyan constraining condition information for 4-pass printing, the scan number k=1, and the number Nzzl of nozzles=16 will be described below with reference to the block diagram of
Note that the constraining condition information indicates whether or not a dot is easily formed upon determining dot allocations of a halftone image at the scan number k=2 next to the current scan number k=1, as described above. When the current scan number is k, the next scan number is k+1.
In step S1001 shown in
C_sum—d(nx,ny)=0 (69)
Lc_sum—d(nx,ny)=0 (70)
M_sum—d(nx,ny)=0 (71)
Lm_sum—d(nx,ny)=0 (72)
Y_sum—d(nx,ny)=0 (73)
K_sum—d(nx,ny)=0 (74)
where C_sum_d(X, Y), Lc_sum_d(X, Y), M_sum_d(X, Y), Lm_sum_d(X, Y), Y_sum_d(X, Y), and K_sum_d(X, Y) are buffer data of respective colors at an address (X, Y). Also, 0≦nx<image X size and 0≦ny<Nzzl.
A description will be given to only cyan. Accumulated scan duty data C_sum_d′ after addition in step S1001 is calculated by:
C_sum—d′=C—d+C_sum—d (75)
In step S1002, an adder 1102 shown in
Out—c_sum(nx,ny)=0 (76)
Out—lc_sum(nx,ny)=0 (77)
Out—m_sum(nx,ny)=0 (78)
Out—lm_sum(nx,ny)=0 (79)
Out—y_sum(nx,ny)=0 (80)
Out—k_sum(nx,ny)=0 (81)
where Out_c_sum(X, Y), Out_lc_sum(X, Y), Out_m_sum(X, Y), Out_lm_sum(X, Y), Out_y_sum(X, Y), and Out_k_sum(X, Y) are buffer data of respective colors C, Lc, M, Lm, Y, and K at an address (X, Y). Also, 0≦nx<image X size and 0≦ny<Nzzl.
A description will be given to only cyan. Accumulated scan duty data Out_c_sum′ after addition in step S1001 is calculated by:
Out—c_sum′=Out—c+Out—c_sum (82)
Note that Out_c assumes a value “0” or “255” since it is halftone data. Since Out_c_sum is the accumulated data of Out_c, it is a multiple of 0 or 255. For example, when Out_c=255 and Out_c_sum=255, Out_c_sum′=510. When Out_c=255 and Out_c_sum=510, Out_c_sum′=765.
In step S1003, the accumulated scan duty data C_sum_d′ calculated using equation (75) is written in the accumulated scan duty buffer 1103. As a result, we have:
C_sum_d←C_sum_d′ (83)
In step S1004, the accumulated halftone data Out_c_sum′ calculated using equation (82) is written in the accumulated halftone data buffer 1104. As a result, we have:
Out_c_sum←Out_c_sum′ (84)
In step S1005, an accumulated scan duty filter processor 1105 applies filter processing to C_sum_d held in the accumulated scan duty buffer 1103. This filter processing uses a two-dimensional (2D) Gaussian filter F_m(C_sum_d, x, y) which changes according to C_sum_d, and calculates C_sum_df by:
C_sum—df=C_sum—d*F—m(C_sum—d,x,y) (85)
where * is a convolution operation.
Note that the 2D Gaussian filter F_m is expressed by:
F—m=F′—m/Sum—m (86)
where Sum_m is a total value of F′_m coefficients. Also, F′_m is given by:
where the values of σx(C_sum_d) and σy(C_sum_d) change according to C_sum_d as the accumulated scan duty data.
In
In step S1006, an accumulated halftone data filter processor 1106 applies filter processing to Out_c sum held in the accumulated halftone data buffer 1104. This filter processing uses a 2D Gaussian filter LPF_b(C_sum_d, x, y) which changes according to C_sum_d, and calculates Out_c_sum_LPF by:
Out—c_sum_LPF=Out—c_sum—d*LPF—b (88)
Note that the 2D Gaussian filter LPF_b is expressed by:
LPF—b=LPF′—b/Sum—b (89)
where Sum_b is a total value of LPF′_b coefficients. Also, LPF′_b is given by:
where the values of σx(C_sum_d) and σy(C_sum_d) change according to C_sum_d as the accumulated scan duty data.
As can be seen from
In step S1007, a subtractor 1107 subtracts the data calculated by the accumulated halftone data filter processor 1106 from the data calculated by the accumulated scan duty filter processor 1105. In step S1008, a weight multiplier 1108 multiplies the difference data by a weighting coefficient h (real number) to obtain constraining condition information C_r. The processes in steps S1007 and S1008 are described by:
C—r←(−Out—c_sum_LPF+C_sum—df)×h (91)
In step S1009, a constraining condition information data buffer write unit 1109 writes the data C_r obtained by formula (91) in the constraining condition information buffer 109.
In step S1010, a constraining condition information data buffer shifter 1110 shifts the constraining condition information C_r written in the constraining condition information buffer 109 upward by one paper feed amount LF=Nzzl/Pass=16/4=4. Shifted constraining condition information data is calculated by:
C—r(nx,ny)=C—r(nx,ny+LF) (92)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (92), when ny+LF≧Nzzl, C_r(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
In step S1011, an accumulated scan duty data shifter 1111 shifts C_sum_d held in the accumulated scan duty buffer 1103 upward by one paper feed amount LF=Nzzl/Pass=16/4=4. Shifted accumulated scan duty data is calculated by:
C_sum—d(nx,ny)=C_sum—d(nx,ny+LF) (93)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (93) as well, when ny+LF≧Nzzl, C_sum_d(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
Likewise, in step S1012, an accumulated halftone data shifter 1112 shifts Out_c_sum held in the accumulated halftone data buffer 1104 upward by one paper feed amount. Shifted accumulated halftone data is calculated by:
Out—c_sum(nx,ny)=Out—c_sum(nx,ny+LF) (94)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (94) as well, when ny+LF≧Nzzl, Out_c_sum(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
In this way, the constraining condition information calculation processing in step S109 of the fourth embodiment is complete.
As described above, since the filter coefficients are changed for an identical color in accordance with the accumulated scan duty data, optimal constraining condition information according to the density can be calculated, thus preventing deterioration of image quality depending on the density.
Note that the filter processing of the fourth embodiment may be applied to the second embodiment that executes the dither matrix processing, and also to the third embodiment that shares constraining condition information by different colors.
The fifth embodiment according to the present invention will be described hereinafter. Since the detailed arrangement of the image forming apparatus according to the fifth embodiment is the same as that in the first embodiment described above, a repetitive description thereof will be avoided.
In the first to fourth embodiments described above, the filter processing is applied to multi-valued data such as C_d or C_sum_d and the like to execute processing under the assumption of preservation of the spatial frequency characteristics of an image. However, as is known, the filter processing for the multi-valued data such as C_d or C_sum_d and the like requires high processing cost in both hardware and software processing.
The fifth embodiment executes processing that omits the filter processing of the multi-valued data. With this processing, an image edge is emphasized, but a configuration that can reduce the processing cost can be attained.
The halftone processing of the fifth embodiment will be described below. This processing is basically the same as that in the flowchart of
In step S109, constraining condition information is calculated. For the sake of simplicity, details of calculations of cyan constraining condition information for 4-pass printing, the scan number k=1, and the number Nzzl of nozzles=16 will be described below with reference to the block diagram of
In step S1101 shown in
C_sum—d(nx,ny)=0 (95)
Lc_sum—d(nx,ny)=0 (96)
M_sum—d(nx,ny)=0 (97)
Lm_sum—d(nx,ny)=0 (98)
Y_sum—d(nx,ny)=0 (99)
K_sum—d(nx,ny)=0 (100)
where C_sum_d(X, X), Lc_sum_d(X, Y), M_sum_d(X, Y), Lm_sum_d(X, Y), Y_sum_d(X, Y), and K_sum_d(X, Y) are buffer data of respective colors at an address (X, Y). Also, 0≦nx<image X size and 0≦ny<Nzzl.
A description will be given to only cyan. Accumulated scan duty data C_sum_d′ after addition in step S1101 is calculated by:
C_sum—d′=C—d+C_sum—d (101)
In step S1102, a halftone data filter processor 1202 applies filter processing using a predetermined low-pass filter LPF_b to Out_c:
Out—c_LPF=Out—c*LPF—b (102)
The coefficients of LPF_b of the fifth embodiment will be explained as an isotropic weighted average filter 2402 in
In step S1103, an adder 1203 shown in
Out—c_LPF_sum(nx,ny)=0 (103)
Out—lc_LPF_sum(nx,ny)=0 (104)
Out—m_LPF_sum(nx,ny)=0 (105)
Out—lm_LPF_sum(nx,ny)=0 (106)
Out—y_LPF_sum(nx,ny)=0 (107)
Out—k_LPF_sum(nx,ny)=0 (108)
where Out_c_LPF_sum(X, Y), Out_lc_LPF_sum(X, Y), Out_m_LPF_sum(X, Y), Out_lm_LPF_sum(X, Y), Out_y_LPF_sum(X, Y), and Out_k_LPF_sum(X, Y) are buffer data of respective colors C, Lc, M, Lm, Y, and K at an address (X, Y). Also, 0≦nx<image X size and 0≦ny<Nzzl.
A description will be given to only cyan. Accumulated halftone-filtered data Out_c_LPF_sum′ after addition in step S1103 is calculated by:
Out—c_LPF_sum′=Out—c_LPF+Out—c_LPF_sum (109)
In step S1104, the accumulated scan duty data C_sum_d′ calculated using equation (101) is written in the accumulated scan duty buffer 1204. As a result, we have:
C_sum_d←C_sum_d′ (110)
In step S1105, the accumulated halftone-filtered data Out_c_LPF_sum′ calculated using equation (109) is written in the accumulated halftone-filtered data buffer 1205. As a result, we have:
Out_c_LPF_sum←Out_c_LPF_sum′ (111)
In step S1106, a subtractor 1206 subtracts the data stored in the accumulated halftone-filtered data buffer 1205 from the data stored in the accumulated scan duty buffer 1204. In step S1107, a weight multiplier 1207 multiplies the difference data by a weighting coefficient h (real number) to obtain constraining condition information C_r. The processes in steps S1106 and S1107 are described by:
C—r←(−Out—c_LPF_sum+C_sum—d)×h (112)
In step S1108, a constraining condition information data buffer write unit 1208 writes the data C_r obtained by formula (112) in the constraining condition information buffer 109.
In step S1109, a constraining condition information data buffer shifter 1209 shifts the constraining condition information C_r written in the constraining condition information buffer 109 upward by one paper feed amount LF=Nzzl/Pass=16/4=4. Shifted constraining condition information data is calculated by:
C—r(nx,ny)=C—r(nx,ny+LF) (113)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (113), when ny+LF≧Nzzl, C_r(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
In step S1110, an accumulated scan duty data shifter 1210 shifts C_sum_d held in the accumulated scan duty buffer 1204 upward by one paper feed amount LF=Nzzl/Pass=16/4=4. Shifted accumulated scan duty data is calculated by:
C_sum—d(nx,ny)=C_sum—d(nx,ny+LF) (114)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (114) as well, when ny+LF≧Nzzl, C_sum_d(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
Likewise, in step S1111, an accumulated halftone data shifter 1211 shifts Out_c_LPF_sum held in the accumulated halftone-filtered data buffer 1205 upward by one paper feed amount. Shifted accumulated halftone data is calculated by:
Out—c_LPF_sum(nx,ny)=Out—c_LPF_sum(nx,ny+LF) (115)
for 0≦nx<image X size and 0≦ny<Nzzl
In equation (115) as well, when ny+LF≧Nzzl, Out_c_LPF_sum(nx, ny)=0. That is, zero is substituted in lower end LF nozzles (four nozzles in this case) after the shift processing.
In this way, the constraining condition information calculation processing in step S109 of the fifth embodiment is complete.
As described above, according to the fifth embodiment, the processing that omits filter processing of multi-valued data is executed for an identical color in place of that in the first to fourth embodiments described above. In this way, an image edge is emphasized, but a configuration that can reduce the processing cost can be attained.
Note that the filter processing of the fifth embodiment may be applied to the second embodiment that executes the dither matrix processing, and also to the third embodiment that shares constraining condition information by different colors.
Each of the aforementioned embodiments has explained the image processing apparatus which uses the ink-jet printing method that forms an image by scanning the printing head having the plurality of nozzles, arranged in the predetermined direction, in a direction perpendicular to the arranging direction of the nozzles, and ejecting inks onto a printing medium. However, the present invention can be applied to printing apparatuses (for example, a thermal transfer method and electrophotography method) which execute printing according to methods other than the ink-jet method. In this case, the nozzles which eject ink droplets correspond to printing elements or laser light-emitting elements which print dots.
The present invention can also be applied to a so-called full-line type printing apparatus or the like, which has a printing head with a length corresponding to the printing width of a printing medium, and attains printing by moving the printing medium with respect to the printing head.
The present invention can adopt embodiments in the forms of a system, apparatus, method, program, storage medium (recording medium), and the like. More specifically, the present invention can be applied to either a system constituted by a plurality of devices (e.g., a host computer, interface device, image sensing device, web application, and the like), or an apparatus consisting of a single device.
Note that the present invention can also be achieved by directly or remotely supplying a program of software that implements the functions of the aforementioned embodiments to a system or apparatus, and reading out and executing the supplied program code by a computer of that system or apparatus. The program in this case is that corresponding to each illustrated flowchart in the embodiments.
Therefore, the program code itself installed in a computer to implement the functional processing of the present invention using the computer implements the present invention. Put differently, the present invention includes the computer program itself for implementing the functional processing of the present invention.
In this case, the form of program is not particularly limited, and an object code, a program to be executed by an interpreter, script data to be supplied to an OS, and the like may be used as long as they have the functions of the program.
As a recording medium for supplying the program, the following media can be used. For example, a Floppy® disk, hard disk, optical disk, magneto-optical disk, MO, CD-ROM, CD-R, CD-RW, magnetic tape, nonvolatile memory card, ROM, DVD (DVD-ROM, DVD-R), and the like can be used.
As a program supply method, the following method may be used. The user establishes a connection to a homepage on the Internet using a browser on a client computer, and downloads the computer program itself of the present invention (or a compressed file including an automatic installation function) from the homepage onto a recording medium such as a hard disk or the like. Also, the program code that forms the program of the present invention may be segmented into a plurality of files, which may be downloaded from different homepages. In other words, the present invention includes a WWW server which makes a plurality of users download a program file required to implement the functional processing of the present invention by the computer.
Also, a storage medium such as a CD-ROM or the like, which stores the encrypted program of the present invention, may be delivered to the user, and the user who has cleared a predetermined condition may be allowed to download key information used to decrypt the encrypted program from a homepage via the Internet. The user executes the encrypted program using the downloaded key information to install the program on a computer.
The functions of the aforementioned embodiments can be implemented when the computer executes the readout program. Furthermore, the functions of the aforementioned embodiments can be implemented when an OS or the like running on the computer executes some or all of actual processing operations on the basis of an instruction of that program.
Furthermore, the functions of the aforementioned embodiments can be implemented when the program read out from the recording medium is written in a memory equipped on a function expansion board or a function expansion unit, which is inserted in or connected to the computer, and is then executed. Therefore, a CPU equipped on the function expansion board or function expansion unit can execute some or all of actual processing operations.
While the present invention has been described with reference to exemplary embodiments, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. The scope of the following claims is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures and functions.
This application claims the benefit of Japanese Patent Application No. 2007-023515, filed Feb. 1, 2007, which is hereby incorporated by reference herein in its entirety.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2007-023515 | Feb 2007 | JP | national |
This application is a continuation of Application No. 12/022,305, which is currently pending.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4974067 | Suzuki et al. | Nov 1990 | A |
| 6164745 | Nagoshi et al. | Dec 2000 | A |
| 6364446 | Ishikawa et al. | Apr 2002 | B1 |
| 6511143 | Ishikawa et al. | Jan 2003 | B1 |
| 6669318 | Ushiroda | Dec 2003 | B2 |
| 7207650 | Ikemoto et al. | Apr 2007 | B2 |
| 7986440 | Yanai et al. | Jul 2011 | B2 |
| 20060170937 | Takahashi | Aug 2006 | A1 |
| 20080186348 | Yanai et al. | Aug 2008 | A1 |
| 20080192267 | Watanabe | Aug 2008 | A1 |
| Number | Date | Country |
|---|---|---|
| 06-336016 | Dec 1994 | JP |
| 2000-103088 | Apr 2000 | JP |
| 2000-141714 | May 2000 | JP |
| 2001-063014 | Mar 2001 | JP |
| Number | Date | Country | |
|---|---|---|---|
| 20110211208 A1 | Sep 2011 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 12022305 | Jan 2008 | US |
| Child | 13102285 | US |
