JP2002298077A - Two-dimensional code, reading method of two-dimensional code, program, and computer readable record medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a two-dimensional code capable of storing a large capacity of information, its reading method, a program, and a computer readable record medium. SOLUTION: Circumferential sides of a two-dimensional matrix 2 are surrounded with solid lines a-d, heading lines R11 and R12 are disposed outside a rectangular corner D, heading lines R13 and R14 are disposed outsides rectangular corners B and C respectively, heading lines R21-R23 and R31-R33 are disposed outsides the sides a and b, heading lines R41-R43 and R51-R53 are disposed insides the sides c and d. The heading lines R21-R23 and R41-R43 are disposed at a same pitch P1, and the heading lines R31-R33 and R51-R53 are disposed at a same pitch P2. Data density information and positioning information are obtained in decoding based on the heading lines.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a two-dimensional code and a method for reading the same, and more particularly, to a two-dimensional code capable of improving data density, a method for reading the two-dimensional code, a program for causing a computer to execute the method, and a method for reading a computer. It relates to a possible recording medium.

[0002]

2. Description of the Related Art Conventionally, as a two-dimensional code, for example, as described in JP-A-7-168902,
A two-dimensional data element is divided into a plurality of parts to form a two-dimensional array, and a two-dimensional code for displaying position information and density information on each core code, or as described in JP-A-7-254037. Attempts have been made to improve the reading speed and reading accuracy when reading a symbol such as a two-dimensional code formed by embedding a shape for position determination in a two-dimensional matrix with a device such as a CCD (Charge Coupled Device) image scanner. It is known that it has been.

[0003]

However, the above-described attempts have been devised on the premise of the performance of a conventional one-dimensional barcode reader. Therefore, there is an advantage that the position determination information and the density information can be easily obtained. However, when storing a large amount of information, the area occupied by the two-dimensional code increases in proportion to the size of the information amount. Was. On the other hand, due to recent technological innovation, the reading speed
Remarkably high performance has been achieved by DSP (Digital Signal Processor), etc., and reading accuracy has been dramatically improved by improvement of image processing technology and development of high resolution CCD device. An environment that can increase the density of the equipment has been prepared.

The present invention has been made in view of the above circumstances, and has as its object to provide a two-dimensional code capable of increasing the density of information, a method of reading the two-dimensional code, a program for causing a computer to execute the method of reading, and a computer readable code. To provide a simple recording medium.

[0005]

The present invention solves the above problems by the following means.

That is, according to the present invention, the data area is arranged so as to form a two-dimensional matrix by encoding binary data into cells, and the data area is arranged so as to surround the first data area. A two-dimensional code including a pattern for providing information on a data density of a region and positioning information, wherein the pattern includes an adjacent first side and a second side.
Are arranged so as to be close to the first data area, and the third side and the fourth side respectively opposed to the first side and the second side are separated from the data area. A substantially rectangular solid line, a first protrusion and a second protrusion arranged at a predetermined pitch so as to extend outward from the first side and the second side, respectively, A third projection and a fourth projection arranged at a predetermined pitch so as to extend inward from the side and the fourth side toward the data area; A fifth protrusion and a sixth protrusion arranged so as to extend the first side and the second side from a first end point which is an intersection of the first and second sides, respectively, and the first end point A seventh protrusion arranged to extend the fourth side from a second end point which is an end point of the first side different from the seventh side When, wherein the third endpoint and the first end point is a terminal point of a different said second side, and the eighth of protrusions arranged so as to extend the third side, and
A two-dimensional code is provided in which a projection is not disposed at a fourth end point, which is an intersection of the third side and the fourth side.

According to the present invention, since the pattern for providing the data density and the positioning information is provided, even if the occupation area of the data area is increased by increasing the number of the binary data, a single pattern is provided. Can be used to position the cell. As a result, the area occupied by the entire two-dimensional code can be made much smaller than a simple multiple of the amount of information stored in the data area. As a result, a two-dimensional code that stores a large amount of information at a high density is provided.

The first to eighth projections function as index lines for acquiring the data density and the positioning information in the read image. That is, the fifth and sixth protrusions are arranged at the first end point, the seventh and eighth protrusions are arranged at the second and third end points, respectively, while the fourth and fourth protrusions are arranged at the second and third end points, respectively. Since no projection is provided at the end point, the fourth end point can be selected as a reference point for specifying the position coordinates of the cell in the read image. In addition, since the first to fourth protrusions are respectively arranged on the rectangular solid line at a predetermined pitch, by calculating the number of these protrusions, the binary data of the binary data symbolized in the data area is calculated. The quantity can be calculated. Thereby, information on the data density in the data area can be obtained. Further, by providing straight lines connecting the protruding portions in the read image, it is possible to specify each position coordinate of the cell based on the coordinates of the intersection of these straight lines.

Preferably, the line width of the first to fourth sides and the width of the first to eighth projections are set in accordance with the size of the cell.

[0010] The first protrusion is formed at a pitch of N (N) at a first length pitch from the first end point to the second end point.
Is a natural number), and the second protrusion is the first protrusion.
M (M is a natural number) are arranged at a pitch of a second length from the end point of the third end point to the third end point, and the third protruding portion extends from the third end point to the fourth end point. The N number of the fourth protrusions are arranged at a pitch of the second length from the second end point toward the fourth end point. Good to be arranged.
The data capacity of the data area can be easily calculated by recognizing the first to fourth protrusions and specifying the specific quantities of N and M.

According to the present invention, there is provided the above-described method for reading a two-dimensional code according to the present invention, wherein the step of obtaining an image of the two-dimensional code includes the steps of: While contacting the fourth end point,
A step of cutting out a rectangular area surrounding the pattern so as to include at least a part of the projections and at least a part of the eighth projections; Each contact between the eighth protrusion and the periphery of the rectangular area is specified as a first contact, a second contact, and a third contact, respectively, and the fifth or sixth protrusion and the periphery of the rectangular area are specified. A step of recognizing a contact point with the first contact point as a fourth contact point, a first line segment connecting the first contact point and the second contact point is set, and the first contact point and the third contact point are determined. The procedure of setting a second line segment to be connected, and the step of setting a first virtual line parallel to the first line segment and moving the virtual line from the fourth contact point to the third contact point, A procedure for recognizing a first projection, the third projection, and the second side; By setting a parallel second virtual line and moving it from the fourth contact point to the second contact point, the second projection, the fourth projection, the first side, And the recognized first to fourth steps
Calculating the capacity of the binary data in the data area on the basis of the number of the projections, a coordinate system using the first line segment and the second line segment as the X axis or the Y axis, or the rectangular area. A procedure of setting a coordinate system in which two sides orthogonal to each other among the sides forming the periphery of the cell are set as the X axis or the Y axis and specifying the coordinates of each cell in the data area; For converting the converted binary data into bit string data.

According to the two-dimensional code reading method, since the position coordinates of each cell in the read image are specified based on the plurality of projections, the symbolized binary data can be restored with high accuracy. it can. Further, since the capacity of the binary data in the data area is calculated based on the recognized number of the first to fourth protrusions, the data density of the data area can be easily and quickly obtained.

Further, according to the present invention, there is provided a program for causing the computer to execute the above-described method for reading a two-dimensional code, and a computer-readable recording medium on which the program is recorded.

[0014]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Some embodiments of the present invention will be described below with reference to the drawings.

(1) Embodiment of Two-Dimensional Code FIG. 1 is a schematic diagram showing an embodiment of a two-dimensional code according to the present invention. As shown in the figure, the two-dimensional code 1 of the present embodiment is arranged so as to surround a matrix data section 2 in which binarized data is stored in the form of bright and dark square cells, and a matrix data section 2. Heading lines (protrusions) R11 to R14, R21 to R formed by a rectangle and solid lines extending vertically from the sides a to d of the rectangle, respectively.
23, R31 to R33, R41 to R43, R51 to R5
3 is provided. The squares and the header lines R11 to R53 are patterns in the present embodiment, whereby data density information and positioning information are given using a reading method described later. The width of the rectangle and each heading line is the same as the length of one side of the data cell.

The headlines R11 and R12 are arranged so as to extend from the point D to the sides b and a, respectively. The heading line R13 is arranged so as to extend the side d from the point B, and the heading line R14 is arranged so as to extend the side c from the point C. These headlines R11 to R14
Respectively correspond to the fifth to eighth protrusions in the present embodiment. Of the square corners A to D, the point A (the fourth
(Corresponding to the end point of the above) is not provided with a heading line. Thereby, as described later, the point A can be used as the origin of the two-dimensional code in the image processing for specifying the position coordinates of each cell.

Heading lines R21 to R23, R31 to R3
3, R41 to R43 and R51 to R53 indicate the positions of specific data cells in the row direction or the column direction, respectively. The headlines R21 to R23 and R41 to R43 are arranged on the sides a and c of the rectangle at a pitch P1 having a fixed length, respectively, and correspond to the first protrusion and the third protrusion in the present embodiment, respectively. Also, heading lines R31-R33, R51-
R53 is arranged at a pitch P2 of a fixed length on each of the sides b and d of the rectangle, and each of the R53 is a second pitch in this embodiment.
And the fourth projection. Pitch P1, P2
Are respectively known constants, and have the same value in the present embodiment.

Heading lines R21 to R23, R31 to R33
Are arranged so as to extend outward from the sides a and b, respectively, of the rectangle. On the other hand, heading lines R41 to R4
3, R51 to R53 are arranged so as to extend inward of the square from the other two adjacent sides c and d. In the present embodiment, the lengths of the heading lines are all the same, but the sides c, c are set so that the inward heading lines R41 to R43, R51 to R53 do not overlap the matrix data part 2.
d is arranged at a distance from the periphery of the matrix data section 2.

The number of heading lines can be independently increased or decreased in each of the horizontal and vertical directions according to the number of data in the matrix data section. Therefore, it is possible to configure two-dimensional codes of various sizes and shapes depending on uses such as data capacity and printing place. Thus, in the two-dimensional code 1 of the present embodiment, the matrix data unit 2
Since there is no special print pattern for cutting out, positioning, etc., more data can be mounted in a smaller area. Further, even if the data capacity is increased, the cutout and positioning can be performed in a single pattern surrounding the matrix data section 2, so that the occupied area of the entire two-dimensional code is larger than the size proportional to the increase in the data capacity. Much smaller. As a result, a two-dimensional code that stores a large amount of information at a high density is provided.

(2) Embodiment of Two-Dimensional Code Reading Method Next, a two-dimensional code reading method shown in FIG. 1 will be described as one embodiment of a two-dimensional code reading method according to the present invention. Here, only a reading procedure specific to the two-dimensional code according to the present invention is shown, and detailed procedures and adjustments generally required in the reading process are omitted.

FIG. 2 is an explanatory diagram of the reading method according to the present embodiment, and FIG. 3 is a flowchart showing a schematic procedure of the reading method shown in FIG.

1) First, digital image data of a two-dimensional code 1 is captured using an image pickup device such as a CCD (step S1).

2) Next, the distribution (histogram) of the image data in which vertical and horizontal dark cells are present is examined, and a rectangular area AR surrounding the two-dimensional code 1 is defined as shown in FIG. 2 (step S2). .

3) Next, a point that contacts each side of the periphery of the rectangular area AR is searched (step S3). In the case of FIG.
Points A, E, F, and H are obtained.

4) Subsequently, the dots on the line connecting the points A, E, F and H adjacent to each other are examined, and a dark solid line corresponds to any line among the sides a to d of the rectangle. It is determined whether or not to perform (Step S4). In the case shown in FIG. 2, the line segment AE
And the line segment AF respectively correspond to the solid lines of the sides d and c of the rectangle. On the other hand, there is no corresponding solid line between the line segment EH and the line segment FH. An intersection A between the line segment AE and the line segment AF is selected as the origin of the two-dimensional code 1 (step S5).

5) Next, a line segment parallel to the line segment AF and having substantially the same length is examined from the point A to the point E, the line segment BH is specified, and the point B and the point H are determined from the end point. To identify. Similarly, a line segment CG which is parallel to the line segment AE from the point A to the point F and whose length is almost the same is examined.
And a point G, and an intersection D between the line segment BH and the line segment CG is specified (step S6).

6) Next, a virtual dashed line (heading dashed line) which is parallel to the line segment AF and has the same length is set, and starting from point A, scanning is performed in the direction of point E in the direction of bd1, bd2. , Heading lines R31 and R53, R32 and R52, R
Search for 33 and R51 (step S7). At this time, a headline dashed line bd1 connecting headlines R31 and R53.
And the length and pitch of each headline are known constants in units of the size of the data cell. Therefore, based on the positional relationship between the points A to D already specified in the above-described procedure. Thus, the position and length of each headline can be predicted.
Similarly, an imaginary dashed line which is parallel to the line segment AE and has the same length is set, and starting from point A, ac is set in the direction of point F.
By scanning 1, ac2,..., A search is made for heading lines R23 and R43, R22 and R42, and R21 and R41 (step S7). Here, the line segment AC (side c of the rectangle)
Are the same as the number of heading lines recognized as extending vertically inward and the number of heading lines recognized as extending vertically outward from the line segment BD (side a of the rectangle). Similarly, the number of heading lines recognized as extending vertically inward from the line segment AB (side d of the rectangle) and the line segment CD (4
If the number of heading lines recognized as extending vertically outward from the side b) of the square is the same, it can be confirmed that the search for each heading line has been performed normally. As described above, the number of heading lines is determined independently in each of the horizontal direction and the vertical direction according to the number of data in the matrix data section 2, so that the number of heading lines recognized by each line segment (side) is determined. The capacity of the matrix data is determined according to the number of lines.

7) Subsequently, as shown by the broken line in FIG.
A line segment bd1 forming a lattice shape by sequentially connecting points on the headline recognized by two parallel sides of the polygon
To bd3, ac1 to ac3 are again assumed, and the coordinates of the intersections n11 to n33 of these line segments are calculated (step S
8). These coordinates correspond to the coordinates of the data cells in the matrix data section 2 extracted at regular intervals.

8) Further, from the coordinates of the intersection obtained in the above 7), the coordinate value of each cell is obtained from the number of cells between the known header lines, and the binary value of each cell is sampled to obtain the bit string data. (Step S9).

9) Finally, since an error correction code is added to the bit string data of the two-dimensional code 1 in advance, error correction is performed using this. Thereby, the original data is restored (step S10).

As described above, according to the two-dimensional code reading method of the present embodiment, the data stored in the matrix data section 2 can be restored with high accuracy by simple image processing, and the data capacity can be quickly reduced. Can be obtained.

(3) Program and Recording Medium A series of procedures of the two-dimensional code reading method described above may be incorporated in a program and read and executed by a computer capable of processing image data. This makes it possible to implement the two-dimensional code reading method according to the present invention using a general-purpose computer. A series of procedures of the above-described two-dimensional code reading method may be stored in a recording medium such as a flexible disk or a CD-ROM as a program for causing a computer capable of processing image data to read the program and execute the program. . The recording medium is not limited to a portable medium such as a magnetic disk or an optical disk, but may be a fixed recording medium such as a hard disk device or a memory. Further, a program incorporating a series of procedures of the above-described two-dimensional code reading method may be distributed via a communication line (including wireless communication) such as the Internet.
Furthermore, a program incorporating a series of procedures of the above-described two-dimensional code reading method is encrypted, modulated, or compressed in a state where the program is transmitted via a wired or wireless line such as the Internet or a recording medium. It may be stored and distributed.

While some embodiments of the present invention have been described above, the present invention is not limited to the above-described embodiments.
It goes without saying that various modifications can be made within the technical scope.

[0034]

As described in detail above, the present invention has the following effects.

That is, according to the two-dimensional code according to the present invention, a substantially rectangular pattern provided so as to surround the data area and provided with a plurality of projections for providing the data density and the positioning information of the data area. , Each cell can be positioned in a single pattern regardless of the size of the data capacity stored in the data area. This provides a two-dimensional code that stores a large amount of information and has high reading accuracy.

Further, according to the two-dimensional code reading method of the present invention, since the position coordinates of each cell in the read image are specified based on the plurality of protrusions, the symbolized binary data can be converted with high accuracy. Can be restored.
In addition, since the method includes the step of calculating the capacity of the binary data in the data area based on the recognized number of the first to fourth protrusions, the data density of the data area can be easily and quickly obtained. it can.

Further, according to the program and the computer-readable recording medium of the present invention, the above-described two-dimensional code reading method can be executed using a general-purpose computer.

[Brief description of the drawings]

FIG. 1 is a schematic diagram showing an embodiment of a two-dimensional code according to the present invention.

FIG. 2 is an explanatory diagram of one embodiment of a two-dimensional code reading method according to the present invention.

FIG. 3 is a flowchart illustrating a schematic procedure of a reading method illustrated in FIG. 2;

[Explanation of symbols]

Reference Signs List 1 2D code 2 Matrix data part a to d Square side bd1 to bd3, ac1 to ac3 Virtual broken line P1, P2 Pitch between heading lines R11 to R14, R21 to R23, R31 to R33, R
41 to R43, R51 to R53 Heading line (projection)

Continuation of the front page (72) Inventor Kozo Kuroiwa 2-24-3, 104, Kyomachi, Kawasaki-ku, Kawasaki-shi, Kanagawa Prefecture (72) Inventor Satoshi Mizoguchi 2-2-132, Nakazato, Ninomiyacho, Naka-gun, Kanagawa Prefecture Shonan Hills Ninomiya 402 F-term (reference) 5B072 AA02 CC21 DD02 DD23 HH11 LL19

Claims (7)

[Claims] 1. A data area in which binary data is symbolized into cells and arranged to form a two-dimensional matrix; and a data area arranged to surround the first data area; And a pattern for providing positioning information, wherein the first side and the second side are adjacent to the first data area, and the first side and the second side are adjacent to each other. A substantially rectangular solid line arranged so that a third side and a fourth side respectively facing each other are separated from the data area, and extend outward from the first side and the second side. A first projection and a second projection respectively arranged at a predetermined pitch, and at a predetermined pitch so as to extend inward from the third side and the fourth side toward the data area. A third projection and a fourth projection arranged, The fifth protrusion and the sixth protrusion arranged so as to extend the first side and the second side respectively from a first end point which is an intersection of the first side and the second side. A projection, a seventh projection arranged to extend the fourth side from a second end point that is an end point of the first side different from the first end point, An eighth projection that is arranged to extend the third side from a third end point that is an end point of the second side different from the end point; A two-dimensional code in which no protrusion is arranged at a fourth end point that is an intersection with the side of No. 4. 2. The method according to claim 1, wherein the line widths of the first to fourth sides and the widths of the first to eighth protrusions are set in accordance with the size of the cell. The described two-dimensional code. 3. The method according to claim 1, wherein the first protrusion has a pitch of N (N) at a first length from the first end point toward the second end point.
Is a natural number), and M (M is a natural number) number of the second protrusions are arranged at a pitch of a second length from the first end point toward the third end point; The N protrusions are arranged at a pitch of the first length from the third end point toward the fourth end point, and the fourth protrusion is the second protrusion from the second end point. 3. The two-dimensional code according to claim 1, wherein the M pieces are arranged at a pitch of the second length toward an end point of No. 4. 4. 4. The two-dimensional code according to claim 3, wherein said first length and said second length are respectively set according to the size of said cell. 5. The method of reading a two-dimensional code according to claim 1, wherein: a step of acquiring an image of the two-dimensional code; A step of cutting out a rectangular area surrounding the pattern so as to be in contact with an end point of No. 4 and to include at least a part of the seventh protrusion and at least a part of the eighth protrusion; The end point, the seventh projection, the eighth projection, and the respective contacts of the peripheral edge of the rectangular area are specified as a first contact, a second contact, and a third contact, respectively, and the fifth or the fifth contact is specified. A step of recognizing a contact point between the protrusion of No. 6 and the periphery of the rectangular area as a fourth contact point; setting a first line segment connecting the first contact point and the second contact point; A second connecting the third contact to the third contact
And setting a first virtual line parallel to the first line segment and moving it from the fourth contact point to the third contact point. A projection, the third projection, and the second
And a second virtual line parallel to the second line segment is set and moved from the fourth contact point in the direction of the second contact point, whereby the second A projection, the fourth projection, and the first
A step of recognizing a side of the rectangular area; a step of calculating a capacity of the binary data in the data area based on the number of recognized first to fourth protrusions; A procedure of setting a coordinate system having two sides orthogonal to each other as an X axis or a Y axis to specify the coordinates of each cell in the data area; and converting the symbolized binary data into bit string data based on the cell coordinates. And a procedure for reading the two-dimensional code. 6. A procedure for acquiring an image of a two-dimensional code according to claim 1, wherein, in the acquired image, a peripheral edge is in contact with the fourth end point, and A step of cutting out a rectangular area surrounding the pattern so as to include at least a part of the projection and at least a part of the eighth projection; and the fourth end point, the seventh projection, and the 8 are specified as a first contact point, a second contact point, and a third contact point, respectively, with the fifth or sixth protrusion and the periphery of the rectangular area. A first line segment connecting the first contact and the second contact, and connecting the first contact and the third contact. Second
And setting a first virtual line parallel to the first line segment and moving it in the direction of the third contact point, so that the first protrusion and the third A step of recognizing the protrusion and the second side; and setting a second imaginary line parallel to the second line segment and moving the line in the direction of the second contact point, thereby obtaining the second point. Recognizing the projections, the fourth projections, and the first side, and calculating the capacity of the binary data in the data area based on the number of the recognized first to fourth projections. Setting a coordinate system in which two sides orthogonal to each other among the sides forming the periphery of the rectangular area are set as the X axis or the Y axis, and specifying the coordinates of each cell in the data area; Converting the encoded binary data into bit string data based on the coordinates; Program for executing the, the reading method of the two-dimensional code comprising a computer. 7. A procedure for acquiring an image of a two-dimensional code according to claim 1, wherein, in the acquired image, a peripheral edge is in contact with the fourth end point and the seventh image is acquired. A step of cutting out a rectangular area surrounding the pattern so as to include at least a part of the projection and at least a part of the eighth projection; and the fourth end point, the seventh projection, and the 8 are specified as a first contact point, a second contact point, and a third contact point, respectively, with the fifth or sixth protrusion and the periphery of the rectangular area. A first line segment connecting the first contact and the second contact, and connecting the first contact and the third contact. Second
And setting a first virtual line parallel to the first line segment and moving it in the direction of the third contact point, so that the first protrusion and the third A step of recognizing the protrusion and the second side; and setting a second imaginary line parallel to the second line segment and moving the line in the direction of the second contact point, thereby obtaining the second point. Recognizing the projections, the fourth projections, and the first side, and calculating the capacity of the binary data in the data area based on the number of the recognized first to fourth projections. Setting a coordinate system in which two sides orthogonal to each other among the sides forming the periphery of the rectangular area are set as the X axis or the Y axis, and specifying the coordinates of each cell in the data area; Converting the encoded binary data into bit string data based on the coordinates; When the computer-readable recording medium recording a program for executing a method of reading the two-dimensional code to the computer with a.