JP2005347860A - Image processing apparatus and image processing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an image processing apparatus and an image processing program capable of attaining high speed multi-value dither processing while considering the capacity of an available memory. <P>SOLUTION: The image processing apparatus includes: a bit map pattern generating section 14 for performing comparison arithmetic operation to a prescribed input value in M-bit input values with all coordinates in a multi-value dither table 11 so as to generate a bit map pattern 12a wherein output values with respect to the prescribed input values are arranged in the order of coordinates; a bit map pattern management section 15 for generating the bit map pattern 12a corresponding to all the input values in advance by using the bit map pattern generating section 14 and manages the bit map pattern 12a as a bit map pattern table 12; and an image processing section 10 that uses the bit map pattern table 12 or the multi-value dither table 11 to convert a multi-value image in M-bit multi-value into a multi-value image in N-bit multi-value. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to an image processing apparatus and an image processing program which are applied to a digital copying machine, a facsimile, a printer, and the like and perform multi-value dither processing.

  Conventionally, multi-value dither processing is performed on an M-bit multi-valued image per pixel using a multi-value dither table to output an N-bit multi-value (M> N) multi-value image. Is known (for example, see Patent Document 1). For example, in a printing apparatus such as a digital copying machine, a facsimile machine, or a printer, when the number of gradations of an input image exceeds the number of gradations that can be drawn, multi-level dither processing is performed on the input image and the gradations that can be drawn Drawing is executed after converting to a number of images.

FIG. 6 is a block diagram illustrating a configuration of an image processing apparatus according to a conventional example, and FIG. 7 is an explanatory diagram illustrating an example of a multi-value dither table.
As shown in FIG. 6, the conventional image processing apparatus has a configuration in which the image processing unit 1 performs a comparison operation between input image data and the multi-value dither table 2 to obtain an output image. For example, in the case of M = 8 and N = 3, seven input values (color values) of 256 gradations (= 2 to the 8th power) are distributed to levels of 8 gradations (= 2 to the 3rd power) (= Compared with the threshold value of 2 to the cube of -1), it is determined which level the input value belongs to, and this is used as the output value.

More specifically, the multi-value dither table 2 shown in FIG. 7 includes seven dither tables 2a. Each dither table 2a is a matrix in which 4 × 4 threshold values are arranged. The horizontal direction indicates the X coordinate and the vertical direction indicates the Y coordinate. For example, the input value of the coordinates (0, 0) is compared with a threshold value (175, 179, 183, 187, 191, 195, 199), and the level to which it belongs is determined. This comparison operation is executed for all pixels of the input image.
Japanese Patent Laid-Open No. 2000-299783

  However, according to the conventional multi-value dither processing, there are thresholds of 2 N −1 per pixel, and these threshold values and the data value of the input image are compared multiple times, and the output value of the pixel is determined. As a result, the calculation takes time and the processing speed is reduced. In particular, when the number of bits N of the output image increases, the number of comparison operations increases, and the processing speed decreases significantly.

  The present invention has been considered in view of the above circumstances, and can perform multi-value dither processing at high speed without performing a comparison operation with a threshold value, and further considers the amount of available memory. An object of the present invention is to provide an image processing apparatus and an image processing program capable of speeding up multi-value dither processing.

  In order to achieve the above object, the image processing apparatus of the present invention performs image processing using a multi-value dither table on a multi-value image having M-bit multi-value per pixel, and N-bit multi-value (M> N). An image processing apparatus for outputting a multi-valued image, wherein a predetermined color value among M-bit color values is compared with all coordinates in the multi-value dither table, and an output value corresponding to the predetermined color value is output. A bitmap pattern creation unit that creates bitmap patterns arranged in coordinate order, and a bitmap pattern corresponding to all color values in advance using the bitmap pattern creation unit, and these bitmap patterns Using the bitmap pattern management unit managed as a table, the bitmap pattern table, or the multi-value dither table, It is constituted comprising an image processing unit for converting the value image into N-bit multi-value multi-value image.

In this way, an M-bit multi-valued multi-valued image is converted into an N-bit multi-valued multi-valued image simply by referring to the bitmap pattern table without performing a comparison operation with a threshold value as in the prior art. It becomes possible. As a result, the multi-value dither processing can be speeded up, and a remarkable effect can be obtained particularly when the number of bits of the output image is large.
In addition, by using the bitmap pattern table and the multi-value dither table properly, the multi-value dither processing can be speeded up while taking into consideration the amount of usable memory.

  The image processing apparatus of the present invention performs a comparison operation with all M-bit color values for all coordinates in the multi-value dither table, and the multi-value in which the output values at each coordinate are arranged in the order of the color values of the input values. The image further comprises a multi-value calculation result table creation unit for creating a calculation result table, and a multi-value calculation result table management unit for managing the multi-value calculation result table created by the multi-value calculation result table creation unit, A processing unit converts an M-bit multi-value multi-value image into an N-bit multi-value multi-value image using the multi-value operation result table, the bitmap pattern table, or the multi-value dither table. is there.

In this way, the multi-value dithering process can be performed at high speed only by referring to the multi-value operation result table without performing the comparison operation with the threshold value.
In addition, by using the multi-value calculation result table, bitmap pattern table, and multi-value dither table properly, the multi-value dither processing can be speeded up while considering the amount of available memory. The multi-value calculation result table and the bitmap pattern table can be used properly.

  In the image processing apparatus of the present invention, the bitmap pattern management unit and / or the multi-value calculation result table management unit confirms the amount of usable memory, and only when the sufficient amount exists, the memory The bit map pattern table and / or the multi-value operation result table are created on the top.

  In this way, it is possible to create a bitmap pattern table and a multi-value calculation result table according to the amount of usable memory, and to speed up the multi-value dither processing. As a result, it is possible to increase the speed of the multi-value dithering process while suppressing excessive memory consumption. In particular, in an image processing apparatus that performs drawing processing simultaneously with multi-value dither processing, it is possible to avoid compression of the drawing processing memory and prevent a reduction in drawing processing speed.

  In the image processing apparatus of the present invention, when the image processing unit converts an M-bit multi-value multi-value image into an N-bit multi-value multi-value image, when the multi-value operation result table exists, When the multi-value operation result table is used and the multi-value operation result table does not exist, the bitmap pattern table is used, and when the multi-value operation result table and the bitmap pattern table do not exist, The multi-value dither table is used to convert an M-bit multi-value multi-value image into an N-bit multi-value multi-value image.

  In this way, it is possible to preferentially select a table with a high processing speed and execute the multi-value dither processing. Incidentally, the multi-value operation result table has the highest priority because the data access is faster than the bitmap pattern table.

Further, the image processing program of the present invention performs image processing using a multi-value dither table on a multi-value image having M bits per pixel and an N-bit multi-value (M> N) multi-value image. An image processing program that causes a computer to operate so as to output the image processing apparatus, wherein the computer is operated as one of the image processing apparatuses described above.
In this way, the present invention is provided as a program, and the same effects as those of the image processing apparatus can be obtained.

As described above, according to the present invention, an M-bit multi-valued multi-valued image can be converted into an N-bit multi-valued multi-valued image only by referring to the bitmap pattern table without performing a comparison operation with a threshold value as in the prior art. Since it can be converted into a value image, multi-value dither processing can be performed at high speed.
In addition, by using a plurality of tables, the multi-value dither processing can be speeded up in consideration of the amount of usable memory.

Embodiments of the present invention will be described below with reference to the drawings.
The configuration of the image processing apparatus according to the embodiment of the present invention will be described with reference to FIG.
FIG. 1 is a block diagram showing a configuration of an image processing apparatus according to an embodiment of the present invention.
However, although the image processing apparatus shown in FIG. 1 shows the configuration of the image processing unit in the printer as a specific example, the image processing apparatus of the present embodiment is not limited to the printer. , Scanners, digital multifunction devices (multifunction peripherals (MFPs)), computers and the like.

  Further, when the image processing apparatus of the present embodiment is a printer, the printer includes various printing methods such as an inkjet printer, a sublimation type thermal transfer printer, a dot impact printer, a laser printer, and a fusion type thermal transfer printer. Includes a printer.

  As shown in FIG. 1, the image processing apparatus according to the present embodiment includes an image processing unit 10, a multi-value dither table 11, a bitmap pattern table 12, a multi-value calculation result table 13, a bitmap pattern creation unit 14, and a bitmap pattern. A management unit 15, a multi-value calculation result table creation unit 16, a multi-value calculation result table management unit 17, a system control unit 18, and a memory management unit 19 are provided.

  The image processing unit 10 performs image processing on the M-bit multi-valued image data per pixel using the multi-value dither table 11, the bitmap pattern table 12, or the multi-value operation result table 13, thereby obtaining an N-bit multi-value image. A multi-valued image having a value (M> N) is output.

  The multi-value dither table 11 is a known one. If M = 8 and N = 3, the multi-value dither table 2 shown in FIG. 7 can be used. Usually, in an image processing apparatus such as a printer, a plurality of types of multi-value dither tables 11 having different gradations of input values, gradations of output values, dither patterns, etc. are prepared and stored in the ROM in advance.

  In multi-value dither processing using the multi-value dither table 11, an output image is obtained by performing a comparison operation between the currently valid multi-value dither table 11 and image data. For example, in the case of M = 8 and N = 3, seven input values (color values) of 256 gradations (= 2 to the 8th power) are distributed to levels of 8 gradations (= 2 to the 3rd power) (= Compared with the threshold value of 2 to the cube of -1), it is determined which level the input value belongs to, and this is used as the output value. This comparison operation is executed for all the pixels of the image data.

  The bitmap pattern table 12 is created in advance by comparing all the N-bit multi-value dither table 11 and the M-bit input value and stored in the RAM or ROM. In the multi-value dither processing using the bitmap pattern table 12, an output value can be obtained simply by referring to the bitmap pattern table 12 without performing a comparison operation. Compared to the processing speed.

FIG. 2 is an explanatory diagram of a bitmap pattern according to the embodiment of the present invention.
The bitmap pattern table 12 is composed of a plurality of bitmap patterns 12a created for each input value. FIG. 2 shows an input value “50” created based on the multi-value dither table 2 of FIG. , "150" bitmap pattern 12a.

  For example, when creating the bitmap pattern 12 a shown in FIG. 2A, the bitmap pattern creation unit 14 compares the input value “50” with the threshold value of each coordinate in the multi-value dither table 2, and 7 to which level it belongs. For example, in the coordinates (0, 3) of the multi-value dither table 2 in FIG. 7, the input value “50” is the threshold value “41” of the fifth layer dither table 2a and the threshold value “41” of the sixth layer dither table 2a. 51 ", the value of this coordinate is" 5 ". The bitmap pattern creation unit 14 repeats such a comparison operation for all the coordinates of the multi-value dither table 2 to create a bitmap pattern 12a as shown in FIG. Further, even when the input value is “150”, a bitmap pattern 12a as shown in FIG. 2B is created by the same comparison operation.

  An instruction to create the bitmap pattern table 12 is issued from the system control unit 18 to the bitmap pattern management unit 15 when the power is turned on. Upon receiving this instruction, the bitmap pattern management city 15 acquires a memory area for the bitmap pattern table from the memory management unit 19 and uses the bitmap pattern creation unit 14 to map the bitmap pattern 12a for all input values. Are managed as a bitmap pattern table 12. However, when the amount of usable memory is small, creation of the bitmap pattern table 12 is avoided.

FIG. 3 is an explanatory diagram of a bitmap pattern table according to the embodiment of the present invention.
The bitmap pattern table 12 shown in this figure is created based on the multi-value dither table 2 of FIG. 7, and is configured by arranging output values corresponding to each input value in the order of coordinates. When the image processing unit 10 performs multi-value dither processing using the bitmap pattern table 12, the bitmap pattern table 12 corresponding to the currently valid multi-value dither table 11 is added to the bitmap pattern table 12 via the bitmap pattern management unit 15. to access. When an input value in the image data is “50”, first, the input value “50” portion in the bitmap pattern table 12 is accessed using the data value “50” as a key.

  Next, based on the coordinates of the input value in the multi-value dither table 11, the corresponding position in the bitmap pattern table 12 is specified, and the output value present here is acquired. By repeating such processing over all the pixels of the image data, it is possible to convert M-bit multilevel image data into an N-bit multilevel output image. Since this multi-value dither process does not perform a comparison operation, it can be performed at a higher speed than the conventional multi-value dither process using the multi-value dither table 11.

  The multi-value calculation result table 13 is also created in advance by comparing all the M-bit input values with the N-bit multi-value dither table 11 and stored in the RAM or ROM. Is different from the bit map pattern table 12 in that the data are arranged in the order of the color values of the input values.

FIG. 4 is an explanatory diagram of a multi-value calculation result table according to the embodiment of the present invention.
The multi-value calculation result table shown in this figure is created based on the multi-value dither table 2 shown in FIG. Focusing on the coordinates (0, 3) in the multi-value dither table 2, when the input value is “0”, the output value is “0”, when the input value is “1”, the output value is “1”, and thereafter input The output value is obtained so that the output value is “1” until the value is “10”, and the output value is “2” from the input value “11” to “20”. This comparison operation result is stored in advance on a ROM or RAM as a table {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2,. 7, 7, 7}, when an input value of a certain pixel is input, an output value can be obtained by simply referring to a table value without performing a comparison operation.

Both the multi-value dither processing by the multi-value operation result table 13 and the multi-value dither processing by the bitmap pattern table 12 do not perform the comparison operation with the multi-value dither table 11, and the position of the output value in the tables 12 and 13. It is possible to obtain the output value for the input value simply by specifying the input value. However, when specifying the position of the output value, the former requires an operation as shown in Equation 1 below, and the latter as shown in Equation 2 below. Is necessary.

Output value position = (Y-coordinate of input value × dither table width + X-coordinate of input value) × 256 + input value (Equation 1)

Output value position = (dither table width × dither table height) × input value + (input value Y coordinate × dither table width) + input value X coordinate (Equation 2)

  According to the above calculation, since the multiplication in Expression 2 is one more, strictly speaking, the multi-value dither processing by the bitmap pattern table 12 is slower. Further, when actually processing image data, after processing a certain pixel, the next pixel is processed. In this way, when the output value of the adjacent pixel is obtained, in the processing by the multi-value calculation result table 13, the adjacent pixel can be accessed by simply adding “256”. In contrast, in the process using the bitmap pattern table 12, the first access key is an input value, and therefore it is not possible to simply access the adjacent pixel. Considering only the processing speed from this point, it is considered that the processing by the multi-value calculation result table 13 is faster, but the processing by the bitmap pattern table 12 is for processing an image whose input value does not change so much. There is an advantage that the processing can be speeded up by using the specific bitmap pattern 12a in a fixed manner. For example, it is advantageous when dithering a vector image.

  When the multi-value calculation result table management unit 17 receives a creation command from the system control unit 18, the multi-value calculation result table creation unit 16 creates and manages the multi-value calculation result table 13 using the multi-value calculation result table creation unit 16. At this time, the multi-value calculation result table management unit 17 makes an inquiry to the memory management unit 19 and executes the creation of the multi-value calculation result table 13 only when there is a sufficient amount of usable memory. .

FIG. 5 is a flowchart showing an operation procedure of the image processing unit according to the embodiment of the present invention.
As shown in this figure, the image processing unit 10 determines the input of image data (S1). If this is YES, the multi-value calculation result table 13 exists for the multi-value calculation result table management unit 17. (S2), if it exists, multi-value dither processing (S3) is executed by the multi-value calculation result table 13. This process is repeated until all the pixels of the image data are converted (S4).

If the multi-value calculation result table 13 does not exist, an inquiry is made to the bitmap pattern management unit 15 as to whether or not the bitmap pattern table 12 exists (S5). If it exists, the multi-value dither processing by the bitmap pattern table 12 is performed. (S6) is executed. This process is also repeated until all the pixels of the image data are converted (S7).
When the bitmap pattern table 12 does not exist, the multi-value dither process (S8) by the multi-value dither table 11 is executed. This process is also repeated until all the pixels of the image data are converted (S9).

  The image processing apparatus of the present embodiment configured as described above performs a comparison operation with all the coordinates in the multi-value dither table 11 for a predetermined input value among M-bit input values, and outputs the predetermined input value. A bitmap pattern creation unit 14 that creates a bitmap pattern 12a in which values are arranged in coordinate order and a bitmap pattern creation unit 14 are used to create bitmap patterns 12a corresponding to all input values in advance. Are used as a bitmap pattern table 12, and the bitmap pattern table 12 or the multi-value dither table 11 is used to convert an M-bit multi-value multi-value image into an N-bit multi-value multi-value image. The image processing unit 10 for converting to the image processing unit 10 is provided. Only by referring to sort map pattern table 12, it is possible to convert the multivalued image M bit multivalued N bit multi-value multi-value image.

As a result, the multi-value dither processing can be speeded up, and a remarkable effect can be obtained particularly when the number of bits of the output image is large.
In addition, by using the bitmap pattern table 12 and the multi-value dither table 11 properly, the multi-value dither processing can be speeded up while considering the amount of usable memory.

  Further, the image processing apparatus performs a comparison operation with all the M-bit input values for all the coordinates in the multi-value dither table 11, and the multi-value operation result table in which the output values at each coordinate are arranged in the order of the color values of the input values. A multi-value calculation result table creation unit 16 that creates 13 and a multi-value calculation result table management unit 17 that manages the multi-value calculation result table 13 created by the multi-value calculation result table creation unit 16. 10 is configured to convert an M-bit multi-value multi-value image into an N-bit multi-value multi-value image using the multi-value operation result table 13, the bitmap pattern table 12, or the multi-value dither table 11. Therefore, the three tables 11 to 13 can be used properly according to the remaining memory capacity and the input image.

  Further, the image processing apparatus checks the amount of usable memory, and creates the bitmap pattern table 12 and the multi-value operation result table 13 on the memory only when there is sufficient memory. Multi-level dither processing can be speeded up while suppressing consumption. In particular, when drawing processing is performed simultaneously with multi-value dither processing, it is possible to avoid drawing processing memory pressure and prevent a reduction in drawing processing speed.

  Further, when converting the M-bit multi-value multi-value image into the N-bit multi-value multi-value image, the image processing apparatus uses the multi-value operation result table 13 when the multi-value operation result table 13 exists. When the multi-value calculation result table 13 does not exist, the bitmap pattern table 12 is used. When the multi-value calculation result table 13 and the bitmap pattern table 12 do not exist, the multi-value dither table 11 is used. Since the M-bit multi-value multi-value image is converted into the N-bit multi-value multi-value image, it is possible to preferentially select a table having a high processing speed and execute the multi-value dither processing.

  The present invention is applied to multi-value dither processing for converting an M-bit multi-value image per pixel into an N-bit multi-value (M> N) multi-value image. In particular, it is useful in printers, copiers, facsimile machines, scanners, and digital composite apparatuses that frequently perform multi-value dither processing.

1 is a block diagram illustrating a configuration of an image processing apparatus according to an embodiment of the present invention. It is explanatory drawing of the bitmap pattern which concerns on embodiment of this invention. It is explanatory drawing of the bitmap pattern table which concerns on embodiment of this invention. It is explanatory drawing of the multi-value calculation result table which concerns on embodiment of this invention. It is a flowchart which shows the operation | movement procedure of the image process part which concerns on embodiment of this invention. It is a block diagram which shows the structure of the image processing apparatus which concerns on a prior art example. It is explanatory drawing which shows the example of a multi-value dither table.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Image processing part 11 Multi-value dither table 12 Bitmap pattern table 13 Multi-value calculation result table 14 Bitmap pattern creation part 15 Bitmap pattern management city 16 Multi-value calculation result table creation part 17 Multi-value calculation result table management part 18 System Control unit 19 Memory management unit

Claims (5)

An image processing apparatus that performs image processing using a multi-value dither table on an M-bit multi-value image per pixel and outputs an N-bit multi-value (M> N) multi-value image. ,
A bitmap pattern that performs a comparison operation with all coordinates in the multi-value dither table for a predetermined color value among M-bit color values, and creates a bitmap pattern in which output values for the predetermined color value are arranged in the coordinate order The creation department;
A bitmap pattern management unit that creates bitmap patterns corresponding to all color values in advance using the bitmap pattern creation unit and manages them as a bitmap pattern table;
An image processing unit that converts an M-bit multi-value multi-value image into an N-bit multi-value multi-value image using the bitmap pattern table or the multi-value dither table. apparatus. A multi-value operation result is created for all the coordinates in the multi-value dither table with all M-bit color values and creating a multi-value operation result table in which the output values at each coordinate are arranged in the order of the color values of the input values. A table creation section;
A multi-value calculation result table management unit that manages the multi-value calculation result table created by the multi-value calculation result table creation unit;
The image processing unit converts an M-bit multi-value multi-value image into an N-bit multi-value multi-value image using the multi-value operation result table, the bitmap pattern table, or the multi-value dither table. The image processing apparatus according to claim 1. The bitmap pattern management unit and / or the multi-value operation result table management unit checks the amount of usable memory, and only when the sufficient memory exists, the bitmap pattern table and / or The image processing apparatus according to claim 1, wherein the multi-value calculation result table is created. When the image processing unit converts an M-bit multi-value multi-value image into an N-bit multi-value multi-value image, if the multi-value operation result table exists, the multi-value operation result table is used, When the multi-value operation result table does not exist, the bitmap pattern table is used, and when the multi-value operation result table and the bitmap pattern table do not exist, the multi-value dither table is used. The image processing apparatus according to any one of claims 1 to 3, wherein a bit multi-value multi-value image is converted into an N-bit multi-value multi-value image. Image processing using a multi-value dither table is performed on an M-bit multi-value image per pixel, and the computer is operated so as to output an N-bit multi-value (M> N) multi-value image. An image processing program,
An image processing program that causes the computer to operate as the image processing apparatus according to claim 1.

Images