JP4096949B2 - Image processing apparatus, processing method, and recording medium - Google Patents

Description

  The present invention relates to an image processing apparatus that multiplies input image data by an error diffusion method.

  2. Description of the Related Art Conventionally, as a computer output device, a color printer of a type that records dots by forming dots with several colors of ink ejected from a head has been proposed. It is widely used for printing. Such a printer can take only two values, that is, a state where dots are formed (on) and a state where dots are not formed (off), and can only express two gradations. Therefore, these printers express the multi-gradation of the original image data by controlling the on / off state of dots dispersed in a predetermined area by so-called halftone processing. In recent years, multi-value printers have been proposed that can express more than one on / off state for each dot by making it possible to form many types of dot diameters and ink densities. This halftone process is still necessary.

  As a typical method of such halftone processing, there is an error diffusion method. The error diffusion method diffuses the error of the gradation value generated when the binarization is performed by comparing the gradation value of each pixel of the image data with a predetermined threshold value to peripheral pixels at a certain ratio. It is a way to do. According to such a technique, although a density error is locally generated between the gradation value of the original image and the density expressed by the printed dots, the density error is distributed to the surrounding pixels to thereby obtain a predetermined error. This error can be eliminated by looking at the area. For this reason, there is an advantage that printing with high image quality can be realized.

  However, since the error diffusion method diffuses density error to surrounding pixels, the amount of calculation for each pixel is large. For this reason, a long time was required for processing. In recent years, as the resolution of printers has increased, and it has become necessary to perform multi-value processing for a larger number of pixels than in the past, it has been desired to shorten the processing time of the error diffusion method.

  In order to increase the processing speed, parallel processing is often applied. In the error diffusion method, it is necessary to wait for the density error caused by the processing of one pixel to be diffused before processing the next pixel. That is, the error diffusion method requires that the pixels be processed one by one in order. For this reason, it has been conventionally considered that parallel processing cannot be applied to the error diffusion method.

  The present invention has been made to solve such a problem, and an object of the present invention is to provide a technique for performing multi-value conversion by an error diffusion method at high speed.

In order to solve the above-described problems, the image processing apparatus of the present invention employs the following configuration.
The image processing apparatus of the present invention
An image processing apparatus that multi-values input image data by an error diffusion method that diffuses density errors that occur when multi-valued each pixel to surrounding pixels that have not yet been multi-valued.
Among the unprocessed pixels that have not yet been multi-valued, a plurality of pixels in which density errors diffused from other pixels are completely determined are subjected to multi-value conversion by the error diffusion method in parallel. .

  According to such an image processing apparatus, since multi-value conversion is performed in parallel for a plurality of pixels, processing by the error diffusion method can be executed at high speed. Speeding up by parallel processing is a means usually performed, but the present invention is significant in that parallel processing is applied to multi-value processing by an error diffusion method, which has conventionally been difficult to apply. The significance of this will be described.

  In the error diffusion method, it is necessary to wait for the density error caused by the processing of one pixel to be diffused before processing the next pixel. Conventionally, it has been difficult to apply parallel processing to the error diffusion method due to the nature of executing such processing. For example, consider image data in which Nx pixels in the X direction and Ny pixels in the Y direction are two-dimensionally arranged. The upper left pixel is represented as (1, 1), and the lower right pixel is represented as (Nx, Ny). When parallel processing is applied to such multi-valued image data, the first attempt is to divide the image data into upper and lower halves, that is, an area where the number of pixels in the Y direction is Ny / 2 or less and an area greater than Ny / 2 It is a method to apply separately. However, in this case, at the boundary between the two divided areas, the density error caused by the multi-value conversion is not solved, and the image quality changes discontinuously at the joint between the two.

  As another means, for example, a first multi-value process that sequentially proceeds from the upper left pixel to the lower right part of the image region and a second multi-value process that sequentially proceeds from the lower right pixel to the upper left part are performed in parallel. Means to do so are conceivable. Even in such a means, a seam between the first multi-value and the second multi-value is generated near the center of the image area, and the image quality is also changed discontinuously.

  As another means, for example, the image is divided into two upper and lower regions, and the first multi-value processing that advances from the center upward and the second multi-value operation that advances from the center downward are performed in parallel. Means to do so are also conceivable. In such a case, since a density error caused by processing of the pixels near the center can be diffused to the surrounding pixels, it is estimated that the image quality at first glance is ensured. However, the error diffusion method has a characteristic that an error due to multi-leveling cannot be sufficiently eliminated by diffusing density error in the vicinity of the pixel where processing is started. This is because a considerable number of pixels is required to express a gradation value of about 256 gradations using binary values of dot on / off. For this reason, normally, in the error diffusion method, the processing is started from the upper left of the image data or the like, thereby making the density error generated in the pixel immediately after the processing less noticeable. As in the method described above, if multi-value conversion is started from the center of the image data by the error diffusion method, density errors due to multi-value display become conspicuous and image quality is greatly impaired.

  As described above, as shown by some examples, it has been difficult for the error diffusion method to achieve parallelization without reducing the image quality. Against this background, the parallel processing of the error diffusion method tended to be excluded from technical considerations. As a result of pursuing the application of parallel processing to the error diffusion method without satisfying such a situation with respect to the image processing technique, the present inventor noticed matters described below and completed the present invention.

  When multi-value conversion is performed by the error diffusion method, there may be a plurality of pixels in the image data in which density errors diffused from other pixels are completely determined. A completely determined pixel means a pixel in which an error diffused to the pixel does not change at all until the processing of the pixel itself is started when multi-value conversion by the error diffusion method is continued. Hereinafter, such a pixel is referred to as an error determination pixel. At least a pixel that is processed next to the pixel of interest that is currently being processed is an error-determined pixel. The other error-determining pixels are determined in accordance with the region where the error is diffused when multi-leveling is performed. The error definite pixel appears depending on the progress of processing by the error diffusion method.

For example,
The image data is data two-dimensionally arranged in a first direction and a second direction,
When the error diffusion method is performed while diffusing the density error to at least a pixel column adjacent in the second direction for each pixel along the pixel column aligned in the first direction,
The plurality of pixels that are multi-valued in parallel are pixels on adjacent pixel columns.

  Taking such a case as an example, the state of parallelization in the present invention is specifically shown. FIG. 9 shows an example in which an error is diffused to pixel columns adjacent in the second direction. Each square in FIG. 9 represents a pixel. 9 corresponds to the first direction of the present invention, and PP, P1,... Correspond to the pixel column. FIG. 9 shows an error distribution when the pixel PP is multi-valued by the error diffusion method. For example, 1/4 of the density error generated in the pixel PP is distributed to the adjacent pixel P1. In addition, the density error is distributed around the pixel of interest by the distribution as illustrated, and the error is also distributed to the pixel columns adjacent in the Y direction in FIG.

  FIGS. 10 to 12 show how errors are distributed when processing by the error diffusion method is sequentially performed. The filled pixels in the figure indicate the target pixel PP being processed. The hatched pixels in the figure indicate pixels in which the density error is diffused from the target pixel PP. When the pixel PP shown in FIG. 10 is processed, an error is diffused to the pixel PQ on the adjacent pixel column. When the processing for the pixels adjacent in the X direction is executed after the processing for the pixel PP in FIG. 10 is completed, the error is not diffused to the pixels PQ on the adjacent pixel columns as shown in FIG. Furthermore, when executing processing of pixels adjacent in the X direction, as shown in FIG. 12, no error is diffused to the pixels PQ on the adjacent pixel columns. As is clear from the specific examples shown in FIGS. 10 to 12, the density error diffused to the pixel PQ on the pixel column adjacent to the target pixel PP is determined when the processing of the pixel PP shown in FIG. 10 is completed. At this time, there are two pixels, the pixel PQ adjacent to the right side of the pixel of interest PP in FIG. 10 and the pixel PQ, as the pixels in which the error diffused from other pixels is completely determined.

  The image processing apparatus of the present invention performs multi-value processing by the error diffusion method for the error-defining pixel as well as the pixel adjacent to the right side of the target pixel PP as in the pixel PQ of this specific example. This process can be performed in parallel with the multi-value pixel PP shown in FIGS. For example, if multi-value conversion of the pixel PQ is executed at the time of FIG. 11, the pixel diffused to the adjacent pixel PR on the right side is determined. Therefore, at the time of FIG. 12, multi-value processing can be performed on the pixel PR simultaneously with the processing of the pixel PP.

  In the present invention, parallelization, which has conventionally been difficult to apply, is realized by executing multi-value conversion by the error diffusion method for a plurality of error-determined pixels in this way. Further, if parallel processing is executed for such error-determined pixels, there will be no seams as in the methods listed above as specific examples of parallelization. Therefore, according to the image processing apparatus of the present invention, it is possible to achieve high speed while maintaining the image quality by the conventional error diffusion method.

  In the above-described specific example, the case where two pixels of the pixel PP and the pixel PQ are processed in parallel has been described. In the multi-value conversion by the error diffusion method, the number of error-determining pixels is not limited to the two described above, and there may be more. Needless to say, when there are three or more such pixels, parallel processing can be performed for three or more pixels. Further, the positional relationship of pixels that can be subjected to parallel processing is not limited to that shown in FIGS. 10 to 12, and can be specified according to the region where the density error is diffused. Of course, it is needless to say that the present invention can be applied even when an error is diffused over three or more lines in the Y direction.

Regarding the image processing apparatus of the present invention, an apparatus that performs parallel processing on at least two pixels can be configured as follows.
An image processing apparatus that multi-values input image data by an error diffusion method that diffuses density errors that occur when multi-valued each pixel to surrounding pixels that have not yet been multi-valued.
Input means for inputting image data arranged two-dimensionally in a first direction and a second direction;
An unprocessed pixel that has not yet been converted into multiple values is converted into multiple values by an error diffusion method that diffuses a density error to at least pixel columns adjacent in the second direction in order along the pixel columns arranged in the first direction. First multi-value conversion means for performing conversion;
The density error diffused from other pixels among the pixels on the pixel column adjacent in the second direction is completely determined for the pixel column that is multi-valued by the first multi-value quantization means. An image processing apparatus is provided with a second multi-value conversion unit that performs multi-value conversion by an error diffusion method in parallel with multi-value conversion by a first multi-value conversion unit.

The present invention can also be configured as an image processing method equivalent to this.
An image processing method that multi-values input image data by an error diffusion method that diffuses density errors that occur when each pixel is multi-valued to surrounding pixels that have not yet been multi-valued.
(A) inputting image data arranged two-dimensionally in a first direction and a second direction;
(B) A step of performing multi-value conversion on an unprocessed pixel that has not yet been multi-valued by an error diffusion method in order along a pixel column arranged in the first direction;
(C) After a pixel in which a density error diffused from other pixels is completely determined appears on a pixel column adjacent in the second direction with respect to the pixel column to be multi-valued in the step (b). In parallel with the step (b), there is provided an image processing method comprising a step of multileveling pixels on the adjacent pixel columns by an error diffusion method.

  In this way, multi-value processing can be executed in parallel for two pixels based on the same operation as described above with reference to FIGS. The above invention is not limited to performing parallel processing on two pixels, and may perform parallel processing on three or more pixels.

  The first multi-value conversion means sequentially executes the multi-value conversion processing in the first direction from one end of the pixel column to the other end, and after the processing is completed up to the other end, Execute the process. When the processing of another pixel column is started, if the multi-value conversion by the second multi-value conversion means is not yet finished, the first multi-value conversion means converts the multi-value by the second multi-value conversion means. For the pixel column to be subjected to the above, multi-value conversion is performed on error-determined pixels existing in pixels on the pixel column adjacent in the second direction. That is, the position of the first multi-value conversion means and the position of the second multi-value conversion means in the above invention are reversed. The image processing apparatus according to the present invention alternates the method of specifying the pixels to be processed by the first multi-value conversion means and the second multi-value conversion means each time the processing for one pixel row is completed. It can also be understood as an apparatus further provided with means for changing to Naturally, the image processing method of the present invention can also be regarded as a method including alternately changing the method of specifying the pixels to be processed in the step (b) and the step (c).

In the above-described image processing apparatus that realizes parallel processing for at least two pixels,
The second multi-value conversion unit may include a determination unit that determines whether or not a density error diffused from other pixels is completely determined for a pixel to be multi-valued. For example, the determination is based on an interval from the pixel that is being processed by the first multi-value conversion unit, or a density error that is diffused to each pixel during the first multi-value conversion process. It can be judged by observing only for a predetermined period. In this way, it is possible to reduce the possibility that the second multi-value conversion means apologizes and processes pixels that are not error-determined pixels, and the certainty that high-quality multi-value conversion is performed increases.

In the above image processing apparatus, for example, the second multi-value conversion means performs multi-value conversion by shifting the multi-value conversion processing by the first multi-value conversion means by a predetermined timing, resulting in other values. Pixels for which the error diffused from these pixels is completely determined may be processed.
For example, the target pixel that has been multi-valued by the first multi-value converting means and the target pixel that has been multi-valued by the second multi-value converting means are in the first direction. It can be in a positional relationship having an interval of about half the width of the pixel column.

  Normally, the error diffusion method does not diffuse the error over half the width of the pixel column. This is because when the error is diffused over such a wide range, the error cannot be sufficiently diffused when both ends of the image are processed, and the image quality after multi-leveling is impaired. Accordingly, if the timing of multi-value conversion by the two multi-value conversion means is shifted as in the above image processing apparatus, the attention of the other multi-value conversion means is focused on the area where the error is diffused by one multi-value conversion means. It is difficult for a pixel to enter. Therefore, parallel processing by the first multi-value quantization means and the second multi-value quantization means can be realized without performing complicated determination processing.

  The effect described above can be obtained if the interval between the pixel of interest by the first multi-value quantization means and the pixel of interest of the second multi-value quantization means is made wider than the error diffusion width. However, if the interval between them is about half the width of the pixel row, the area where the density error is diffused by one multi-value quantization means and the pixel to be processed by the other multi-value quantization means can overlap. Sex can be minimized. Therefore, the possibility that the image quality is impaired by the parallel processing can be minimized. Further, when the processing of one pixel column is completed by the first multi-value conversion means, the second multi-value conversion means has almost half of the processing of adjacent pixel columns, so the first multi-value conversion is performed. The means can start the processing of the next pixel row without waiting time, and can realize very efficient processing.

  In the image processing apparatus of the present invention, it is desirable that the first multi-value conversion means and the second multi-value conversion means are constituted by different arithmetic circuits. The image processing apparatus of the present invention can be configured by realizing the first multi-value conversion means and the second multi-value conversion means with the same arithmetic circuit, but if both are configured with different arithmetic circuits. The effect of speeding up by parallel processing can be obtained to the maximum. Here, the arithmetic circuit may be a dedicated circuit for performing multi-value processing by an error diffusion method, or may be a general-purpose circuit such as a CPU. Of course, a combination of both may be used.

  Usually, an image processing apparatus that performs multi-value processing by an error diffusion method has a memory for storing a diffused error in correspondence with a pixel. In the image processing apparatus of the present invention, a memory used in the first multi-value conversion means and a memory used in the second multi-value conversion means can be prepared.

Further, the memory used by both means may be shared in the following manner.
That is, in an image processing apparatus that performs parallel processing on two pixels,
The image data is data having Nx pixels (Nx is an integer of 2 or more) in the first direction,
The first multi-value quantization means is a means for diffusing density errors to unprocessed pixels on n pixel columns from the Yth to Y + n−1th (Y, n are natural numbers),
The second multi-value conversion means
A region in which density error is diffused to unprocessed pixels on n pixel columns from Y + 1 to Y + n, and the density error is diffused to the Yth pixel column by the first multi-value quantization unit; Means for processing pixels in which positions in the first direction do not overlap with a region where density error is diffused in the Y + n-th pixel column;
A memory corresponding to two-dimensionally arranged pixels in each of the Nx number in the first direction and n number in the second direction;
While the density error diffused to the (n−1) pixel columns from the (Y + 1) th to the (Y + n−1) th is kept uniquely in the positional relationship between the pixels and the memory in the first direction and the second direction, store in a memory corresponding to n-1 pixels,
And,
In the memory corresponding to the remaining one pixel column, the density error diffused to the Y-th pixel column and the density error diffused to the Y + n-th pixel column are stored in the first direction as pixels. An image processing apparatus includes a storage unit that stores the memory while maintaining a unique positional relationship.

  The area where the error is diffused by the first multi-value quantization means and the area where the error is diffused by the second multi-value quantization means overlap in the area from the (Y + 1) th to the (Y + n-1) th pixel column. Yes. Therefore, in this area, a memory for storing an error diffused by both means can be shared. For this purpose, a memory for Nx × (n−1) pixels is sufficient. In addition to this memory, a memory for storing an error diffused to the Y-th pixel column by the first multi-value quantization means and an error diffused to the Y + n-th pixel column by the second multi-value quantization means If there is a memory for storing the error, the error diffused by both means can be stored without confusion. In the image processing apparatus, the second positional relationship between the region in which the error is diffused in the Yth pixel column and the region in which the error is diffused in the Y + nth pixel column does not overlap. After controlling the pixel of interest of the multi-value conversion means, the density error diffused in these pixel columns is stored in a memory corresponding to one pixel column. Thus, by partially sharing the memory for storing the error diffused by both the multi-value conversion means, the memory capacity can be saved. Further, by sharing the memory, it is not necessary to transmit a density error between the first multi-value conversion unit and the second multi-value conversion unit, and the processing speed can be increased.

The memory for storing the diffused error can be further saved by adopting the following mode.
That is, in an image processing apparatus that performs parallel processing on two pixels,
The image data is data having Nx pixels (Nx is an integer of 2 or more) in the first direction,
The first multi-value conversion means starts from the first pixel of interest to be processed with respect to unprocessed pixels on n pixel columns from the Yth to Y + n−1th (Y, n are natural numbers). Means for diffusing density error over a maximum of m pixels (m is a natural number) in the first direction;
The second multi-value conversion means increases the maximum number of m pixels in the first direction from the second target pixel to be processed with respect to unprocessed pixels on n pixel columns from Y + 1 to Y + n. A means for diffusing density errors over
A first memory corresponding to two-dimensionally arranged pixels in a number of Nx in the first direction and n-1 in the second direction;
A second memory corresponding to 2m pixels,
The density error diffused to the (n−1) pixel columns from the (Y + 2) th to the (Y + n) th is represented by n− while maintaining the positional relationship between the pixels and the memory in the first direction and the second direction uniquely. Storing in a first memory corresponding to one pixel;
And,
An error diffused from the first target pixel to the m pixels in the first direction in the Yth pixel column, and the second direction from the second target pixel in the Y + 1th pixel column The image processing apparatus includes storage means for storing an error diffused to m pixels in the second memory.

  In this way, the memory amount can be saved to “Nx × n + 2m”. The error stored in the second memory includes not only the error newly diffused by the first multi-value conversion means and the second multi-value conversion means, but also the error already diffused by the previous processing. You need to remember the sum. In addition to the above-described aspects, the error allocation to each memory may employ various correspondence relationships that can avoid the error diffused to different pixels being confused and stored in the same memory. it can.

  The printing apparatus of the present invention described above can also be configured by realizing a multilevel processing by an error diffusion method by a computer. Therefore, the present invention can also take the form of a recording medium on which such a program is recorded.

The recording medium of the present invention is
A computer-readable program for multi-valued input image data can be obtained by an error diffusion method that diffuses density errors that occur when each pixel is multi-valued to surrounding pixels that have not yet been multi-valued. A recorded recording medium,
A function of inputting image data arranged two-dimensionally in a first direction and a second direction;
A first multi-value quantization function that multi-values unprocessed pixels that have not yet been multi-valued by an error diffusion method in order along the pixel columns arranged in the first direction;
Among the pixels on the pixel column adjacent in the second direction to the pixel column to be multi-valued by the first multi-value function, the pixel in which the density error diffused from other pixels is completely determined With the ability to identify
A recording medium recording a program for realizing a second multi-value function for performing multi-value conversion by an error diffusion method in parallel with the first multi-value function for the identified pixel.

  The recording medium includes a flexible disk, CD-ROM, magneto-optical disk, IC card, ROM cartridge, punch card, printed matter on which a code such as a barcode is printed, an internal storage device of a computer (memory such as RAM or ROM). ) And external storage devices can be used. Moreover, the aspect as a program supply apparatus which supplies the computer program which makes a computer implement | achieve the said function via a communication path is also included.

Hereinafter, embodiments of the present invention will be described based on examples.
(1) Apparatus Configuration FIG. 1 is a block diagram showing the configuration of a printing apparatus to which an image processing apparatus as an embodiment of the present invention is applied. As shown in the figure, a scanner 12 and a color printer 22 are connected to a computer 90. A computer 90 functions as the image processing apparatus of this embodiment. The computer 90 includes two CPUs 81A and 81B as arithmetic devices that execute various arithmetic processes related to image processing according to a program. The following units are connected to each other by a bus 80 with the CPUs 81A and 81B as the center. The ROM 82 stores in advance programs and data necessary for the CPUs 81A and 81B to execute various arithmetic processes.

  The RAM 83 is a memory in which various programs and data necessary for executing various arithmetic processes by the CPUs 81A and 81B are temporarily read and written. The RAM of this embodiment is accessed from the two CPUs 81A and 81B. Therefore, in this embodiment, a RAM of a type in which two CPUs can freely read and write without considering timing with each other is used. Of course, if a slight decrease in processing efficiency is prepared, a normal RAM may be used, and the access timing may be controlled so that reading and writing to the RAM are not performed simultaneously by the two CPUs.

  The input interface 84 controls input of signals from the scanner 12 and the keyboard 14, and the output interface 85 controls output of data to the printer 22. The CRTC 86 controls signal output to the CRT 21 capable of color display, and the disk controller (DDC) 87 controls data exchange with the hard disk 16, the CD-ROM drive 15, or a flexible disk drive (not shown). The hard disk 16 stores various programs loaded in the RAM 83 and executed, various programs provided in the form of device drivers, and the like.

  In addition, a serial input / output interface (SIO) 88 is connected to the bus 80. The SIO 88 is connected to the modem 18 and is connected to the public telephone line PNT via the modem 18. The computer 90 is connected to an external network via the SIO 88 and the modem 18, and a program necessary for image processing can be downloaded to the hard disk 16 by connecting to a specific server SV. It is also possible to load a necessary program by a CD-ROM or a flexible disk and cause the computer 90 to execute it.

  FIG. 2 is a block diagram showing a software configuration of the image processing apparatus. The image processing apparatus in the computer 90 is configured by loading a so-called printer driver 100 into the computer 90 and realizing the functions shown in the figure. First, the input unit 102 inputs image data to be processed by the image processing apparatus. This image data may be data fetched from the scanner 12 shown in FIG. 1 or may be data generated by the computer 90 executing various application programs.

  The input image data is transferred to the rendering unit 104. The rendering unit converts the image data into data corresponding to pixels two-dimensionally arranged in the X direction and the Y direction. As a result, image data having gradation values of three color components of red (R), green (G), and blue (B) is generated for each pixel. The state of the image data generated by the rendering unit is shown in FIG. The squares in the figure indicate the respective pixels. In this embodiment, Nx pixels in the X direction and Ny pixels in the Y direction are two-dimensionally arranged. In this specification, as shown in FIG. 3, numbers are assigned to the X direction and the Y direction in order from the upper left of the image data, and each pixel is specified in the coordinate format (number in the X direction, number in the Y direction). To do. Accordingly, the upper left pixel of the image data is represented as (1, 1), and the lower right pixel is represented as (Nx, Ny).

  The image data generated in this way is transferred to the color correction unit 106. In the color correction unit 106, RGB image data is converted into multi-values for colors that can be printed by the printer 22, here, for each color of cyan (C), magenta (M), yellow (Y), and black (K). Signal). The color correction unit 106 refers to the color correction table LUT and replaces the RGB gradation values of the image data with the gradation values of each color of CMYK. In this embodiment, each color component has a gradation value with a width such as 256 gradations.

  Image data having CMYK gradation values is binarized by the halftone processing unit 110. That is, data corresponding to ON / OFF of dots formed by the printer 22 is assigned to each pixel. In the printer driver 100 according to the present embodiment, halftone processing can be processed in parallel by two blocks of the first error diffusion unit 112 and the second error diffusion unit 114 shown in FIG. Both share image data and execute binarization by the error diffusion method. In this embodiment, the first error diffusion unit 112 processes pixels on odd-numbered pixel columns, that is, pixels represented by (n, 2m−1) (n and m are natural numbers), and the second error diffusion unit Reference numeral 114 denotes a pixel on an even-numbered pixel column, that is, a pixel represented by (n, 2m) (n and m are natural numbers). FIG. 4 shows the sharing of the two. In FIG. 4, solid arrows indicate the order of processing by the first error diffusion unit 112, and broken arrows indicate the order of processing by the second error diffusion unit 114. Each pixel column is processed in ascending order of numbers in the X direction, as shown in FIG. The processing timing by the first error diffusion unit 112 and the second error diffusion unit 114 will be described later.

  In the error diffusion method, as will be described in detail later, image processing that minimizes the density error is realized by diffusing the density error caused by the binarization of each pixel to surrounding pixels. As a memory for storing the density error, the first error diffusion unit 112 and the second error diffusion unit 114 each use a common error buffer 116. Of course, the first error buffer used by the first error diffusion unit 112 and the error buffer used by the second error diffusion unit 114 may be provided separately.

  The image data processed by the above functional blocks is output to the printer 22 via the output unit 120. The printer 22 can print an image corresponding to the input image data by forming dots for each pixel to be written based on this data. In this embodiment, the printer 22 is used as an example of the output destination of the image processing result, but the output destination is not limited to this. In addition to a so-called printer, it can be output to a plate-making apparatus for screen printing, or can be output to a display.

  The printer 22 used in the present embodiment is a so-called ink jet type printer. In other words, it is a printer that records an image by ejecting ink onto printing paper to form dots. Of course, other types of printers such as a so-called dot impact type printer or thermal transfer type printer may be used.

(2) Image processing:
Next, the contents of image processing in the image processing apparatus of this embodiment will be described. FIG. 5 shows a flowchart of an image processing routine by the image processing apparatus of this embodiment. This process is executed by the CPUs 81A and 81B in the computer 90. In this embodiment, the CPU 81A mainly executes processing, and the CPU 81B executes halftone processing described later together with the CPU 81A.

  As shown in FIG. 5, when the image processing routine is started, the CPU 81A inputs image data (step S100). This image data corresponds to the image data input by the input unit 102 shown in FIG. That is, it is the original image data generated by data read from the scanner 12 or various applications. Next, the CPU 81A executes a rendering process on this image data (step S200). This process corresponds to the process executed by the rendering unit 104 shown in FIG. That is, the image data read in step S100 is replaced with RGB gradation data corresponding to the two-dimensionally arranged pixels. As shown in FIG. 3, the image data obtained by the rendering process is Nx size in the X direction and Ny size in the Y direction, and has RGB gradation values for each pixel.

  Next, the CPU 81A performs color correction processing (step S300). The color correction process is a process of converting image data composed of R, G, B gradation values into data of gradation values of C, M, Y, K colors used in the printer 22. This process is performed by using a color correction table LUT (see FIG. 2) that stores combinations of C, M, Y, and K for expressing colors composed of combinations of R, G, and B by the printer 22. . Various known techniques can be applied to the process of performing color correction using the color correction table LUT. For example, a process based on an interpolation operation (for example, a technique described in Japanese Patent Laid-Open No. Hei 4-144482) can be applied. The content of the color correction process varies depending on the output device. When the output device uses the RGB color system, the color correction process can be omitted.

  The color-corrected image data is subjected to halftone processing by the error diffusion method (step S400). Here, the halftone process means that the gradation value of the original image data (256 gradations in this embodiment) is converted into binary data corresponding to ON / OFF of the dots of the printer 22. In this embodiment, this processing is performed in parallel by two arithmetic circuits of CPU 81A and CPU 81B. The CPU 81A corresponds to the first error diffusion unit 112 in FIG. 2, and the CPU 81B corresponds to the second error diffusion unit 114 in FIG.

  FIG. 6 is a flowchart showing the flow of halftone processing in this embodiment. In the following, processing contents for one color of the color image data are shown. Actually, the same processing is repeatedly executed for each color. FIG. 6 shows the first halftone process executed by the CPU 81A and the second halftone process executed by the CPU 81B. Both processes are performed in parallel at timings related to each other.

  When the first halftone process is started, the CPU 81A assigns a value (1, 1) to a variable (kx1, ky1) for specifying a pixel of interest to be binarized, and initializes this variable (step S1). S410). As shown in FIG. 4, the CPU 81A performs binarization in order from the upper left end of the image data. Therefore, the data specifying the pixel (1, 1) to be processed first is substituted into the variables (kx1, ky1).

  On the other hand, when the second halftone process is started in parallel with this process, the CPU 81B substitutes the value (1, 2) for the variable (kx2, ky2) for specifying the pixel of interest to be binarized (step S1). S440). As shown in FIG. 4, the CPU 81B performs binarization in order from the left end of the pixel column adjacent to the pixel column processed by the CPU 81A. Therefore, data specifying the pixel (1, 2) to be processed first is substituted into the variables (kx2, ky2).

Next, the CPUs 81A and 81B determine whether or not halftone processing can proceed based on the positional relationship between the respective pixels of interest. In the first halftone process, the CPU 81A determines whether or not the following expression (1) is satisfied (step S412). If the following expression (1) is satisfied, the process waits for execution (step S414).
kx2-Nx / 2 <kx1 <kx2 (1)

  The meaning of such determination will be described with reference to FIG. In the following description, in order to express the processing timing of the CPU 81A and the CPU 81B, the expressions “processing is progressing” and “processing is delayed” are used for convenience. “Processing is progressing” means that the target pixel being processed by one CPU is located on the right side of the target pixel being processed by the other CPU, that is, the number in the X direction is larger. Shall. The positional relationship between the pixels of interest in the Y direction does not matter. “Processing is delayed” means that, on the contrary, the target pixel processed by one CPU is located on the left side of the target pixel processed by the other CPU.

  In the present embodiment, for example, when the CPU 81A is processing the pixel indicated by the arrow A1 in FIG. 7, the CPU 81B that processes the pixel on the pixel column adjacent to the lower side is the X direction as indicated by the arrow B1. The processing is executed at a timing delayed by an amount corresponding to about half of the width of the pixel. When the CPU 81A finishes the processing of the pixel column indicated by the arrow A1 in FIG. 7, the CPU 81B performs the processing of the pixel column per arrow B2 in FIG. At this time, on the contrary, the CPU 81A executes processing at a timing delayed from the CPU 81B by an amount corresponding to about half the width of the pixel in the X direction (arrow A2 in FIG. 7). In this embodiment, the CPU that processes the pixel row located on the lower side executes processing at a timing delayed by an amount corresponding to about half of the width of the pixel in the X direction from the other CPU. It is set. The reason for executing the processing at such timing will be described later. The CPU 81A determines whether or not the above equation (1) is satisfied in steps S412 and 414, thereby controlling the processing timing shown in FIG. 7 as follows.

  When the number kx1 in the X direction of the pixel of interest of the CPU 81A is smaller than the number kx2 in the X direction of the pixel of interest of the CPU 81B, it means that the CPU 81A is in a state of processing delayed from the CPU 81B. This corresponds to the case where the CPU 81A is in the state of the arrow A2 in FIG. 7 and the CPU 81B is in the state of the arrow B2. In this state, when kx1 is larger than “kx2−Nx / 2”, it means that the interval between kx1 and kx2 is less than or equal to half the width Nx of the pixel in the X direction. That is, when the above equation (1) is satisfied, the CPU 81A has a process timing that is too early and may catch up with the CPU 81B that is processing. Therefore, the CPU 81A waits for execution of the process in step S414 in order to adjust the process timing.

On the other hand, when the processing of the CPU 81A is advanced, that is, when the CPU 81A is in the state of the arrow A1 in FIG. 7 and the CPU 81B is in the state of the arrow B1, the adjustment of the processing timing is performed in the second halftone processing. Is called. In the second halftone process, the CPU 81B determines whether or not kx2 satisfies the following expression (2) (step S442). If satisfied, the CPU 81B determines that there is a risk of catching up with the CPU 81A and waits for the process (step S442). S444). The content of the following equation (2) is equal to the case where the relationship between the CPUs 81A and 81B is replaced in the above equation (1).
kx1-Nx / 2 <kx2 <kx1 (2)

  In step S412 in the first halftone process and in step S442 in the second halftone process, the CPU 81A and the CPU 81B transmit information on each pixel of interest so as to advance the process while maintaining the predetermined timing shown in FIG. I'm happy. The interaction between the CPUs 81A and 81B is indicated by broken arrows in FIG.

  When it is determined that binarization should be executed by the above processing, the CPU 81A reads image data (step S416). As described above, this image data is data having 256 gradations for each color component of CMYK for each pixel. For this image data, the CPU 81A executes error diffusion processing (step S418). The contents of the error diffusion process are shown in FIG.

  In the error diffusion process, the CPU 81A generates diffusion error correction data CDX based on the image data (step S460). As will be described later, in the error diffusion process, an error in gradation expression generated for a processed pixel is distributed to pixels around the pixel with a predetermined weight. Processing of each pixel is performed in consideration of an error distributed to the pixel. Therefore, in step S460, the error corresponding to the target pixel is read and reflected in the image data of the target pixel. FIG. 9 exemplifies how much weight is distributed to peripheral pixels with respect to the pixel PP of interest, and how much this error is distributed. With respect to the pixel PP of interest, the density error is a predetermined weight (1/4, 1/8, 1/16) with respect to several pixels in the X direction and several pixels on a pixel column adjacent in the Y direction. It is distributed with.

  The CPU 81A compares the diffusion error correction data CDX generated in this way with the threshold value TH (step S462). If the data CDX is smaller than the threshold value TH, the result value RE representing the binarization result has a value 0. Is substituted (step S464). In this embodiment, assigning a value of 0 to the result value RE means that the printer 22 does not form a dot on the pixel of interest. The threshold value TH is a value that serves as a reference for determining whether or not the binarized result value RE becomes 0, and can be set to any value. In the present embodiment, in order to binarize 256 gradations of the original image data, an intermediate gradation value 127 is set. In step S462, when the correction data CDX is larger than the threshold value TH, the value 1 is substituted into the result value RE (step S466). In this embodiment, substituting the value 1 into the result value RE means that the printer 22 forms a dot on the pixel of interest.

  Next, the CPU 81A calculates an error caused by binarization, and executes a process of diffusing the error to surrounding pixels (step S468). The error means a difference between the density corresponding to the gradation value of the original image data and the density expressed by the binarized result. For example, when the gradation value in the original image data is 0, if the result value RE is 0, no error occurs in the expressed density. At this time, the error is 0. If the result value RE is 1 with respect to the gradation value 0 in the original image data, an error occurs in the expressed density. If it is evaluated that the density expressed by one dot corresponds to the gradation value 255 of the original image, the error is “−255”. The negative sign means that the gradation value of the original image data is smaller than the density evaluation value after binarization.

  The error thus calculated is diffused to the surrounding pixels at the rate shown in FIG. 9 (step S468). For example, when an error corresponding to the gradation value 4 is calculated in the pixel PP of interest, an error corresponding to the gradation value 1 that is ¼ of the error is diffused to the adjacent pixel P1. It will be. Similarly, the error is diffused at the ratio shown in FIG. 9 for the other pixels. The diffused error is reflected in the image data in step S460 described above, and diffusion error correction data CDX is generated.

  When binarization is performed for the pixel of interest by the above processing, the CPU 81A increases kx1 by the value 1 (step S420). This process shifts the target pixel by one in the X direction. Further, it is determined whether or not kx1 is larger than Nx (step S422). If it is larger, the value of kx1 is set to 1 and the value of ky1 is increased by binarization (step S424). When the value of kx1 is greater than Nx, it means that the processing has been completed to the right end for one pixel column, and therefore data corresponding to the leftmost pixel of the next pixel column is substituted for kx1 and ky1. is there. The reason why ky1 is increased by the value 2 is that, as shown in FIG. 7, in this embodiment, the CPU 81A performs binarization of the odd-numbered pixel columns. In step S422, when the value of kx1 is Nx or less, the above process is skipped.

  Next, the CPU 81A determines whether or not the value of ky1 is larger than Ny (step S426). When the value of ky1 is larger than Ny, it means that the CPU 81A has processed all the image data, and thus the first halftone process ends. If the value of ky1 is less than or equal to Ny1, binarization of the next pixel of interest is executed by repeating the processing from step S412 onward.

  If it is determined that the binarization should be executed by the processes of steps S442 and S444 in the second halftone process, the CPU 81B executes the binarization of the image data. The contents of the binarization process are the same as the first halftone process. That is, image data is read (step S446), and error diffusion processing is executed (step S448). The contents of the error diffusion process are the same as those in the first halftone process (FIG. 8). Thereafter, kx2 and ky2 are respectively increased, and the processing is executed for all the image data while sequentially shifting the target pixel (steps S452 to S456). This process is performed in parallel with the first halftone process independently of the first halftone process. Depending on the processing timing, there is a possibility that the processing contents of both are different, for example, the CPU 82B performs binarization by the error diffusion method while the CPU 81A reads the data of the first halftone process. There is also.

  As described above, when the halftone processing is completed by the CPU 81A and CPU 81B (step S400 in FIG. 5), the CPU 81A outputs binarized image data (step S500). In this embodiment, as described above, the printer 22 is the output destination. In the present embodiment, data is output after halftone processing has been completed for all image data. However, for example, data may be output every time processing is completed for one pixel column. I do not care.

  Here, the reason why the processing timing of the CPU 81A and the CPU 81B is shifted by an amount corresponding to half of the width of the pixel in the X direction in this embodiment will be described. As apparent from the flowchart of FIG. 8, in the error diffusion method, each pixel is binarized based on the diffusion error correction data CDX. The diffusion error correction data CDX is generated by reflecting the diffusion error data allocated to the image data of each pixel. Accordingly, the binarization processing of the pixel cannot be performed while the diffusion error data distributed to each pixel is not determined. In the present embodiment, parallel processing of pixels for which diffusion error data is determined is realized by shifting the processing timings of the CPU 81A and the CPU 81B.

  FIGS. 10 to 12 show how errors are distributed when processing by the error diffusion method is sequentially performed. The pixel of fill in the figure indicates the target pixel PP being processed by the CPU 81A. The hatched pixels in the figure indicate pixels in which the density error is diffused from the target pixel PP. The area where the error is distributed from the pixel of interest is as shown in FIG. When the pixel PP shown in FIG. 10 is processed, an error is diffused to the pixel PQ on the pixel column adjacent to the pixel column. When the processing for the pixels adjacent in the X direction is executed after the processing for the pixel PP in FIG. 10 is completed, the error is not diffused to the pixels PQ on the adjacent pixel columns as shown in FIG. Furthermore, when executing processing of pixels adjacent in the X direction, as shown in FIG. 12, no error is diffused to the pixels PQ on the adjacent pixel columns. As apparent from FIGS. 10 to 12, the pixel diffused to the pixel PQ on the pixel column adjacent to the pixel column being processed by the error diffusion method is the time when the processing of the pixel PP shown in FIG. 10 is completed. Confirm with.

  Therefore, theoretically, the second halftone process by the CPU 81B can be started after the CPU 81A completes the pixel processing shown in FIG. When the processing by the CPU 81B is started at such timing, depending on the processing speed of both, the CPU 81B may start the processing of the pixel PR for which the diffusion error has not yet been determined at the time of FIG. When the binarization process is performed in a state where the diffusion error is not fixed, the density error generated in other pixels cannot be sufficiently compensated, and the image quality may be deteriorated.

  In the present embodiment, in order to avoid such a risk of degrading the image quality, the processing timings of both are shifted by an amount corresponding to Nx / 2 pixels. In this way, even if the processing of any of the CPUs 81A and 81B is progressing, the processing timings of both are shifted by a certain amount, so that stable processing is realized without causing deterioration in image quality due to the cause described above. can do.

  In the present embodiment, the reason why both processing timings are shifted by an amount corresponding to Nx / 2 pixels is based on a method of using an error buffer. The error buffer is a memory that temporarily stores the error diffused in step S468 of the error diffusion process (FIG. 8).

  In this embodiment, as described above with reference to FIG. 2, the error buffer is shared by both the CPU 81A and the processing by the CPU 81B. The storage of errors in the error buffer according to this embodiment will be described with reference to FIGS. FIG. 13 shows an area where an error is diffused when the pixels PA and PB are binarized by the CPU 81A and CPU 81B. When the CPU 81A executes binarization processing on the pixel of interest PA on the pixel row ky and diffuses an error to each pixel with the distribution shown in FIG. 9, the error is diffused in the region indicated by the solid line in FIG. A1 in FIG. 13 indicates an error diffused on the same pixel column as the pixel of interest PA of the CPU 81A, and A2 indicates an error diffused on the lower pixel column of the pixel of interest PA.

  FIG. 14 shows the memory area in the error buffer prepared in this embodiment in a form corresponding to the image data. Each square indicated by a broken line represents a memory area corresponding to a pixel. In this embodiment, an error buffer corresponding to two pixel columns, that is, a memory for Nx × 2 pixels is prepared. As shown in FIG. 14, the error diffused from the pixel PA is stored in the error buffer in the same correspondence relationship as the pixel columns ky and ky + 1 in FIG.

  When the CPU 81B executes the binarization process on the pixel of interest PB on the pixel row ky + 1, the diffused error is diffused in the region indicated by the solid line in FIG. B2 in FIG. 13 means an error diffused on the same pixel column ky + 1 as the target pixel PB of the CPU 81B, and B3 indicates an error diffused on the lower pixel column ky + 2 of the target pixel PB. The error diffused by the CPU 81B is stored in the error buffer as shown in FIG. The error diffused to the pixel column ky + 1 is stored in the memory corresponding to the second pixel column in the error buffer, in the same manner as the part storing the diffusion error A2 from the CPU 81A. For this pixel column, if the pixel in which the error is diffused from the CPU 81A and the pixel in which the error is diffused from the CPU 81B overlap, the sum of both is stored in the memory.

  The error diffused to the pixel column ky + 2 is stored in a memory corresponding to the first pixel column in the error buffer. In FIG. 13, the pixel on the left side of the pixel of interest PA is a pixel that has already been binarized, so there is no need to store the error diffused from the CPU 81A in the error buffer corresponding to this pixel. Therefore, in this embodiment, the memory corresponding to this portion is used for storing the error diffused from the CPU 81B to ky + 2.

  In the present embodiment, among the ky to ky + 2 pixel columns in which the error is diffused from the CPU 81A and the CPU 81B, the error diffused to the uppermost pixel column ky and the lowermost pixel column ky + 2 is set to the same pixel column. By storing in the corresponding memory, the capacity of the error buffer is saved. Further, in this embodiment, the error diffused to the pixel column ky and the error diffused to the pixel column ky + 2 are shifted by shifting the processing timing of the CPU 81A and the CPU 81B by an amount corresponding to Nx / 2 pixels. The possibility of being confused and stored within is reduced.

  According to the image processing apparatus of this embodiment described above, high-quality halftone processing by the error diffusion method can be performed at high speed by performing binarization in parallel with the CPU 81A and the CPU 81B. Further, since binarization is performed in parallel for pixels for which errors are completely determined, it is possible to increase the speed without impairing image quality. At this time, as shown in FIG. 14, by sharing a part of the error buffer between both CPUs, the amount of error buffer can be saved, and it is not necessary to transmit the error amount between both CPUs. Further, it is possible to further speed up the processing.

  In this embodiment, the processing timings of the CPU 81A and CPU 81B are shifted by Nx / 2 pixels, but various timing shift amounts can be set according to the error diffusion region by the error diffusion method. As shown in the flowchart of FIG. 6 of this embodiment, the error is completely determined by the process for controlling the interval between the target pixels processed by the CPU 81A and the CPU 81B (steps S412, S414, S442, and S444 in FIG. 6). If it is possible to avoid binarization of pixels that have not been performed, the difference in processing timing between them may be further narrowed. For example, the processing of the pixel PQ by the CPU 81B may be started immediately at the time shown in FIG.

  If parallel processing is performed at such dense timing, parallel processing using three or more arithmetic circuits can be realized. An example of such processing is shown in FIG. A region where an error is diffused when the pixel P1 is processed by the first arithmetic circuit is defined as P1e. At this time, since the error to be diffused is determined for the pixel P2, the processing of the pixel P2 is executed by the second arithmetic circuit. A region where an error is diffused by processing of the pixel P2 is defined as P2e. If the processing of the pixel P2 is performed, the error diffused to the pixel P3 is determined, and therefore the processing of the pixel P3 can be executed by the second arithmetic circuit. Thereafter, similarly, the fourth arithmetic circuit can process the pixel P4 and more pixels in parallel. In this case, the processing speed can be improved according to the degree of multiplexing of parallel processing.

  In the above embodiment, the case where processing is performed using two CPUs 81A and 81B has been described as an example. However, one process may be realized by a dedicated circuit for performing binarization by error diffusion. Naturally, both may be realized by a dedicated circuit.

  In the above-described example, color image data has been described as an example, but it is naturally applicable to single-color image data as well. In the above example, the binarization process has been described as an example. However, the present invention can also be applied to image processing that performs multilevel conversion of three or more values.

  Since the image processing apparatus is mainly processed by the computer 90, an embodiment as a recording medium in which a program for realizing such processing is recorded can be employed. Such storage media include flexible disks, CD-ROMs, magneto-optical disks, IC cards, ROM cartridges, punch cards, printed matter printed with codes such as barcodes, computer internal storage devices (such as RAM and ROM). A variety of computer-readable media can be used, such as memory) and external storage devices. Moreover, the aspect as a program supply apparatus which supplies the computer program which performs multi-value conversion etc. which were demonstrated above to a computer via a communication path is also possible.

  Although various embodiments of the present invention have been described above, the present invention is not limited to these embodiments, and various embodiments can be implemented without departing from the scope of the present invention.

It is a schematic block diagram of the image processing apparatus of this invention. It is explanatory drawing which shows the structure of software. It is explanatory drawing which shows the format of image data. It is explanatory drawing shown about the order which processes a pixel in a present Example. It is a flowchart which shows the image processing routine of a present Example. It is a flowchart which shows the halftone process routine of a present Example. It is explanatory drawing which shows the process timing of the parallel processing in a present Example. It is a flowchart which shows the error diffusion process routine of a present Example. It is explanatory drawing which shows the weight value of error distribution in a present Example. It is explanatory drawing which shows the relationship between the focused pixel and error diffusion area | region in the 1st time. It is explanatory drawing which shows the relationship between the focused pixel and error diffusion area | region in the 2nd time. It is explanatory drawing which shows the relationship between the focused pixel and error diffusion area | region in the 3rd time. It is explanatory drawing which shows the relationship of the error diffusion area | region by parallel processing. It is explanatory drawing which shows the mode of the memory | storage of the diffusion error in an error buffer. It is explanatory drawing which shows the mode of quadruple parallel processing.

Explanation of symbols

DESCRIPTION OF SYMBOLS 12 ... Scanner 14 ... Keyboard 15 ... CD-ROM drive 16 ... Hard disk 18 ... Modem 21 ... Color display 22 ... Color printer 80 ... Bus 81 ... CPU
82 ... ROM
83 ... RAM
84 ... Input interface 85 ... Output interface 86 ... CRTC
87: Disk controller (DDC)
88 ... Serial I / O interface (SIO)
90 ... personal computer 100 ... printer driver 102 ... input unit 104 ... rendering unit 106 ... color correction unit 110 ... halftone processing unit 112 ... first error diffusion unit 114 ... second error diffusion unit 116 ... error buffer 120 ... output unit

Claims (4)

An image processing apparatus that multi-values input image data by an error diffusion method that diffuses density errors that occur when multi-valued each pixel to surrounding pixels that have not yet been multi-valued.
Input means for inputting image data arranged two-dimensionally in a first direction and a second direction;
An unprocessed pixel that has not yet been converted into multiple values is converted into multiple values by an error diffusion method that diffuses a density error to at least pixel columns adjacent in the second direction in order along the pixel columns arranged in the first direction. Two multi-value conversion means for performing conversion, a pixel array that is multi-valued by one of the two multi-value conversion means and a pixel array that is multi-valued by the other of the two multi-value conversion means And two multi-value conversion means for performing multi-value conversion independently of each other in parallel with each other while maintaining a relationship adjacent to each other along the second direction ,
The image data is data having Nx pixels (Nx is an integer of 2 or more) in the first direction,
The preceding multi-value conversion means, which is one of the two multi-value conversion means and performs multi-value conversion for a pixel column having a smaller coordinate in the second direction, coordinates Y or we Y + n-1 (Y, n is a natural number, Y coordinates or pixel columns including pixel to be processed in the preceding multi-value conversion means) to unprocessed pixels on the n pixel columns to to diffuse the concentration error,
Subsequent multi-value conversion means, which is one of the two multi-value conversion means and performs multi-value conversion for a pixel column having a larger coordinate in the second direction, coordinate at pixel n to unprocessed pixels on the pixel row with diffusing the density error, density error diffused from other pixels is completely determined between Y + 1 or et Y + n, and the the errors caused by multi-level pixel second direction coordinate density error to the pixel rows of the second direction coordinate Y by region and the prior multi-level means to be diffused to the pixel columns of the Y + n is position of the first direction of the area to be spread processes the pixels that do not overlap,
The image processing apparatus further includes:
A memory including n memory columns each capable of storing Nx errors ;
Wherein the position is the concentration error diffusion to each, along the first direction of each pixel of the n-1 pieces of pixel columns in the second direction coordinate Y + 1 or et Y + n-1 or memory The density error in which the coordinates in the second direction are diffused into the Y pixel column and the Y + n pixel column are stored in one of the n memory columns in correspondence with the position in the column. An image processing apparatus comprising: storage means for storing a position along each of the pixels in the first direction and a position in the memory column in correspondence with the remaining one of the n memory columns. . The image processing apparatus according to claim 1,
Each of the processing target pixels of the two multi-value conversion means is an image processing apparatus having a positional relationship in which the interval in the first direction is about half the width of the pixel column. An image processing method that multi-values input image data by an error diffusion method that diffuses density errors that occur when each pixel is multi-valued to surrounding pixels that have not yet been multi-valued.
(A) inputting image data arranged two-dimensionally in a first direction and a second direction;
(B) An error diffusion method in which unprocessed pixels that have not yet been multi-valued are sequentially diffused along at least the pixel columns adjacent in the second direction along the pixel columns arranged in the first direction. Are two multi-value conversion processes for multi-value conversion, wherein the multi-value conversion is performed in one of the two multi-value conversion processes and the other of the two multi-value conversion processes. And two multi-value conversion steps for performing multi-value conversion independently of each other in parallel with each other while maintaining a relationship in which the pixel columns are adjacent to each other along the second direction ,
The preceding multi-value conversion step, which is one of the two multi-value conversion steps and performs multi-value conversion for a pixel column having a smaller coordinate in the second direction, The density of unprocessed pixels on n pixel columns with coordinates from Y to Y + n−1 (Y, n are natural numbers, and Y is equal to or greater than the coordinates of the pixel column including the pixel to be processed in the preceding multi-value conversion step) A process of diffusing errors,
The subsequent multi-value process, which is one of the two multi-value processes and is a multi-value process for performing multi-value processing on a pixel column having a larger coordinate in the second direction, This is a step of diffusing density error to unprocessed pixels on n pixel columns whose coordinates are Y + 1 to Y + n, and a pixel in which the density error diffused from other pixels is completely determined, and the pixel A density error is diffused in a region where the error caused by the multi-value conversion is diffused to the pixel column whose second direction coordinate is Y + n and in the preceding multi-value conversion step, the pixel direction whose second direction coordinate is Y A step of processing a pixel whose position in the first direction with a region to be overlapped does not overlap,
The image processing method further includes:
(C) preparing a memory including n memory columns each capable of storing Nx errors;
(D) The density error diffused in each of the n−1 pixel columns in which the coordinates in the second direction are Y + 1 to Y + n−1, and the position of each pixel along the first direction and the memory The density error in which the coordinates in the second direction are diffused into the Y pixel column and the Y + n pixel column are stored in one of the n memory columns in correspondence with the position in the column. An image processing method comprising: a storing step of storing a position along each of the pixels in the first direction and a position in the memory column in association with each other in the remaining one of the n memory columns. . A computer-readable program for multi-valued input image data can be obtained by an error diffusion method that diffuses density errors that occur when each pixel is multi-valued to surrounding pixels that have not yet been multi-valued. A recorded recording medium,
A function of inputting image data arranged two-dimensionally in a first direction and a second direction;
An unprocessed pixel that has not yet been converted into multiple values is converted into multiple values by an error diffusion method that diffuses a density error to at least pixel columns adjacent in the second direction in order along the pixel columns arranged in the first direction. A pixel array that is multi-valued by one of the two multi-value functions and a pixel array that is multi-valued by the other of the two multi-value functions And a program that realizes two multi-value conversion functions for performing multi-value conversion in parallel with each other while maintaining a relationship adjacent to each other along the second direction ,
The image data is data having Nx pixels (Nx is an integer of 2 or more) in the first direction,
The preceding multi-valued function, which is one of the two multi-valued functions and performs multi-valued processing for a pixel column having a smaller coordinate in the second direction, The density of unprocessed pixels on n pixel columns from Y to Y + n−1 (Y, n are natural numbers, and Y is equal to or greater than the coordinate of the pixel column including the processing target pixel of the preceding multi-value conversion function) Diffuse error,
The subsequent multi-valued function, which is one of the two multi-valued functions and performs multi-valued processing for a pixel column having a larger coordinate in the second direction, A pixel in which density errors are diffused to unprocessed pixels on n pixel columns with coordinates Y + 1 to Y + n, density errors diffused from other pixels are completely determined, and the pixel has multiple values An area where the error caused by the conversion is diffused into the pixel column whose coordinates in the second direction are Y + n and a region where the density error is diffused into the pixel line where the coordinates in the second direction are Y by the preceding multi-value quantization function And the pixels in which the positions in the first direction do not overlap ,
The recording medium further includes:
The density error diffused in each of the n−1 pixel columns whose coordinates in the second direction are Y + 1 to Y + n−1 is one of n memory columns that can store Nx errors. Second, the position of each pixel in the first direction and the position in the memory column are stored in correspondence with each other, and the coordinate in the second direction is a pixel column having Y and a pixel column having Y + n. A storage function for storing the diffused density error in the remaining one of the n memory columns by associating the position of each pixel in the first direction with the position in the memory column; A recording medium for recording a program to be realized.

Images