Method of and apparatus for generating tint pattern data
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to a method of and an apparatus for generating tint pattern data used for producing tint patterns by means of which a color print is reproduced. 
     2. Description of the Prior Art 
     In a color printing process, there are some cases where tint patterns producing respective uniform colors are printed on the same printing paper to produce a color print on which respective tint patterns are printed in contact with each other but without a blank line between them. 
     The following steps are generally carried out in order to produce such tint patterns. First, a line drawing is manually prepared by a designer, which line drawing defines outlines of different pattern areas to which respective uniform colors are assigned. A block copy of the line drawing is made and a positive picture of the block copy is taken as an original to be set for a process scanner. The process scanner reads the original picture to produce image data expressing the line drawing. An operater determines the respective uniform colors for the different pattern areas in the drawing by inputting color-assigning data into the process scanner. The process scanner generates tint pattern data expressing the colors in respective pattern areas of the line drawing and produces halftone positives or halftone negatives of the tint patterns as a function of the tint pattern data. 
     However, if the tint pattern data are generated so as to express the colors only at the inside of the outlines, the printed matter to be produced on the basis of the tint pattern data includes blank lines, that is, white lines on which no ink is printed in place of the outlines. 
     In order to prevent the occurrence of blank lines, the tint patterns may be expanded to cover the areas on which the outlines are positioned. However, it is not easy in general to expand the tint patterns by modifying the tint pattern data in the process scanner as well as modifying the tint patterns manually because respective widths of the outlines are not constant in the line drawing. In other words, when the tint pattern data are modified to expand the tint patterns by a constant width all around under the condition that the constant widths is smaller than the largest width of the outlines, some blank lines appear at some areas on the printed matter where parts of the outlines of larger width than the constant width are positioned. On the other hand, if the constant width is larger than the smallest width of the outlines, two different color inks of the neighboring pattern areas are overlapped on those areas where parts of the outlines of smaller width than the constant width are positioned. 
     SUMMARY OF THE INVENTION 
     The present invention is directed to a method of and an apparatus for generating tint pattern data used for producing tint patterns by which a color print is reproduced, the method comprising the steps of: (a) preparing a first image data expressing a first image including a line having finite width, a first area and a second area, where the first and second areas are separated from each other by the line, (b) executing a thinning process on the first image data in order to reduce the width of the line to form a thinned line having a uniform width, thereby to obtain a second image data expressing a second image including the thinned line, an enlarged first area and an enlarged second area, where the enlarged first and second areas are separated from each other by the thinned line, (c) generating third and fourth image data depicting the shapes of the enlarged first and second areas, respectively, (d) executing an expansion process on the third and fourth image data in order to expand the enlarged first and second areas by a constant width to form first and second expanded areas, respectively, (e) generating fifth and sixth image data expressing shapes of the first and second tint areas, respectively, and (f) generating tint pattern data, which expresses the shapes of the first and second expanded areas with respective prescribed colors, as a function of the fifth and sixth image data. 
     According to one aspect of the present invention, the first through sixth image data are formed as binary data assigned to each pixel, and the thinning process and the expansion process are performed through first and second logical processing operations respectively, where a pixel cluster consisting of a plurality of pixels is previously defined, respective binary data for the plurality of the pixels are subjected to the first and second logical processings, and binary data of a central portion of the pixel cluster is replaced by respective results of said first and second logical processings in the pixel cluster, respectively. 
     According to another aspect of the present invention, the thinning process is performed under the conditions of: (1) a first condition that the line is not divided into pieces by the thinning process, (2) a second condition that the thinned line is formed at the central portion of the line, (3) a third condition that the length of the thinned line is kept the same as that of the line even if the line is formed as a segment, and (4) a fourth condition that two arbitrary pixels neighboring each other are regarded as being continuous. 
     Preferably, a value of the third and fourth image data may be a first logical value at the inside of the enlarged first and second areas, respectively, and a second logical value at the outside of the enlarged first and second areas, respectively, and the second logical processing includes a logical summation amoung binary data of all pixels included in the pixel cluster. 
     Further, the constant width may be at least half of the uniform width. The constant width is preferably equal to the uniform width, and may be the same as the width of the pixel. 
     Accordingly, an object of the present invention is to provide a method of and an apparatus for generating tint pattern data which are useful in producing tint patterns in contact with each other on printed matter. Another object of the present invention is to prevent blank lines and overprinted areas from being produced on the printed matter. 
     These and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram showing the structure of an image processing apparatus, 
     FIG. 2 is a flow chart showing the procedure according to a preferred embodiment of the present invention, 
     FIGS. 3A-3F is a schematic view of images according to the preferred embodiment, 
     FIG. 4 is a schematic view showing a pixel cluster, 
     FIGS. 5A-5B is a schematic view showing patterns of binary data in the pixel cluster in a thinning process, and 
     FIG. 6 is a schematic view showing the thinning process using the pixel cluster. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     FIG. 1 is a block diagram showing the structure of an image processing apparatus that represents a preferred embodiment of the present invention. The image processing apparatus 110 comprises an image disc 111, a processing part 112 and a CPU 113. The image processing apparatus 110 first receives signals indicative of original image data D o  of a line drawing from an input scanner 100. A variety of devices such as a process scanner, a computer and the like, which generates the original image data D o , can be employed in place of the input scanner 100. The original image data D o , which expresses shapes and densities of outlines in the line drawing, is stored in the image disc 111. The original image data D o  is then transmitted from the image disc 111 to the processing part 112 to be subjected to data processing such as a thinning process on outline areas and processing for generating tint pattern data D t  expressing tints to be laid on respective tint pattern areas. The tint pattern data D t  is transmitted from the processing part 112 to the image disc 11 to be stored therein. The tint pattern data D t  is then outputted from the image disc 111 to an output scanner 120, by means of which tint patterns are recorded as halftone positives or halftone negatives. 
     The processing part 112 comprises an image memory 112a and a binary memory 112b. The image memory 112a temporarily stores a part of the original image data D o  to be processed in the processing part 112 and the binary memory 112b also temporarily stores binary data obtained through binarization of the original image data D o . The data processing in the processing part 112 is performed under the control of command signals delivered from the CPU 113. 
     FIG. 2 is a flow chart showing the operating procedure of the preferred embodiment of the present invention. FIGS. 3A-3F is a diagram showing the images at the main steps of the preferred embodiment. 
     First, original image data D 10  for an original image 10 shown in FIG. 3A is outputted from the image disc 111 into the image memory 112a at a step S1. The original image 10 has a shape of ten millimeter square, for example, and it is a part of a whole original image expressed by the original image data D o . There are three image areas 2, 3 and 4 separated from each other by a line area 1 in the original image 10. The original image data D 10  expresses the shape and the optical density of the line area 1. The original image 10 shown in FIG. 3A is an enlarged part of the whole original image and the line area 1 is consequently a part of outlines drawn on the whole original image. Some colors may be already assigned to the image areas 2, 3 and 4, or alternatively, they are not assigned yet. Namely, the original image may be either of a color picture or a line drawing of black and white. The original image data D 10  is the density data assigned to each pixel, for example. 
     The original image data D 10  is binarized by the CPU 113 at a step S2 based upon a prescribed threshold value. That is, if the density value of a pixel is higher than the threshold value, the binary data for the pixel is set at &#34;1&#34;, and if the density value is lower than the threshold value, the binary data for the pixel is set at &#34;0&#34;. If the image areas 2, 3 and 4 already have their respective assigned colors, the threshold value is set at a density higher than the respective colors and lower than that of the line area 1. Such a selection of the threshold value is possible since the line area 10 has been drawn with black or another deep color whose optical density is higher than that of the respective colors assigned to the areas 2, 3 and 4. The binary data B 10  for the original image 10 thus obtained expresses the shape of the line area 1. If the original image data D 10  itself is given as the binary data B 10  and is transmitted from the image disc 111 to the image memory 112a at the step S1, it is not necessary to execute the step S2. 
     The binary data B 10  thus obtained is stored in both the binary memory 112b and the image disc 111 at the step S3. 
     The binary data B 10  is subjected to a thinning process for reducing the width of the line area 1 by a pixel width at a step S4. The thinning process will be described in detail later. As a result, at the step S4 there is obtained from the line area 1 a reduced binary data, which expresses the shape of a reduced line area reduced by the pixel width. 
     At a step S5, the binary data B 10  stored in the binary memory 112b is replaced by the reduced bianry data obtained at the step S4. 
     The shape of the line area after the thinning process is compared with that before the thinning process at a step S6. If the shape of the line area is changed, the steps S4 through S6 are excuted again. On the other hand, if the shape of the line area is found to be unchanged, the thinning process is ended. Consequently, binary data B 10a  expressing an image 10a shown in FIG. 3B is obtained after repeating the steps S4-S6. The image 10a includes a thinned line area 1a whose width is equal to the pixel width, and enlarged image areas 2a, 3a and 4a which are expanded from the image areas 2, 3 and 4 shown in FIG. 3A. 
     The thinning process at the step S4 is performed with a (3×3) pixel cluster PC having nine pixels P 0  through P 8  as shown in FIG. 4. The center pixel P 4  is sequentially positioned at each pixel in the original image 10, while performing logical processing on nine binary data assigned to the pixels P 0  through P 8  in the binary data B 10  of the original image 10. Through the logical processing, the line area 1 is cut down by the pixel width Δt at one side thereof. As a result, the width of the line area 1 is reduced by the pixel width Δt after one thinning process at the step S4. The thinning process is repeated in order to reduce the line area 1 to the thinned line area 1a having a width equal to the pixel width Δt. 
     Preferably, the content of the logical processing is determined by consideration of the following conditions: 
     C1: A line area is not divided into pieces by the logical processing. 
     C2: A thinned line area is formed at the central portion of an initial line area 
     C3: Even if an initial line area in an original image does not form a closed loop, that is, even if the initial line area is formed as a segment, the length of a thinned line area is kept the same as that of the initial line area. However, the line area 1 shown in FIG. 3A, which ends at a frame 11 of the original image 10, is treated as a closed loop. Under this condition, segments 9a-9d of the pixel width Δt remains as a noise component in the image 10a after the thinning process. However, the segments 9a-9d are eliminated at a step S9 which will be described later. 
     C4: Two pixels neighboring each other at either of the vertical direction, the lateral direction and the oblique direction are treated as being continuous in order not to cut a line area. 
     C5: The logical processing is performed only on the basis of the binary data of the nine pixels P 0  through P 8  in the pixel cluster PC. 
     The logical processing satisfying the conditions C1 through C5 can be performed through the following equations: 
     
         a.sub.4 (new)=N.sub.1 +N.sub.2 +N.sub.3 +N.sub.4 +N.sub.5 +N.sub.6 +N.sub.7 +N.sub.8 +N.sub.9 +N.sub.10 +N.sub.11 +N.sub.12 +N.sub.13 +N.sub.14 +N.sub.15 +N.sub.16 +N.sub.17 +N.sub.18 +N.sub.19 +N.sub.20(1) 
    
     
         N.sub.1 =a.sub.1 ×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×a.sub.7                         (2a) 
    
     
         N.sub.2 =INV(a.sub.1)×a.sub.3 ×a.sub.4 ×a.sub.5 ×INV(a.sub.7)                                       (2b) 
    
     
         N.sub.3 =a.sub.1 ×INV(a.sub.2)×INV(a.sub.3)×a.sub.4 ×a.sub.5                                            (2c) 
    
     
         N.sub.4 =a.sub.4 ×a.sub.5 ×a.sub.7 ×INV(a.sub.8)×{INV(a.sub.1)+INV(a.sub.3)}     (2d) 
    
     
         N.sub.5 =INV(a.sub.1)×a.sub.3 ×a.sub.4 ×INV(a.sub.6)×a.sub.7                         (2e) 
    
     
         N.sub.6 =INV(a.sub.3)×a.sub.4 ×a.sub.6 ×INV(a.sub.7)×(a.sub.0 +a.sub.1 +a.sub.2 +a.sub.5 +a.sub.8)(2f) 
    
     
         N.sub.7 =a.sub.0 ×INV(a.sub.1)×INV(a.sub.3)×a.sub.4 ×(a.sub.2 +a.sub.5 +a.sub.6 +a.sub.7 +a.sub.8)      (2g) 
    
     
         N.sub.8 =INV(a.sub.1)×a.sub.2 ×a.sub.4 ×INV(a.sub.5)×(a.sub.0 +a.sub.3 +a.sub.6 +a.sub.7 +a.sub.8)(2h) 
    
     
         N.sub.9 =INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.7)×a.sub.8 ×(a.sub.0 +a.sub.1 +a.sub.2 +a.sub.6)                               (2i) 
    
     
         N.sub.10 =INV(a.sub.1)×a.sub.4 ×INV(a.sub.5) INV(a.sub.7)×a.sub.8 ×(a.sub.0 +a.sub.2 +a.sub.3 +a.sub.6)(2j) 
    
     
         N.sub.11 =a.sub.1 ×a.sub.3 ×a.sub.4 ×a.sub.5 ×a.sub.7                                            (2k) 
    
     
         N.sub.12 =a.sub.1 ×a.sub.3 ×a.sub.4            (21) 
    
     
         N.sub.13 =a.sub.0 ×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (2m) 
    
     
         N.sub.14 =INV(a.sub.0)×a.sub.1 ×INV(a.sub.2)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (2n) 
    
     
         N.sub.15 =INV(a.sub.0)×INV(a.sub.1)×a.sub.2 ×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (2o) 
    
     
         N.sub.16 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×a.sub.3 ×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (2p) 
    
     
         N.sub.17 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×a.sub.5 ×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8) (2q) 
    
     
         N.sub.18 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×a.sub.6 ×INV(a.sub.7)×INV(a.sub.8)                    (2r) 
    
     
         N.sub.19 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×a.sub.6 ×INV(a.sub.7)×INV(a.sub.8)                    (2s) 
    
     
         N.sub.20 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×a.sub.8(2t) 
    
     
         a.sub.4 (new)=M.sub.1 +M.sub.2 +M.sub.3 +M.sub.4 +M.sub.5 +M.sub.6 +M.sub.7 +M.sub.8 +M.sub.9 +M.sub.10 +M.sub.11 +M.sub.12 +M.sub.13 +M.sub.14 +M.sub.15 +M.sub.16 +M.sub.17 +M.sub.18 +M.sub.19 +M.sub.20(3) 
    
     
         M.sub.1 =a.sub.1 ×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×a.sub.7                         (4a) 
    
     
         M.sub.2 =INV(a.sub.1)×a.sub.3 ×a.sub.4 ×a.sub.5 ×INV(a.sub.7)                                       (4b) 
    
     
         M.sub.3 =a.sub.3 ×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×a.sub.7      (4c) 
    
     
         M.sub.4 =INV(a.sub.0)×a.sub.1 ×a.sub.3 ×a.sub.4 ×{INV(a.sub.5)+INV(a.sub.7)}                        (4d) 
    
     
         M.sub.5 =a.sub.1 ×INV(a.sub.2)×a.sub.4 ×a.sub.5 ×INV(a.sub.7)                                       (4e) 
    
     
         M.sub.6 =INV(a.sub.3)×a.sub.4 ×a.sub.6 ×INV(a.sub.7)×(a.sub.0 +a.sub.1 +a.sub.2 +a.sub.5 +a.sub.8)(4f) 
    
     
         M.sub.7 =a.sub.0 ×INV(a.sub.1)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×(a.sub.2 +a.sub.6 +a.sub.7 +a.sub.8)(4g) 
    
     
         M.sub.8 =a.sub.0 ×INV(a.sub.1)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.7)×(a.sub.2 +a.sub.5 +a.sub.6 +a.sub.8)(4h) 
    
     
         M.sub.9 =INV(a.sub.1)×a.sub.2 ×a.sub.4 ×INV(a.sub.5)×(a.sub.0 +a.sub.3 +a.sub.6 +a.sub.7 +a.sub.8)(4i) 
    
     
         M.sub.10 =a.sub.4 ×INV(a.sub.5)×INV(a.sub.7)×a.sub.8 ×(a.sub.0 +a.sub.1 +a.sub.2 +a.sub.3 +a.sub.6)      (4j) 
    
     
         M.sub.11 =a.sub.1 ×a.sub.3 ×a.sub.4 ×a.sub.5 ×a.sub.7                                            (4k) 
    
     
         M.sub.12 =a.sub.4 ×a.sub.5 ×a.sub.7            (4l) 
    
     
         M.sub.13 =a.sub.0 ×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (4m) 
    
     
         M.sub.14 =INV(a.sub.0)×a.sub.1 ×INV(a.sub.2)×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (4n) 
    
     
         M.sub.15 =INV(a.sub.0)×INV(a.sub.1)×a.sub.2 ×INV(a.sub.3)×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (4o) 
    
     
         M.sub.16 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×a.sub.3 ×a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8)                                                         (4p) 
    
     
         M.sub.17 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×a.sub.5 ×INV(a.sub.6)×INV(a.sub.7)×INV(a.sub.8) (4q) 
    
     
         M.sub.18 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×a.sub.6 ×INV(a.sub.7)×INV(a.sub.8)                    (4r) 
    
     
         M.sub.19 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×a.sub.7 ×INV(a.sub.8)                                       (4s) 
    
     
         M.sub.20 =INV(a.sub.0)×INV(a.sub.1)×INV(a.sub.2)×INV(a.sub.3).times.a.sub.4 ×INV(a.sub.5)×INV(a.sub.6)×INV(a.sub.7)×a.sub.8(4t) 
    
     where 
     a 4  (new): new binary data of the pixel P 4   
     a 0  -a 8  : initial binary data of the pixels P 0  -P 8   
     ×: AND operation 
     +: OR operation 
     INV(a i ): inverted data of the binary data a i   
     The respective right hand sides of the equations (1) and (3) are alternately calculated while replacing the value of the binary data a 4  in the right hand side by that obtained in the preceeding calculation as the data a 4  (new). 
     FIG. 5 is a schematic view showing patterns PA 1  -PA 33  and PB 1  -PB 33  of binary data in the pixel cluster PC, at which patterns the binary data a 4  of the center pixel P 4  is changed from &#34;1&#34; to &#34;0&#34; by the equations (1) and (3), respectively. Shaded pixels in the patterns PA 1  -PA 33  and PB 1  -PB 33  show that the initial binary data at the pixels are &#34;1&#34;, and non-shaded pixels show that initial binary data at those pixels are &#34;0&#34;. The shaded area is a part of the line area 1. The patterns PA 1  through PA 33  shown in FIG. 5A corresponds to the equation (1) and the patterns PB 1  through PB 33  shown in FIG. 5B corresponds to the equation (3). As can be seen from the patterns PA 1  through PA 33 , especially the patterns PA 21  through PA 33 , the equation (1) operates to eliminate the lower and right sides of the line area 1. On the other hand, as can be seen from the patterns PB 21  through PB 33 , the equation (3) operates to eliminate the upper and left sides of the line area 1. With respect to patterns other than those shown in FIG. 5, the binary data a 4  of the center pixel P 4  is not changed by the equations (1) nor (3). 
     During the repetition of the steps S4 through S6, a first logical processing in accordance with the equation (1) is first performed at the step S4, thereby to obtain a reduced binary data expressing a shape of a once-reduced line area whose width is reduced by the pixel width Δt at the lower and right sides of the line area 1. After returning to the step S4 through the steps S5 and S6, a second logical processing in accordance with the equation (3) is performed, thereby to obtain a twice-reduced binary data expressing the shape of a twice-reduced line area whose width is reduced by the pixel width Δt at the upper and left sides of the once-reduced line area. Namely, the first logical processing operation the equation (1) and the second logical processing operation using the equation (3) are alternately performed at the step S4 until the thinned line area 1a having the pixel width Δt is finally obtained. 
     FIG. 6 is a view schematically showing the logical processing. If the pixel cluster PC is so positioned that the center pixel P 4  is located at the edge of an initial line area 5 as shown in FIG. 6A, the result of the first logical operation using the equation (1) becomes &#34;0&#34;, whereby the binary data a 4  of the center pixel P 4  is replaced by the value of &#34;0&#34;. After the first logical processing with the equation (1) for all the pixels included in the image, the right side of the line area 5 is eliminated. Then, the second logical processing with the equation (3) is performed. As a result, a thinned line area 5a of the pixel width Δt is obtained as shown in FIG. 6B. However, at this time segments 9a-9d remain in the enlarged image areas 2a, 3a and 4a shown in FIG. 3B because of the condition C3 described before. 
     At a step S7, binary data B 2a  expressing the shape of the enlarged image area 2a is obtained. In this step, the image 10a shown in FIG. 3B is first displayed on an image display means such as a cathode ray tube (CRT), then an operator designates one of the enlarged image areas 2a, 3a and 4a as a subject area with a stylus pen, a mouse or the like by pointing out some position in the enlarged image area 2a and specifies a color density of the designated image area 2a by inputting color density data with a keyboard or the like. The processing part 112 recognizes that pixels having a value of &#34;0&#34; in the enlarged area included in the position pointed out by the operator and enclosed by the thinned line area 1a and the frame 11, are included in a single area. As a result, the binary data B 2a  expressing the shape of the enlarged image area 2a shown in FIG. 3C is obtained. Namely, binary data of pixels included in the enlarged image area 2a are set at &#34;1&#34;, and binary data of pixels out of the enlarged image area 2a in the image 10a are set at &#34;0&#34;. However, binary data at the segments 9a and 9b, which remain in the enlarged image area 2a as noise components and have values of &#34;1&#34; in the binary data B 10a  at the step S4, are set at &#34;0&#34; in the binary data B 2a  as noise component. The segments 9a and 9b are shown as non-shaded areas in FIG. 3c. 
     The binary data B 2a  is stored in the binary memory 112b at a step S8. 
     At a step S9, logical processing is performed on the binary data B 2a  for expanding the enlarged image area 2a by the pixel width Δt toward the thinned line area 1a. The logical processing is an OR operation as follows: 
     
         a.sub.4 (new)=a.sub.0 +a.sub.1 +a.sub.2 +a.sub.3 +a.sub.4 +a.sub.5 +a.sub.6 +a.sub.7 +a.sub.8                                         (5) 
    
     According to the OR operation, binary data of &#34;0&#34; at pixels neighboring a pixel having a binary data of &#34;1&#34; are changed to be &#34;1&#34;. As a result, the enlarged image area 2a is expanded by the pixel width Δt, thereby to become a tint area 2b including two parts 1b and 1c of the thinned line area 1a. FIG. 3D is an enlarged view showing the tint area 2b obtained through the expansion operation in the step S9. Furthermore, the expansion operation by the equation (5) functions so as to eliminate the segments 9a and 9b which remained in the enlarged image area 2a as noise components because the segments 9a and 9b are of the pixel width Δt and are expressed with values of &#34;0&#34; in the binary data B 2a . As a result, binary data B 2b  expressing the shape of the tint area 2b without the noise component is obtained at the step S9. 
     The binary data B 2a  stored in the binary memory 112b is replaced by the binary data B 2b  for the tint area 2b at the step S10. 
     Then, tint-generation processing is performed on the binary data B 2b  at a step S11. Namely, tint pattern data D 2b , which expresses the shape and color of the tint area 2b, is generated on the basis of the binary data B 2b  and a color density previously specified by an operator for the tint area 2b. 
     The tint pattern data D 2b  thus obtained is stored in the image memory 112a at the step S12. 
     If it is determined at the step S13 that all of the tint pattern data has not yet been generated, then the tint pattern data D 3b  for a tint area 3b shown in FIG. 3E is obtained by repeating the steps S7 through S12 after returning to the step S7 from the step S13. The tint area 3b is an area expanded by a pixel width Δt toward the thinned line area 1a from the enlarged image area 3a in the same way as that for the tint area 2b. The tint area 3b covers two parts 1c and 1d of the thinned line area 1a similar to the way tint area 2b included the parts 1b and 1c. A part of the tint pattern data D 2b , which corresponds to the part 1c of the thinned line area 1a included in both the tint areas 2b and 3b, is scratched and that part 1c is expressed by the tint pattern data D 3b  which is generated later than the tint pattern data D 2b . The steps S7 through S13 are repeated in order to generate all of the tint pattern data D 2b , D 3b  and D 4b  concerning the image areas 2, 3 and 4, which includes all of the image area in the original image 10 stored in the image memory 112a. 
     FIG. 3F is a diagram schematically showing the final tint areas 2c, 3c and 4c expressed by the final tint pattern data D 2c , D 3c  and D 4c , respectively, which are finally obtained after the repetition of the steps S7 through S13. The final tint areas 2c, 3c and 4c are formed so as to contact each other and not to cause an overlap nor a blank between them. The final tint area 2c is the same as the enlarged image area 2a because the two parts 1c and 1b of the thinned line area 1a included in the tint area 2b shown in FIG. 3D are expressed by the final pattern data D 3c  and D 4c , respectively. The part 1c of the thinned line area 1a, which is positioned between the enlarged image area 2a and 3a is expressed by the final tint pattern data D 3c  and the other part 1b of the thinned line area 1a is expressed by the final tint pattern data D 4c . As will be understood by those skilled in the art, the final tint pattern data D 4c  is the same as the tint pattern data D 4b  which is generated at the latest of all the tint pattern data D 2b , D 2c  and D 4b . 
     The final tint pattern data D 2c , D 3c  and D 4c  thus obtained are transmitted to the image disc 111 and stored therein at a step S14. 
     The steps S1 through S14 are sequentially repeated for the other parts of the whole original image, whereby final tint pattern data concerning all of the image areas included in the whole original image are generated. 
     In the above described procedure, the line area 1 is reduced to the thinned line area 1a having the width Δt of one pixel. However, the line area 1 may be reduced to have a uniform width of NΔt, where N is an integer, by the end of the step S6. When the steps S7 through S13 are executed in this case, final tint areas are also formed so as to contact each other and not to cause an overlap nor a blank between them if the amount of expansion at the step S9 is set at NΔt. The amount of expansion may be set at a value of at least half of NΔt in order for final tint areas to contact each other and not to cause an overlap nor a blank between them. However, if the line area 1 is reduced to have the width Δt of one pixel, as is described in the above embodiment, respective differences between the enlarged image areas 2a, 3a and 4a and the tint areas 2c, 3c and 4c can be minimized. 
     In an actual printing process, printing blocks for the tint areas 2c, 3c and 4c are produced on the basis of the final tint pattern data D 2c , D 3c  and D 4c , and a multicolor print with no line area of black color nor blank line is reproduced with the blocks. A multicolor print having the line area 1 of black color can also be reproduced through overprinting the line area 1, if necessary. 
     According to the present invention, image areas separated from each other by a line whose width is not constant can be easily transformed into tint areas contacting each other without causing an overlap nor a blank between them, and tint pattern data expressing respective shapes of the tint areas with prescribed colors can be easily generated. 
     Although the present invention has been described and illustrated in detail, it should be clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, the spirit and scope of the present invention being limited only by the terms of the appended claims.