JP6798588B2 - Mask data generation method, mask data generation program, and mask data generation device - Google Patents

Description

The present invention relates to a mask data generation method, a mask data generation program, and a mask data generation device.

In recent years, high-performance printing machines have become available to individual users, and it is a matter of course to provide high-precision and high-quality printed matter in commercial printed matter. In such a situation, in order to make a profit in commercial printed matter, it is a major issue to reduce the amount of ink, which is one of the main raw materials of printed matter.

For a binary image, a technique for converting the density to a low density for a region having a predetermined size or larger and a region such as a small dot, a halftone dot region and another region, respectively. Techniques for performing suitable conversion processing are known.

Japanese Unexamined Patent Publication No. 2011-041108 Japanese Unexamined Patent Publication No. 2004-213298

In a binary image with a reduced amount of ink, it may be visually recognized when a low-density portion or unprinted pixels occur periodically even in a small region of several pixels.

Therefore, on one aspect, the present invention aims to generate a reduction pattern that is difficult to see.

According to one aspect, it is a pixel that does not print the identification information of the pixels based on the order of the numbers from a certain area including a plurality of pixels in which the identification information including the number information is stored in association with each other. When the number of pixels stored in association with the information indicating the above and stored by associating the identification information with the information indicating that the pixels are not printed reaches a predetermined number, the pixels are not printed and are included in the certain area. Mask data characterized in that a computer executes a process in which information indicating that the information is to be printed is stored in association with the identification information of the pixel that is not stored in association with the identification information. A method of generating is provided.

Further, as a means for solving the above-mentioned problems, an apparatus for performing the above-mentioned method, a program for causing a computer to execute the above-mentioned processing, and a storage medium for storing the program may be used.

It is possible to generate a reduction pattern that is difficult to see.

It is a figure which shows the example of a printing system. It is a figure which shows the hardware configuration of the image data generation apparatus. It is a figure which shows the whole structure example in an information processing terminal. It is a figure for demonstrating the outline of an image data generation process. It is a figure which shows the functional configuration example of an image data generation apparatus. It is a figure which shows the example of the cell for reducing the pixel. It is a figure which shows the example before and after the pixel reduction. It is a flowchart for demonstrating the reduction pattern generation processing by the reduction pattern generation processing part. It is a figure which shows the example of the cell order by the Bayer arrangement. It is a figure which shows the order example of pixel reduction in the whole image. It is a figure which shows another example of a cell order. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure for demonstrating an order rule irregular system. It is a figure which shows the example of the calculation result by the order rule irregularity method of FIG. It is a figure which shows the example of the reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. It is a figure for demonstrating the order rule random system. It is a figure which shows the calculation result example by the order rule random method of FIG. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the example of the reduction pattern at the time of reducing one pixel at a time according to the pixel number of FIG. It is a figure which shows the calculation result example by 2 dot growth. It is a figure which shows the reduction pattern example at the time of reducing 16 pixels by 2 dot growth according to the pixel number of FIG. It is a figure which shows the reduction pattern example at the time of reducing 32 pixels by 2 dot growth according to the pixel number of FIG. It is a figure which shows the reduction pattern example at the time of reducing 48 pixels by 2 dot growth according to the pixel number of FIG. It is a figure which shows the calculation result example by 3 dot growth. It is a figure which shows the reduction pattern example at the time of reducing 16 pixels by 3 dot growth according to the pixel number of FIG. It is a figure which shows the reduction pattern example at the time of reducing 32 pixels by 3 dot growth according to the pixel number of FIG. It is a figure which shows the reduction pattern example at the time of reducing 48 pixels by 3 dot growth according to the pixel number of FIG. It is a figure which shows the example of the calculation result by n dot growth. It is a figure which shows the reduction pattern example at the time of reducing 16 pixels by n dot growth according to the pixel number of FIG. 33. It is a figure which shows the reduction pattern example in the case of reducing 32 pixels by n dot growth according to the pixel number of FIG. 33. It is a figure which shows the reduction pattern example in the case of reducing 48 pixels by n dot growth according to the pixel number of FIG. 33. It is a figure which shows the example of the calculation result by the combination of the order rule irregular system and 2 dot growth. It is a figure which shows the example of the reduction pattern at the time of reducing 16 pixels by the compound type 2 dot growth according to the pixel number of FIG. 37. It is a figure which shows the example of the reduction pattern at the time of reducing 32 pixels by the compound type 2 dot growth according to the pixel number of FIG. 37. It is a figure which shows the example of the reduction pattern at the time of reducing 48 pixels by the compound type 2 dot growth according to the pixel number of FIG. 37. It is a figure which shows the example of the calculation result by the order rule irregular system and 3 dot growth. It is a figure which shows the example of the reduction pattern at the time of reducing 16 pixels by the composite type 3 dot growth according to the pixel number of FIG. 41. It is a figure which shows the example of the reduction pattern at the time of reducing 32 pixels by the composite type 3 dot growth according to the pixel number of FIG. 41. It is a figure which shows the example of the reduction pattern at the time of reducing 48 pixels by the composite type 3 dot growth according to the pixel number of FIG. 41. It is a figure which shows the arrangement example of the cell based on the order rule irregular system. It is a figure which shows the arrangement example of the cell based on the order rule random method.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a diagram showing an example of a printing system. In FIG. 1, the printing system 1000 includes a development processing device 70, an image data generation device 80, and a print output device 90.

The unfolding processing device 70 unfolds the input original data 1 into the original binary image 2. The manuscript data 1 is a data file or the like including a color image. The original binary image 2 is input to the image data generation device 80.

The image data generation device 80 performs data processing on the input original binary image 2, and outputs the binary image 3 after reducing the pixels. The image data generation device 80 includes an image data generation processing unit 83 that thins out the pixels to be printed without deteriorating the image quality. The image data generation processing unit 83 generates a binary image 3 after pixel reduction, which can reduce the amount of ink by thinning out the pixels of the original binary image 2 in a pattern that is difficult to see.

In this embodiment, reducing the amount of ink means changing the pixels to be printed to non-printing pixels to reduce the number of pixels. Further, such pixels that are originally printed (printing pixels) are not printed in order to reduce the amount of ink, and are referred to as reduction pixels. Usually, the reduction pixels are formed for a region where the print pixels are continuous.

The pixel-reduced binary image 3 is input to the print output device 90, and the print output device 90 prints based on the pixel-reduced binary image 3. The printed matter 4 on which the manuscript data 1 is printed is output.

The image data generation device 80 may have a hardware configuration as shown in FIG. 2 and may be an individual system independent of the printing system 1000. FIG. 2 is a diagram showing a hardware configuration of the image data generation device.

In FIG. 2, the image data generation device 80 is an information processing device controlled by a computer, and displays a CPU (Central Processing Unit) 11, a main storage device 12, an auxiliary storage device 13, and an input device 14. It has a device 15, a communication I / F (interface) 17, and a drive device 18, and is connected to the bus B.

The CPU 11 corresponds to a processor that controls the image data generation device 80 according to a program stored in the main storage device 12. A RAM (Random Access Memory), a ROM (Read Only Memory), or the like is used in the main storage device 12, and is obtained by a program executed by the CPU 11, data required for processing by the CPU 11, and processing by the CPU 11. Store or temporarily store the collected data.

An HDD (Hard Disk Drive) or the like is used in the auxiliary storage device 13, and data such as a program for executing various processes is stored in the auxiliary storage device 13. Various processes are realized by loading a part of the program stored in the auxiliary storage device 13 into the main storage device 12 and executing the program in the CPU 11. The storage unit 130 corresponds to the main storage device 12 and / or the auxiliary storage device 13.

The input device 14 has a mouse, a keyboard, and the like, and is used by the user to input various information necessary for processing by the image data generation device 80. The display device 15 displays various information required under the control of the CPU 11. The input device 14 and the display device 15 may be a user interface using an integrated touch panel or the like. The communication I / F17 communicates through a network such as wired or wireless. Communication by communication I / F17 is not limited to wireless or wired.
A program that realizes the processing performed by the image data generation device 80 is provided to the image data generation device 80 by a storage medium 19 such as a CD-ROM (Compact Disc Read-Only Memory).

The drive device 18 interfaces the storage medium 19 (for example, a CD-ROM or the like) set in the drive device 18 with the image data generation device 80.

Further, a program for realizing various processes according to the present embodiment described later is stored in the storage medium 19, and the program stored in the storage medium 19 is stored in the image data generation device 80 via the drive device 18. Will be installed. The installed program can be executed by the image data generation device 80.

The storage medium 19 for storing the program is not limited to the CD-ROM, and is one or more non-transitory, tangible media having a structure that can be read by a computer. It should be. As the computer-readable storage medium, in addition to the CD-ROM, a portable recording medium such as a DVD disk or a USB memory, or a semiconductor memory such as a flash memory may be used.

The image data generation device 80 may be an information processing terminal 81 such as a personal computer as shown in FIG. FIG. 3 is a diagram showing an overall configuration example of the information processing terminal. In FIG. 3, the information processing terminal 81 has an OS (Operating System) such as Windows (registered trademark), and has an application 5 running on the OS, an image data generation processing unit 83, a printer driver 9, and the like.

The application 5, the image data generation processing unit 83, and the printer driver 9 are realized by the CPU 11 executing the corresponding program.

The application 5 performs a predetermined process and prints. The process performed by application 5 is not specified. The application 5 binarizes the original data 1 and makes a print request to the image data generation processing unit 83.

The image data generation processing unit 83 reduces the pixels of the original binary image 2 of the original data 1 in response to the print request from the application 5, and transfers the binary image 3 after the pixel reduction to the printer driver 9 in the printer 90. Have -2 print.

The printer driver 9 controls the printer 90-2 to print the binary image 3 after reducing the pixels. The printer 90-2 prints the binary image 3 after reducing the pixels and outputs the printed matter 4. The printer 90-2 may be connected to the information processing terminal 81 by wire or wirelessly.

Since the information processing terminal 81 has the same hardware configuration shown in FIG. 2, the description thereof will be omitted.

The outline of the image data generation processing 83p by the image data generation processing unit 83 will be described. FIG. 4 is a diagram for explaining an outline of the image data generation process. In FIG. 4, the image data generation process 83p reduces the number of printed pixels of the original binary image 2 and outputs the pixel-reduced binary image 3. In the image data generation process 83p, the pixel reduction process 84p and the reduction pattern generation process 85p are performed.

The pixel reduction process 84p sets the pixels satisfying the reduction rate 6 to the pixels that are not printed based on the reduction pattern 7 in the original binary image 2. Specifically, "1" is indicated when printing is performed for each pixel, and "0" is set when printing is not performed. In the original binary image 2, the pixels that are set to be printed are not printed. Change to settings. "1" is changed to "0". "1" indicates a pixel to be printed in black, and "0" indicates a pixel not to be printed. In the following description, changing to a setting that does not print pixels may mean thinning out pixels.

The reduction rate 6 is a preset value and is stored in the storage unit 130. The reduction pattern 7 is generated by the reduction pattern generation process 85p and stored in the storage unit 130.

The reduction pattern generation process 85p generates the reduction pattern 7. The reduction pattern 7 in this embodiment is a pattern that solves the following problems when the pixels are thinned out.
・ If the thinned area is large, it will be visible.
-Even if one area in which pixels to be printed are thinned out cannot be visually recognized, if areas having the same shape are continuous at equal intervals, it may be visually recognized that the image is thinned out.

FIG. 5 is a diagram showing a functional configuration example of the image data generation device. Although FIG. 5 shows an example of the functional configuration of the image data generation device 80, the functional configuration of the image data generation processing unit 83 is the same in the information processing terminal 81. In FIG. 5, the image data generation processing unit 83 includes a pixel reduction processing unit 84 and a reduction pattern generation processing unit 85.

The storage unit 130 stores the original binary image 2, the reduction rate 6, the reduction pattern 7, the pixel reduction binary image 3, and the like.

The pixel reduction processing unit 84 is a processing unit that performs the pixel reduction processing 84p. The pixel reduction processing unit 84 generates a pixel reduction binary image 3 that satisfies the reduction rate 6 with respect to the original binary image 2 according to the reduction pattern 7. The pixel-reduced binary image 3 is an image in which the printed area includes a non-printable area that cannot be visually recognized, that is, a perforated image.

The reduction pattern generation processing unit 85 is a processing unit that performs reduction pattern generation processing. The reduction pattern generation processing unit 85 generates a reduction pattern 7 in which the image quality is not impaired and the image in which the pixels are thinned out cannot be visually recognized.

A mechanism for reducing pixels will be described with reference to FIGS. 6 and 7. FIG. 6 is a diagram showing an example of a cell for reducing pixels.

FIG. 6A shows an example in which 16 pixels of 4 × 4 are used as one cell. Hereinafter, this one cell will be described, but one cell may be appropriately set and is not limited to 16 pixels of 4 × 4.

When the thinned pixels are interspersed, it may be recognized as a gray color feeling or a rough image quality, and the black color feeling may be impaired. Therefore, one cell is a unit that forms a pixel reduction area by thinning out pixels adjacent to each other. Hereinafter, it is referred to as a reference cell 6rb. By doing so, it is possible to express black color without visually recognizing the thinned pixels.

In the reference cell 6rb, the thinning order (hereinafter referred to as reduction order 6q) is determined by drawing a spiral outward while rotating from the center of the reference cell 6rb. In the reference cell 6rb, the number "1" is the starting point.

FIG. 6B shows a reduction pattern when 3 pixels are reduced in one cell. When reducing 3 pixels, the pixels corresponding to the reduction numbers 1, 2, and 3 are reduced from the center according to the reduction order 6q of the reference cell 6rb.

FIG. 7 is a diagram showing an example before and after pixel reduction. FIG. 7A shows any one cell in the original binary image 2. FIG. 7B shows an image of the cell after pixel reduction. By performing a logical product operation on the cell of FIG. 7 (A) and the cell of the reduction pattern of FIG. 6 (B), an image after pixel reduction without pixels as shown in FIG. 7 (B) can be obtained. .. This is a process performed by the pixel reduction processing unit 84.

FIG. 8 is a flowchart for explaining the reduction pattern generation processing by the reduction pattern generation processing unit. In FIG. 8, the reduction pattern generation processing unit 85 determines the pixel number (step S100). In this embodiment, the pixel number is determined by any of the methods of FIGS. 16, 21, 29, 33, 37, and 41, which will be described later.

The reduction pattern generation processing unit 85 calculates the number of reduction pixels from the reduction rate 6 (step S101). The reduction pattern generation processing unit 85 obtains the number of reduced pixels by multiplying the total number of pixel values “1” in the original binary image 2 by the reduction rate 6. The pixel number is initialized to 0.

The reduction pattern generation processing unit 85 increments the pixel number by a predetermined number (step S102), and determines whether or not the pixel number in the reduction pattern 7 exceeds the number of reduced pixels (step S103). The predetermined number of minutes is the number of pixels to be reduced at one time in one cell.

When the pixel number exceeds the number of reduced pixels (YES in step S103), the reduction pattern generation processing unit 85 sets the value of the target pixel to "1" (step S104). On the other hand, when the pixel number is equal to or less than the number of reduced pixels (NO in step S103), the reduction pattern generation processing unit 85 sets the value of the target pixel to “0” (step S105).

The reduction pattern generation processing unit 85 determines whether or not all the pixels have been completed (step S106). It may be determined whether or not the pixel number has reached the total number of pixel values "1" in the original binary image 2 obtained in step S101. When all the pixels are not completed (NO in step S106), the reduction pattern generation processing unit 85 returns to step S102, adds 1 to the pixel number, and repeats the same processing as described above.

On the other hand, when all the pixels are completed (YES in step S106), the reduction pattern generation processing unit 85 outputs the reduction pattern 7 (step S107). The reduction pattern 7 is stored in the storage unit 130.

The pixel reduction processing unit 84 uses the reduction pattern 7 generated by the reduction pattern generation processing unit 85 to perform the processing described with reference to FIG. 7, and generates a binary image 3 after pixel reduction. After reducing the pixels, the binary image 3 is input to the print output device 90.

In the above, the pixel is uniquely specified by using the pixel number, but the coordinates of the pixel may be used instead of the number. The pixel number and pixel coordinates that specify the pixel in this way correspond to the pixel identification information.

Next, a variation example of the reduction pattern generation process will be described.
(A) Existing method The shape of the reduction area in each cell is the same, and the shape direction is also the same.
(B) Order rule variation The orientation of the shape of the reduction area formed in the cell is made variable.
(B1) Order rule irregular method (B2) Order rule random method (C) Growth pixel number variation In the first round, the number of adjacent two pixels or more in each cell is reduced at one time.
(C1) 2-dot growth In each cell, the number of adjacent 2 pixels is reduced.
(C2) 3-dot growth In each cell, the number of adjacent 3 pixels is reduced.
(C3) n-dot growth (n> 3)
In each cell, the number of adjacent n pixels of 4 or more is reduced.
(D) Combined composite types (B) and (C).
Combine (D1) (B1) ordered irregularity scheme and (C1) 2-dot growth.
Combine (D2) (B1) ordered irregularity scheme and (C2) 3-dot growth.

First, an example of the existing method (A) will be described by taking the case where the region of 16 × 16 pixels in the original binary image 2 is the reduction target region 9a as an example. The area where the print pixels are continuous is the target of the reduction target area 9a, and may be 16 × 16 pixels or more. FIG. 9 is a diagram showing an example of cell order according to the Bayer arrangement.

In FIG. 9, there are 16 reference cells 6rb, and a Bayer sequence is applied to assign cell numbers to each cell. 1 to 16 are assigned to 16 reference cells 6rb. Hereinafter, they are referred to as cells 1 to 16.

Cells are selected according to the order of cells 1 to 16, and in the selected cells, pixels are reduced according to the reduction order 6q in the reference cell 6rb shown in FIG. 6 (A) as shown in FIG. 6 (B). The pixel number is set so as to be.

In the reduction target area 9a
Pixel sequence sequence in cell 6rb = Cell (x, y)
It is represented by. In this example, the size is represented by CellX = 4 and CellY = 4.

Also,
Cell order to reduce print pixels = CellNum (x, y)
It is represented by.

The cells are ordered from 1 to 16, that is, as shown in FIG.
Number of cells = CellCnt = 16
It is represented by.

First, the reduction order 6q in the case of reducing one pixel for each cell in one round of cells 1 to 16 will be described. FIG. 10 is a diagram showing an example of the order of pixel reduction in the entire image. The number shown in the circle at the center of each cell is the cell number. The same applies to the following figures. FIG. 10 shows an example in which the reduction order 6q is assigned to each pixel of the reduction target region 9a in the order of cells 1 to 16 determined by the Bayer arrangement. Pixels 1 to 256 are defined.

In the Bayer array, cells are selected in order according to cells 1 to 16, the first pixel of the reference cell 6rb described above is selected, and numbers are sequentially assigned to the entire original binary image 2. The first pixel of cell 1 is pixel 1, the first pixel of cell 2 is pixel 2, the first pixel of cell 3 is pixel 3, ..., And the first pixel of cell 16 is pixel 16.

When the cells 1 to 16 are cycled, the cell 1 is returned to, and the second pixel of the reference cell 6rb becomes the pixel 17. Cell 2 to cell 16 are sequentially selected, and the second pixel is numbered in the same manner as described above. By repeating such processing 16 times, pixels 1 to image 256 are determined.

When the sequence number of the pixel to be reduced is expressed by Pixs (x, y),
Pixs (x, y)
= CellNum (x, y)
+ (Cell (Mod (x, CellX), Mod (y, CellY)) -1)
× CellCnt
It is expressed as. Here, the remainder of Mod (A, B) = A / B is shown.

FIG. 11 is a diagram showing another example of cell order. As shown in FIG. 11A, the cell order may be determined in the vertical or horizontal direction. Further, as shown in FIG. 11B, the cell order may be determined in a rotation format from the outside to the center or a rotation format from the center to the outside. These, including the Bayer sequence, are part of various cell order definition examples and are not limited to the examples described above.

In this embodiment, the Bayer array is used, and the reduction pattern generation processing unit 85 determines the pixel number according to the Bayer array, and generates the reduction pattern 7 in which the number of printed pixels is reduced based on the reduction rate 6. Then, the pixel reduction processing unit 84 changes the pixel value from "1" to "0" by performing a logical product operation on the reduction pattern 7 and the original binary image 2 according to the reduction pattern 7.

12 to 14 show an example of reducing one pixel at a time. In FIGS. 12 to 14, and also in the same figure described later, the reduced pixels are shown in full.

FIG. 12 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 12, by going around cells 1 to 16, a reduction pattern 116 in which one pixel is reduced in each cell is generated.

In the reduction pattern 116, pixels 1 to 16 are reduced pixels, and all the reduced pixel regions are regularly arranged at equal intervals in the vertical and horizontal directions.

FIG. 13 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 13, by further cycling from the state of the reduction pattern 116 to the cells 1 to 16, the reduction pattern 132 in which two pixels are reduced adjacent to each cell is generated.

In the reduction pattern 132, in addition to the pixels 1 to 16 of the reduction pattern 116, the pixels 17 to 32 are the reduction pixels. Each pixel 17 to 32 is a reduction pixel adjacent to the right of each of the pixels 1 to 16. Therefore, the reduced pixel regions formed by the two pixels formed in the cells 1 to 16 are regularly arranged vertically and horizontally at equal intervals.

FIG. 14 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 14, by further cycling from the state of the reduction pattern 132 to the cells 1 to 16, the reduction pattern 148 in which the reduction patterns 148 are reduced by 3 pixels adjacent to each cell is generated.

In the reduction pattern 148, in addition to the pixels 1 to 32 of the reduction pattern 132, the pixels 32 to 48 are the reduction pixels. Each pixel 33 to 48 is a reduction pixel adjacent to each of the pixels 17 to 32. Therefore, the reduced pixel regions formed by the three pixels formed in the cells 1 to 16 are regularly arranged vertically and horizontally at equal intervals.

Next, an example of the above (B) order rule variation will be described. First, (B1) the order rule irregular method will be described.

FIG. 15 is a diagram for explaining an order rule irregular system. In the above (A), there was only one reference cell 6rb, but in the (B1) order rule irregular method, four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 are used. The relationship between the four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 is as follows.

The reference cell 6rb_1 corresponds to the reference cell 6rb in FIG. 6A, and the reduction order 6q of the reference cell 6rb_1 is as shown in FIG. 6A. The reference cell 6rb_2 shows the reduction order 6q when the reference cell 6rb is rotated counterclockwise (counterclockwise) by 90 °, and the reference cell 6rb_2 is rotated 180 ° counterclockwise (counterclockwise). The reduction order 6q when the reference cell 6rb_3 is rotated indicates the reduction order 6q when the reference cell 6rb is rotated counterclockwise (counterclockwise) by 270 °.

(B1) In the order rule irregular method, each time the cells 1 to 16 are circulated and one is selected, the four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 are circulated and applied. That is,
Reference cell 6rb_1-> Reference cell 6rb_1
-> Reference cell 6rb_3-> Reference cell 6rb_4 ...
It is selected repeatedly like. Therefore, the reference cell is determined by the cell number. When the number of cells is 16, it is as follows.

Reference cell 6rb_1 = cell numbers 1, 5, 9, and 13
Reference cell 6rb_2 = cell numbers 2, 6, 10, and 14
Reference cell 6rb_3 = cell numbers 3, 7, 11, and 15
Reference cell 6rb_4 = cell numbers 4, 8, 12, and 16
(B1) The calculation method for determining the pixel number by the order rule irregular method is that Pixs (x, y) is the pixel number.
Pixs (x, y)
= CellNum (x, y)
+ (CellG (Mod (x, CellX), Mod (y, CellY))-1))
× Cellct
It is represented by. CellG (x, y) is any one of CellP1 (), CellP2 (), CellP3 (), and CellP4 ().

FIG. 16 is a diagram showing an example of a calculation result by the order rule irregular method of FIG. FIG. 16 shows a calculation result 209 in which each time a cell is selected according to the Bayer array, the reference cell is switched, pixels are selected according to the reduction order 6q in each reference cell, and numbers (serial numbers) are assigned in sequence. ing.

FIG. 17 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 17, by going around cells 1 to 16, a reduction pattern 216 in which one pixel is reduced in each cell is generated.

Unlike the reduction pattern 116 (FIG. 12), the reduction pattern 216 has a variable interval between the reduction pixel regions and does not show a constant interval between all the reduction pixel regions.

FIG. 18 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 18, by further cycling from the state of the reduction pattern 216 to cells 1 to 16, a reduction pattern 232 in which two pixels are reduced adjacent to each cell is generated.

In the reduction pattern 232, in addition to the pixels 1 to 16 of the reduction pattern 216, the pixels 17 to 32 are the reduction pixels.

Pixels 17, 21, 25, and 29 are reduced pixels adjacent to the right of pixels 1, 5, 9, and 13, respectively, and pixels 18, 22 are adjacent to the right of pixels 2, 6, 10, and 14, respectively. , 26, and 30 are reduced pixels, and pixels 19, 23, 27, and 31, respectively, adjacent to the left of pixels 3, 7, 11, and 15, are reduced pixels, of pixels 4, 8, 12, and 16. Pixels 20, 24, 28, and 32, respectively, adjacent to the bottom are reduced pixels.

Therefore, the orientation of the reduced pixel region formed by the two pixels formed in the cells 1 to 16 changes, and the interval between the reduced pixel regions also changes.

FIG. 19 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 19, by further cycling from the state of the reduction pattern 232 to the cells 1 to 16, the reduction pattern 248 in which the reduction patterns 248 are reduced by 3 pixels adjacent to each cell is generated.

In the reduction pattern 248, in addition to the pixels 1 to 22 of the reduction pattern 232, the pixels 33 to 48 are the reduction pixels.

Pixels 33, 37, 41, and 45 are reduced pixels adjacent to pixels 17, 21, 25, and 29, respectively, and pixels 34, 38, respectively, adjacent to the left of pixels 18, 22, 26, and 30. , 42, and 46 are reduced pixels, and pixels 35, 39, 43, and 47 are adjacent to under pixels 19, 23, 27, and 31, respectively, and are reduced pixels, of pixels 20, 24, 28, and 32. Pixels 36, 40, 44, and 48 adjacent to the right are reduced pixels, respectively.

In the reduction pattern 248, the spacing between the reduction pixel regions formed by the three pixels formed in the cells 1 to 16 is substantially the same, but the orientation is changed.

Next, (B2) the order rule random method will be described. FIG. 20 is a diagram for explaining an order rule random method. Similar to the above (B1) order rule irregular method, the (B2) order rule random method also uses four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4. The reduction order 6q in each reference cell 6rb_1, 6rb_2, 6rb_3, and 6rb_4 is the same as in (B1) order rule irregular method.

However, in the (B2) order rule random method, four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 are randomly selected and applied each time cells 1 to 16 are circulated in this order to select one. In other words, one is selected from the four angles of 0 °, 90 °, 180 °, and 270 °, and the reference cell 6rb_1 (that is, the reference cell 6rb (FIG. 6A)) is rotated and applied. ..

As an example,
Reference cell 6rb_1-> Reference cell 6rb_3
-> Reference cell 6rb_4-> Reference cell 6rb_2
-> Reference cell 6rb_1-> Reference cell 6rb_3
-> Reference cell 6rb_4-> Reference cell 6rb_2
-> Reference cell 6rb_2-> Reference cell 6rb_4
-> Reference cell 6rb_3-> Reference cell 6rb_1
-> Reference cell 6rb_2-> Reference cell 6rb_4
-> Reference cell 6rb_3-> Reference cell 6rb_1 ...
Is selected as. If the number of cells is 16, in this example,
Reference cell 6rb_1 is applied to cell numbers 1, 5, 12, 16 and
Reference cell 6rb_2 is applied to cell numbers 4, 8, 9, 13 and
Reference cell 6rb_3 is applied to cell numbers 2, 6, 9, 15 and
Reference cell 6rb_4 is applied to cell numbers 3, 7, 10 and 14.

(B2) Order rule The calculation method for determining the pixel number by the random method is that Pixs (x, y) is the pixel number.
Pixs (x, y)
= CellNum (x, y)
+ (CellR (Mod (x, CellX), Mod (y, CellY))-1))
× Cellct
It is represented by. CellR (x, y) is any one of CellP1 (), CellP2 (), CellP3 (), and CellP4 ().

FIG. 21 is a diagram showing an example of calculation results by the order rule random method of FIG. In FIG. 21, each time the cells are selected according to the Bayer array, the reference cell 6rb is switched, the pixels are selected according to the reduction order 6q in each reference cell 6rb, and the calculation result 309 is numbered sequentially. There is.

FIG. 22 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. 21. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 22, by going around cells 1 to 16, a reduction pattern 316 in which one pixel is reduced in each cell is generated.

Unlike the reduction pattern 116 (FIG. 12), the reduction pattern 316 has a variable interval between the reduction pixel regions and does not show a constant interval between all the reduction pixel regions.

FIG. 23 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. 21. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 23, by further performing the second round from the state of the reduction pattern 316 to the cells 1 to 16, the reduction pattern 332 in which two pixels are reduced adjacent to each cell is generated.

In the reduction pattern 332, in addition to the pixels 1 to 16 of the reduction pattern 316, the pixels 17 to 32 are the reduction pixels.

Pixels 17, 21, 28, and 32 are reduced pixels adjacent to the right of pixels 1, 5, 12, and 16, respectively, and pixels 18, 22 are adjacent to the left of pixels 2, 6, 11, and 15, respectively. , 27, and 31 are reduced pixels, and pixels 19, 23, 26, and 30 are adjacent to under pixels 3, 7, 10, and 14, respectively, and are reduced pixels of pixels 4, 8, 9, and 13. Pixels 20, 24, 25, and 29, respectively, adjacent to the bottom are reduced pixels.

Therefore, the orientation of the reduced pixel region formed by the two pixels formed in the cells 1 to 16 changes, and the interval between the reduced pixel regions also changes.

FIG. 24 is a diagram showing an example of a reduction pattern in the case of reducing one pixel at a time according to the pixel number of FIG. 21. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 24, by further performing the second round from the state of the reduction pattern 232 to the cells 1 to 16, the reduction pattern 348 in which the reduction patterns 348 are reduced by 3 pixels adjacent to each cell is generated.

In the reduction pattern 348, pixels 33 to 48 are the reduction pixels in addition to the pixels 1 to 22 of the reduction pattern 232.

Pixels 33, 37, 44, and 48 are adjacent pixels above pixels 17, 21, 28, and 32, respectively, and pixels 34, 38, respectively, adjacent below pixels 18, 22, 27, and 31. , 43, and 47 are reduced pixels, and pixels 35, 39, 42, and 46 are adjacent to the right of pixels 19, 23, 26, and 30, respectively, and are reduced pixels, of pixels 20, 24, 25, and 29. Pixels 36, 40, 41, and 45 adjacent to the left are reduced pixels, respectively.

In the reduction pattern 348, the spacing between the reduction pixel regions formed by the three pixels formed in the cells 1 to 16 is substantially the same, but the orientation is changed.

Next, (C) a variation in the number of growth pixels will be described. The growth pixel is the number of pixels to be reduced in the first round of cells 1 to 16. (C) In the variation of the number of growth pixels, the reference cell 6rb of FIG. 6 (A) is used, but the number of pixels of 2 or more is reduced in the first round of cells 1 to 16.

First, (C1) 2-dot growth will be described. FIG. 25 is a diagram showing an example of calculation results by 2-dot growth. In FIG. 25, in 2-dot growth, two adjacent pixels are selected in the first round of cells 1 to 16, one pixel is selected in each cell 1 to 16 in the second and subsequent rounds, and each pixel is serially numbered. The calculation result 409 with a number is shown.

The solid line corresponds to the selection example of two pixels in the first round, and the broken line shows the selection example of one pixel in the second round.

FIG. 26 is a diagram showing an example of a reduction pattern when 16 pixels are reduced by 2-dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 26, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 2 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. As a result, the reduction pattern 416 is generated.

In the reduction pattern 416, pixels 1 and 2 in cell 1, pixels 3 and 4 in cell 2, pixels 5 and 6 in cell 3, pixels 7 and 8 in cell 4, which are a combination of two adjacent pixels, Pixels 9 and 10 in cell 5, pixels 11 and 12 in cell 6, pixels 13 and 14 in cell 7, and pixels 15 and 16 in cell 8 are reduced pixels.

In the reduction pattern 416, the number of pixels is reduced by 2 for each of the 8 cells 1 to 8, and the reduction pixel region is not formed in the cells 9 to 16. Further, in the reduction pattern 416, the interval of the reduction pixel region is wider than that of the reduction pattern 116 (FIG. 12). Therefore, the reduction pattern 416 shows a pattern different from the reduction pattern 116, which is difficult to see.

FIG. 27 is a diagram showing an example of a reduction pattern when 32 pixels are reduced by 2-dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 27, in the first round of cells 1 to 16, the number of pixels is reduced by 2 pixels, and when the reduction rate 6 is satisfied, the cell selection is completed. In this case, all the cells from the first round cells 1 to 16 are reduced by 2 pixels, and as a result, the reduction pattern 432 is generated.

The reduction pattern 432 shows the same pattern as the reduction pattern 132 (FIG. 13) as a result of reducing by 2 pixels for each of the 16 cells 1 to 16.

FIG. 28 is a diagram showing an example of a reduction pattern in the case where 48 pixels are reduced by 2-dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 28, by further performing the second round from the state of the reduction pattern 432 to the cells 1 to 16, the reduction pattern 448 in which 3 pixels are reduced adjacent to each cell is generated.

In the reduction pattern 448, in addition to the pixels 1 to 32 of the reduction pattern 332, the pixels 33 to 48 are the reduction pixels.

The reduction pattern 448 shows the same pattern as the reduction pattern 148 (FIG. 14) as a result of reducing by 3 pixels for each of the 16 cells 1 to 16 although the reduction pixels in the first round are different.

Next, (C2) 3-dot growth will be described. FIG. 29 is a diagram showing an example of a calculation result by 3-dot growth. In FIG. 29, in the 3-dot growth, adjacent 3 pixels are selected in the first round of cells 1 to 16, one pixel is selected in each cell 1 to 16 in the second and subsequent rounds, and each pixel is serially numbered. The calculation result 509 with a number is shown.

The solid line corresponds to the selection example of 3 pixels in the first round, and the broken line shows the selection example of 1 pixel in the second round.

FIG. 30 is a diagram showing an example of a reduction pattern when 16 pixels are reduced by 3 dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 30, in the first round of cells 1 to 16, the number of pixels is reduced by 3 pixels, and when the reduction rate 6 is satisfied, the cell selection is completed. In this case, cells 1 to 5 in the first round are reduced by 3 pixels, and cell 6 is reduced by only 1 pixel. As a result, the reduction pattern 516 is generated.

In the reduction pattern 516, pixels 1, 2, and 3 in cell 1, pixels 4, 5, and 6 in cell 2, and pixels 7, 8, and 9 in cell 3, which are a combination of three adjacent pixels, Pixels 10, 11, and 12 in the cell 4 and pixels 13, 14, and 15 in the cell 5 are reduced pixels. In cell 6, only one pixel is the reduction pixel.

In the reduction pattern 516, 3 pixels are reduced for each of the 5 cells 1 to 5, 1 pixel is reduced for each cell 6, and the reduction pixel region is not formed in the cells 7 to 16. Therefore, the reduction pattern 516 shows a pattern different from the reduction pattern 116 (FIG. 12), and can be said to be a pattern that is difficult to see.

FIG. 31 is a diagram showing an example of a reduction pattern when 32 pixels are reduced by 3 dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 31, in the first round of cells 1 to 16, the number of pixels is reduced by 3 pixels, and when the reduction rate 6 is satisfied, the cell selection is completed. In this case, cells 1 to 10 in the first round are reduced by 3 pixels, and cell 11 is reduced by only 2 pixels. As a result, the reduction pattern 532 is generated.

In the reduction pattern 532, pixels 1, 2, and 3 in cell 1, pixels 4, 5, and 6 in cell 2, and pixels 7, 8, and 9 in cell 3, which are a combination of three adjacent pixels, Pixels 10, 11, and 12 in cell 4, pixels 13, 14, and 15 in cell 5, pixels 16, 17, and 18 in cell 6, pixels 19, 20, and 21 in cell 7, cell 8 Pixels 22, 23, and 24 in the cell 9, pixels 25, 26, and 27 in the cell 9, and pixels 28, 29, and 30 in the cell 10 are reduced pixels. In the cell 11, only the pixels 31 and 32 of the two pixels are the reduction pixels.

In the reduction pattern 532, 3 pixels are reduced for each of the 10 cells 1 to 10, 2 pixels are reduced for each cell 11, and the reduction pixel region is not formed in the cells 12 to 16. Therefore, the reduction pattern 532 shows a pattern different from the reduction pattern 132 (FIG. 13), and can be said to be a pattern that is difficult to see.

FIG. 32 is a diagram showing an example of a reduction pattern when 48 pixels are reduced by 3 dot growth according to the pixel number of FIG. 25. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 32, in the first round of cells 1 to 16, the number of pixels is reduced by 3 pixels, and in the second round, the number of pixels is reduced by one pixel. When the reduction rate 6 is satisfied, the cell selection is completed. In this case, in the first round, all cells are reduced by 3 pixels, and in the second round, only one pixel is reduced in all cells. As a result, the reduction pattern 548 is generated.

In the reduction pattern 548, pixels 1, 2, and 3 in cell 1, pixels 4, 5, and 6 in cell 2, and pixels 7, 8 and 9 in cell 3, which are a combination of three adjacent pixels, Pixels 10, 11, and 12 in cell 4, pixels 13, 14, and 15 in cell 5, pixels 16, 17, and 18 in cell 6, pixels 19, 20, and 21 in cell 7, cell 8 Pixels 22, 23, and 24 in, pixels 25, 26, and 27 in cell 9, pixels 28, 29, and 30 in cell 10, pixels 31, 32, and 33 in cell 11, and in cell 12. Pixels 34, 35, and 36, pixels 37, 38, and 39 in cell 13, pixels 40, 41, and 42 in cell 14, pixels 43, 44, and 45 in cell 15, and in cell 16. Pixels 46, 47, and 48 are reduced pixels.

The reduction pattern 548 shows the same pattern as the reduction pattern 148 (FIG. 14) as a result of reducing by 3 pixels for each of the 16 cells 1 to 16 although the reduction pixels in the first round are different.

Next, (C3) n-dot growth (n> 3) will be described. FIG. 33 is a diagram showing an example of a calculation result by n-dot growth. (C3) As an example of n-dot growth, n = 4 will be described. In FIG. 33, in n-dot growth (n = 4), four adjacent pixels are selected in the first round of cells 1 to 16, and one pixel is selected in each cell 1 to 16 in the second and subsequent rounds. The calculation result 609 in which the pixels are numbered sequentially is shown.

The solid line corresponds to the selection example of 4 pixels in the first round, and the broken line shows the selection example of 1 pixel in the second round.

FIG. 34 is a diagram showing an example of a reduction pattern when 16 pixels are reduced by n-dot growth according to the pixel number of FIG. 33. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 34, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 4 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. As a result, the reduction pattern 616 is generated.

In the reduction pattern 616, pixels 1 to 4 in cell 1, pixels 5 to 8 in cell 2, pixels 9 to 12 in cell 3, and pixels 13 to in cell 4, which are a combination of four adjacent pixels. 16 is a reduction pixel.

In the reduction pattern 616, 4 pixels are reduced for each of the four cells 1 to 4, and the reduction pixel area is not formed in the cells 5 to 16, so that the interval of the reduction pixel area is larger than that of the reduction pattern 116 (FIG. 12). It is widely taken and shows a pattern different from the reduction pattern 116. It can be said that the reduction pattern 616 is less visible than the reduction pattern 116.

FIG. 35 is a diagram showing an example of a reduction pattern when 32 pixels are reduced by n-dot growth according to the pixel number of FIG. 33. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 33, in the first round of cells 1 to 16, the number of pixels is reduced by 4 pixels, and when the reduction rate 6 is satisfied, the cell selection is completed. In this case, the cells in the first round cells 1 to 4 are reduced by 4 pixels, and as a result, the reduction pattern 632 is generated.

In the reduction pattern 632, pixels 1 to 4 in cell 1, pixels 5 to 8 in cell 2, pixels 9 to 12 in cell 3, pixels 13 to 16 in cell 4, which are a combination of four adjacent pixels, Pixels 17 to 20 in the cell 5, pixels 21 to 24 in the cell 6, pixels 25 to 28 in the cell 7, and pixels 29 to 32 in the cell 8 are the reduction pixels.

In the reduction pattern 632, 4 pixels are reduced for each of the 8 cells 1 to 8, and the reduction pixel area is not formed in the cells 9 to 16, so that the interval of the reduction pixel area is larger than that of the reduction pattern 132 (FIG. 13). It is widely taken and shows a pattern different from the reduction pattern 132. Therefore, it can be said that the reduction pattern 632 is less visible than the reduction pattern 132.

FIG. 36 is a diagram showing an example of a reduction pattern when 48 pixels are reduced by n-dot growth according to the pixel number of FIG. 33. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 36, in the first round of cells 1 to 16, the number of pixels is reduced by 4 pixels, and the cell selection is completed when the reduction rate 6 is satisfied. In this case, the cells in the first round cells 1 to 12 are reduced by 4 pixels, and as a result, the reduction pattern 648 is generated.

In the reduction pattern 648, pixels 33 to 48 are the reduction pixels in addition to the pixels 1 to 32 of the reduction pattern 632.

In the reduction pattern 648, 4 pixels are reduced for each of the 12 cells 1 to 12, and the reduction pixel area is not formed in the cells 13 to 16, so that the interval of the reduction pixel area is variable from the reduction pattern 132 (FIG. 13). And does not show a constant interval between all the reduced pixel areas. Therefore, it can be said that the reduction pattern 648 is less visible than the reduction pattern 132.

Next, (D) the composite type will be described. The composite type is a method of setting a pixel number by combining one of the above-mentioned (B) sequence rule variations and (C) one of the growth pixel number variations. Hereinafter, (B1) a combination of (B1) an ordered irregular method and (C1) 2-dot growth (D1) and (B1) a combination of an ordered irregular method and (C2) 3-dot growth (D2) will be described. Not limited to combinations. Needless to say, (B2) order rule random method may be combined instead of (B1) order rule irregular method.

First, the combination (D1) will be described. FIG. 37 is a diagram showing an example of a calculation result by a combination of an irregular ordering method and 2-dot growth. In FIG. 37, each time a cell is selected into cells 1 to 16, one is selected and applied while patrolling four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 as shown in FIG.

In 2-dot growth, two adjacent pixels were selected in the first round of cells 1 to 16, one pixel was selected in each cell 1 to 16 from the second round onward, and each pixel was numbered sequentially. The calculation result 709 is shown.

The solid line corresponds to the selection example of two pixels in the first round, and the broken line shows the selection example of one pixel in the second round.

FIG. 38 is a diagram showing an example of a reduction pattern in the case where 16 pixels are reduced by the composite type 2-dot growth according to the pixel number of FIG. 37. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 38, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 2 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. As a result, the reduction pattern 716 is generated.

In the reduction pattern 716, pixels 1 and 2 in cell 1, pixels 3 and 4 in cell 2, pixels 5 and 6 in cell 3, pixels 7 and 8 in cell 4, which are a combination of two adjacent pixels, Pixels 9 and 10 in cell 5, pixels 11 and 12 in cell 6, pixels 13 and 14 in cell 7, and pixels 15 and 16 in cell 8 are reduced pixels. Further, the reduced pixel region is not formed in the cells 9 to 16.

By combining with the irregular ordering method, the reduced pixels of pixels 1 and 2 in cell 1, pixels 5 and 6 in cell 3, pixels 9 and 10 in cell 5, and pixels 13 and 14 in cell 7 are reduced. In the region, each reduction pixel is formed in the horizontal direction. Of these, the reduced pixel areas of pixels 1 and 2 and pixels 9 and 10 are expanded (grown) to the right, and the reduced pixels of pixels 5 and 6 and pixels 13 and 14 are expanded to the left (growth). Growing.

Further, the reduction pixels are formed in the vertical direction by the pixels 3 and 4 in the cell 2, the pixels 7 and 8 in the cell 4, the pixels 11 and 12 in the cell 6, and the pixels 15 and 16 in the cell 8. To. Of these, the reduced pixel areas of pixels 3 and 4, and the reduced pixel areas of pixels 11 and 12 expand (grow) upward, and the reduced pixel areas of pixels 7 and 8 and pixels 15 and 16 expand (grow) downward. )doing.

Therefore, unlike the reduction pattern 116 (FIG. 12), the reduction pattern 716 has a variable interval between the reduction pixel regions and does not show a constant interval between all the reduction pixel regions. It can be said that the reduction pattern 716 is more difficult to see than the reduction pattern 116. That is, the interval of the reduced pixel region can be made variable by the composite type of (D1).

FIG. 39 is a diagram showing an example of a reduction pattern in the case where 32 pixels are reduced by the composite type 2-dot growth according to the pixel number of FIG. 37. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 39, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 2 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. In this case, all the cells from the first round cells 1 to 16 are reduced by 2 pixels, and as a result, the reduction pattern 732 is generated.

In the reduction pattern 732, the number of pixels is reduced by 2 pixels for each of the 16 cells 1 to 16. Combined with the ordering irregularity method, pixels 1 and 2 of cell 1, pixels 5 and 6 of cell 3, pixels 9 and 10 of cell 5, pixels 13 and 14 of cell 7, pixels 211 and 22 of cell 11, cell Each reduction pixel is formed laterally by the pixels 25 and 26 of 13 and the pixels 29 and 30 of cell 15. Of these, the reduced pixel areas of pixels 1 and 2, pixels 9 and 10, pixels 17 and 18, and pixels 25 and 26 are expanded (grown) to the right, and pixels 5 and 6 and pixels 13 and 14 are used. The reduced pixel areas of the pixels 21 and 22 and the pixels 29 and 30 are expanded (grown) to the left.

Further, pixels 3 and 4 in cell 2, pixels 7 and 8 in cell 4, pixels 11 and 12 in cell 6, pixels 15 and 16 in cell 8, pixels 19 and 20 in cell 10, and pixels in cell 12 Each reduction pixel is formed in the vertical direction by 23 and 24, the pixels 27 and 28 of the cell 14, and the pixels 31 and 32 of the cell 16. Of these, the reduced pixel regions of pixels 7 and 8, pixels 15 and 16, pixels 23 and 24, and pixels 31 and 32 expand (grow) downward, and pixels 3 and 4, pixels 11 and 12, and pixel 19 And 20, each of the reduced pixel regions of pixels 27 and 28 is expanding (growing) upward.

Therefore, the interval of the reduced pixel region can be made variable by the composite type of (D1).

FIG. 40 is a diagram showing an example of a reduction pattern in the case where 48 pixels are reduced by the composite type 2-dot growth according to the pixel number of FIG. 37. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 40, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 2 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. In this case, all the cells from cells 1 to 16 in the first round are reduced by two pixels, and in the second round, the number of pixels is reduced by one pixel. As a result, a reduction pattern 748 is generated.

In the reduction pattern 748, the pixels 33 to 48 are the reduction pixels in addition to the pixels 1 to 32 of the reduction pattern 732. Reduced pixel regions of the same shape are formed in cells 1-16, but are shown in four different directions. The directions of the reduced pixel areas of cells 1, 5, 9, and 13, the directions of the reduced pixel areas of cells 2, 6, 10, and 14, and the directions of the reduced pixel areas of cells 3, 7, 11, and 15. , Cells 4, 8, 12, and 16 are different from the direction of the reduced pixel area.

Similar to the reduction pattern 148 (FIG. 14), the reduction pattern 748 has the same shape of the reduction pixel region formed by the three pixels in each cell 1 to 16, but the orientation of the shape is different. Therefore, it can be said that the reduction pattern 748 is a pattern that is harder to see than the reduction pattern 148 (FIG. 14).

Next, the combination (D2) will be described. FIG. 41 is a diagram showing an example of a calculation result by an irregular ordering method and 3-dot growth. In FIG. 41, each time a cell is selected for cells 1 to 16, one is selected and applied while circulating four reference cells 6rb_1, 6rb_2, 6rb_3, and 6rb_4 as shown in FIG.

In the 3-dot growth, adjacent 3 pixels were selected in the first round of cells 1 to 16, one pixel was selected in each cell 1 to 16 in the second and subsequent rounds, and each pixel was numbered sequentially. The calculation result 809 is shown.

The solid line corresponds to the selection example of 3 pixels in the first round, and the broken line shows the selection example of 1 pixel in the second round.

FIG. 42 is a diagram showing an example of a reduction pattern in the case where 16 pixels are reduced by the composite type 2-dot growth according to the pixel number of FIG. 41. The case where the number of reduced pixels calculated based on the reduction rate 6 is 16 is illustrated. In FIG. 42, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 3 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. As a result, the reduction pattern 816 is generated.

In the reduction pattern 816, pixels 1, 2 and 3 in cell 1, pixels 4, 5 and 6 in cell 2, pixels 7, 8 and 9 in cell 3, and in cell 4, which are a combination of three adjacent pixels. The pixels 10, 11 and 12, the pixels 13, 14 and 15 in the cell 5 and the pixel 16 in the cell 6 are the reduction pixels. Only cell 6 has a reduction of 1 pixel.

Further, in the reduction pattern 816, since the reduction pixel region is not formed in the cells 7 to 16, the reduction pixel region is set wider than the reduction pattern 116. Further, in the reduction pattern 816, the shape of each reduction pixel region is the same, but the direction is any one of the four directions, and all the reduction pixel regions do not show the same direction. Therefore, unlike the reduction pattern 116, the reduction pattern 816 can be said to be a pattern that is difficult to see.

FIG. 43 is a diagram showing an example of a reduction pattern in the case where 32 pixels are reduced by the composite type 3-dot growth according to the pixel number of FIG. 41. The case where the number of reduced pixels calculated based on the reduction rate 6 is 32 is illustrated. In FIG. 43, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 3 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. In this case, all the cells from cells 1 to 16 in the first round are reduced by 3 pixels, and in the second round, the number of pixels is reduced by one pixel. As a result, the reduction pattern 832 is generated.

In the reduction pattern 832, pixels 1, 2 and 3 in cell 1, pixels 4, 5 and 6 in cell 2, pixels 7, 8 and 9 in cell 3, and in cell 4, which are a combination of three adjacent pixels. Pixels 10, 11 and 12, pixels 13, 14 and 15 in cell 5, pixels 16, 17 and 18 in cell 6, pixels 19, 20 and 21 in cell 7, pixels 22, 23 in cell 8 and 24, pixels 25, 26 and 27 in cell 9, pixels 28, 29 and 30 in cell 10, and pixels 31 and 32 in cell 11 are reduced pixels. Only cell 11 has a reduction of 2 pixels.

In the reduction pattern 832, since the reduction pixel region is not formed in the cells 12 to 16, the length between the reduction pixel regions changes. Further, in the reduction pattern 832, the shape of each reduction pixel region is the same, but the direction is any one of the four directions, and all the reduction pixel regions do not show the same direction. Therefore, unlike the reduction pattern 132, the reduction pattern 832 can be said to be a pattern that is difficult to see.

FIG. 44 is a diagram showing an example of a reduction pattern in the case where 48 pixels are reduced by the composite type 3-dot growth according to the pixel number of FIG. 41. The case where the number of reduced pixels calculated based on the reduction rate 6 is 48 is illustrated. In FIG. 44, each time a cell is selected from cells 1 to 16, the number of pixels is reduced by 3 pixels, and when the reduction rate 6 is satisfied, the cell selection and the reduction of pixels are completed. In this case, all the cells from cells 1 to 16 in the first round are reduced by 3 pixels, and in the second round, the number of pixels is reduced by one pixel. As a result, the reduction pattern 848 is generated.

In the reduction pattern 848, in addition to the pixels 1 to 32 of the reduction pattern 732, the pixels 33 to 48 are the reduction pixels. Reduced pixel regions of the same shape are formed in cells 1-16, but are shown in four different directions. The directions of the reduced pixel areas of cells 1, 5, 9, and 13, the directions of the reduced pixel areas of cells 2, 6, 10, and 14, and the directions of the reduced pixel areas of cells 3, 7, 11, and 15. , Cells 4, 8, 12, and 16 are different from the direction of the reduced pixel area.

Similar to the reduction pattern 748, the reduction pattern 848 has the same shape of the reduction pixel region formed by the three pixels in each cell 1 to 16 as in the reduction pattern 148 (FIG. 14), but has the same shape. The orientation is different. Therefore, it can be said that the reduction pattern 848 is a pattern that is harder to see than the reduction pattern 148 (FIG. 14).

The reduction patterns 216, 232, 248, 316, 432, 448, 516, 532, 548, 616, 632, 648, 716, 732, 748, 816, 832, and 848 described above are the reduction patterns 7 of this embodiment. It corresponds to (FIG. 5) and is generated by the reduction pattern generation processing unit 85.

The reduction target area 9a in which the cells 1 to 16 are arranged may be 16 × 16 pixels or more, and the cells may be spaced apart from each other. If the pixel reduction processing unit 84 reads the reduction data in cell units of a predetermined size from the reduction pattern 7 and performs the logical product operation described in FIG. 7 on the cell size area in the original binary image 2. Good. An example of cell arrangement in the reduction target area 9a is shown below as cells 1 to 4.

FIG. 45 is a diagram showing an example of cell arrangement based on the order rule irregular method. FIG. 45 (A) shows an example in which cells 1 to 4 are arranged at equal intervals in the original binary image 2 with a predetermined number of pixels of 2 pixels or more between the cells. FIG. 45B shows an example in which cells 1 to 4 are arranged in the original binary image 2 by varying the number of pixels between cells based on the ordering irregularity method of FIG.

In FIGS. 45 (A) or 45 (B), in each of the cells 1 to 4, the position of the number 1 as the starting point in the cell changes based on the order rule irregular method of FIG. In the order of cells 1 to 4, number 1 is shown at a position rotated 90 ° to the left about the center of the cell based on the irregular ordering method.

Further, in the determination of the pixel number, the cells are selected in the order of cell 1, cell 2, cell 3, and cell 4, and in the selected cell, cells are assigned to pixels according to the reduction order 6q (FIG. 15) starting from number 1. Numbers are set sequentially in all of 1 to 4.

By combining the reduction pattern generated by the reduction pattern generation processing unit 85 with the cell arrangement shown in FIG. 45 (A) or FIG. 45 (B), the reduction pixel areas can be separated to make the pattern more difficult to see. can do.

FIG. 46 is a diagram showing an example of cell arrangement based on the order rule random method. In FIG. 46 (A), based on the random ordering method of FIG. 20, cells 1 to 4 are arranged at equal intervals in the original binary image 2 with a predetermined number of pixels separated by 2 or more pixels. Shown. FIG. 46B shows an example in which cells 1 to 4 are arranged in the original binary image 2 by varying the number of pixels between cells based on the ordering random method of FIG.

In FIGS. 46 (A) and 46 (B), in each of the cells 1 to 4, the position of the number 1 as the starting point in the cell changes based on the order rule random method of FIG. In the order of cells 1 to 4, number 1 is shown at a position that is irregularly rotated about the center of the cell based on the random ordering method.

Further, in determining the pixel number, the cells are selected in the order of cell 1, cell 2, cell 3, and cell 4, and in the selected cell, cells are assigned to pixels according to the reduction order 6q (FIG. 20) starting from number 1. Serial numbers are set for all of 1 to 4.

By combining the reduction pattern generated by the reduction pattern generation processing unit 85 with the cell arrangements of FIGS. 46 (A) and 46 (B), the reduction pixel areas can be separated to make the pattern more difficult to see. can do.

In this embodiment, by changing the number of pixels between the reduced pixel regions, it is possible to make it difficult to visually recognize the periodicity of the reduced pixel regions. Further, by changing the directionality of the shape of the reduced pixel region, it is possible to make it difficult to visually recognize the existence of the reduced pixel region.

The present invention is not limited to the specifically disclosed examples, and major modifications and modifications can be made without departing from the scope of claims.

The following additional notes will be further disclosed with respect to the embodiments including the above embodiments.
(Appendix 1)
For a plurality of cells defined in a target area in which a plurality of pixels to be printed are continuous, a reduction order for reducing the number of pixels to be printed outward by rotating from the center in the order of cell numbers of the plurality of cells is shown. Place the reference cell while rotating it at a predetermined angle.
One cell is selected from the plurality of cells in the order of the cell numbers, and serial numbers in the plurality of cells are set in a predetermined number of pixels according to the reduction order in the selected cells.
The number of pixels corresponding to the reduction rate for reducing the number of pixels to be printed in the target area is calculated.
Until the number of pixels is reached, the value of each pixel is changed to a value that is not printed in the order of the serial numbers.
An image data generation method in which a computer performs a process of outputting a pattern of the non-printing pixels for the target area.
(Appendix 2)
The computer
The image data generation method according to Appendix 1, wherein when the predetermined angle is zero degrees, the reference cell is arranged at the position of the cell in the target area without rotating the reference cell.
(Appendix 3)
The computer
The image data generation method according to Appendix 1, wherein when the predetermined angle is 90 degrees, the reference cell is rotated and arranged in the order of the cell numbers by 90 degrees.
(Appendix 4)
The computer
The image data generation method according to Appendix 1, wherein when the predetermined angle is 90 degrees, the reference cells are arranged in the order of the cell numbers at an angle that is irregularly rotated a plurality of times in units of 90 degrees.
(Appendix 5)
The computer
The image data generation method according to any one of Supplementary note 1 to 4, wherein the serial numbers are sequentially set for two or more consecutive plurality of pixels in the selected cell in accordance with the reduction order.
(Appendix 6)
The computer
The image data generation method according to any one of Supplementary note 1 to 5, wherein a process of arranging the plurality of cells at equal intervals or irregularly changed intervals is performed in the target area.
(Appendix 7)
For a plurality of cells defined in a target area in which a plurality of pixels to be printed are continuous, a reduction order for reducing the number of pixels to be printed outward by rotating from the center in the order of cell numbers of the plurality of cells is shown. Place the reference cell while rotating it at a predetermined angle.
One cell is selected from the plurality of cells in the order of the cell numbers, and serial numbers in the plurality of cells are set in a predetermined number of pixels according to the reduction order in the selected cells.
The number of pixels corresponding to the reduction rate for reducing the number of pixels to be printed in the target area is calculated.
Until the number of pixels is reached, the value of each pixel is changed to a value that is not printed in the order of the serial numbers.
An image data generation program that causes a computer to perform a process of outputting a pattern of the non-printing pixels for the target area.
(Appendix 8)
For a plurality of cells defined in a target area in which a plurality of pixels to be printed are continuous, a reduction order for reducing the number of pixels to be printed outward by rotating from the center in the order of cell numbers of the plurality of cells is shown. An arrangement part that arranges the reference cell while rotating it at a predetermined angle,
A number setting unit that selects one cell from the plurality of cells in the order of the cell numbers and sets serial numbers in the plurality of cells in a predetermined number of pixels according to the reduction order in the selected cells.
A calculation unit that calculates the number of pixels corresponding to the reduction rate for reducing the number of pixels to be printed in the target area.
A change unit that changes the value of each pixel to a value that is not printed in the order of the serial numbers until the number of pixels is reached.
An image data generation device including an output unit that outputs a pattern of the non-printing pixels with respect to the target area.

1 Original data 2 Original binary image 3 Binary image after pixel reduction 4 Printed matter 11 CPU
12 Main storage device 13 Auxiliary storage device 14 Input device 15 Display device 17 Communication I / F
18 Drive device 19 Storage medium 70 Deployment processing device 80 Image data generation device 83 Image data generation processing unit 84 Pixel reduction processing unit 85 Reduction pattern generation processing unit 90 Print output device 130 Storage unit 1000 Printing system B bus

Claims (3)

From a certain area including a plurality of pixels stored in association with identification information including number information, the identification information of the pixels is associated with information indicating that the pixels are not printed, based on the order of the numbers. Remember
When the number of pixels stored by associating the identification information with the information indicating that the pixels are not printed reaches a predetermined number, the information indicating that the pixels are not printed included in the certain area is associated with the identification information. The identification information of the pixel that is not stored is associated with the information indicating that the pixel is to be printed and stored.
A method of generating mask data, characterized in that the processing is performed by a computer. From a certain area including a plurality of pixels stored in association with identification information including number information, the identification information of the pixels is associated with information indicating that the pixels are not printed, based on the order of the numbers. Remember
When the number of pixels stored by associating the identification information with the information indicating that the pixels are not printed reaches a predetermined number, the information indicating that the pixels are not printed included in the certain area is associated with the identification information. The identification information of the pixel that is not stored is associated with the information indicating that the pixel is to be printed and stored.
A mask data generation program characterized by having a computer perform processing. From a certain area including a plurality of pixels stored in association with identification information including number information, the identification information of the pixels is associated with information indicating that the pixels are not printed, based on the order of the numbers. The first mapping unit stored in the storage unit and
When the number of pixels stored by associating the identification information with the information indicating that the pixels are not printed reaches a predetermined number, the information indicating that the pixels are not printed included in the certain area is associated with the identification information. A second mapping unit that stores the identification information of the pixels that are not stored in the storage unit by associating the information indicating that the pixels are to be printed with the identification information of the pixels.
A mask data generation device characterized by having.