JP5592234B2 - Two-dimensional code generation device, two-dimensional code reading device, two-dimensional code, two-dimensional code generation method, two-dimensional code reading method, and program - Google Patents

Description

  The present invention relates to a technique for encoding and generating a two-dimensional code arranged as a pattern on a two-dimensional matrix.

  In recent years, many barcodes have been used for solid identification and the like. For example, Patent Document 1 discloses a technique for converting two-dimensional coding of character and number information into a substantially square shape. Patent Document 2 discloses a technique of a two-dimensional code composed of rectangles having different aspect ratios.

  By the way, since the two-dimensional code disclosed in Patent Document 1 is configured in a substantially square shape, the code size increases both vertically and horizontally when the amount of information is increased. Therefore, inconvenience arises when attached to an elongated object. For example, a conventionally used one-dimensional bar code can be displayed in a relatively long and narrow shape, but is weak against linear stains, and it is difficult to display a thin line in ink jet printing. . Further, when compared by occupying the same area, there is a disadvantage that the amount of information is smaller than that of the two-dimensional code. In addition, since the two-dimensional code disclosed in Patent Document 2 is formed in a rectangular shape, it is convenient to attach an elongated shape compared to the substantially square two-dimensional code disclosed in Patent Document 1.

Japanese Patent No. 2938338 Japanese Patent No. 4247190

  However, in the technique disclosed in Patent Document 2, it is assumed that a two-dimensional code displayed on a card is photographed for each card with a camera. In the case of an elongated two-dimensional code attached to an object, it is often more convenient to scan and read the two-dimensional code in some cases than to capture it as one screen.

  In general, when a long and thin two-dimensional code is recognized by scanning, erroneous recognition is likely to occur depending on the scanning speed, and it is necessary to deal with it, but Patent Document 2 does not disclose such consideration.

  In view of the above, an object of the present invention is to stably perform code recognition processing by avoiding erroneous recognition of data bits of a two-dimensional code, even when scanning and recognizing a two-dimensional code formed in an elongated shape. It is to provide a two-dimensional code generation device and a program that can perform the above.

Two-dimensional code generating apparatus of the present invention is a two-dimensional code generating device for generating a two-dimensional code arranged as a pattern marks Goka data on a two-dimensional matrix, the encoded data In contrast, the two-dimensional data in which redundant data including at least two pieces of data that are adjacent and whose values are inverted are periodically inserted at intervals for each encoded data , and a start bit and an end bit are added. characterized by having a two-dimensional code generation means to generate code.
The two-dimensional code reader of the present invention is a two-dimensional code reader that reads a two-dimensional code in which encoded data is arranged as a pattern on a two- dimensional matrix, and detects a start bit and an end bit. reading means for reading the two-dimensional code, at least the periodically inserted adjacent by the encoded encoding intervals for dividing each data to the data in the two-dimensional code, and the value is inverted the redundant data includes two data based on a detection means for detecting the encoded data divided by said redundancy data from said two-dimensional code, is the encoded detected by said detecting means And decrypting means for decrypting the received data.
The two-dimensional code of the present invention is a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix , and is adjacent to the encoded data and inverted in value. Redundant data including at least two data is periodically inserted, and a start bit and an end bit are added .

  As described above, according to the present invention, data bits of a two-dimensional code are provided by providing a device for generating a two-dimensional code by periodically inserting redundant data having a predetermined data structure and a device for decoding. Therefore, the code recognition process can be performed stably. In particular, it is possible to provide a two-dimensional code recognition device and program suitable for scanning and recognizing a steel sheet production line.

It is a figure which shows the functional structure of the two-dimensional code production | generation apparatus and two-dimensional code reader which concern on embodiment of this invention. It is a figure which shows the hardware constitutions of the two-dimensional code production | generation apparatus which concerns on embodiment of this invention, and a two-dimensional code reader. It is a flowchart which shows the process of the two-dimensional code production | generation apparatus which concerns on embodiment of this invention. It is a flowchart which shows the process of the two-dimensional code reader which concerns on embodiment of this invention. It is a figure which shows the structural example of a conversion table. It is a figure which shows the structural example of a definition table. FIG. 7 is a diagram for explaining an example in which input data “GH” is converted into data bits according to the definition rule 1 in FIG. 6 to generate a two-dimensional code. FIG. 8 is a diagram for explaining an example of converting data bits of a two-dimensional code generated by the process described in FIG. 7 into output data according to the definition rule 1 in FIG. 6. It is a figure for demonstrating the example which converts the input data "441" into a data bit according to the definition rule 2 of FIG. 6, and produces | generates a two-dimensional code. FIG. 10 is a diagram for explaining an example of converting data bits of a two-dimensional code generated by the process described in FIG. 9 into output data according to the definition table 2 in FIG. 6. The input data “441” is converted into data bits according to the definition rule 2 in FIG. 6, and the redundant bit insertion unit inserts the redundant bits into the data bits at a constant cycle without referring to the definition rule 2. It is a figure for demonstrating an example. FIG. 12 is a diagram for explaining an example of converting data bits of a two-dimensional code generated by the process described in FIG. 11 into output data according to the definition rule 2 in FIG. 6. It is a figure which shows the other example of a definition table. It is a figure for demonstrating the example which converts the input data "GH" into a data bit according to the definition rule 1 of FIG. 13, and produces | generates a two-dimensional code. FIG. 15 is a diagram for explaining an example in which data bits of a two-dimensional code generated by the process described in FIG. 14 are converted into output data according to the definition rule 1 in FIG. 13. It is a figure which shows the further another example of a definition table, and the process example which produces | generates a two-dimensional code from the input data "AB012" according to the said definition table, and reads the said two-dimensional code. It is a figure which shows the other aspect of a redundancy bit. It is a system configuration figure showing an example of an embodiment of the present invention.

  DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, preferred embodiments to which the invention is applied will be described in detail with reference to the accompanying drawings.

  FIG. 1 is a diagram illustrating a functional configuration of a two-dimensional code generation device 1 and a two-dimensional code reading device 2 according to the present embodiment. The two-dimensional code generation device 1 and the two-dimensional code reading device 2 may be an integrated device, or may be individual devices.

<Two-dimensional code generator 1>
As shown in FIG. 1, the two-dimensional code generation device 1 includes a data input unit 11, a binarization processing unit 12, a redundant bit insertion unit 13, a two-dimensional code output unit 14, a conversion table 121, and a definition table 122. . The data input unit 11 inputs data such as characters, numbers and images (hereinafter referred to as input data) to be converted into a two-dimensional code. The binarization processing unit 12 binarizes (encodes) the input data. At that time, the binarization processing unit 12 refers to the conversion table 121 and the definition table 122. Here, the conversion table 121 is a table for setting and managing the correspondence between input data and output data (to be described later) and binarized data, as shown in FIG. Hereinafter, the binarized data obtained by converting the input data by the binarization processing unit 12 is referred to as data bits. The definition table 122 is a table for setting and managing data for defining the data structures of input data and output data (hereinafter referred to as definition rules). More specifically, in the definition rule, it is defined whether each data constituting the input data and the output data is “character”, “number”, or “image”. In the following, in order to simplify the description, the case where the input data is “character” and “number” will be mainly described.

  FIG. 6 is a diagram illustrating a configuration example of the definition table 122. In the example of FIG. 6, the definition table 122 includes a definition rule 1 that defines “characters” and “characters” as data structures of input data and output data, and “numbers” as data structures of input data and output data. It manages a definition table 2 defining “numbers” and “numbers”. That is, the definition rule 1 defines a data structure in which two “characters” such as “AB” and “BD” are arranged. In the definition rule 2, for example, a data structure in which three “numbers” such as “123” and “578” are arranged is defined.

  Here, as shown in the conversion table 121 of FIG. 5, “numbers” of “0” to “9” can be expressed by 4 bits by omitting the upper 2 bits of 0. Therefore, when the binarization processing unit 12 refers to the definition rule 2 from the definition table 122, it is defined as “number”, “number”, and “number”. Convert to Further, as shown in the conversion table 121 in FIG. 5, “characters” from “A” to “Z” can be represented by 6 data bits. Therefore, since the binarization processing unit 12 refers to the definition rule 1 from the definition table 122 and is defined as “character” and “character”, each data of the input data is converted into 6-bit data bits.

  The redundancy bit insertion unit 13 inserts redundancy bits into the data bits obtained by the binarization processing unit 12. At that time, the redundant bit insertion unit 13 refers to the definition table 122 and determines a position where the redundant bit is inserted into the data bit. In the present embodiment, the redundant bit is handled as a bit indicating a reference position when the two-dimensional code reading unit 2 detects a data bit from the two-dimensional code. Therefore, it is preferable to arrange the redundant bits at the positions where the data bits are separated. Therefore, in the present embodiment, when “number”, “number”, and “number” are defined as in the definition rule 2, the redundancy bit insertion unit 13 makes the data bits redundant at intervals of 4 bits. Decide to insert a bit. Further, when “character” and “character” are defined as in the definition rule 1, the redundant bit insertion unit 13 determines to insert redundant bits at 6-bit intervals with respect to the data bits. By detecting the positions of the redundant bits that periodically exist in this way, it is possible to accurately detect the data bits that exist between them. When the input data is image data, for example, a redundancy bit may be inserted for each data of one scan line, or a redundancy bit may be inserted for each data of a predetermined number of pixels.

  Further, the redundancy bit insertion unit 13 inserts the redundancy bit into the data bit, and then adds a start bit and an end bit to the head part and the last part, respectively. In this way, at the time of reading the code, the two-dimensional code reader 2 can identify from where to where the two-dimensional code is by detecting the start bit and the end bit from the two-dimensional code. Become. A two-dimensional code is generated by the above data processing. The two-dimensional code output unit 14 prints the above two-dimensional code on the object. The two-dimensional code is a binary (bit) of input data, which is an array of numerical values, to form data bits. Each data bit value (binary) is displayed on a two-dimensional matrix, for example, white It is arranged as a black pattern. In the following description, a two-dimensional code in which data bits are arranged on a two-dimensional matrix having a width direction of 2 bits and a length direction of N bits (N is a natural number) will be described as an example.

<Two-dimensional code reader 2>
The two-dimensional code reader 2 will be described. As shown in FIG. 1, the two-dimensional code reader 2 includes a two-dimensional code reader 21, a data bit detector 22, a data converter 23, and a data output unit 24. The two-dimensional code reading unit 21 reads a two-dimensional code printed on the object. The data bit detection unit 22 detects the position of the redundant bit from the two-dimensional code, and detects the data bit with reference to the position of the redundant bit. That is, the data bit detection unit 22 detects redundant bits that appear periodically, and detects data bits existing between them. At that time, the data bit detection unit 22 refers to the definition rule from the definition table 122. When “numeric”, “numeric”, and “numeric” are defined as the data structure as in the definition rule 2, the data bit detection unit 22 determines that the data bit detected from the two-dimensional code is every 4 bits. recognize. On the other hand, when “character” and “character” are defined as the data structure as in the definition rule 1, the data bit detection unit 22 recognizes that the data bit detected from the two-dimensional code is every 6 bits. . That is, the data bit detection unit 22 recognizes the number of data bits to be detected, and detects the data bits based on the position of the redundant bit. The data converter 23 converts (decodes) the data bits detected by the data bit detector 22 into “number” or “character” data (hereinafter referred to as output data) with reference to the conversion table 121. . The data output unit 24 outputs the output data obtained by the data conversion unit 23 to, for example, a display.

  FIG. 2 is a diagram illustrating a hardware configuration of the two-dimensional code generation device 1 and the two-dimensional code reading device 2 according to the present embodiment. FIG. 2 shows a hardware configuration when the two-dimensional code generation device 1 and the two-dimensional code reading device 2 are integrated.

  The CPU 201 comprehensively controls each device and controller connected to the system bus. The ROM 203 has a processing flow shown in FIG. 3 and FIG. 4 executed by the basic input / output system (BIOS) and operating system program which are control programs of the CPU 201, the two-dimensional code generation device 1, and the two-dimensional code reading device 2, for example. Programs and so on are stored.

  Further, for example, the program for performing the processing shown in FIGS. 3 and 4 according to the present embodiment may be recorded on a computer-readable recording medium such as a CD-ROM and supplied from the recording medium. However, it may be configured to be supplied via a communication medium such as the Internet.

  The RAM 202 functions as a main memory, work area, and the like for the CPU 201. The CPU 201 implements various operations by loading a program necessary for execution of processing into the RAM 202 and executing the program.

  The CPU 201 implements various operations by loading a program necessary for execution of processing into the RAM 202 and executing the program.

  The display controller 208 controls image display on the display 209. The KB controller 204 receives an operation input from the KB (keyboard) 205 and transmits it to the CPU 201. Although not shown, in addition to the KB 205, a pointing device such as a mouse can also be applied to the two-dimensional code generation apparatus 1 and the two-dimensional code reading apparatus 2 according to the present embodiment as user operation means.

  The print unit 207 is a device for printing a two-dimensional code on an object. The scanner unit 206 is a device for reading a two-dimensional code printed on an object.

  FIG. 18 shows an example of the embodiment. A steel plate 1802 in a through-plate that is a production line of a steel plate, a two-dimensional code 1801 printed on the steel plate, a camera 1803 corresponding to a scanner unit, a marking device 1804 corresponding to a print unit that prints a two-dimensional code in a previous process, two It is composed of 1.2 which is a dimension code generator and reader.

  The binarization processing unit 12, the redundant bit insertion unit 13, the data bit detection unit 22, and the data conversion unit 23 illustrated in FIG. 1 are stored in, for example, the ROM 203 and loaded into the RAM 202 as necessary. This is a configuration realized by the CPU 201 that executes it. The data input unit 11 has a configuration corresponding to the KB 205 and the KB controller 204. The two-dimensional code output unit 14 has a configuration corresponding to the print unit 207. The two-dimensional code reading unit 21 has a configuration corresponding to the scanner unit 206.

  FIG. 3 is a flowchart showing processing of the two-dimensional code generation device 1 according to the present embodiment. First, in step S301, the data input unit 11 inputs input data such as characters and numbers to be converted into a two-dimensional code. In step S <b> 302, the binarization processing unit 12 refers to the conversion table 121 and the definition table 122. Here, the binarization processing unit 12 refers to the definition rule from the definition table 122 and recognizes the number of bits corresponding to the structure of the input data. That is, for input data in which “number”, “number”, and “number” are defined in the definition rule 2, the binarization processing unit 12 converts each data of the input data into 4-bit data bits. Recognize that. On the other hand, for input data in which “character” and “character” are defined in the definition rule 1, the binarization processing unit 12 recognizes that each data of the input data is converted into 6-bit data bits. . In step S303, the binarization processing unit 12 converts the input data into data bits with the recognized number of bits using the conversion table 121 referred to in step S302. That is, when the binarization processing unit 12 recognizes that the data is to be converted into 4-bit data bits, for example, the input data “2” is associated with “000010” in the conversion table 121, but the first two digits. To “0010” except “00”. In the first place, “number” can be expressed by 4 bits, so there is no problem even if the first two digits “00” are not present. On the other hand, when it is recognized that the data is converted into 6-bit data bits, for example, the input data “2” is converted into “000010”.

  In step S304, the redundant bit insertion unit 13 refers to the definition rule from the definition table 122 and inserts the redundant bit into the data bit. For example, when the definition rule 2 is referred to, the redundant bit insertion unit 13 inserts redundant bits at intervals of 4 bits with respect to the data bits. On the other hand, when the definition rule 1 is referred to, the redundant bit insertion unit 13 inserts redundant bits at a cycle of 6 bits with respect to the data bits.

  In step S305, the redundancy bit insertion unit 13 adds a start bit to the beginning of the data bit in which the redundancy bit is inserted, and adds an end bit to the end. Thereby, a two-dimensional code is generated. In step S306, the two-dimensional code output unit 14 prints the generated two-dimensional code on the object.

  FIG. 7 is a diagram for explaining an example in which input data “GH” is converted into data bits according to the definition rule 1 in FIG. 6 to generate a two-dimensional code.

  When the data input unit 11 inputs the input data “GH” 701, the binarization processing unit 12 refers to the definition rule 1 “character” and “character” from the definition table 122, and each data “G” of the input data. , “H” is converted into 6-bit bit data. Therefore, the binarization processing unit 12 refers to the conversion table 121 and converts “G” to “010000” and “H” to “010001” (702 in FIG. 7). The binarization processing unit 12 generates bit data “010000010001” corresponding to “GH” by combining these bit data. The input data and the definition rule to be referenced may be linked by a method in which the definition rule to be referred to is specified by the user before the input data is input, or the input data and the definition rule are associated with each other. A table may be prepared separately.

  Next, the redundant bit insertion unit 13 recognizes that redundant bits are periodically inserted into the bit data at intervals of 6 bits by referring to the same definition rule 1. Therefore, the redundant bit insertion unit 13 inserts redundant bits between the head portion of the bit data “010000010001” and between “010000” and “010001”. Next, the redundant bit insertion unit 13 adds a start bit to the head part of the bit data after inserting the redundant bit and adds an end bit to the last part. Thereby, a two-dimensional code is generated (703 in FIG. 7). Note that (0) to (5) in the two-dimensional code indicated by reference numeral 703 in FIG. 7 indicate the arrangement position or arrangement order of the data bits. The same applies to FIG. 9, FIG. 11, FIG. 14, and FIG.

  FIG. 4 is a flowchart showing processing of the two-dimensional code reading device 2 according to the present embodiment. First, in step S401, the two-dimensional code reading unit 21 reads the two-dimensional code printed on the object. In step S <b> 402, the read image data of the entire two-dimensional code is developed on the RAM 202. In step S403, the data bit detection unit 22 refers to the definition rule from the definition table 122, and detects the number of data bits detected from the two-dimensional code. That is, for output data in which “number”, “number”, and “number” are defined in the definition rule 2, the data bit detection unit 22 recognizes that a data bit is detected every four bits from the two-dimensional code. To do. On the other hand, for output data in which “character” and “character” are defined in the definition rule 1, the data bit detection unit 22 recognizes that a data bit is detected every 6 bits from the two-dimensional code.

  In step S <b> 404, the data bit detection unit 22 detects start bits, redundancy bits, and end bits from the image data of the entire two-dimensional code developed on the RAM 202. In step S405, the data bit detection unit 22 detects a data bit from the two-dimensional code using the start bit, the redundancy bit, and the end bit. That is, the data bit detection unit 22 detects the beginning and end of the two-dimensional code from the start bit and the end bit, thereby grasping from where to where the two-dimensional code is. The data bit detection unit 22 detects the position of the redundant bit existing in the two-dimensional code, and detects the data bit existing between the redundant bits on the basis of the position. At that time, the data bit detection unit 22 detects the data bits on the assumption that the data bits existing between the redundant bits are the number of bits recognized from the definition rule.

  In the present embodiment, when the moving speed of the object on which the two-dimensional code is printed changes, or the reading speed of the two-dimensional code changes due to the changing moving speed of the two-dimensional code reader 2. However, the data bits of the two-dimensional code can be accurately read from the redundant bit positions. That is, the read image data of the two-dimensional code is developed once on the RAM 202, but when the reading speed is high, when it is developed on the RAM 202 with a size smaller than the actual data bits, or conversely, the reading speed is low, It is expanded on the RAM 202 with a size larger than the actual data bits. As a result, in the conventional method, a data bit expanded in a large size may be detected by a data bit having a larger number of bits than the actual number, and conversely, a data bit expanded in a small size has a smaller number of bits. May be detected by data bits. As described above, when data bits are read in a size different from the actual data bits of the two-dimensional code, erroneous recognition of the data bits may occur.

  On the other hand, in this embodiment, the position of the redundant bit is detected from the two-dimensional code developed on the RAM 202, and the bit of the predetermined number of bits (here, 4 or 6 bits) from where to where in the two-dimensional code. Since the data bit is detected after grasping whether it is data, erroneous recognition of the data bit can be avoided.

  Some redundant bits may be difficult to detect by themselves because of the relationship with adjacent data bits. On the other hand, in the present embodiment, the read two-dimensional code is once developed on the RAM 202, and then the redundant bit is detected. Therefore, if the detection of other redundant bits is successful to some extent, the position of redundant bits that are difficult to detect can be estimated using the periodicity of the arrangement pattern of the redundant bits. .

  In step S406, the data conversion unit 23 refers to the conversion table 121 and converts the data bits detected in step S405 into output data. In step S407, the data output unit 24 displays the output data on a display or the like.

  FIG. 8 is a diagram for explaining an example in which the data bits of the two-dimensional code 703 generated by the process described in FIG. 7 are converted into output data according to the definition rule 1 in FIG.

  When the two-dimensional code reading unit 21 reads the two-dimensional code 801 (703 in FIG. 7), all image data of the two-dimensional code is developed on the RAM 202. The data bit detection unit 22 refers to the definition rule 1 “character” and “character” from the definition table 122 and recognizes that a data bit is detected every 6 bits from the two-dimensional code. Note that the two-dimensional code and the definition rule to be referenced may be linked by a method in which the definition rule to be referenced is specified by the user before the two-dimensional code is read, or the two-dimensional code and the definition rule are associated. You may prepare the attached table separately.

  Next, the data bit detection unit 22 detects a start bit, a redundancy bit, and an end bit from the image data developed on the RAM 202. From the start bit and the end bit, it is possible to detect from where to where the two-dimensional code is. Further, the data bit detection unit 22 detects the position of the redundant bit from the two-dimensional code, and detects the data bit existing between the redundant bits. Reference numeral 802 in FIG. 8 denotes a bit pattern of all two-dimensional codes detected from the image data of the two-dimensional code 801 developed on the RAM 202. The start bit and the end bit each have a unique bit pattern. By detecting this bit arrangement, it is possible to grasp from where to where it is a two-dimensional code. In addition, redundant bits ("1", "0") are periodically arranged between the start bit and the end bit, and exist between the redundant bits by detecting these redundant bits. The data bits “010000” and “010001” are detected (803 in FIG. 8). The data conversion unit 23 refers to the conversion table 121 of FIG. 5 and converts the data bits “010000” and “010001” into output data “G” and “H”. The data output unit 24 outputs “GH” obtained by combining the output data generated by the data conversion unit 23 (804 in FIG. 8).

  FIG. 9 is a diagram for explaining an example in which input data “441” is converted into data bits according to the definition rule 2 in FIG. 6 to generate a two-dimensional code.

  When the data input unit 11 inputs input data “441” 901, the binarization processing unit 12 refers to the definition rule 2 of “number”, “number”, “number” from the definition table 122, and inputs data “4” It is recognized that “4” and “1” are converted into 4-bit bit data, respectively. Therefore, the binarization processing unit 12 refers to the conversion table 121 and converts “4” into “0100” and “1” into “0001” (902 in FIG. 9). The binarization processing unit 12 generates bit data “010001000001” corresponding to “441” by combining these bit data.

  Next, the redundant bit insertion unit 13 recognizes that redundant bits are periodically inserted into the bit data at intervals of 4 bits by referring to the same definition rule 2. Therefore, the redundant bit insertion unit 13 sets the redundant bit at the beginning of the bit data “010001000001”, between “0100” and “0100”, and between “0100” and “0001”. Insert. Next, the redundant bit insertion unit 13 adds a start bit to the head part of the bit data after inserting the redundant bit, and adds an end bit to the last part. As a result, a two-dimensional code is generated (903 in FIG. 9).

  FIG. 10 is a diagram for explaining an example in which the data bits of the two-dimensional code 903 generated by the processing described in FIG. 9 are converted into output data according to the definition table 2 in FIG.

  When the two-dimensional code reading unit 21 reads the two-dimensional code 1001 (903 in FIG. 9), all image data of the two-dimensional code is developed on the RAM 202. The data bit detection unit 22 refers to the definition rule 2 of “number”, “number”, and “number” from the definition table 122 and recognizes that a data bit is detected every 4 bits from the two-dimensional code. Next, the data bit detection unit 22 detects a start bit, a redundancy bit, and an end bit from the image data developed on the RAM 22. From the start bit and the end bit, it is possible to detect from where to where the two-dimensional code is. Further, the data bit detection unit 22 detects the position of the redundant bit from the two-dimensional code, and detects the data bit existing between the redundant bits. Reference numeral 1002 in FIG. 10 indicates a bit arrangement of all two-dimensional codes detected from the image data of the two-dimensional code 1001 developed on the RAM 202. As in the example of FIG. 8, by detecting the bit arrangement of the start bit and the end bit, it is possible to grasp from where to where is the two-dimensional code. Then, by detecting redundant bits (“1”, “0”) that periodically exist in the two-dimensional code, data of “0100”, “0100”, “0001” existing between the redundant bits is detected. A bit is detected (1003 in FIG. 10). The data conversion unit 23 refers to the conversion table 121 in FIG. 5 and converts the data bits “0100”, “0100”, and “0001” into output data “4”, “4”, and “1”. The data output unit 24 outputs “441” obtained by combining the output data generated by the data conversion unit 23 (1004 in FIG. 10).

  As described above, in this embodiment, when the structure of input data is “number”, “number”, “number”, the minimum number of bits that can represent “0” to “9” as input data. The data is converted into (4 bits) data bits. Thereby, it becomes possible to generate a two-dimensional code without using unnecessary data bits, and the size of the two-dimensional code can be reduced.

  In the above-described embodiment, the redundant bits are inserted into the data bits at intervals that divide each data bit according to the definition rule. However, as another embodiment, the redundant bits are always in a fixed number of bits. May be inserted. A specific example will be described with reference to FIGS.

  11 converts the input data “441” into data bits in accordance with the definition rule 2 in FIG. 6, and the redundant bit insertion unit 13 does not refer to the definition rule 2, and does not refer to the definition rule 2. It is a figure for demonstrating the example which inserts a redundant bit with respect to a data bit by a period.

  When the data input unit 11 inputs data “441” 1101, the binarization processing unit 12 refers to the definition rule 2 of “number”, “number”, “number” from the definition table 122, and inputs data “4”. , “4” and “1” are converted into 4-bit bit data, respectively. Therefore, the binarization processing unit 12 refers to the conversion table 121 and converts “4” into “0100” and “1” into “0001” (1102 in FIG. 11). The binarization processing unit 12 generates bit data “010001000001” corresponding to “441” by combining these bit data.

  Next, the redundant bit insertion unit 13 inserts redundant bits into the bit data at a cycle of 6 bits. That is, the redundant bit insertion unit 13 inserts redundant bits at the beginning of the bit data “010001000001” and between “010001” and “000001”. Next, the redundant bit insertion unit 13 adds a start bit to the head part of the bit data after inserting the redundant bit and adds an end bit to the last part. Thereby, a two-dimensional code is generated (1103 in FIG. 11).

  FIG. 12 is a diagram for explaining an example of converting data bits of the two-dimensional code 1103 generated by the processing described in FIG. 11 into output data according to the definition rule 2 in FIG.

  When the two-dimensional code reading unit 21 reads the two-dimensional code 1201 (1103 in FIG. 11), all image data of the two-dimensional code is developed on the RAM 202. The data bit detection unit 22 refers to the definition rule 2 of “number”, “number”, and “number” from the definition table 122 and recognizes that a data bit is detected every 4 bits from the two-dimensional code. Next, the data bit detection unit 22 detects a start bit, a redundancy bit, and an end bit from the image data developed on the RAM 22. The process up to detecting where the two-dimensional code is from the start bit and the end bit is the same as the processing described with reference to FIGS. In the present embodiment, it is assumed that the data bit detection unit 22 knows in advance that redundant bits are inserted at 6-bit intervals with respect to data bits. Further, the data bit detection unit 22 recognizes that the data bit is detected every 4 bits from the definition rule 2. Therefore, when the 6-bit data bit existing between the redundant bits is detected twice, the data bit detecting unit 22 detects three 4-bit data bits from the total 12-bit data bits detected twice. That is, when the data bit detection unit 22 detects “010001” and “000001” as 6-bit data bits existing between the redundant bits (1202 in FIG. 12), the data bit “010001000001” obtained by combining these is represented by 3 Then, “0100”, “0100”, and “0001” are detected (1203 in FIG. 12). The data conversion unit 23 refers to the conversion table 121 in FIG. 5 and converts the data bits “0100”, “0100”, and “0001” into output data “4”, “4”, and “1”. The data output unit 24 outputs “441” obtained by combining the output data generated by the data conversion unit 23 (1204 in FIG. 12).

  Next, examples of other definition rules applicable to the embodiment of the present invention will be described. In the definition rule described above, the same structure is always defined for input data and output data. However, in this embodiment, different structures are defined for input data and output data in the definition rule. That is, the definition rule of this embodiment defines a method for converting the structure of input data to output data.

  FIG. 13 is a diagram illustrating another example of the definition table 122. In this definition table 122, the definition rule 1 defines that input data having a structure of “characters” and “characters” is converted into output data having a structure of “numbers”, “numbers”, and “numbers”. Definition rule 2 defines that input data having a structure of “number”, “number”, and “number” is converted to output data having a structure of “character” and “character”. Hereinafter, an operation when the definition rule 1 of FIG. 13 is applied will be described.

  FIG. 14 is a diagram for explaining an example in which input data “GH” is converted into data bits according to the definition rule 1 in FIG. 13 to generate a two-dimensional code.

  When the data input unit 11 inputs input data “GH” 1401, the binarization processing unit 12 refers to the definition rule 1 “character” and “character” from the definition table 122 and inputs the input data “G”, “H”. It recognizes that “is converted into 6-bit bit data. Accordingly, the binarization processing unit 12 refers to the conversion table 121 and converts “G” into “010000” and “H” into “010001” (1402 in FIG. 14). The binarization processing unit 12 generates bit data “010000010001” corresponding to “GH” by combining these bit data.

  Next, the redundant bit insertion unit 13 recognizes that redundant bits are periodically inserted into the bit data at intervals of 6 bits by referring to the same definition rule 1. Therefore, the redundant bit insertion unit 13 inserts redundant bits between the head portion of the bit data “010000010001” and between “010000” and “010001”. Next, the redundancy bit insertion unit 13 adds a start bit to the beginning of the bit data after inserting the redundancy bit, and adds an end bit to the end. As a result, a two-dimensional code is generated (1403 in FIG. 14).

  FIG. 15 is a diagram for explaining an example of converting the data bits of the two-dimensional code 1403 generated by the processing described in FIG. 14 into output data according to the definition rule 1 in FIG.

  When the two-dimensional code reading unit 21 reads the two-dimensional code 1501 (1403 in FIG. 14), all image data of the two-dimensional code is developed on the RAM 202. The data bit detection unit 22 detects data bits every 4 bits from the two-dimensional code because “number”, “number”, and “number” are defined as output data in the definition rule 1 of the definition table 122. Recognize that. At the same time, the data bit detection unit 22 also defines “character” and “character” as input data in the definition rule 1 of the definition table 122, so the redundant bit insertion unit 13 of the two-dimensional code generation device 1. Recognizes that redundant bits are inserted at 6-bit intervals with respect to data bits. Next, the data bit detection unit 22 detects a start bit, a redundancy bit, and an end bit from the image data developed on the RAM 22. The data bit detection unit 22 detects from where to where the two-dimensional code is based on the start bit and the end bit.

  When the 6-bit data bit existing between the redundant bits is detected twice, the data bit detection unit 22 detects three 4-bit data bits from the total 12-bit data bits detected twice. That is, when the data bit detection unit 22 detects “010000” and “010001” as the 6-bit data bits existing between the redundant bits (1502 in FIG. 15), the data bit “010000010001” obtained by combining these is represented by 3 Then, “0100”, “0100”, and “0001” are detected (1503 in FIG. 15). The data conversion unit 23 refers to the conversion table 121 in FIG. 5 and converts the data bits “0100”, “0100”, and “0001” into output data “4”, “4”, and “1”. The data output unit 24 outputs “441” obtained by combining the output data generated by the data conversion unit 23 (1504 in FIG. 15).

  FIG. 16 is a diagram showing still another example of the definition table 122 and a processing example of generating a two-dimensional code from input data “AB012” according to the definition table 122 and reading the two-dimensional code. So far, the process of generating output data having the same data structure as the data bits read from the two-dimensional code has been described, but in the following, output data having a data structure different from the data bits read from the two-dimensional code is generated. Processing will be described.

  As shown in FIG. 16A, in the definition table 122 in this example, in the definition rule 1, “character (1)”, “character (2)”, “number (1)”, “number (2)” , The input data having the structure of “number (3)” is converted into the structure of “character (1)”, “number (1)”, “number (2)”, “number (3)”, “character (2)”. Is defined to be converted to output data.

  When the data input unit 11 inputs data “AB012” 1601, the binarization processing unit 12 reads “character (1)”, “character (2)”, “number (1)”, “number ( 2) ”and“ Numeric (3) ”with reference to definition rule 1 and converting input data“ A ”,“ B ”,“ 0 ”,“ 1 ”,“ 2 ”into 6-bit bit data, respectively. Recognize Therefore, the binarization processing unit 12 refers to the conversion table 121, “A” is “001010”, “B” is “001011”, “0” is “000000”, “1” is “000001”, “2” is converted to “000010” (1602 in FIG. 16). Thereafter, the redundancy bit insertion 13 inserts the redundancy bit, the start bit, and the end bit into the data bits by the same method, and a two-dimensional code is generated.

  When the two-dimensional code reading unit 21 reads the generated two-dimensional code, the data bit detection unit 22 uses “character (1)”, “character (2)”, “number (1)” as input data in the definition rule 1. ”,“ Number (2) ”,“ number (3) ”, and output data is“ character (1) ”,“ number (1) ”,“ number (2) ”,“ number (3) ”, Since it is defined as “character (2)”, after detecting data bits every 6 bits from the two-dimensional code, “character (2)” arranged second from the beginning is arranged last. The data bit is replaced with The data conversion unit 23 refers to the conversion table 121 of FIG. 5 and outputs the data bits “001010”, “000000”, “000001”, “000010”, “001011” after the replacement in this way to the output data “A012B”. To "". The data output unit 24 outputs the output data “A012B” generated by the data conversion unit 23 (1603 in FIG. 16). As described above, it is possible to generate output data “A012B” having a data structure different from that of the data bit “AB012” read from the two-dimensional code.

  In the processing example described above, the binarization processing unit 12 inputs the input data “A”, “B”, “0”, “1” based on the definition rule 1 of the definition table 122 in FIG. , “2” is converted into 6-bit bit data, and the redundant bit insertion unit 13 inserts redundant bits into the bit data at intervals of 6 bits, but is not limited thereto. . For example, the binarization processing unit 12 refers to the definition rule 1 of the definition table 122 in FIG. 16A to input data “A”, “B”, “0”, “1”, “2”. Are converted into 6-bit, 6-bit, 4-bit, 4-bit, and 4-bit data bits, respectively, and the redundancy bit insertion unit 13 applies 6-bit, 6-bit to the data bits generated by the binarization processing unit 12. Redundant bits may be inserted at 4-bit, 4-bit, 4-bit intervals. In this case, the data bit detector 22 refers to the definition rule 1 and recognizes that there are 6 bits, 6 bits, 4 bits, 4 bits, and 4 bits of data bits between the redundant bits. Then, the data bit is detected. Even with such a technique, erroneous recognition of data bits can be avoided even if the reading speed of the two-dimensional code changes.

  In the embodiment described above, for example, as shown in FIG. 7, two-dimensional with 2 bits in the width direction (vertical direction in the figure) and N (N is an arbitrary natural number) bits in the length direction (horizontal direction in the figure). A code is taken as an example, but a two-dimensional code applicable to the present invention is not limited to this form. That is, the width direction can also be configured with an arbitrary number of bits (M bits (M is an arbitrary natural number)).

  Further, the redundancy bit is not limited to the mode shown in the above embodiment. In the above embodiment, the redundant bit is a data bit in which two bits of “1” and “0” are adjacent in the length direction in a two-dimensional code having a width direction of 2 bits and a length direction of N bits. Are arranged so as to appear alternately at both ends, but other modes of redundant bits include the following. FIG. 17 is a diagram illustrating another mode of redundant bits. FIG. 17A shows an example of redundant bits arranged such that data bits in which two bits of “1” and “0” are adjacent in the width direction of the two-dimensional code appear in a period of 3 bits in the length direction. Is shown. FIG. 17 (b) shows that a data bit in which two bits of “1” and “0” are adjacent to each other at one end in the width direction of the two-dimensional code is also 3 bits in the length direction. The example of the redundancy bit arrange | positioned so that it may appear with the period of is shown.

  In the case of the redundant bits shown in FIG. 7, since redundant bits appear alternately at both ends in the width direction of the two-dimensional code, how many bits the width of the two-dimensional code is from the redundant bits existing at both ends. I can grasp it. In the case of the redundant bits shown in FIG. 17A, the bits are arranged over all the bits in the width direction of the two-dimensional code. Therefore, if one redundant bit is detected, it is possible to grasp how many bits the width of the two-dimensional code is. In this way, when the redundant bits shown in FIGS. 7 and 17A are employed, it is possible to know how many bits the width of the two-dimensional code is, so in practice, there are more data bits in the width direction. It is possible to avoid misrecognition of data bits, such as being present as being present but not present. On the other hand, the redundant bits shown in FIG. 17B are not suitable for preventing erroneous recognition of data bits in the width direction as in the redundant bits shown in FIGS. 7 and 17A. In the direction, erroneous recognition of data bits can be prevented. As described above, the redundancy bits applicable to the present invention include various forms, and are not limited to those exemplified above.

  In the above-described embodiment, the data bit and the redundancy bit are expressed by binary bits of “0” and “1”, but the present invention is not limited to this. That is, the data bits and the redundant bits may be expressed in grayscale or color having three or more values. In this case, the two-dimensional code is read, the image data is developed on the RAM 202, the image data is subjected to image processing, multilevel values are recognized, and then converted from data bits to output data using a conversion table. Processing will be performed. Further, the redundant bits are not limited to 2 bits as in the above-described embodiment, and may be expressed by a number of bits larger than that.

  Also, a check digit is added immediately before the end bit of the two-dimensional code, the value of all data bits and the value of the check digit are added, and 0 × F is obtained when the remainder is taken as 0 × F. Accordingly, it may be determined (error detection) whether or not the data bits can be read accurately. If it is determined that the data bit cannot be read correctly, the reading process is performed again. Further, when converting input data into data bits, error correction may be performed using a known Reed-Solomon encoding technique.

  In the above-described embodiment, rectangular redundancy bits and data bits are arranged in a two-dimensional code. However, the shape of the redundancy bits and data bits is not limited to this, and for example, circular redundancy bits and data bits. Bits may be used as long as they are common to all bits. As a result, it is possible to solve the problem that the data is expressed by thin lines like a one-dimensional bar code and is not easily displayed by ink-jet printing as it is vulnerable to linear stains. .

  1: two-dimensional code generator, 2: two-dimensional code reader, 11: data input unit, 12: binarization processing unit, 13: redundant bit insertion unit, 14: two-dimensional code output unit, 21: two-dimensional Code reading unit, 22: data bit detection unit, 23: data conversion unit, 24: data output unit, 121: conversion table, 122: definition table

Claims (14)

The marks Goka data a two-dimensional code generating device for generating a two-dimensional code arranged as a pattern on a two-dimensional matrix,
With respect to the encoded data, adjacent and redundant data including at least two data values are inverted periodically inserted at intervals classified in each encoded data, a start bit and two-dimensional code generating apparatus characterized by having a two-dimensional code generation means to generate the two-dimensional code added to the end bit. The said two-dimensional code production | generation means arrange | positions the said redundant data so that it may appear alternately at the both ends of the width direction of the said two-dimensional code in the length direction of the said two-dimensional code. The two-dimensional code generation device described. 3. The two-dimensional code generation device according to claim 1, wherein the two-dimensional code generation unit generates a two-dimensional code in which the data is arranged in a shape common to all but a thin line . A two-dimensional code reader for reading a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix,
Reading means for reading the two-dimensional code by detecting a start bit and an end bit;
In the two-dimensional code, the redundant data including at least two adjacent data that are periodically inserted at intervals divided for each encoded data with respect to the encoded data and whose values are inverted is used as a reference. Detecting means for detecting the encoded data divided by the redundant data from the two-dimensional code;
It said detection means by said detected encoded two-dimensional code reader you characterized by chromatic and decoding means for decoding data. Further comprising expansion means for expanding the two-dimensional code read by the reading means on a memory;
5. The two-dimensional code reader according to claim 4 , wherein the detection unit detects the redundant data from the two-dimensional code developed on the memory . The encoded data is a two-dimensional code arranged as a pattern on a two-dimensional matrix,
With respect to the encoded data, adjacent and redundant data including at least two data values are inverted are periodically inserted, characterized in that the start bit and end bit are added two dimension code. It said redundancy data, two-dimensional code according to claim 6, characterized in that it is inserted at intervals classified for each of the encoded data. The two-dimensional data according to claim 6 or 7, wherein the redundant data is arranged so as to alternately appear at both ends in the width direction of the two-dimensional code in the length direction of the two-dimensional code. code. The two-dimensional code according to any one of claims 6 to 8, wherein the encoded data is arranged in a shape common to all except a thin line . The two-dimensional code according to claim 6, wherein the encoded data is binary data or ternary or higher data . A two-dimensional code generation method for generating a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix,
Redundant data including at least two pieces of data that are adjacent to each other and whose values are inverted is periodically inserted into the encoded data at intervals that are divided for each encoded data, and a start bit and an end bit two-dimensional code generation how to comprising a two-dimensional code generating step of generating the two-dimensional code added. A two-dimensional code reading method for reading a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix,
A reading step of reading the two-dimensional code by detecting a start bit and an end bit;
In the two-dimensional code, the redundant data including at least two adjacent data that are periodically inserted at intervals divided for each encoded data with respect to the encoded data and whose values are inverted is used as a reference. And detecting the encoded data segmented by the redundant data from the two-dimensional code,
Two-dimensional code reading how to; and a decoding step of decoding the encoded data detected by the detecting step. A program for causing a computer to execute a two-dimensional code generation method for generating a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix,
Redundant data including at least two pieces of data that are adjacent to each other and whose values are inverted is periodically inserted into the encoded data at intervals that are divided for each encoded data, and a start bit and an end bit A program for causing a computer to execute a two-dimensional code generation step for generating the two-dimensional code to which is added . A program for causing a computer to execute a two-dimensional code reading method for reading a two-dimensional code in which encoded data is arranged as a pattern on a two-dimensional matrix,
A reading step of reading the two-dimensional code by detecting a start bit and an end bit;
In the two-dimensional code, the redundant data including at least two adjacent data that are periodically inserted at intervals divided for each encoded data with respect to the encoded data and whose values are inverted is used as a reference. And detecting the encoded data segmented by the redundant data from the two-dimensional code,
A program for causing a computer to execute a decoding step of decoding the encoded data detected by the detection step .

Images