Method of and apparatus for processing an image

Abstract: A method of electrically processing an image using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel to be noted in the image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form. The method comprises the following steps of previously calculating thresholds (Th₁, Th₂) of densities each corresponding to the ratio between the respective pixels, selecting, as a pixel to be noted (f), any unitary one (a, b) of the adjacent pixels, which are different in ratio from each other, calculating errors (E) produced in the peripheral pixels, which are propagated to the noted pixel (f), according to respective distances between the individual peripheral pixels and the noted pixel and areas of the individual peripheral pixels, adding each of the propagated errors to a density of the noted pixel so as to effect a rearrangement (f') on the density of the noted pixel, comparing the rearranged density of noted pixel with each of thresholds obtained according to the noted pixel so as to obtain a corresponding level (G) represented in binary form, and obtaining density distribution errors (e) based on the ratio between the respective adjacent pixels, the rearranged density (f') noted pixel and the level (G) represented in binary form.

Description: The present invention relates to a method of and an apparatus for processing an image, wherein errors produced in a plurality of pixels forming the image are computed and processed. Each of originals is read or scanned by a scanner unit having an image sensor such as a CCD (Charge Coupled Device) or the like. After data read from the original has been subjected to image processing by an image processing unit, the so-processed data can be printed on a recording sheet by a printing unit such as a TPH (Thermal Print Head) or the like. A system has been generally used wherein upon printing, a thermal head is provided in a main scanning direction and sub-scanning is performed by feeding a recording sheet. Fig. 18 shows a thermal head 50 attached to a printing unit, for performing thermal printing. Adjacent heating elements 51 are formed so as to be identical in size to each other. Thus, the image processing at the step prior to the printing is performed as the image processing based on pixels identical in size (area) to each other. Further, the recording of data on the recording sheet is carried out by selectively driving the respective heating elements of the thermal head. Described specifically, upon image processing, the respective heating elements are energized or de-energized under drive control executed in digitized or binary form to thereby form predetermined characters and images. When an original, a picture or the like has multi levels of gray in density, the multi levels of halftone can be reproduced on a recording sheet at a high gradation by using an error diffusion method upon image processing. The error diffusion method is used for the purpose of determining errors to be propagated to a pixel to be noted from peripheral pixels to obtain the errors to be propagated to the noted pixel (corresponding to a heating element which will be intended for printing later) and using the errors to make a decision about the degree of halftone of the noted pixel to thereby achieve high tonal characteristics. When the decision about the tone of the noted pixel is finally made, a substantially density or level of halftone in multi levels of tone is set as a threshold, for example, and the density of the noted pixel, which is added with the errors, is represented in digitized or binary form depending on whether the density is higher or lower than the threshold. Since, however, the conventional thermal head 50 comprises the adjacent heat elements 51 formed so as to be identical in size to each other, tones representable by the adjacent two heating elements are limited to three levels of tone. Therefore, the conventional thermal head becomes complicated in structure and is increased in scale to represent multi levels of halftone. Thus, a thermal head 60 constructed so that adjacent heating elements are alternately varied in size as shown in Fig. 19 is known. According to the thermal head 60, the adjacent heating elements 61 and 62 are different in heating value from each other. Therefore, four levels of halftone can be represented in total by the adjacent two heating elements 61 and 62, so that multi levels of halftone can be easily produced. However, an image processing method, which is performed using an error diffusion method using the thermal head 60, has not yet been proposed. Namely, it is necessary to perform image processing applied to the thermal head 60 as well as to use the aforementioned thermal head 60 in order to exhibit a higher tonal characteristic. However, there has heretofore been proposed only image processing utilizing the error diffusion method used with the thermal head comprised of the heating elements identical in size to each other. This is because distances between the noted pixel and its peripheral pixels may simply be considered due to the fact that the heating elements are identical in size to each other. Thus, the thermal head 60 comprised of the noted pixels (heating elements) having the two types of sizes cannot cope or treat with the image processing in the case of the error diffusion method based on the distance between the respective heating elements 61 and 62 alone is used. The present invention is as claimed in the claims. The present invention has been made in view of the foregoing. It is therefore an object of the present invention to provide a method of and an apparatus for processing an image, wherein high tonal characteristics can be given to an image formed by two types of adjacent pixels different in size from each other. Each of heating elements of a thermal head can be optimally controlled by the image processing so that high levels of halftone can be produced on a recording sheet. In order to achieve the above object, the present invention provides an image processing method using a so-called error diffusion method of representing, in digitized or binary form, a density of a pixel to be noted in an image formed so that pixels (a, b) thereof adjacent to each other in a scanning direction are different in area from each other, based on combinations of the density of the noted pixel and densities of a plurality of pixels provided on the periphery of the noted pixel. An image processing method according to a first aspect the present invention comprises the following steps of previously calculating thresholds (Th 1 , Th 2 ) of densities each corresponding to the area ratio between the respective adjacent pixels, selecting, as a pixel to be noted (f), any one (a or b) of the adjacent pixels, which are different in area ratio from each other, calculating errors (E) produced in the peripheral pixels, which are propagated to the noted pixel (f), according to respective distances between the individual peripheral pixels and the noted pixel and areas of the individual peripheral pixels, adding each of the propagated errors to a density of the noted pixel so as to effect a rearrangement (f') on the density of the noted pixel, comparing the rearranged density of noted pixel with each of thresholds obtained according to the noted pixel so as to obtain a corresponding level (G) represented in binary form, and obtaining density distribution errors (e) based on the rearranged density (f') of noted pixel, the ratio between the respective adjacent pixels and the level (G) represented in binary form. An image processing method according to a second aspect of the present invention comprise the following steps of calculating thresholds (Th 11 through Th 13 ) of densities of the predetermined respective adjacent two pixels (a, b) according to combined patterns of the densities thereof, selecting a pair of the adjacent pixels (a, b) as a noted pixel block F which is a combination of the adjacent two pixels, calculating errors (ES) produced in the peripheral pixels, which are propagated to the noted pixel block (F), according to distances between individual peripheral pixel blocks and the noted pixel block, adding each of the propagated errors to a density of the noted pixel block so as to effect a rearrangement (F') on the density of the noted pixel block, and comparing the rearranged density of noted pixel block with the thresholds according to the noted pixel block so as to obtain a signal represented in quaternary form, which is indicative of a quaternary-formed level (G) of the noted pixel block, outputting a signal represented in binary form, which is indicative of digitized levels of the pixels (a,b), based on the signal represented in quaternary form; and obtaining density distribution errors (E) corresponding to combined patterns of densities of the respective pixels in the noted pixel block, based on the rearranged density (F') of noted pixel block and the signal represented in quaternary form. Further, the present invention provides an image processing apparatus using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel to be noted (f) in an image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form. An image processing apparatus according to a third aspect of the present invention for executing the image processing method of the first aspect of the present invention comprises noted pixel selecting means (5) for successively selecting any one of the respective pixels (a, b) as a pixel to be noted, based on an image scanning signal so as to output a corresponding select signal (S1), weight coefficient setting means (7) for computing weight coefficients with respect to the noted pixel and the respective peripheral pixels, based on areas of the respective adjacent pixels (a, b) and distances between the noted pixel and the individual peripheral pixels and outputting weight coefficients (K 1 through K 4 ) corresponding to the individual noted pixels in response to the select signal outputted from the noted pixel selecting means, threshold calculating means for calculating thresholds of densities for selecting digitized levels of individual pixels according to the area ratio between the adjacent pixels and computing and outputting thresholds (Th 1 , Th 2 ) corresponding to the individual noted pixels in response to the select signal, propagation error calculating means (10) for computing errors (E) produced in the peripheral pixels, which are propagated to the noted pixel (f), based on the weight coefficients outputted from the weight coefficient setting means, rearranging means (15) for adding each of the propagated errors to a density of the noted pixel so as to effect a rearrangement (f') on the density of the noted pixel, by-level digitizing means (17) for comparing the rearranged density of noted pixel with each of the thresholds (Th 1 , Th 2 ) outputted from the threshold calculating means according to the noted pixel so as to produce a corresponding level (G) represented in binary form and outputting a signal (S2) represented in binary form, corresponding to the pixels (a, b), and density distribution error calculating means (19) for obtaining density distribution errors (e) corresponding to the respective pixels to be noted, based on the density (f') rearranged by the rearranging means, the digitized levels produced from the by-level digitizing means (17) and the ratio between the respective adjacent pixels and outputting a density distribution error signal (S3) corresponding to the respective pixels (a, b). An image processing apparatus according to a fourth aspect of the present invention for executing the image processing method of the second aspect of the present invention comprises processing method as defined in claim 2 and comprises noted pixel selecting means (5) for selecting a set of the adjacent pixels (a, b) as a noted pixel block based on an image scanning signal and outputting a select signal (S1) corresponding to the selected set of pixels, weight coefficient setting means (7) for computing and outputting weight coefficients (K 11 through K 14 ) with respect to the noted pixel block and the respective peripheral pixel blocks, based on distances between the noted pixel block and the individual peripheral pixel blocks, threshold calculating means (12) for computing and outputting a plurality of density thresholds (Th 11 through Th 13 )according to the density of the noted pixel block, propagation error calculating means (10) for calculating errors produced in the peripheral pixel blocks, which are propagated to the noted pixel block (F), based on the weight coefficients outputted from the weight coefficient setting means, rearranging means (15) for adding each of the propagated errors to a density of the noted pixel block so as to effect a rearrangement (F') on the density of the noted pixel block, quaternary forming means (16) for comparing the rearranged density with each of the thresholds outputted from the threshold calculating means according to the noted pixel block and outputting a signal (S4) represented in quaternary form, which is indicative of a quaternary-formed level (G) of the noted pixel block, by-level digitizing means (17) for outputting a signal (S2) represented in binary form, which is indicative of digitized levels of the pixels (a, b), based on the signal (S4) outputted from the quaternary forming means, and density distribution error calculating means (19) for calculating density distribution errors (E) corresponding to the individual pixel blocks, based on the density (F') rearranged by the rearranging means and the quaternary-formed level (G) outputted from the quaternary forming means (16) and outputting a density error signal (S3) based on the result of calculation. According to the image processing method and apparatus of the first and third aspects of the present invention, the noted pixel selecting means (5) successively selects the pixels (a, b) adjacent to each other in the main scanning direction and different in area from each other as the noted pixel (f) in response to the scanning signal. The propagation error calculating means (10) determines each of the errors (E) produced from the peripheral pixels, which are propagated to the noted pixel (f), based on the sum of the product of the density distribution errors (e m-1,n-1 through e m-1,n ) calculated from the density distribution error calculating means (19) and the weight coefficients (K 1 through K 4 ) produced from the weight coefficient setting means. Thereafter, the rearranging means (15) adds each of the propagated errors (E) to the density of the noted pixel (f) so as to rearrange (f') the density of the noted pixel (f). The by-level digitizing means (17) compares the rearranged density with each of the thresholds (Th 1 , Th 2 ) outputted from the threshold calculating means (12) so as to obtain the by-level digitized level (G). Thereafter, the density distribution error calculating means (19) can obtain the density distribution errors (e) with respect to each of the noted pixels (f) based on the ratio between the respective noted pixels (f), the rearranged density (f') and the digitized level (G). Embodiments of the present invention will now be described, by way of example only, with reference to the accompanying drawings in which: Fig. 1 is a view typically showing the layout of respective pixels at the time that a pixel a having a large area ratio is taken as a pixel to be noted in order to describe an area method showing a first embodiment of the present invention; Fig. 2 is a view typically illustrating the layout of respective pixels at the time that a pixel b having a small area ratio is taken as a pixel to be noted in the first embodiment shown in Fig. 1; Fig. 3 is a block diagram showing the structure of the first embodiment of an image processing apparatus according to the present invention; Fig. 4 is a view for describing the dispersion of density distribution errors produced in a pixel to be noted into peripheral pixels when the pixel to be noted is taken as a pixel b in the first embodiment shown in Fig. 3; Fig. 5 is a view for describing the dispersion of density distribution errors produced in a pixel to be noted into peripheral pixels when the pixel to be noted is taken as a pixel a in the first embodiment shown in Fig. 3; Fig. 6 is a flowchart for describing a process of calculating weight coefficients employed in the first embodiment of the present apparatus; Fig. 7 is a flowchart for describing a computing process executed in the first embodiment of the present apparatus; Fig. 8 is a view for describing specific states of densities of respective pixels employed in the first embodiment shown in Fig. 3; Fig. 9 is a view for explaining the result of specific computations obtained in the first embodiment shown in Fig. 3; Fig. 10 is a view typically showing the layout of pixels represented in block units to describe a block method showing a second embodiment of the present invention; Fig. 11 is a view for describing the dispersion of density distribution errors produced in a pixel to be noted, which is employed in the second embodiment, into peripheral pixels; Figs. 12(a) through 12(d) are respectively views for describing density representations of four patterns which are combinations of pixels in adjacent block units and respectively show thresholds employed in the second embodiment; Fig. 13 is a block diagram showing the structure of the second embodiment of an image processing apparatus according to the present invention; Fig. 14 is a flowchart for describing a computing process executed in the second embodiment of the apparatus shown in Fig. 13; Fig. 15 is a view for describing specific states of densities of respective pixels employed in the second embodiment shown in Fig. 13; Fig. 16 is a view showing the result of specific computations obtained in the second embodiment shown in Fig. 13; Fig. 17 is a block diagram illustrating one example of the application of the present apparatus to a stencil printer; Fig. 18 is a view for describing a thermal head comprised of heating elements adjacent to each other, which are identical in size to each other; and Fig. 19 is a view for describing a thermal head comprised of heating elements adjacent to each other, which are different in size from each other; A first embodiment of the present invention will now be described. The first embodiment is called an "area method", which computes or calculates density distribution errors for each pixel. Figs. 1 and 2 are respectively views typically showing parts of pixels in an image corresponding to the thermal head 60. The pixels are provided so as to have a width ratio of a : b (2 : 1 in the same drawings). Further, the pixels are provided adjacent to each other and disposed alternately with respect to a main scanning direction. Now, a + b is defined as equal to 2 (i.e., a + b = 2) from the relationship of a > b. Incidentally, the horizontal direction shown in the drawing corresponds to the main scanning direction, i.e., the direction of arrangement or layout of a CCD, a thermal head, etc., whereas the vertical direction in the drawing corresponds to a sub scanning direction, i.e., the direction of feeding an original, a recording paper, etc. The two kinds of pixels a and b different in width from each other are respectively successively set as pixels f to be noted upon scanning. As a result, two pixel layouts or arrangements (CASES1 and CASE2) are formed which represent a state (see Fig. 1) in which the pixel a is taken as the pixel f to be noted and a state (see Fig. 2) in which the pixel b is taken as the pixel f to be noted. Peripheral pixels f m-1n-1 , f m,n-1 , f m+1,n-1 , f m-1.n are respectively interchanged according to the different pixel arrangements. As shown in Figs. 1 and 2, the peripheral pixels f m-1,n-1 through f m-1,n shown in Figs. 1 and 2 are arranged at four positions including three positions where the three peripheral pixels exist on a first scanning line as seen in the main scanning direction and one position where the remaining peripheral pixel exists on a second scanning line. Namely, the pixels f to be noted and the peripheral pixels f m-1,n-1 through f m-1,n with respect to the noted pixel f are set based on the fact that density distribution errors e m-1,n-1 , e m,n-1 , e m+1,n-1 , e m-1,n with respect to these peripheral pixels f m-1,n-1 , f m,n-1 , f m+1,n-1 , f m-1,n are transmitted or propagated to their corresponding noted pixel f (f m,n ) at a scanning end (corresponding to a second pixel on the second scanning line). Thus, when the pixel f to be noted is brought to a third pixel on the second scanning line in the main scanning direction by scanning, any of the peripheral pixels f m-1,n-1 through f m-1,n are shifted in a manner similar to the pixel f to be noted. Next, Fig. 3 is a block diagram showing the structure of an image processing apparatus 1 of the present invention. An image scanning signal is inputted to a noted pixel selecting means 5. The noted pixel selecting means 5 detects whether a pixel f m,n (where m shows a row of a matrix, which extends in the main scanning direction and n shows a column thereof, which extends in the sub scanning direction) to be noted, which changes momentarily according to the scanning signal, corresponds to either one of pixels a or b . Thereafter, the noted pixel selecting means 5 outputs a select signal S1 indicative of either one of the corresponding pixel arrangements CASE1 and CASE2 to each of components of the image processing apparatus 1. A weight coefficient setting means 7 is supplied with information about distances between the position of center of the noted pixel f , i.e., f m,n and the positions of centers of the respective peripheral pixels f m-1,n-1 through f m-1,n about the noted pixel f , the areas of the pixels a and b and pixel ratios. Thereafter, the weight coefficient setting means 7 sets weight coefficients K 1 through K 4 for the density distribution errors e m-1,n-1 through e m-1,n produced in the respective peripheral pixels in accordance with the following operations and stores them therein. A description will now be made of the calculation of the weight coefficients K 1 through K 4 . Figs. 4 and 5 respectively show where a pixel b different from a pixel a is set as a pixel f m,n to be noted and pixel a is set as a pixel f m,n to be noted. Further, Figs. 4 and 5 respectively illustrate the manner in which density distribution errors produced in each of the noted pixels f are dispersed into their corresponding peripheral pixels f m-1,n-1 through f m-1,n extending in four directions. Incidentally, the square root of 2 (2 1/2 ) in the following equation is taken as 1.4. Further, the ratio, i.e., a : b between the adjacent pixels a and b is equal to 2 : 1. Thus, if weights necessary for dispersing the density distribution errors developed in the pixel f m,n to be noted into the four directions are considered in terms of distance in the CASE11 shown in Fig. 4, then they are represented as follows: (f to e 11 ) : (f to e 21 ) : (f to e 31 ) : (f to e 41 ) = 1.4 : 1 : 1.4 : 1 Further, the ratio between areas of the respective density distribution errors is represented as e 11 : e 21 : e 31 : e 41 = 2 : 2 : 1 : 2. Thus, weight coefficients with respect to the pixels from the noted pixel f to the respective error pixels are obtained in consideration of both the distances and the areas in the following manner. Since B 1 = 1.4×2 + 1×2 + 1.4×1 + 1×2 approximates to 8.2, f to e 11 = 1.4×2 ÷ B 1 approximates to 0.3415, f to e 21 = 1×2 ÷ B 1 approximates to 0.2439, f to e 31 = 1.4×1 ÷ B 1 approximates to 0.1707 and f to e 41 = 1×2 ÷ B 1 approximates to 0.2439. Next, if weights necessary for dispersing errors produced in the pixel f m,n into four directions are considered even in the CASE12 shown in Fig. 5 in a manner similar to the CASE11 in terms of distance, then they are represented as follows: (f to e 12 ) : (f to e 22 ) : (f to e 32 ) : (f to e 42 ) = 1.4 : 1 : 1.4 : 1 Further, the ratio between areas of the respective errors is represented as e 12 : e 22 : e 32 : e 42 = 1 : 1 : 2 : 1. Thus, weight coefficients with respect to the pixels from the noted pixel f to the respective error pixels are obtained in consideration of both the distances and the areas in the following manner. Since B 2 = 1.4×1 + 1×1 + 1.4×2 + 1×1 approximates to 6.2, f to e 12 = 1.4×1 ÷ B 2 approximates to 0.2258, f to e 22 = 1×1 ÷ B 2 approximates to 0.1613, f to e 32 = 1.4×2 ÷ B 2 approximates to 0.4516 and f to e 42 = 1×1 ÷ B 2 approximates to 0.1613. Thus, the weight coefficients K 1 through K 4 with respect to each of the CASE1 and CASE2 shown in Figs. 1 and 2 are respectively selected. If the pixel a shown in Fig. 1 is taken as the pixel f to be noted (CASE1) then weight coefficients K 1 through K 4 with respect to e m-1,n-1 , e m,n-1 , e m+1,n-1 and e m-1,n respectively correspond to f to e 41 in the CASE11 and a numeric value of 0.2439, f to e 32 in the CASE12 and a numerical value of 0.4516, f to e 21 in the CASE11 and a numerical value of 0.2439, and f to e 11 in the CASE11 and a numerical value of 0.3415. If the pixel b shown in Fig. 2 is taken as the pixel f to be noted (CASE2), then weight coefficients K 1 through K 4 with respect to e m-1,n-1 , e m,n-1 , e m+1,n-1 and e m-1,n respectively correspond to f to e 42 in the CASE12 and a numeric value of 0.1613, f to e 31 in the CASE11 and a numerical value of 0.1707, f to e 22 in the CASE12 and a numerical value of 0.1613, and f to e 12 in the CASE12 and a numerical value of 0.2258. A process of calculating the weight coefficients K 1 through K 4 for each of the CASE1 and CASE2, which have been described above, is shown in a flowchart of Fig. 6. The weight coefficient setting means 7 calculates the weight coefficients K 1 through K 4 at each of the CASE1 and CASE2 and stores therein the numerical values corresponding to the calculated weight coefficients. Next, the weight coefficients K 1 through K 4 corresponding to each of the CASE1 and CASE2 are read based on the select signal S1 outputted from the noted pixel selecting means 5 and are outputted to a propagation error calculating means 10. Next, a threshold calculating means 12 calculates density thresholds Th 1 and Th 2 at each of the CASE1 and CASE2 and stores their corresponding numerical values therein. A per-pixel density region having halftones or intermediate tones ranges from 0 to 255 levels of halftone. Accordingly, the adjacent two pixels a and b provide 510 levels of halftone in total. Further, since the ratio between the pixels, i.e., a : b = 2 : 1 as described above, the thresholds Th 1 and Th 2 in the CASE1 and CASE2 become equal to 510×2/3 ÷ 2 = 170 and 510×1/3 ÷ 2 = 85. Incidentally, the maximum density value A in the CASE1 becomes equal to 510×2/3 = 340. The maximum density value B in the CASE2 becomes equal to 510×1/3 = 170. Further, the threshold calculating means 12 reads the corresponding thresholds for each of the CASE1 and CASE2 in response to the select signal S1 outputted from the noted pixel selecting means 5 and outputs the read thresholds to a by-level digitizing means 17. The propagation error calculating means 10 calculates each of errors E propagated onto the noted pixel f for each CASE from the following equation: E = (K 1 *e m-1,n-1 ) + (K 2 *e m,n-1 ) + (K 3 *e m+1,n-1 ) + (K 4 *e m-1,n ) Since CASEs vary each time the adjacent pixels are scanned as the pixel f to be noted, values different from each other according to the respective CASEs are read from the weight coefficient setting means 7, so that propagation errors E 1 and E 2 are calculated according to the individual CASEs. The e m-1,n-1 through e m-1,n in the respective terms of the above equation correspond to density distribution errors produced in the respective peripheral pixels f m-1,n-1 through f m-1,n . They are used for obtaining the value of a density error signal S3 from a density distribution error calculating means 19 to be described later. Thus, an initial value of an error produced in each of the peripheral pixels is set to 0 (error 0) until each of the density distribution errors is calculated. A rearranging means 15 adds each of the different propagation errors E 1 and E 2 obtained from the propagation error calculating means 10 according to the individual CASE1 and CASE2 to a density of the input noted pixel f in accordance with each of the following equations to thereby rearrange the noted pixel into f' m,n . Thereafter, the rearranging means 15 outputs a density f' obtained after completion of the rearrangement of the pixel f to be noted to the by-level digitizing means 17. Here, each of the terms f m,n in the following equations will show a pixel itself and a density of that pixel. CASE1) f' m,n = f m,n + E 1 CASE2) f' m,n = f m,n + E 2 In accordance with each of the following equations, the by-level digitizing means 17 compares the density rearranged by the rearranging means 15 with each of the thresholds Th 1 and Th 2 produced from the threshold calculating means 12 according to the individual CASE1 and CASE2 and converts the result of comparison into digitized or binary form. Here, a number of "0" used to represent a scale of digitized levels shows white and a number of "1" shows black. CASE1) when f' m,n ≧ Th 1 (threshold 170), G m,n is taken as being equal to "1" (black). When f' m,n < Th 1 , G m,n is taken as equal to "0" (white). CASE2) when f' m,n ≧ Th 2 (threshold 85), G m,n is taken as being equal to "1" (black). When f' m,n < Th 2 , G m,n is taken as equal to "0" (white). The by-level digitized output is outputted from the by-level digitizing means 17 as a by-level digitized signal S2, which is used for turning ON and OFF a heating element corresponding to the pixel f (pixel a or b ) to be noted. The density distribution error calculating means 19 calculate density distribution errors e m,n for the pixel f to be noted, based on the density f' of the noted pixel rearranged by the rearranging means 15, the digitized level G produced from the by-level digitizing means 17 and the maximum density values A and B of the individual pixels in accordance with the following equations. Incidentally, the maximum density values of the pixels A and B are respectively equal to 340 and 170. CASE1) e m,n = f' m,n - (G m,n *A) CASE2) e m,n = f' m,n - (G m,n *B) Each of the so-calculated density distribution errors e m,n for the noted pixel f is outputted to an unillustrated memory or storing means as a density error signal S3, which is subsequently used as each of density distribution errors produced in peripheral pixels with respect to a new pixel to be noted by scanning. Accordingly, the propagation error calculating means 10 reads the stored value (density error signal S3) indicative of each density distribution error and calculates the propagation errors E 1 and E 2 according to the individual CASEs based on the result of reading. Incidentally, a process of from the error calculation to the detection of the above density distribution errors is described in a flowchart shown in Fig. 7. An image processing operation of the area method based on the above construction will next be described by specific examples. A process of dispersing errors when individual pixels are scattered at predetermined densities (within a density level range of 0 to 255) in the form of dots as shown in Fig. 8, will first be described below. When a pixel f m,n to be noted is a pixel a and belongs to a first pixel on one scanning line, the noted pixel corresponds to the CASE1. 1) The density of the pixel f to be noted is 76. 2) An error propagated to the noted pixel f is as follows: E 1 = (K 1 *e 1 ) + (K 2 *e 2 ) + (K 3 *e 3 ) + (K 4 *e 4 ) = (0.2439*0) + (0.4516*0) + (0.2439*0) + (0.3415*0) = 0 (Incidentally, weight coefficients K 1 through K 4 with respect to e 1 through e 4 respectively correspond to values read in the CASE1. Further, since no pixels equivalent to peripheral pixels with respect to the pixel f to be noted exist, the values of the density distribution errors e 1 through e 4 in the individual terms of the above equation are respectively 0 (= initial value)). 3) Rearrangement of the noted pixel f Since f' m,n = f m,n + E 1 = 76 + 0 = 76, it remains unchanged. 4) By-level digitization Since f' m,n < Th 1 (170), G m,n is determined as equal to "0" (white) and its digitized output is outputted as the by-level digitized signal S2. 5) Detection of each of the density distribution errors e m,n = f' m,n - G*A = 76 - 0*340 = 76 Thus, the density distribution error produced in the noted pixel f m,n is represented as 76, which is stored in the memory means as the density error signal S3. A process of diffusing each of errors when a pixel b (which belongs to a second pixel on one scanning line: f m+1,n ) adjacent to the pixel a is scanned as the pixel f to be noted as shown in Fig. 8, will next be described. 1) The density of the pixel f m+1,n to be noted is 102. 2) An error propagated onto the noted pixel f is as follows: E 2 = 0.1613*0 + 0.1707*0 + 0.1613*0 + 0.2558*76 = 17.1608 (At this time, weight coefficients K 1 through K 4 respectively correspond to values read in the CASE2). 3) Rearrangement of the noted pixel f f' m+1,n = f m+1,n + E 2 = 102 + 17.1608 = 119.1608 4) By-level digitization Since f' m+1,n > Th 2 (85), G m+1,n is determined as equal to "1" (black) and its digitized output is outputted as the by-level digitized signal S2. 5) Detection of each of the density distribution errors e m,n = f' m,n - G*B = 119.1608 - 1*170 =-50.8392 Thus, the density distribution error produced in the noted pixel f m+1,n is represented as -50.8392, which is stored in the memory means as the density error signal S3. Fig. 9 is a view for describing levels G represented in digitized or binary form and density distribution errors e , both of which correspond to the two pixels described above. Thus, the digitized levels G each outputted as the digitized signal S2 and the density distribution errors e each outputted as the density distribution error signal S3 may be successively re-stored in their corresponding scanned pixels to be noted, so as to form a corresponding list represented in the form of a table. According to the area method described above, a high level of halftone can be obtained by dispersing the density distribution errors produced in the individual pixels into their corresponding peripheral pixels. A second embodiment of the present invention will now be described. The second embodiment will be referred to as a "block method". Even in the case of the second embodiment, adjacent pixels a and b are provided with a predetermined ratio set therebetween as shown in Fig. 10 in a manner similar to the first embodiment. However, a density distribution error is calculated for each pixels (hereinafter called "pixel block") in which the two pixels a and b provided adjacent in a main scanning direction are set as a group or block. Further, in the present embodiment, the ratio or a : b between the adjacent pixels a and b is represented as 2 : 1 in a manner similar to the first embodiment. The pixels a and b represented in the block unit are used as a noted pixel block F m,n as one group. The pixel block F to be noted and the peripheral pixel blocks with respect to the noted pixel block F are set based on the fact that density distribution errors E m-1,n-1 , E m,n-1 , E m+1,n-1 , E m-1,n with respect to peripheral pixel blocks F m-1,n-1 , F m,n-1 , F m+1,n-1 , F m-1,n are transmitted or propagated to their corresponding noted pixel block (F m,n ) at a scanning end (corresponding to third and fourth pixels on the second scanning line). Therefore, a noted pixel selecting means 5 employed in the present embodiment selects one group of pixels a and b as a pixel block F to be noted in response to a scanning signal and outputs a select signal S1 therefrom. A description will next be made of the calculation of weight coefficients K 11 through K 14 . Fig. 11 shows the manner in which density distribution errors produced in a pixel block F to be noted are dispersed into their corresponding peripheral pixel blocks extending in four directions. The weight coefficients K 11 through K 14 with respect to the density distribution errors E m-1,n-1 through E m-1,n respectively produced in the peripheral pixel blocks are set to and stored in a weight coefficient setting means 7 based on distances between the position of center of the pixel block F m,n to be noted and the positions of centers of the respective peripheral pixel blocks in accordance with the following operational equations. Since the pixels in the individual blocks are identical in area to each other, weights with respect to the areas can be omitted. Now, the noted pixel block F can be represented in the form of densities of four patterns shown in Figs. 12(a) through 12(d). When the two pixels of a and b are taken as one block because the ratio a : b between the adjacent pixels a and b is equal to 2 : 1, the following values can be taken as density values, which can be represented within the block, so as to fall within a density range of 0 to 510. Namely, they are four patterns in total, which comprises a + b = 510 (maximum density value of each of pixels a and b ) shown in Fig. 12(a), a = 340 (maximum density value of pixel a ) shown in Fig. 12(b), b = 170 (maximum density value of pixel b ) shown in Fig. 12(c) and 0 = 0 (minimum density value) shown in Fig. 12(d). Fig. 13 is a block diagram showing an image processing apparatus using the block method of the second embodiment. In the same drawing, the same elements of structure as those shown in Fig. 3 descriptive of the first embodiment are identified by like reference numerals and their description will therefore be omitted. A threshold calculating means 12 calculates thresholds from intermediate values of the respective densities in accordance with the following equations. Th 11 = [(a + b) - a]/2 + a = 425 Th 12 = (a - b)/2 + b = 255 Th 13 = b/2 = 85 Weights necessary for diffusing errors produced in the pixel block F m,n to be noted in four directions are represented in the form of (F to E 11 ) : (F to E 21 ) : (F to E 31 ) : (F to E 41 ) = 5 1/2 : 2 : 2*5 1/2 : 2 judging from the distances. Thus, weight coefficients set to the noted pixel block F and the respective error pixel blocks are obtained in consideration of the distances. Since ES = 5 1/2 + 2 + 2*5 1/2 + 2 approximates to 10.6, F to E 11 , F to E 21 , F to E 31 and F to E 41 are represented as follows: F to E 11 = 5 1/2 ÷ ES approximates to 11/53 F to E 21 = 2 ÷ ES approximates to 10/53 F to E 31 = 2*5 1/2 ÷ ES approximates to 22/53 F to E 41 = 2 ÷ ES approximates to 10/53 where 5 1/2 is taken as 2.2. Thus, the weight coefficients K 11 through K 14 shown in Fig. 10 are represented as follows: The weight coefficient K 11 set for E m-1,n-1 corresponds to F to E 41 shown in Fig. 11, i.e., 10/53. The weight coefficient K 12 set for E m,n-1 corresponds to F to E 31 , i.e., 22/53. The weight coefficient K 13 set for E m+1,n-1 corresponds to F to E 21 , i.e., 10/53. The weight coefficient K 14 set for E m-1,n corresponds to F to E 11 , i.e., 11/53. The weight coefficients K 11 through K 14 are actually set to values easy to be treated as fractional numbers to be described below and are stored in the weight coefficient setting means 7. K 11 = 1/6, K 12 = 1/3, K 13 = 1/6, K 14 = 1/3 A propagation error calculating means 10 calculates each of errors ES to be propagated to the pixel block F to be noted in accordance with the following equation (initial value of ES = 0). ES = 1/6*E m-1,n-1 + 1/3*E m,n-1 + 1/6*E m+1,n-1 + 1/3*E m-1,n where E m,n shows the adjacent two pixels a and b , i.e., e m,n + e m,n+1 . A rearranging means 15 adds the propagation error ES obtained from the propagation error calculating means 10 to the density of the pixel block F to be noted to thereby rearrange the noted pixel block into F' m,n . Thereafter, the rearranging means 15 outputs a density F' of the pixel block F, which is obtained after completion of the rearrangement of the pixel block F to be noted, to a quaternary forming means 16. Thereafter, the density F' is outputted to a by-level digitizing means 17. F' m,n = F m,n + ES The quaternary forming means 16 compares the rearranged density F' of pixel block F to be noted with the thresholds Th 11 through Th 13 produced from the threshold calculating means 12, represents it or a density output in quaternary form according to each of the results of comparison and outputs the same as a signal S4 represented in quaternary form. Result 1) when F' m,n ≧ Th 11 (threshold 425), G m,n = "3". Further, the respective pixels in the pixel block F, i.e., g m,n = "1" (black) and g m+1,n = "1" (black). Result 2) when Th 12 (threshold 255) ≦ F' m-n ≦ Th 11 , G m,n = "2". Further, the respective pixels in the pixel block F, i.e., g m,n = "1" (black) and g m+1,n = "0" (white). Result 3) when Th 13 (threshold 85) ≦ F' m,m ≦ Th 12 , G m,n = "1". Further, the respective pixels in the pixel block F, i.e., g m,n = "0" (white) and g m+1,n = "1" (black). Result 4) when F' m,n < Th 13 , G m,n = "0". Further, the respective pixels in the pixel block F, i.e., g m,n = "0" (white) and g m+1,n = "0" (white). The four results are established so as to correspond to the density representations of the four patterns shown in Figs. 12(a) through 12(d). As a result, the quaternary-formed signal S4 is produced according to each of the four patterns. Each output G m,n represented in quaternary form is of a level represented in quaternary form with the pixel block to be noted as a unit and is outputted to a density distribution error calculating means 19 as the signal S4. The by-level digitizing means 17 is inputted with the quaternary-formed signal S4 and outputs digitized levels g m,n and g m+1,n in units of the pixels a and b in the pixel block to be noted in response to the quaternary-formed signal S4. Result 1) when the signal S4 is G m,n = "3", the respective pixels in the noted pixel block, i.e., g m,n = "1" (black) and g m+1,n = "1" (black). Result 2) when the signal S4 is G m,n = "2", the respective pixels in the noted pixel block, i.e., g m,n = "1" (black) and g m+1,n = "0" (white). Result 3) when the signal S4 is G m,n = "1", the respective pixels in the noted pixel block, i.e., g m,n = "0" (white) and g m+1,n "1" (black). Result 4) when the signal S4 is G m,n = "0", the respective pixels in the noted pixel block, i.e., g m,n = "0" (white) and g m+1,n = "0" (white). The digitized signal S2 is used for turning ON and OFF heating elements corresponding to the pixels f m,n (pixel a or b ), f m+1,n (pixel b or a ) in a printing unit provided at a subsequent stage. In accordance with the following equation, the density distribution error calculating means 19 calculates a density distribution error E m,n with respect to the pixel block F to be noted, based on the density F' of the noted pixel block F rearranged by the rearranging means 15, the signal level G represented in quaternary form, which is produced from the quaternary forming means 16 and the maximum density values A and B of the individual pixels. Incidentally, the maximum density values of the individual pixels A and B are respectively equal to 340 and 170. E m,n = F' m,n - G*(A + B)/3 The density distribution error E m,n of the noted pixel block F, which has been calculated in the above-described manner, is outputted to an unillustrated storing means as a density error signal S3, which is subsequently used as each of density distribution errors produced in peripheral pixel blocks with respect to a new pixel F to be noted by scanning. The propagation error calculating means 10 reads the stored values indicative of the density distribution errors and calculates each of propagation errors ES based on the result of reading. Incidentally, a process of the level reading to the detection of the above density distribution errors is described in a flowchart shown in Fig. 14. An image processing operation of the block method based on the above construction will next be described by specific examples. Now, respective pixels are scattered at predetermined densities in the form of dots as shown in Fig. 15. When the pixel block F m,n to be noted is first and second pixels (f m,n f m+1,n ) on one scanning line extending in a main scanning direction, 1) The density of the pixel block F m,n to be noted, i.e., f m,n + f m+1,n = 76 + 102 = 178. 2) An error propagated onto the noted pixel block F is as follows: ES = (K 11 *E 1 ) + (K 12 *E 2 ) + (K 13 *E 3 ) + (K 14 *E 4 ) = (1/6*0) + (1/3*0) + (1/3*0) + (1/3*0) = 0 (Incidentally, weight coefficients K 11 through K 14 with respect to E 1 through E 4 respectively correspond to values read in the CASE1. Further, the values of E 1 through E 4 in the individual terms of the above equation are respectively 0 (= initial value)). 3) Rearrangement of the noted pixel block F F' m,n = F m,n + ES = 178 + 0 = 178, it remains unchanged. 4) Quaternary formation and by-level digitization Since Th 13 (85) ≦ F' m,n (178) < Th 12 (55) because of F' = 178, G m,n is determined as equal to "2" (black), which is outputted as a signal S4 represented in quaternary form.Further, g m,n = "0" (white) and g m+1,n = "1" (black). They are outputted as a signal S2 represented in binary form. 5) Detection of each of the density distribution errors E m,n = F' m,n - G m,n *(A+B)/3 = 178 - 170 = 8 Thus, the density distribution error produced in the noted pixel F m,n is represented as 8, whose value is stored in a memory or storing means as a density error signal S3. A process of dispersing errors when a pixel block (corresponding to third and fourth pixels on one scanning line in a main scanning direction: f m+2,n , f m+3,n ) just adjacent to the above pixel block is scanned as the noted pixel block F shown in Fig. 15, will now be described below. 1) The density of a noted pixel block F m+1,n (f m+2,n , f m+3,n ) is 128 + 178 = 306. 2) An error propagated onto the noted pixel block F is as follows: ES = 1/6*0 + 1/3*0 + 1/6*0 + 1/3*8 = 2.66 (At this time, only a density distribution error value produced in a peripheral pixel block E 4 with respect to the pixel block F to be noted exists). 3) Rearrangement of the noted pixel block F F' m+1,n = F m+1,n + ES = 306 + 2.66 = 308.66 4) Quaternary formation and by-level digitization Since Th 12 (255) ≦ F' m+1,n (308.66) < Th 11 (425), G m,n is determined as equal to "3" (black), which is outputted as a signal S4 represented in quaternary form. Further, g m+2,n = "1" (black) and g m+3,n = "0" (white). Each of them is outputted as a signal S2 represented in binary form. 5) Detection of each density distribution error E m,n = F' m,n - G m,n *(A+B)/3 = 308.66 - 340 = - 31.34 Thus, the density distribution error for the pixel block F m+1,n to be noted is represented as -31.34. This value is stored in the memory means as a density error signal S3. Fig. 16 is a view for describing the manner in which levels G represented in quaternary form, levels g represented in digitized or binary form and density distribution errors E with respect to the two noted pixel blocks described above are stored in table form. According to the above-described block method, the adjacent pixels a and b are taken as one pixel. Further, the density distribution errors produced in the individual pixels can be propagated onto their corresponding peripheral pixels so as to obtain high levels of halftone. The image processing apparatus 1, which has been described in each of the respective embodiments, is applied to a stencil printer 30 shown by a block diagram of Fig. 17. In the stencil printer 30, a scanner unit 33 having an image sensor 32 reads or scans an original 31 and outputs data read from the original 31 to an image processing unit 35 through an A/D converter 34. In the image processing unit 35, a pre-processing unit 35a effects a data correction such as shading or the like on the output of the scanner unit 33. Thereafter, a data processing unit 35b effects image processing on the data, using the aforementioned error dispersing method. Data S2 represented in digitized or binary form, which is outputted to the outside from the image processing unit 35, is outputted to a printing means 36. The printing means 36 comprises a plate-making unit 37 and a printing unit 38. The plate-making unit 37 makes a stencil original or plate with respect to an image on the original 31 in accordance with a thermal process. At this time, a thermal means (thermal head 60) whose adjacent heating elements are different in size from each other drives and controls the heating elements, based on the signal S2 so as to correspond to digitized levels of pixels a and b . The printing unit 38 has a rotating drum on which the processed stencil original has been applied. Printing paper is fed to a plate cylinder while the rotating drum is being rotated and ink is discharged from the inside of the rotating drum, whereby an image is formed on the printing paper with the ink which passed through the stencil original. Further, the stencil printer 30 is provided with a plate taking-off unit 39 for separating an used stencil original from the rotating drum and a paper feeding unit 40 for supplying the printing paper. Incidentally, the respective components are generally controlled by a controller 41. The image processing apparatus described above can also be applied to one other than the stencil printer. Namely, so long as apparatuses each having a printing unit comprising adjacent heating element whose ratios are different from each other, such as an arrangement in which the signal S2 is outputted to a printer having simply a thermal head, etc., are used, then operations and effects similar to those described above can be obtained even in either case. Incidentally, each of the above embodiments describes the case where the ratio between the adjacent pixels (heating elements) is set as 2 : 1. However, the ratio between the pixels is not necessarily limited to or by 2 : 1. Alternatively, other ratio may be used. According to the present invention, an error diffusion method of propagating density distribution errors produced in peripheral pixels with respect to a noted pixel in an image comprised of respective two pixels adjacent in a main scanning direction and different in size from each other, to the pixel to be noted can be constructed in a simple procedure and with ease. In the method and the apparatus as defined in claims 1 and 3, when each of pixels is selected as a pixel to be noted and propagation errors for propagating density distribution errors produced in peripheral pixels with respect to the selected noted pixel to the noted pixel are determined, areas of the respective pixels and distances between the individual peripheral pixels and the pixel to be noted are taken into consideration as weights. After the propagation errors have been obtained, the resulting error outputs are represented in binary form so as to obtain the density distribution errors. Thus, representations of the multi levels of halftone can be specifically created while characteristics of the multi levels of halftone with respect to an image of adjacent two pixels different in size from each other are efficiently used. In the method and the apparatus as defined in claims 2 and 4, a pair of adjacent pixels is selected as a pixel block to be noted, which is formed by combining the adjacent pixels. Subsequently, the above computing process is performed with the noted pixel block as a unit. The same effect as that described above can be obtained. By using the image processing method and the image processing apparatus, each of heating elements different in size from each other, which form a thermal head, can be optimally controlled, so that multi levels of halftone can be created onto a recording sheet.

Claims: A method of processing an image using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel to be noted in the image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form, said method comprising the following steps of: previously calculating thresholds (Th 1 , Th 2 ) of densities each corresponding to the area ratio between the respective adjacent pixels (a,b); selecting, as a pixel to be noted (f), any unitary one (a, b) of the adjacent pixels, which are different in area ratio from each other; calculating errors (E) produced in said peripheral pixels, which are propagated to the noted pixel (f), according to respective distances between the individual peripheral pixels and the noted pixel and areas of the individual peripheral pixels; adding each of the propagated errors to a density of the noted pixel so as to effect a rearrangement (f') on the density of the noted pixel; comparing the rearranged density of noted pixel with each of thresholds obtained according to the noted pixel so as to obtain a corresponding level (G) represented in binary form; and obtaining density distribution errors (e) based on the ratio between the respective adjacent pixels, the rearranged density (f') of noted pixel and the level (G) represented in binary form. A method of processing an image using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel to be noted in the image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form, said method comprising the following steps of: calculating thresholds (Th 11 through Th 13 ) of densities of the predetermined respective adjacent two pixels (a, b) according to combined patterns of the densities thereof; selecting a pair of the adjacent pixels (a, b) as a noted pixel block F which is a combination of the adjacent two pixels; calculating errors (ES) produced in the peripheral pixel blocks, which are propagated to said noted pixel block (F), according to distances between individual peripheral pixel blocks and said noted pixel block; adding each of said propagated errors to a density of said noted pixel block so as to effect a rearrangement (F') on the density of said noted pixel block; and comparing the rearranged density of noted pixel block with said thresholds according to the noted pixel block so as to obtain a signal represented in quaternary form, which is indicative of a quaternary-formed level (G) of the noted pixel block; outputting a signal represented in binary form, which is indicative of digitized levels of the pixels (a,b), based on the signal represented in quaternary form; and obtaining density distribution errors (E) corresponding to combined patterns of densities of the respective pixels in said noted pixel block, based on the rearranged density (F') of noted pixel block and the signal represented in quaternary Form. An image processing apparatus using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel to be noted (f) in an image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form, said image processing apparatus comprising: noted pixel selecting means (5) for successively selecting any one of said respective pixels (a, b) as a pixel to be noted, based on an image scanning signal so as to output a corresponding select signal (S1); weight coefficient setting means (7) for computing weight coefficients with respect to the noted pixel and the respective peripheral pixels, based on areas of the respective adjacent pixels (a, b) and distances between the noted pixel and the individual peripheral pixels and outputting weight coefficients (K 1 through K 4 ) corresponding to the individual noted pixels in response to the select signal outputted from said noted pixel selecting means; threshold calculating means (12) for calculating thresholds of densities for selecting digitized levels of individual pixels according to the area ratio between the adjacent pixels and computing and outputting thresholds (Th 1 , Th 2 ) corresponding to the individual noted pixels in response to the select signal; propagation error calculating means (10) for computing errors (E) produced in the peripheral pixels, which are propagated to the noted pixel (f), based on the weight coefficients outputted from said weight coefficient setting means; rearranging means (15) for adding each of said propagated errors to a density of the noted pixel so as to effect a rearrangement (f') on the density of the noted pixel; by-level digitizing means (17) for comparing the rearranged density of noted pixel with each of the thresholds (Th 1 , Th 2 ) outputted from said threshold calculating means according to the noted pixel so as to produce a corresponding level (G) represented in binary form and outputting a signal (S2) represented in binary form, corresponding to the pixels (a, b); and density distribution error calculating means (19) for obtaining density distribution errors (e) corresponding to the respective pixels to be noted, based on the ratio between the respective adjacent pixels, the density (f') rearranged by said rearranging means and the digitized level produced from said by-level digitizing means (17) thereby outputting a density distribution error signal (S3) corresponding to the respective pixels (a, b). An image processing apparatus using an error diffusion method of propagating density distribution errors produced in pixels provided on the periphery of a pixel (F) to be noted in an image formed so that respective adjacent pixels (a, b) thereof extending in a main scanning direction are different in area from each other, to the noted pixel and representing a density output at the noted pixel in binary form, said image processing apparatus comprising: noted pixel selecting means (5) for selecting a set of the adjacent pixels (a, b) as a noted pixel block based on an image scanning signal and outputting a select signal (S1) corresponding to the selected set of pixels; weight coefficient setting means (7) for computing and outputting weight coefficients (K 11 through K 14 ) with respect to the noted pixel block and the respective peripheral pixel blocks, based on distances between the noted pixel block and the individual peripheral pixel blocks; threshold calculating means (12) for computing and outputting a plurality of density thresholds (Th 11 through Th 13 ) according to the density of the noted pixel block; propagation error calculating means (10) for calculating errors (ES) produced in the peripheral pixel blocks, which are propagated to the noted pixel block (F), based on the weight coefficients outputted from said weight coefficient setting means; rearranging means (15) for adding each of said propagated errors to a density of the noted pixel block so as to effect a rearrangement (F') on the density of the noted pixel block; quaternary forming means (16) for comparing the rearranged density with each of the thresholds outputted from said threshold calculating means according to the noted pixel block and outputting a signal (S4) represented in quaternary form, which is indicative of a quaternary-formed level (G) of the noted pixel block; by-level digitizing means (17) for outputting a signal (S2) represented in binary form, which is indicative of digitized levels of the pixels (a, b), based on the signal (S4) outputted from said quaternary forming means; and density distribution error calculating means (19) for calculating density distribution errors (E) corresponding to the individual pixel blocks, based on the density (F') rearranged by said rearranging means and the quaternary-formed level (G) outputted from said quaternary forming means (16) and outputting a density error signal (S3) based on the result of calculation.

Inventors: INAMINE NOBORU, KURITA SYOUJI, NOGUCHI IKUO, INAMINE, NOBORU, KURITA, SYOUJI, NOGUCHI, IKUO
Applicants: RISO KAGAKU CORP, RISO KAGAKU CORPORATION
Application year: 1994
Main classification: H04N1
IPC codes: H04N1, B41J2, G06T5