JPH1016375A - Method for forming hairline pattern and apparatus therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily form a hairline pattern high in the degree of freedom. SOLUTION: A hairline pattern formed by arranging a large number of hairlines H extending almost along a predetermined direction on a plane is formed by image processing due to a computer. A plurality of lines each having predetermined line width G are defined and arranged longitudinally at a predetermined line interval K so as to be adjacent to each other. A plurality of the hairlines H corresponding to the line width are generated at every lines and arranged laterally at a predetermined line interval S so as to be adjacent to each other to be allotted. Each of the hairlines H has the width corresponding to W pixels obtained by random numbers and an elongated rectangular figure having the length corresponding to L pixels obtained by random numbers is defined and a unidimensional fluctuation field having predetermined amplitude is utilized to displace respective pixels constituting the rectangular figure in a lateral direction to form a hairline pattern.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a technique for generating a hairline pattern, and more particularly to a technique for expressing a soft wood grain pattern surface or a metal surface such as aluminum in decorative paper or transfer film for building materials. The present invention relates to a technique for generating a hairline pattern.

[0002]

2. Description of the Related Art In building materials such as decorative paper and transfer film,
A technique of printing or embossing a hairline pattern (linear figure pattern) to express a texture unique to the material has been adopted. A hairline pattern is a pattern consisting of a set of many thin lines (called hairlines or lines) extending along a specific direction, and is usually applied to the surface of a soft wood grain pattern or a metal surface such as aluminum. It is used to express a unique texture. Depending on the building material used, the hairline pattern may be printed on the surface, or the hairline pattern may be embossed as an uneven pattern on the surface layer.

Conventionally, such a hairline pattern has been obtained by extracting the hairline pattern from the surface of natural wood. That is, it is a general method to take a photograph of a natural wood surface in a special lighting environment so that the hairline pattern appears most prominently, and capture this as digital image data. . Normally, a retouch process using a computer is performed on a pattern captured as digital image data, and a finely adjusted pattern is used as a print document.

[0004]

As described above, in order to prepare a print manuscript of a hairline pattern, conventionally,
Since the original pattern was extracted from the surface of the natural wood, it was difficult to prepare a hairline pattern as expected, and there was a problem that the degree of freedom in designing the pattern was limited. In other words, from the point of view of a designer who creates a building material pattern, he wants to obtain a hairline pattern that meets the desired conditions such as the thickness, length, and density of the hairline. In order to do that, you have to find a natural wood surface that suits your taste.
It is impossible to get the hairline pattern you like. For this reason, the hairline pattern extracted from the actually existing natural tree has to be compromised, and the design is greatly restricted.

[0005] Actually, a pattern extracted from the surface of natural wood is not suitable for use as a printed original as it is, and correction on a film or retouching using a computer is indispensable. The operation of this retouching process requires skill and requires a great deal of cost and time. In this retouching process, it is possible to make fine adjustments to the original pattern, but it is very difficult to significantly change or correct the pattern.

Accordingly, an object of the present invention is to provide a hairline pattern generation method that can easily generate a hairline pattern having a high degree of freedom.

[0007]

[Means for Solving the Problems]

(1) A first aspect of the present invention is a method for generating a hairline pattern in which a large number of hairlines extending substantially along a predetermined direction are arranged on a plane, and setting a parameter required for pattern generation, Defining a plurality of rows each having a predetermined row width G, and arranging the plurality of rows vertically adjacent to each other with a predetermined row interval K to define an allocation area; A step of generating a plurality of hairlines corresponding to the line width G, arranging and arranging the plurality of hairlines adjacently in the horizontal direction at a predetermined line interval S, and an image showing a number of hairlines allocated in the allocation area And outputting the data.

(2) A second aspect of the present invention is the above-mentioned first aspect.
In the method of generating a hairline pattern according to the aspect,
A predetermined line width W and a line length L are defined, an elongated rectangular figure having a width of W pixels and a length of L pixels is defined, and a one-dimensional fluctuation field having an amplitude smaller than the line width G is defined. Each hairline is generated by displacing each pixel constituting the rectangular figure in the width direction by utilizing the method.

(3) The third aspect of the present invention is the above-mentioned second aspect.
In the method of generating a hairline pattern according to the aspect,
J-th harmonic having amplitude A _j and phase ω _j (where 1
As a sum of ≦ j ≦ n, k _j is a predetermined coefficient), a function d = f () representing a one-dimensional fluctuation field by an expression of d = Σ _{j = 1, n} A _j sin k _j · (θ−ω _j ) θ), and the position in the length direction of the rectangular figure is made to correspond to the variable value θ,
Based on a function value d given by a function d = f (θ), each pixel at a position corresponding to the variable value θ is displaced in the width direction.

(4) The fourth aspect of the present invention is the above-mentioned second aspect.
In the method of generating a hairline pattern according to the aspect,
Prepare a one-dimensional fractal field that defines a scalar value d on the coordinate axis θ in a self-similar manner, associate the position in the length direction of the rectangular figure with the coordinate value θ, and convert it to the scalar value d defined in the one-dimensional fractal field. Based on this, each pixel at a position corresponding to the coordinate value θ is displaced in the width direction.

(5) A fifth aspect of the present invention is the above-mentioned first aspect.
In the hairline pattern generation method according to the fourth to fourth aspects, the distribution range of the line width W, the distribution range of the line length L,
The distribution range of the line interval S is set as a parameter, and the line width W within the set distribution range is determined for each row by using a random number, and the same line width is applied to hairlines belonging to the same row. The line length L and the line interval S for each hairline are determined using random numbers, respectively, to determine predetermined values within a set distribution range.

(6) A sixth aspect of the present invention is directed to an apparatus for generating a hairline pattern in which a number of hairlines extending substantially along a predetermined direction are arranged on a plane; Rectangular figure defining means for defining values W and L (where W << L) using random numbers, defining an elongated rectangular figure having a width of W pixels and a length of L pixels; Using a random number, a fluctuation field generating means for generating a one-dimensional fluctuation field having a predetermined amplitude,
Based on the one-dimensional fluctuation field, a hairline generating means for generating a hairline by displacing each pixel constituting the rectangular figure in the width direction, and an allocating means for allocating the generated hairline on a plane using random numbers, Is provided.

[0013]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below based on an embodiment shown in the drawings. FIG. 1 is a flowchart showing a basic procedure of a hairline pattern generation method according to the present invention. All the procedures shown here are performed as data processing using a computer.

First, in step S1, parameters required for pattern generation are set. The operator sets the conditions of the hairline pattern to be generated in this step S
1 will be set. In the following step S2, an allocation area is defined. This allocation area is a closed area on a plane on which a large number of hairlines extending substantially along a predetermined direction are arranged. As will be described in detail later, the closed region is configured by arranging a plurality of rows, and individual hairlines are allocated in each row. Step S3
Is a process of generating a graphic constituting each hairline and allocating the graphic to each line defined in step S2. In the last step S4, a pattern composed of a large number of hairlines thus allocated is output as image data. The processing that the operator actually performs on the computer is only the parameter setting processing in step S1, and the processing in steps S2 to S4 is automatically performed in the computer based on the set parameters. Become.

FIG. 2 shows an example of parameters to be set in step S1. In this example, first, the image size of the hairline pattern to be generated is set. For example, as shown in FIG. 3, consider a case where a hairline pattern is generated by allocating a large number of hairlines H in a rectangular area having a size represented by an image width width and a height represented by an image height height. . In this case, as parameters indicating the image size, the image width width and the image height he
ight is set. Here, the values width and hei
We will use the number of pixels as the unit for ght (for example,
When generating a hairline pattern composed of 480 horizontal pixels × 360 vertical pixels, the image width = 480 and the image height he
ight = 360), and the position of each pixel is represented by a coordinate value (x, y) in an XY coordinate system with the origin at the upper left corner. Therefore, in the example shown in FIG. 3, the position P of the pixel at the upper left corner is represented by coordinates of P (1, 1), and the position Q of the pixel at the lower right corner is represented by coordinates of Q (width, height). You.

FIG. 4 is a partially enlarged view of FIG. 3, and shows in detail the form of each hairline H constituting the hairline pattern. One hairline H extends substantially along the horizontal direction of the figure (the X-axis direction in the XY coordinate system defined in FIG. 3), and is constituted by a linear figure having fluctuations in the vertical direction (the Y-axis direction) of the figure. Have been. One hairline H
Has a predetermined line length L (length in the X-axis direction) and a predetermined line width W (width in the Y-axis direction). In this embodiment, the line width W is the same in each part of the same hairline. Is set to However, the line width W and the line length L take different values for each individual hairline H, and as a whole hairline pattern, a thick hairline, a thin hairline, a long hairline, and a short hairline are arranged in a random manner. . In the present invention, "rows" are defined as indicated by broken lines in FIG. One row has a predetermined row width G (width in the Y-axis direction) and forms an elongated rectangular area extending in the horizontal direction (X-axis direction) in the figure by the image width width. Such rows are arranged adjacent to each other at a predetermined row interval K in the vertical direction (Y-axis direction) in the figure.

The hairline H is allocated in each line defined in this way. Each hairline H has fluctuations in the vertical direction of the figure, but is allocated so as to always fall within the range of the row width G, and a large number of hairlines H are arranged in one row in the horizontal direction of the figure. It is arranged in. At this time, a predetermined line interval S is secured between the hairlines H arranged adjacently in the same row. Since the line interval S also takes a different value for each hairline H, some hairlines are arranged adjacently at a wide interval.
Some hairlines are located adjacent to each other at small intervals.

In the parameters shown in FIG. 2, the parameters indicating the distribution range of the line width W and the distribution range of the line length L are the maximum value Wmax and the minimum value Wmin of the line width W of the hairline H and the maximum value Lmax of the line length L. And the minimum value L
Defined by min. The parameter indicating the distribution range of the line interval S is defined by the maximum value Smax and the minimum value Smin of the line interval S. As shown in FIG. 4, the line interval K is a parameter indicating an interval between rows in arranging each row. In this example, since the row spacing K is a constant, all rows are arranged while maintaining the same row spacing K. However, the distribution range is defined using the maximum value Kmax and the minimum value Kmin of the row spacing K. However, the value may be changed for each line interval.

The fluctuation amplitude A and the fluctuation period C in the parameters shown in FIG. 2 are parameters for determining the fluctuation of the hairline H in the vertical direction (width direction). In the present embodiment, by adding a vertical fluctuation based on a one-dimensional fluctuation field to a horizontally elongated rectangular figure,
One hairline H is generated. The fluctuation amplitude A and the fluctuation period C are parameters indicating the maximum amplitude and the period of the one-dimensional fluctuation field.

A method of generating a hairline H based on such a method will be described with reference to the conceptual diagrams of FIGS. First, as shown in FIG. 5, a rectangular figure F elongated in the horizontal direction having a predetermined line width W and a predetermined line length L is prepared. Subsequently, a one-dimensional fluctuation field as shown in FIG. 6 is prepared. Here, for convenience of explanation, an example in which a very general sine wave function is used as a one-dimensional fluctuation field will be described. That is, d
= (A / 2) sin θ, and a predetermined fluctuation component d (where A /
2 ≧ d ≧ −A / 2). Then, if the θ axis is made to correspond linearly to the horizontal direction of the rectangular figure F and each point constituting the rectangular figure F is displaced in the vertical direction based on the associated fluctuation component d, a hairline as shown in FIG. H can be obtained.

The fluctuation amplitude A set as a parameter
Represents the amplitude of the one-dimensional fluctuation field shown in FIG. 6, and the fluctuation period C represents the period of the one-dimensional fluctuation field. As can be seen from FIG. 7, one hairline H thus generated becomes a distorted linear figure having a line width W and a line length L, and the vertical width of the entire figure (the point located at the uppermost point). Is the sum of the line width W and the fluctuation amplitude A (W +
A). Therefore, if the row width G is set to G = W + A, as shown in FIG.
Can be exactly assigned in each line. In this example, since the fluctuation amplitude A and the fluctuation period C are constants, all the hairlines have the same fluctuation amplitude and fluctuation period, but the maximum value Amax and the minimum value Amin of the fluctuation amplitude A are To define the distribution range of the amplitude using the maximum value Cmax and the minimum value Cmin of the fluctuation period C so that each hairline has a fluctuation component having a different amplitude and period. It doesn't matter.

The process of step S2 in the flowchart of FIG. 1 is a process of defining a region for allocating a hairline based on the above-described basic policy. First, a different line width W is defined for each row. At this time,
For example, using a random number, the line width W is distributed in the range from the maximum value Wmax to the minimum value Wmin. Then, a value G = W + obtained by adding the fluctuation amplitude A (in this embodiment, the same value for all rows) to the line width W defined for each row.
A is defined as the row width of each row, and as shown in FIG. 4, a plurality of rows having such a row width G are separated by a row interval K (in this embodiment, the same value for all rows). If they are arranged vertically adjacent to each other, the process of defining the allocation area is completed. In other words, the process of step S2 can be said to be a process of defining the position of each row indicated by a broken line in FIG.

The process of step S3 is a process of actually allocating the generated hairline H to each line thus defined. First, a rectangular figure F as shown in FIG.
Generate. The line width W, which is the vertical width of the rectangular graphic F, has already been defined for each row in step S2. Therefore, here, the line length L is set to a maximum value Lmax to a minimum value Lmax using, for example, a random number.
It is determined to be distributed in the range of min, and a rectangular figure F having a width W and a length L is generated. Subsequently, a one-dimensional fluctuation field having a fluctuation amplitude A and a fluctuation period C as shown in FIG. 6 is prepared, and a rectangular figure F is formed by using the one-dimensional fluctuation field.
Are displaced in the vertical direction, one hairline H as shown in FIG. 7 can be generated. The hairline H has a size suitable for the row width G of the row to be allocated. The hairline H thus generated is allocated to each line. For example, a plurality of hairlines H may be sequentially allocated from left to right.
At this time, a predetermined line interval S is ensured between the hairlines adjacent on the left and right. The line interval S is determined using a random number, for example, so that the line interval S is equal to the maximum value S.
It is determined so as to be distributed in the range from max to the minimum value Smin.

When the hairlines H have been allocated to all the rows in this way, in step S4, the image data indicating the large number of hairlines allocated in the allocation area is obtained.
What is necessary is just to output as a hairline pattern. Based on the image data obtained in this way, a printing original plate for printing a hairline pattern or an emboss plate for embossing is created.

According to the method described above, the operator can freely set the thickness, length, degree of fluctuation, density, etc. of each hairline at the parameter setting stage in step S1, and change the parameters if necessary. While
It is possible to repeat trial and error until a desired hairline pattern is obtained. For this reason, a pattern having a very high degree of freedom can be easily obtained. In particular, it is possible to create a pattern composed of extremely thin hairlines, which cannot be obtained from the surface of natural wood, or a unique pattern with a rich design.

FIG. 8 is a block diagram showing a basic configuration of an apparatus for generating a hairline pattern by the above-described method. This device is composed of random number generating means 10, rectangular figure defining means 20, fluctuation field generating means 30, hairline generating means 40, and allocating means 50.
Practically, each of these means is realized by computer hardware and software, but here, for convenience, description will be made by dividing into individual functional blocks.

The random number generating means 10 is a means for generating a random number used in each of the other means.
It has a function of generating a uniform random number or a normal random number having a value between 1. The rectangular figure defining means 20 determines the values W and L (W << L) using the random numbers,
An elongated rectangular figure F having a width of pixels and a length of L pixels is defined. As shown in FIG.
If Wmax to Wmin are defined as parameters indicating the distribution range of L, and Lmax to Lmin are defined as parameters indicating the distribution range of the line length L, the values W and L fall within this range using random numbers. Is determined to be The fluctuation field generating means 30 has a function of generating a one-dimensional fluctuation field having a predetermined amplitude using a random number. As a method of generating a one-dimensional fluctuation field using such random numbers, for example, a method of generating a one-dimensional fractal field by a midpoint displacement method as described later is known. The hairline generation means 40 has a function of generating a hairline H by displacing each pixel constituting the rectangular figure F in the width direction based on the one-dimensional fluctuation field. The large number of hairlines H thus generated are allocated by the allocation means 50 in the allocation area on the plane. Line spacing S used to determine the position of each hairline H
Is determined using random numbers. When the allocation processing is completed, the hairline pattern is output as image data from the allocation means 50.

[0028]

Next, a more specific processing procedure of the hairline pattern generation method according to the present invention will be described.

§1. Definition procedure diagram of the allocation region 9 is a flowchart showing a specific procedure of definition processing allocation area in step S2 shown in FIG. here,
A specific processing procedure for defining an allocated area having an image width and an image height as shown in FIG. 3 when the parameters are set as shown in FIG. 2 will be described.
First, in step S21, a row number parameter i is set to an initial value 1. The number-of-lines parameter i is a parameter indicating what line the current processing target is. For example, when i = 1, it means that the process for securing the area for the first row shown in FIG. 4 has been performed. In the following step S22, the coordinate value y indicating the coordinate in the vertical direction is set to the initial value 1. The unit of the coordinate value is one pixel. As shown in FIG. 3, the coordinate value y = 1 indicates the uppermost pixel, and the coordinate value y = height indicates the lowermost pixel. Become. Here, regarding the allocation area shown in FIG.
The process proceeds from top to bottom along the Y axis. The coordinate value y given the initial value in step S22 is used as a parameter indicating the Y coordinate position currently being processed.
In this flowchart, the process of setting the value a to the variable A is described as “A: =
a ".

In step S23, the line width W of the i-th row
(I) is W (i) = Wmin + RND * (Wmax-Wmi
n). Here, RND is 0
<RND <1 is an arbitrary random number. Therefore, the line width W (i) of the i-th row is an arbitrary value within the range of Wmin to Wmax. Subsequently, in step S24, y: =
By the calculation of y + W (i) + A, the parameter y is changed to “W
(I) + A ”, and in step S25, the parameter y is set to“ K ”by an operation of y: = y + K.
Only increase. As shown in FIG. 4, this process is a parameter updating process for indicating that the process for a section corresponding to the row width G (G = W + A) and the row interval K of one row has been completed. In the following step S26, y <height
It is determined whether or not the condition is satisfied. This determination is for determining whether or not the processing has reached the lower side of the allocation area shown in FIG.
, The number-of-rows parameter i is updated by 1, and the processing from step S23 is repeated.

As described above, steps S23 through S
By making a round of the processing up to 27, an area for one row (row width G + row interval K) is secured. Thus, when a negative determination is made in step S26, that is, when y ≧ height, many rows have been defined over the entire allocation area shown in FIG. Since the line width W (i) of the i-th row is defined using random numbers, the value differs for each row, and the row width G (i) of the i-th row is G ( i) = W
(I) It is determined by + A. After all, the individual line widths are random for each line. Therefore, in step S26, y = height may be satisfied, or y> height may be satisfied. In the case of the former, a plurality of lines that fit perfectly within the section of the image height height are defined, and in the case of the latter, the area (line width G + line spacing K) for the last line is This means that the definition is made slightly outside the section of the image height height. In the present embodiment, when such protrusion occurs, the entire procedure is performed again. That is, in step S28, y =
The processing from step S21 is repeatedly executed until the height becomes height. In other words, the same processing is repeatedly executed until a plurality of lines that fits perfectly within the section of the image height are defined. Although such trial and error is inefficient as an algorithm, there is no problem in practical use because the actual operation time using a computer is very short.

When a plurality of lines that finally fit within the section of the image height are finally defined, the value of the line number parameter i at that time is stored as the total line number N in step S29. Keep it. This total number of rows N
Will be used in the hairline allocation process later. Further, the line widths W (1), W (2),..., W for each row determined in step S23.
The value of (N) also needs to be stored for use in later hairline allocation processing.

§2. Hairline Assignment Procedure FIG. 10 is a flowchart showing a specific procedure of the hairline assignment processing in step S3 shown in FIG. Here, the following description will be made assuming that the allocation area defining process has already been completed by the procedure shown in FIG.

First, in step S31, a row number parameter i, a horizontal coordinate value parameter x, and a vertical coordinate value parameter y are each set to an initial value 1. Here, the number-of-lines parameter i is a parameter indicating the line that is the target of the hairline allocation process, and the coordinate value parameters x and y are located at the upper left corner of the circumscribed rectangle of one generated hairline. This is a parameter indicating the position coordinates (x, y) to perform.

In the following step S32, the line length L of one hairline H is L = Lmin + RND *
(Lmax-Lmin). Here, RND is an arbitrary random number of 0 <RND <1. Therefore, the line length L determined here is from Lmin to L
Any value within the range of max. Subsequently, step S3
At 3, one hairline is created. A specific generation method is as shown in FIGS. That is, the line length L determined in step S32 and the line width W of the i-th row already determined by the procedure shown in FIG.
(I), a rectangular figure F having a length L and a width W (i)
Is defined, and a one-dimensional fluctuation field is used to apply a fluctuation component to the rectangular figure F to generate one hairline. In the next step S34, a process of arranging one hairline thus generated in the i-th row is performed. Specifically, the upper left corner point Z of the circumscribed rectangle of the hairline H shown in FIG.
The arrangement may be performed so as to be at the coordinate position (x, y) indicated by y.

When the arrangement of one hairline is completed, an updating process for increasing the value of the coordinate value parameter x by the line length L is performed in the subsequent step S35. Next, in step S36, the line interval S is set as S =
It is determined by the formula Smin + RND * (Smax-Smin). Here, RND is an arbitrary random number of 0 <RND <1. Therefore, the line interval S determined here is an arbitrary value within the range of Smin to Smax. Subsequently, in step S37, an updating process for increasing the value of the coordinate value parameter x by the line interval S is performed. After all, the parameter x in steps S35 and S37
Will increase the value of x by the sum of the length L of one already arranged hairline and the predetermined line interval S, and the arrangement position of the next hairline to be allocated adjacently (x , Y) are determined.

In step S38, the parameter x> widt
h is determined. This is the horizontal coordinate value parameter x
Is a process for determining whether or not the image width of the layout area has been exceeded.
The processing from step 2 is repeatedly executed. That is, a plurality of hairlines are arranged one after another in the i-th row.

In step S38, parameter x>
If it is determined to be width, in step S39, an updating process for increasing the vertical coordinate value parameter y by W (i) + A + K is performed, and an updating process for increasing the row number parameter i by 1 is performed. That is, since the hairline arrangement processing has been completed for the i-th row, preparation has been made for executing the hairline arrangement processing for the next (i + 1) -th row. And step S
The process proceeds to step S41 via 40, the coordinate value parameter x in the horizontal direction is returned to the initial value 1, and the processing from step S32 is repeatedly executed.

Thus, the first line, the second line,...
When the processing up to the line is completed, it is determined in step S40 that i> N, and the entire procedure shown in FIG. 10 is completed. At this point, a plurality of hairlines are assigned to all of the N rows. Note that when the above procedure is performed, the image width
Part of the hairline placed beyond the width range,
Although the data protrudes from the right side of the allocated area, when the image data is output, the data of the protruding portion may be ignored.

§3. Deformation Procedure Using One-Dimensional Fluctuation Field FIGS. 5 to 7 show a general concept of obtaining a hairline H by deforming a rectangular figure F using a one-dimensional fluctuation field. The specific procedure of is described. Now, a one-dimensional fluctuation field d = f as shown in FIG.
It is assumed that (θ) has been given. Here, the value of d is
Let it be assumed that it has been normalized to the range 0 ≦ d ≦ 1.
On the other hand, a rectangular figure F as image data is represented by a set of pixels. Here, a rectangular figure F having a line width W of six pixels as shown in FIG.
Let us consider a case where deformation is performed using the one-dimensional fluctuation field shown in FIG. In this case, first, the position in the length direction (horizontal direction in the figure) of the rectangular figure F is linearly corresponded to the axis θ of the one-dimensional fluctuation field. Then, a series of pixel groups arranged in the width direction of the rectangular figure F are displaced in the width direction according to the value of d. That is, for the pixel group located at the horizontal position θ, I
What is necessary is just to displace downward by NT (A · f (θ)) in the figure. Here, “INT” is a function that gives an integer part,
This is for making the displacement amount of each pixel a pixel unit (integer). The coefficient A is a fluctuation amplitude.

Here, in the rectangular figure F shown in FIG. 12, a specific method of displacing the pixel group located at the horizontal position θm1 and the pixel group located at the horizontal position θm2 will be described as an example. For example, INT (A · f
If (θm1)) = 5 and INT (A · f (θm2)) = 2, as shown in FIG. 13, the pixel group located at the position θm1 is displaced by 5 pixels downward in the figure, The pixel group located at the position θm2 is displaced downward by two pixels.

If such displacement processing is performed for all pixels, one hairline is obtained. The upper left corner point Z of the original rectangular figure F is the upper left corner of the circumscribed rectangle of the obtained hairline. Points. The maximum value of the displacement amount of the pixel is the fluctuation amplitude A, and the width (length in the vertical direction) of the circumscribed rectangle of the obtained hairline is equal to the row width G = W + A. Therefore, the hairline obtained by such a deformation process is suitable for being arranged on a row having the row width G.

§4. One-dimensional fluctuation using sinusoidal function
Field Generation Method As described above, a sine wave function can be used as a one-dimensional fluctuation field. However, FIG.
When a simple sine wave function as shown in FIG. 7 is used as a one-dimensional fluctuation field, the obtained hairline H has a geometric shape as shown in FIG. 7, and is somewhat improper as a hairline having a fluctuation component in the natural world. Become natural.

In order to generate a hairline having a more natural fluctuation, it is preferable to use a more natural one-dimensional fluctuation field. As one of the techniques for artificially generating such a fluctuation field, there is a method of superimposing a sine wave function having various frequency components. For example, amplitude Aj, phase ω
As a sum of the _j- th harmonic (where 1 ≦ j ≦ n) having _j , the one-dimensional fluctuation field is _{expressed by the following} formula _: d = Σ _{j = 1, n} A _j sink k _j · (θ−ω _j ) By defining the function d = f (θ), it is possible to generate a hairline that gives a very natural fluctuation. Here, the coefficient k _j is a parameter that determines the frequency of each harmonic, for example,
k _j = j may be set. Further, the amplitude A _j and the phase ω _j are determined to be arbitrary values using random numbers, and a function d = f (θ) is defined as a sum of a plurality of sine wave functions having different frequencies, amplitudes, and phases. Preferably, it is possible to define.

§5. One-dimensional fluctuation using fractal
Field Generation Method As a natural one-dimensional fluctuation field, a one-dimensional fractal field in which a scalar value d is defined in a self-similar manner on the coordinate axis θ can be used. Here, a method of generating a one-dimensional fractal field called a midpoint displacement method will be described as an example.

Now, as shown in FIG. 14, two grid points A and B (indicated by double circles in the figure) are defined on a single line at a predetermined distance, and these grid points A and B are defined. B defines scalar values a and b, respectively. 2 defined in this way
The two grid points A and B are initial grid points, and the scalar values a and b are so-called initial conditions set for the two grid points A and B.

Subsequently, as shown in FIG. 15, a first-stage grid point C is defined at the middle point between the two grid points A and B. At this time, a scalar value c is also defined for the grid point C, and the scalar value c is a scalar value a,
It is defined by a predetermined operation based on b. FIG. 15 shows a state where the scalar value c of the grid point C has not been determined yet. Note that, here, a grid point in a state where a scalar value is undefined is indicated by a single circle, and a grid point in a state where a scalar value is defined is indicated by a double circle. The scalar value c is calculated by the following arithmetic expression c = (a + b) / 2 + T · RND (1). Here, a and b are grid points A
And B are scalar values defined, T is the maximum half-amplitude value of fluctuation, and RND is an arbitrary random number satisfying -1 ≦ RND ≦ + 1. As described above, a random number is used for the definition of the scalar value c, which depends on an accidental element. However, the scalar value c is not defined as a completely slammed value.
Are limited by the scalar values a and b and the maximum half-amplitude value T. That is, as shown in the above equation (1), the average value of the scalar values a and b is −T to
A value obtained by adding an arbitrary value (determined by a random number) within the range of + T is the value of the scalar value c. Therefore, the maximum half-amplitude value T is a parameter that limits the degree of fluctuation that deviates from the average value.

After the scalar value c for the grid point C at the first stage has been defined in this manner, subsequently, as shown in FIG. 16, the midpoint of the grid points A and C and the midpoint of the grid points C and B are set. , Respectively, define grid points D and E in the second stage. Then, for these lattice points D and E, scalar values d and e are respectively expressed as d = (a + c) / 2 + (1/2) .T.RND (2) e = (c + b) / 2 + (1 / 2) · T · RND (3) Calculated by the formula: Here, as described above, T
Is the maximum half amplitude value of fluctuation, RND is -1 ≦ RND ≦ +
An arbitrary random number of 1. Equations (2) and (3) are very similar to equation (1), but it should be noted that the maximum half-amplitude value T is multiplied by a factor of (1/2).

Subsequently, a grid point of the third stage is defined at each of the five grid points A, D, C, E, and B defined at the second stage, and a scalar is also assigned to these grid points. Calculate and define values. For example, a scalar value f for a grid point F (not shown) defined as a midpoint between grid points A and D is given by: f = (a + d) / 2 + (1/4) .T.RND (4) It is calculated by the following formula. In this equation (4), a coefficient of (1/4) is applied to the maximum half amplitude value T.

To facilitate understanding, the above steps will be described using actual numerical values. For example, FIG.
Suppose that scalar values "50" and "50" are set as initial conditions for grid points A and B in the initial stage, respectively. As shown in FIG. 18, a grid point C of the first stage is defined as a middle point between the two grid points A and B.
Is defined. In this case, the scalar value c defined for the grid point C is given by the following equation (1) by the operation of c = (50 + 50) / 2 + T · RND (1) . Here, the maximum half-amplitude value of the fluctuation is set to T = 5.
Assume that ND = + 0.8. In this case, the scalar value c obtained by the calculation is c = 54.

Subsequently, grid points A and C and grid points C and B
As shown in FIG. 19, a grid point D and a grid point E of the second stage are defined as the middle points of the scalar values d and E in this case. e is given by the above equations (2) and (3), and d = (50 + 54) / 2 + (1/2) .T.RND (2) e = (54 + 50) / 2 + (1/2) .T.RND (3) It is given by the following operation. Here, assuming that the random numbers RND = −0.4 and RND = + 0.4 happen to be calculated in the above equations, a scalar value d = 5 obtained by the calculation.
1, e = 53. As a result, at the stage where the scalar values for the grid points in the second stage are obtained, the scalar values are defined for the five grid points A, D, C, E, and B, respectively, as shown in FIG. .

Similarly, these five grid points A,
A grid point of the third stage is defined at each of the middle points of D, C, E, and B, and a scalar value is calculated and defined for these grid points, and further, a fourth stage, a fifth stage,. Repeat the same operation as above. Such an operation is performed a predetermined finite number of times n
By repeating the above process, a number of grid points are defined between the grid points A and B in the initial stage, and a predetermined scalar value is defined for each of these grid points. In addition, if the calculation method of the scalar value s with respect to the grid point at the n-th stage is represented by a general formula, s = (α + β) / 2 + (1/2 (n-1)). T. Here, α and β are the scalar values of the grid points on both sides of the grid point (calculated in the (n−1) th step), and T is the maximum half-amplitude value of the fluctuation, as described above. RND is an arbitrary random number satisfying -1 ≦ RND ≦ + 1.

When a number of grid points having predetermined scalar values are defined by such a method, the distribution of scalar values of these grid points gives a one-dimensional fractal field. In the specific example described above, a scalar value of “50” is defined at the left end point and the right end point of the one-dimensional fractal field, and a number of grid points defined between these end points also have their own scalar values. Defined. If the distribution direction of the one-dimensional fractal field thus obtained is plotted on the abscissa and individual scalar values are plotted on the ordinate, a graph as shown in FIG. 21 is drawn. Such a graph has, for example, properties similar to the shape of a coastline in nature. In other words, individual scalar values have various distributions, such as partially increasing or decreasing, but the complexity of this distribution pattern is microscopic,
It is known that it becomes the same when viewed from a macro perspective. Explaining this property more specifically, in FIG. 21, the complexity of the graph between the grid points AB and the complexity of the graph between the grid points AD are the same. If you look at the section enlarged by a magnifying glass, it still has the same complexity. In other words,
Each scalar value is defined for each grid point in a self-similar manner, which means that it changes spatially with natural fluctuations.

Taking θ in the horizontal axis direction and d in the vertical axis direction of the one-dimensional fractal field as shown in FIG. 21, d = f (θ)
Is defined, it can be used as a one-dimensional fluctuation field to be applied to the present invention.

§6. Other Embodiments In the embodiments described above, in order to determine the line width W, the line length L, and the line interval S of the hairline, the distribution range is determined by giving the respective minimum and maximum values as parameters.
The values within this distribution range were determined using uniform random numbers.
The average value and the variance of the individual values may be given as parameters, and random numbers having a normal distribution may be generated to determine the individual values.

In the above-described embodiment, one hairline always has the same line width W. However, using a one-dimensional fluctuation field, each line of the one hairline has a line width W.
May be varied. In this case, one hairline becomes thicker or thinner on the way.

The hairline pattern formed in the allocation area shown in FIG. 3 has no pattern consistency between the right side and the left side. Therefore, when the same hairline pattern is repeatedly arranged in the left-right direction, discontinuity occurs at the boundary. Will occur. In other words, the pattern is not spatially repeatable. Therefore, in order to generate a spatially repeatable pattern, the following procedure can be added to the processing shown in FIG. That is, from step S40 to step S41, step S3
When returning to the process from step 2, an arbitrary x coordinate value (1 <x <width) is generated using a random number, and the image on the i-th row is separated into a right half and a left half at the position of the coordinate value x. That is, a process of exchanging the right half image and the left half image is performed. If such processing is added, the finally obtained hairline pattern becomes a repeatable pattern in which the right side and the left side are completely continuous. Of course, if such a process is performed, a discontinuous portion will occur at an arbitrary position inside each row, but since the distribution of the discontinuous portions is random, discontinuities within the pattern are conspicuous. Nothing.

[0058]

As described above, by using the hairline pattern generation method according to the present invention, a hairline pattern having a high degree of freedom can be easily generated.

[Brief description of the drawings]

FIG. 1 is a flowchart showing a basic procedure of a hairline pattern generation method according to the present invention.

FIG. 2 is a diagram showing an example of parameters to be set in step S1 of the flowchart of FIG.

FIG. 3 is a plan view showing a state in which a hairline pattern is generated by allocating a large number of hairlines H in a rectangular area having a size represented by a variable value width on the horizontal side and a variable value height on the vertical side.

FIG. 4 is a partially enlarged view showing a part of FIG. 3 in an enlarged manner in order to show in detail a form of an individual hairline H constituting a hairline pattern.

FIG. 5 is a diagram illustrating an example of a rectangular figure F that is a basis of a hairline.

FIG. 6 is a diagram illustrating an example of a one-dimensional fluctuation field used for generating a hairline.

7 is a diagram showing a hairline H obtained by deforming the rectangular figure F shown in FIG. 5 based on the one-dimensional fluctuation field shown in FIG.

FIG. 8 is a block diagram showing a basic configuration of a hairline pattern generation device according to the present invention.

FIG. 9 is a flowchart showing a specific procedure of an allocation area defining process in step S2 of the flowchart of FIG. 1;

FIG. 10 is a flowchart showing a specific procedure of a hairline allocating process in step S3 of the flowchart of FIG. 1;

FIG. 11 shows a one-dimensional fluctuation field d = f (θ) used in the present invention.
It is a figure which shows the general example of.

FIG. 12 is a diagram illustrating a pixel configuration of a rectangular graphic F having a line width W;

13 is a diagram illustrating a process of displacing a pixel group with respect to the rectangular graphic F illustrated in FIG. 12;

FIG. 14 is a diagram showing a state of a preparation stage of a procedure for generating a one-dimensional fractal field.

FIG. 15 is a diagram showing a state of a first stage of a procedure for generating a one-dimensional fractal field.

FIG. 16 is a diagram showing a state of a second stage of a procedure for generating a one-dimensional fractal field.

FIG. 17 is a diagram showing a state of a preparation stage of a specific example for generating a one-dimensional fractal field.

FIG. 18 shows a first example of a specific example for generating a one-dimensional fractal field.
It is a figure showing a state of a stage.

FIG. 19 is a second example of a specific example for generating a one-dimensional fractal field.
It is a figure showing a state of a stage.

FIG. 20 shows a third example of the embodiment for generating a one-dimensional fractal field.
It is a figure showing a state of a stage.

FIG. 21 is a graph showing an example of a finally obtained one-dimensional fractal field.

[Explanation of symbols]

 Reference Signs List 10 random number generating means 20 rectangular figure defining means 30 fluctuation field generating means 40 hairline generating means 50 allocation means A fluctuation amplitude C fluctuation period F rectangular figure G line width H hairline K line spacing L ... Line length S ... Line interval W ... Line width Z ... Top left corner of rectangle

 ──────────────────────────────────────────────────続 き Continuing on the front page (72) Inventor Futa Miki 1-1-1, Ichigaya Kagacho, Shinjuku-ku, Tokyo Inside Dai Nippon Printing Co., Ltd. (72) Inventor Tetsuo Shinki 1-chome, Ichigaya-cho, Shinjuku-ku, Tokyo No. 1 Dai Nippon Printing Co., Ltd. (72) Inventor Yu Okamoto 1-1-1, Ichigaya Kagamachi, Shinjuku-ku, Tokyo Dai Nippon Printing Co., Ltd

Claims (6)

[Claims] 1. A method for generating a hairline pattern in which a plurality of hairlines extending substantially along a predetermined direction are arranged on a plane, comprising the steps of: setting parameters required for pattern generation; G, defining a plurality of rows, and arranging the plurality of rows vertically adjacent to each other with a predetermined row interval K, and defining an allocation area. Generating a plurality of hairlines corresponding to the plurality of hairlines, arranging the plurality of hairlines adjacent to each other in the horizontal direction at a predetermined line interval S, and outputting image data indicating a number of hairlines allocated in the allocation area And a method for generating a hairline pattern. 2. The generation method according to claim 1, wherein a predetermined line width W and a line length L are determined, and an elongated rectangular figure having a width of W pixels and a length of L pixels is defined. Generating a hairline pattern by using a one-dimensional fluctuation field having an amplitude smaller than the line width G to generate individual hairlines by displacing each pixel constituting the rectangular figure in the width direction. Method. 3. The generation method according to claim 2, wherein a j-th harmonic having an amplitude A _j and a phase ω _j (where 1
As a sum of ≦ j ≦ n, k _j is a predetermined coefficient), a function d = f () representing a one-dimensional fluctuation field by an expression of d = Σ _{j = 1, n} A _j sin k _j · (θ−ω _j ) θ), the position in the length direction of the rectangular figure is made to correspond to the variable value θ, and each pixel at the position corresponding to the variable value θ is determined based on the function value d given by the function d = f (θ). A hairline pattern generating method characterized by displacing the hairline in the width direction. 4. The generation method according to claim 2, wherein a one-dimensional fractal field in which a scalar value d is defined on the coordinate axis θ in a self-similar manner is prepared, and the position in the length direction of the rectangular figure is set as the coordinate value θ. A hairline pattern generation method, wherein each pixel at a position corresponding to the coordinate value θ is displaced in the width direction based on the scalar value d defined in the one-dimensional fractal field. 5. The generation method according to claim 1, wherein a distribution range of the line width W, a distribution range of the line length L, and a distribution range of the line interval S are set as parameters, respectively. The line width W within the set distribution range is determined using random numbers, so that the same line width is applied to hairlines belonging to the same line, and the line length L and the line interval S for each hairline A method of generating a hairline pattern, wherein a predetermined value within a set distribution range is determined using random numbers. 6. A device for generating a hairline pattern in which a number of hairlines extending substantially along a predetermined direction are arranged on a plane, comprising: a random number generating means for generating a random number; W and L (where W <<
L), a rectangular figure defining means for defining an elongated rectangular figure having a width of W pixels and a length of L pixels, and a one-dimensional fluctuation having a predetermined amplitude using the random numbers. A fluctuation field generating means for generating a field, a hairline generating means for generating a hairline by displacing each pixel constituting the rectangular figure in a width direction based on the one-dimensional fluctuation field, and the generated hairline, And a allocating means for allocating on a plane using a random number.