CN108073966B - A kind of conversion method of two-dimensional code and hole array code - Google Patents

Abstract

The invention relates to the technical field of product production, and discloses a conversion method of a two-dimensional code and a hole array code. When the m×m size is greater than the preset threshold, the conversion method is as follows: first convert the m×m size QR code into the m×m size binary table, then divide it into at least two binary table parts from the whole, and then convert Each part is converted into the corresponding hole-array code local map, and finally all the hole-array code local maps are combined into a complete hole-array code map, and the hole-array code is formed accordingly. When the m×m size is not greater than the preset threshold, the conversion method is: first convert the m×m size QR code into m×m size binary table, then convert it into m×1 size decimal table, then Convert the decimal table of m×1 size to the hole array code map of m×1 size, and form the hole array code accordingly. The embodiment of the present invention can convert a two-dimensional code into a hole array code with a smaller number of holes, which greatly reduces the processing workload, reduces the processing cost, and improves the work efficiency.

Description

A kind of conversion method of two-dimensional code and hole array code

technical field

The invention relates to the technical field of product production, in particular to a conversion method of a two-dimensional code and a hole array code.

Background technique

Tracing the cause of product problems is a serious challenge for manufacturers in every industry, from automotive to aerospace, from medical to food. In an era of globalization, companies pursue relationship management to maximize customer satisfaction. Consumption and environmental regulations are becoming more stringent, so traceability becomes even more necessary.

More than ever, manufacturers are seeking to maximize production capacity and reduce costs. To achieve this, every step in the entire manufacturing process must be monitored and a complete history maintained. Issues affecting product quality must be quickly identified and corrected to prevent defective product from continuing down the production line, with the ultimate goal of minimizing product returns. In the electronics industry, PCB production also needs to meet customer requirements for traceability. When problems are found, customers want to quickly locate the cause of the problem and the affected product range.

At present, in the production process of various products (such as multi-layer PCB, FPC), the factory generally directly uses the two-dimensional code as an information carrier to spray on the board surface, and in each process, the two-dimensional code information is read by a scanning gun and Add new processing information to the QR code. However, this method of using the two-dimensional code as a traceability mark has the defect that it is easily affected by various factors and is difficult to identify. Therefore, the two-dimensional code can be converted into a hole array code as a traceability mark to overcome this defect. The number of holes contained in the array code greatly affects the processing workload and processing efficiency. Therefore, how to convert the two-dimensional code into a hole array code with a smaller number of holes is an urgent problem to be solved at present.

SUMMARY OF THE INVENTION

The purpose of the present invention is to provide a conversion method between a two-dimensional code and a hole array code, which converts the two-dimensional code into a hole array code with fewer holes, reduces the processing workload, and improves the work efficiency.

For this purpose, the present invention adopts the following technical solutions:

A conversion method of a two-dimensional code and a hole array code, wherein the size of the two-dimensional code is m×m, and when the m×m size is greater than a preset threshold, the conversion method is:

Converting the two-dimensional code of the m×m specification into a dot matrix code of the m×m specification, and then converted into a binary table of the m×m specification;

dividing the binary table of m×m specification into at least two binary table parts from the whole;

Convert each binary table part into the corresponding hole array code local map;

Combine all the obtained partial maps of hole array codes into a complete hole array code map;

A hole array code is formed on the product according to the hole array code map.

Optionally, the method for dividing the binary table of m×m size into at least two binary table parts from the whole includes:

孔阵码区域尺寸L₁×L₂以及所述二维码的规格 m×m；所述L₁为长度、L₂为宽度；Get the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ and the specification m×m of the two-dimensional code; the L ₁ is the length, and the L ₂ is the width;

计算得出组合列数n；According to the formula

Calculate the number of combined columns n;

According to the formula x=[m/n], get the equal fraction x;

The binary table of m×m size is divided into x parts in a manner that the number of columns for each combination is n.

Optionally, the method for dividing the binary table of m×m size into at least two binary table parts from the whole includes:

孔阵码区域尺寸L₁×L₂以及所述二维码的规格 m×m；所述L₁为长度、L₂为宽度；Get the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ and the specification m×m of the two-dimensional code; the L ₁ is the length, and the L ₂ is the width;

计算得出组合列数n的最大值n_max；According to the formula

Calculate the maximum value n _max of the number of combined columns n;

According to the formula x _min =[m/n _max ], obtain the minimum value x _min of the equal fraction x;

The binary table of m×m specification is divided into x _min parts in a manner that the number of columns in each combination is n _max .

Optionally, the method for dividing the binary table of m×m size into at least two binary table parts from the whole further includes: dividing the binary table of m×m size according to the number of columns of each combination being n _max . When the method is divided into x _min parts, the reversed sum of the equal division values is minimized.

Optionally, after dividing the binary table of m×m size into x parts according to the way that each combined column number is n, if the equal value is 1, then convert the corresponding binary table part into hole array code. Holes are generated using the Columns on the corresponding side in the partial drawing.

Optionally, when the m×m=18×18, the binary table of the m×m specification is divided into five binary table parts from the whole, and the specifications of each part are: 18×4, 18×4, 18×4, 18×4 and 18×2.

Optionally, the method for converting each binary table part into a corresponding hole array code local map includes:

Convert the data in each binary table part into decimal data and divide by 2 ⁿ , so that each number in the table is less than 1, and obtain a hole array code table of m×1 specification;

Draw a hole array code diagram according to the hole array code table of m×1 specification.

Optionally, when the m×m specification is not greater than a preset threshold, the conversion method is:

The two-dimensional code of m×m size is first converted into a dot matrix code of m×m size, and then converted into a binary table of m×m size, where m×m is smaller than a preset value.

Convert a binary table of m×m size to a decimal table of m×1 size.

Convert the decimal table of m×1 specification into a hole array code map of m×1 specification, and then form a hole array code on the product according to the hole array code map.

Optionally, the method for converting a decimal table of m×1 size into a hole array code map of m×1 size includes:

Divide each data in the decimal table of m×1 specification by 2 ^m , so that each number in the table is less than 1, and obtain the hole array code table of m×1 specification;

Draw a hole array code diagram according to the hole array code table of m×1 specification.

Optionally, the two-dimensional code includes a row-type two-dimensional code and a matrix-type two-dimensional code.

Compared with the prior art, the embodiment of the present invention has the following beneficial effects: the embodiment of the present invention can convert the two-dimensional code into a hole array code with a smaller number of holes, greatly reducing the processing workload, reducing the processing cost, and improving the work efficiency .

Description of drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention, and for those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort.

Fig. 1 is an example diagram of a QR two-dimensional code in the prior art;

Fig. 2 is a DM two-dimensional code example diagram in the prior art;

Fig. 3 is the lattice code obtained by conversion of the QR two-dimensional code shown in Fig. 1;

Fig. 4 is the lattice code obtained by the conversion of DM two-dimensional code shown in Fig. 2;

Fig. 5 is a 3×3 bitmap converted from the 3×3 binary table shown in Table 1;

Fig. 6 is a 4×4 bitmap converted from the 4×4 binary table shown in Table 2;

7 is a flowchart of a method for converting a two-dimensional code with a size not greater than a preset threshold to a hole array code provided by an embodiment of the present invention;

FIG. 8 is a hole array code diagram drawn by the 4×1 hole array code table shown in Table 4;

9 is a flowchart of a method for converting a two-dimensional code with a specification greater than a preset threshold to a hole array code provided by an embodiment of the present invention;

Figure 10 is an 18×18 two-dimensional code array diagram;

Fig. 11 is a hole array code diagram obtained by converting the 18×18 two-dimensional code shown in Fig. 10;

Fig. 12 is the hole array code obtained according to the hole array code diagram shown in Fig. 11;

Figure 13 is a 21×21 bitmap generated according to the binary table shown in Table 5;

Fig. 14 is the hole array code diagram obtained according to table 6 conversion;

FIG. 15 is a hole array code obtained according to the hole array code diagram shown in FIG. 14 .

Detailed ways

In order to make the purpose, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the following The described embodiments are only some, but not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

The technical solutions of the present invention will be further described below with reference to the accompanying drawings and through specific embodiments.

(1) Introduction to QR code technology

Two-dimensional code is an information identification technology developed by combining three technologies of computer, communication and photoelectric sensing. It is a black and white geometric figure arranged according to certain rules. The black and white positions in the figure correspond to "1" and "0" respectively, thus forming a binary character sequence, which can represent numbers, characters and other information. According to different coding principles, there are two types of two-dimensional code: row-type two-dimensional code and matrix-type two-dimensional code.

Row-type two-dimensional codes are formed by combining one-dimensional codes into multiple lines according to certain rules. Due to the relationship between the row-type two-dimensional code and the one-dimensional code, the two have the same encoding principle, but the encoding rule of the row-type two-dimensional code is different from that of the one-dimensional code, so the decoding algorithm is also different.

Matrix-type two-dimensional barcodes achieve the effect of encoding through the distribution of dark and light color pixels in a matrix. In the encoding, binary "1" is represented by dark pixels, and binary "0" is represented by light pixels. Indicates that in the end all pixels form a rectangular figure, and the position distribution of the pixels represents the content contained in the matrix QR code. Commonly used code systems for matrix QR codes include QR Code, Maxi Code, Data Matrix, etc. In the PCB industry, two-dimensional codes are also widely used, and the Data Matrix code system is mainly used.

(2) Introduction to hole array code

Different from the matrix two-dimensional code, which uses the combination of dark and light color blocks to mark information, the hole array code marks the information to be recorded by combining the position information of multiple small holes within a specified area.

(3) QR code storage information mechanism

Matrix-type two-dimensional code is a symbol system for automatic identification and processing of graphic symbols, usually with error correction function. Among them, the representative matrix two-dimensional codes are QR codes, DM codes and so on.

As shown in Figure 1, the QR Code is a square, generally black and white. It consists of two parts: coding area and function graphics. The coding area is responsible for storing data coding information. The function graphics is used to define fixed-format information such as version information and format information. All functional graphics areas are surrounded by blank areas to distinguish them from the coding area. . QR Code QR code model 1 is the earliest QRCode QR code produced. The highest version is 14 (73X73 code element), which can process up to 1167 digits. QR Code QR Code Model 2 is an improved version of Model 1, the highest version is 40 (177X177 symbols), and can handle up to 7089 digits. It can also read the data smoothly even if the QR code is deformed. When the QR code is printed on a curved surface, or the QR code is deformed due to the reading angle and other reasons, it can still be effectively read through the alignment mode set inside the QR code.

There are 1 to 40 versions of QR Code symbols, representing 40 specifications respectively. Each version symbol is increased by 4 modules on each side of the previous version, that is, the specification of version 1 is 21 modules × 21 modules, the version 2 is 25 modules × 25 modules, ..., the specifications of version 40 are 177 modules × 177 modules.

As shown in Figure 2, Data Matrix code (referred to as DM code) is one of the earliest two-dimensional codes. It is the smallest of all barcodes at present. It is especially suitable for the identification of small parts. It is directly printed on the product entity for reading. Widely used in industrial serial number management and product finalization and other fields.

The DM code is a two-dimensional matrix image, consisting of nominally square modules, a finder pattern L boundary and an alternating pattern module. Unlike the QR code, the DM code does not have a 7*7 module. Position detection graphics and 3*3 module correction patterns are smaller than QR codes and can be easily marked on small parts.

capacity:

(1) Numerical data: 3,116 characters;

(2) Alphabet data: 235 characters;

(3) 8-bit byte data: 1,556 characters;

(4) Chinese character data: not supported.

The DM code has strong error correction performance, and only needs to read 20% of the data to correctly identify the data. It should be noted that when the number of modules exceeds 255, the DM code will be split, and the code will be split by switching the mode, which has a high recognition rate.

No matter which code system the QR code uses to encode, what is really needed is the information stored in it. Although the appearances of Figure 1 and Figure 2 are different, the information finally read from the two QR codes are the same four words. For the two-dimensional code shown in Figure 1 and Figure 2, it can be converted into a two-dimensional code in dot form, as shown in Figure 3 and Figure 4, respectively.

Compared with the original square-shaped QR code on the product (such as PCB board and FPC board), it will be more efficient and reliable to print the dot-shaped code on the product. However, the above-mentioned dot matrix code still has a large number of dots, and it is not the best choice to process this kind of dot matrix code. Therefore, this embodiment will propose a form of hole matrix code to replace the dot matrix code.

First of all, it is necessary to know how the dot matrix code stores information. The dot matrix code is encoded by binary numbers and finally converted into a two-dimensional code. The principle is as follows. Generally speaking, the specifications of QR codes are relatively large, such as 16×16 and 18×18, which are commonly used. However, in order to illustrate the principle, we may use the specifications of 3×3 and 4×4.

The dot matrix code of 3×3 specification can be understood as follows: as shown in Table 1 below, Table 1 is a table of 3×3 specification, which stores some binary information, and can be imaged for these binary information, among which For "1", it can be represented by a dark dot, and for "0", it can be represented by a blank. Therefore, Table 1 can be converted into a bitmap, the shape of which is shown in Figure 5.

0 0 1 1 1 0 1 0 1

Table 1

As can be seen from Figure 6, the part with data 1 in Table 1 is represented by black dots, and the part with data 0 is represented by hollow dots, so that the information in Table 1 is transformed into the image in Figure 5, from the digital To images, although they look different, the information they store is the same.

The dot matrix code of 4×4 specification can be understood as follows: First, randomly select a binary table of 4×4 specification, as shown in Table 2 below; ” is blank to convert, and Figure 6 can be obtained.

1 0 1 0 0 1 0 1 1 0 0 1 1 1 0 0

Table 2

It can be seen from the above analysis that for each table storing binary information, a bitmap can be found corresponding to it. In addition, according to the knowledge of the combination, it can be known that the larger the size of the binary table, the more information it can store, but the more points of the corresponding bitmap. For QR codes, the size of 21×21 is the minimum size, which means that each minimum size bitmap has 441 dots, while the size of the QR code in version 40 today is 177×177, which means that one A 177×177 two-dimensional code requires 31329 points, which is very inconvenient for industrial applications. Therefore, this embodiment proposes a set of coding rules to convert the dot matrix code into a hole matrix code to greatly reduce the number of holes.

(4) Encoding rules for QR code to hole array code

This embodiment proposes a method for converting a two-dimensional code and a hole array code, including: a method for converting two-dimensional codes whose specifications are not greater than a preset threshold, and a method for converting two-dimensional codes whose specifications are greater than a preset threshold.

(1) For the two-dimensional code whose specification is not greater than the preset threshold, the conversion method between it and the hole array code is shown in Figure 7, including:

Step 101: Convert the two-dimensional code of m×m size into a dot matrix code of m×m size, and then convert it into a binary table of m×m size, where m×m is smaller than a preset value.

Step 102 , convert the binary table of m×m size into a decimal table of m×1 size.

Step 103: Divide each data in the m×1 decimal table by 2 ^m so that each number in the table is less than 1, and obtain the m×1 hole array code table.

Step 104 , drawing a hole array code diagram according to the hole array code table of m×1 specification.

Step 105 , forming a hole array code on the product according to the hole array code map.

The following will take a 4×4 QR code as an example to illustrate the specific conversion method:

For the 4×4 QR code, still take Figure 6 as an example. For Figure 6, it can be converted first to the 4×4 binary table shown in Table 2, and then to the 4×1 decimal table shown in Table 3:

10 5 9 12

table 3

In this way, the 4×4 two-dimensional code is converted into a 4×1 decimal table. In order to convert this information into the required achievable hole array code, the following conversion is continued: each data in the 4×1 table Divide by 2 ⁴ , which gives Table 4, where every number in Table 4 is less than 1.

Table 4

For this table 4, it can be converted into a hole array code map as shown in Figure 8: by converting each data into the ratio of point positions in one row, 4 columns can be converted into one column of point storage information, if the number of columns increases , which can greatly improve the efficiency of characterizing the two-dimensional code.

(II) For the two-dimensional code whose specification is greater than the preset threshold, the conversion method between it and the hole array code is shown in Figure 9, including:

Step 201: Convert the two-dimensional code of m×m size into a dot matrix code of m×m size, and then convert it into a binary table of m×m size.

Step 202: Divide the binary table of m×m size into at least two binary table parts from the whole, and the size of each binary table part is smaller than the m×m size;

Step 203: Convert each binary table part into a corresponding hole-array code local map to obtain at least two hole-array code local maps.

Step 204: Combine all the obtained partial maps of the hole array code into a complete map of the hole array code.

Step 205 , forming a hole array code on the product according to the hole array code map.

In order to minimize the number of holes in the finally formed hole array code, the method for dividing the binary table of m×m size in step 202 includes:

孔阵码区域尺寸L₁×L₂(L₁为长度，L₂为宽度)以及二维码规格m×m；其中，孔阵码区域尺寸一般为5mm×5mm或者4mm×4mm；First, get the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ (L ₁ is the length, L ₂ is the width) and the size of the two-dimensional code m×m; the size of the hole array code area is generally 5mm×5mm or 4mm×4mm;

计算得出组合列数n的可取值；Then, according to the formula

Calculate the possible value of the number of combination columns n;

Finally, according to the formula x=[m/n], the equal fraction x of the binary table division of the m×m specification is obtained.

In the above division method, n may have multiple values, so that the equal fraction x may also have multiple values, that is, there are multiple division methods. However, the larger the aliquot x, the more holes need to be machined, so the optimal aliquot x=[m/n _max ].

In step 203, the method for converting each binary table part into a corresponding hole array code local map is as follows:

First convert the data in each binary table part into decimal data and divide by 2 ⁿ , so that each number in the table is less than 1, and obtain the hole array code table of m×1 specification;

Then draw the hole array code diagram according to the hole array code table of m×1 specification.

The following will take the 18×18 and 21×21 QR codes commonly used in the PCB industry as examples to illustrate.

①18×18 QR code to hole array code

Taking the 18×18 two-dimensional code array diagram shown in FIG. 10 as an example, it is clear before the conversion that the requirements for converting 18×18 into an 18×1 hole array diagram are very high. If it is converted into 18×1 hole array code, the machining accuracy of the machine should be less than or equal to 238nm, which is far beyond the level that the current machine can actually process. To this end, this embodiment will convert it. It can be considered to divide 18×18 into small parts such as 18×4 or 18×5, and then convert such small parts into local maps of hole array codes respectively. Then this embodiment adopts the following calculation method:

First, get the following parameters:

a. The punching accuracy of the machine

b. The size of the hole array code area L ₁ ×L ₂ ;

c. The size of the QR code is m×m, which is 18×18.

For the punching accuracy, the calculation method can be as follows: For the conversion of n columns of data into one column of data, the minimum unit of measurement e ^* is:

Then the punching accuracy of the machine should meet:

In this way, when the punching precision of the machine is given, according to the width L ₂ of the two-dimensional code area, n _max can be obtained by formula 2, and finally the optimal solution can be obtained according to n _max . The calculation process is as follows:

L₁×L₂＝4mm×4mm。由于n为整数，反解较为困难，可以将n从小到大代入到式2，取满足条件的最大值，可以得到 n_max＝4，于是可以将二维码数据分为x＝[18/4]＝5等份。而等分数x越大，需要加工的孔数就会相应增加，比如如果分成6份，那么需要增加18个孔，因此，在满足精度要求尽可能小、孔数尽可能少的约束条件下，可以得到最佳方案，即将18×18分为18×4，18×4，18×4，18×4，18×2。Assuming a given machine accuracy

L ₁ ×L ₂ =4mm×4mm. Since n is an integer, the inverse solution is difficult. You can substitute n into Equation 2 from small to large, and take the maximum value that satisfies the conditions, you can get n _max =4, so the two-dimensional code data can be divided into x=[18/4 ] = 5 aliquots. And the larger the equal fraction x is, the number of holes to be processed will increase accordingly. For example, if it is divided into 6 parts, then 18 holes need to be added. Therefore, under the constraints that the accuracy requirements are as small as possible and the number of holes are as small as possible, The best solution can be obtained, that is, 18×18 is divided into 18×4, 18×4, 18×4, 18×4, 18×2.

Then, the hole array code diagram shown in Figure 11 can be obtained after conversion processing and merging, and the final hole array code can be obtained by removing the line decoration in the hole array code diagram. As shown in Figure 12, the picture has a total of 93 holes. Including 90 data holes and 3 positioning holes; while the original two-dimensional code data has a total of 414 holes, obviously, this will greatly reduce the processing volume.

②21×21 QR code to hole array code

First, a QR code is randomly generated, and its corresponding 21×21 binary table is shown in Table 5 below.

0 0 0 0 1 0 0 0 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 1 0 1 1 0 1 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 1 1 1 1 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 0 0 0 1 1 0 0 0 1 1 0 1 1 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 1 0 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 1 1 0 0 1 1 1 1 1 0 0 1 1 0 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 0 0 1 0 0 0 1 1 0 1 1 1 0 1 1 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 1 1 0 1 0 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 0 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 1 1 1 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 1 0 0 1 0 1 1 1 0 0 1 1 1 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 1 0 1 0 1 0 1 1 1 1 1 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 0

table 5

Then, a bitmap of the 21×21 specification as shown in Figure 13 is generated through the table 5. It is unrealistic to convert the bitmap of this specification into a hole matrix code of the 21×1 specification, so this example is the same The calculation is carried out according to the calculation method of the 18×18 specification, and the process is as follows:

即15.625um，L₂＝5mm，那么可以一步步代入式2计算得到n_max＝5。因此，对21×21的二维码，最少需要将21列数据分成[21/5]＝5份，于是可以将21×21规格的二维码分为以下几部分：Assuming the punching accuracy of the machine

That is, 15.625um, L ₂ =5mm, then n _max =5 can be calculated by substituting into Equation 2 step by step. Therefore, for the 21×21 QR code, at least 21 columns of data need to be divided into [21/5]=5 parts, so the 21×21 QR code can be divided into the following parts:

(1) 21×5, 21×5, 21×5, 21×5, 21×1;

Or, (2) 21×5, 21×4, 21×4, 21×4, 21×4;

Or, (3) 21×5, 21×5, 21×4, 21×4, 21×3;

and many more.

Obviously, the machining requirements of 21×5, 21×4 and 21×3 require decreasing precision. In actual operation, first of all, it is necessary to reduce the number of machined holes as much as possible under the premise of satisfying the drilling accuracy of the machine, and secondly, to reduce the number of holes with high precision requirements as much as possible. The principle of least judgment is used to determine the best solution. In the above three division schemes, the distribution of the number of holes required by the precision can be evaluated by the reverse order number (every two numbers in the sequence are compared, and the number of two unequal sequences is added by 1). The above schemes (5, 5, 5, 5, 1), (5, 4, 4, 4, 4), (5, 5, 4, 4, 3) and other sequence inverse numbers are 4, 4, and 8 respectively, but the number of 21×5 in scheme (1) is greater than Scheme (2), so scheme (2) is the best scheme among the above three division schemes.

For 21×1 data that only converts one column, you can use the left vertical column to punch 5 holes to represent the data. According to the above rules, the 21×21 QR code data can be converted into the following table 6:

0 6 13 twenty three 11 twenty one 1 11 31 11 1 16 20 1 6 twenty three 1 10 10 4 twenty four twenty three 1 15 13 1 29 15 31 twenty four 14 6 30 25 12 18 6 29 11 2 twenty four 4 1 9 twenty two 12 19 14 16 27 twenty four 10 12 20 18 18 25 2 5 11 0 0 19 29 2 8 9 17 31 0 3 26 twenty one 4 17 20 19 7 3 14 8 26 3 13 14 18 15 4 6

Table 6

Divide the data in Table 6 by 25, and finally convert it into the hole array code map shown in Figure 14. After removing the lines, the final hole array code can be obtained, as shown in Figure 15.

Compared with the 441 holes in the 21×21 size two-dimensional map, the figure 15 only needs 113 holes, including 110 data holes and 3 positioning holes, which greatly improves the production efficiency.

孔阵码区域尺寸L₁×L₂(L₁为长度，L₂为宽度)以及二维码规格m×m；In summary, before the conversion, the following information is required: the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ (L ₁ is the length, L ₂ is the width) and the QR code specification m×m;

Then, the number of combination columns n is calculated according to formula 2, and the equal fraction x is calculated by using the number of combination columns n, and finally a variety of combinations that meet the above conditions are obtained; the optimal solution should be as follows: in order to ensure the minimum number of machining holes, this The equal fraction x is required to be equal to [m/n _max ]; on the basis of the minimum number of processed holes, the number of holes required to ensure high precision is as small as possible, so the equal fraction values (such as 5, 5, 1, 1) are required to be in reverse order The sum is the smallest. In addition, if the equal value is 1, use the left column line to punch holes, which can reduce one column of holes.

As mentioned above, the above embodiments are only used to illustrate the technical solutions of the present invention, but not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand: The technical solutions described in the embodiments are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions in the embodiments of the present invention.

Claims (10)

1. a conversion method of two-dimensional code and hole array code, the specification of described two-dimensional code is m × m, it is characterized in that, when described m × m specification is greater than preset threshold, described conversion method is: converting the two-dimensional code of the m×m specification into a dot matrix code of the m×m specification, and then converted into a binary table of the m×m specification; dividing the binary table of m×m specification into at least two binary table parts from the whole; Convert each binary table part into the corresponding hole array code local map; Combine all the obtained partial maps of hole array codes into a complete hole array code map; A hole array code is formed on the product according to the hole array code map. 2. The method for converting a two-dimensional code and a hole array code according to claim 1, wherein the method for dividing the binary table of the m×m specification into at least two binary table parts as a whole comprises: Get the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ and the specification m×m of the two-dimensional code; the L ₁ is the length, and the L ₂ is the width; According to the formula

Calculate the number of combined columns n; According to the formula x=[m/n], get the equal fraction x; Divide the binary table of m×m size into x parts in a manner that the number of columns for each combination is n. 3. The method for converting a two-dimensional code and a hole array code according to claim 1, wherein the method for dividing the binary table of the m×m specification into at least two binary table parts as a whole comprises: Get the punching accuracy of the machine

The size of the hole array code area L ₁ ×L ₂ and the specification m×m of the two-dimensional code; the L ₁ is the length, and the L ₂ is the width; According to the formula

Calculate the maximum value n _max of the number of combined columns n; According to the formula x _min =[m/n _max ], obtain the minimum value x _min of the equal fraction x; The binary table of m×m specification is divided into x _min parts in a manner that the number of columns in each combination is n _max . 4. The method for converting a two-dimensional code and a hole-array code according to claim 3, wherein the method for dividing the binary table of the m×m specification into at least two binary table parts as a whole further comprises: When dividing the binary table of m×m size into x _min parts in a manner that the number of combined columns for each part is n _max , the reversed sum of the equal division values is minimized. 5. The conversion method of two-dimensional code and hole array code according to claim 2, is characterized in that, after the binary table of described m×m specification is divided into x parts according to the mode that each combined column number is n , if the equivalence value is 1, the column lines on the corresponding side are used to generate holes when the corresponding binary table part is converted into a local map of hole array codes. 6 . The method for converting a two-dimensional code and a hole array code according to claim 3 , wherein when the m×m=18×18, the binary table of the m×m specification is divided into five parts from the whole. 7 . A binary table part, the specifications of each part are: 18 × 4, 18 × 4, 18 × 4, 18 × 4 and 18 × 2. 7. The conversion method of two-dimensional code and hole array code according to claim 2, is characterized in that, the described method that each binary table part is converted into corresponding hole array code partial map respectively comprises: Convert the data in each binary table part into decimal data and divide by 2 ⁿ , so that each number in the table is less than 1, and obtain a hole array code table of m×1 specification; Draw a hole array code diagram according to the hole array code table of m×1 specification. 8. The conversion method of two-dimensional code and hole array code according to claim 1, wherein, when the m×m specification is not greater than a preset threshold, the conversion method is: Converting the two-dimensional code of m×m size into a dot matrix code of m×m size first, and then converting it into a binary table of m×m size, where m×m is smaller than a preset value; Convert the binary table of m×m size to the decimal table of m×1 size; Convert the decimal table of m×1 specification into a hole array code map of m×1 specification, and then form a hole array code on the product according to the hole array code map. 9. The method for converting a two-dimensional code and a hole array code according to claim 8, wherein the method for converting a decimal table of m×1 specification into a hole array code map of m×1 specification comprises: Divide each data in the decimal table of m×1 specification by 2 ^m , so that each number in the table is less than 1, and obtain the hole array code table of m×1 specification; Draw a hole array code diagram according to the hole array code table of m×1 specification. 10 . The method for converting a two-dimensional code and a hole-array code according to claim 1 , wherein the two-dimensional code comprises a row-type two-dimensional code and a matrix-type two-dimensional code. 11 .

Images