High-simulation trademark graphic code typesetting method and system

Abstract

The invention provides a high-simulation trademark graphic code typesetting method and system, and relates to the technical field of anti-counterfeiting. The method comprises the following steps: determining the code value and code system of a dot matrix code and the shape and size of a to-be-generated image; determining a mask of the to-be-generated image; generating an original dot matrix code binary array; 1%-100% is equally divided into 2n dot density intervals; dividing the average gray value by 255 for each gray area of the mask of the to-be-generated image to obtain a corresponding sparse percentage; determining a dot density interval in which each sparse percentage is located; replacing the original dot matrix code binary array to generate a graph code fused composite array; and according to different binary values in the graph code fused composite array, performing different color rendering on pixels corresponding to the binary values to obtain a final dot matrix code image as a trademark graph code. According to the invention, a trademark, a LOGO and a sign which have publicity value, are visible to human eyes and have a visual communication effect are formed by using the code points.

Description

Technical Field

[0001] The present invention relates to the field of anti-counterfeiting technology, and particularly to a method and system for typesetting a highly simulated trademark graphic code. Background Art

[0002] Currently, dot matrix codes have begun to be used in the market as one code for one item, for manufacturers' anti-counterfeiting and traceability inspection and consumers' anti-counterfeiting code scanning. Since dot matrix codes generally have advantages such as beauty, concealment, and smaller requirements for readable footprint compared to two-dimensional codes. Among them, CN117292610A "A Trademark Making Method and a Hardware Part" proposes an idea of making a hardware part by laser with a dot matrix code forming an image, but it cannot solve the problem of how to change the original rectangular full-paved code image with a specified width and height into a code image in the form of "positive printing" or "negative printing" of an irregular shape, trademark, or text outline and ensure its readability. At the same time, trademark images often have different gray level differences in different regions, and are not simply black and white monochromatic combinations. Therefore, for a color trademark or LOGO with gradient colors, its gray scale image should also have multiple gray levels. However, the area formed by dot matrix codes often has only 2 levels, namely pure white and pure black, and the gray levels presented by the code points according to a certain fixed sparsity do not exceed 3 levels in total. The trademark LOGO image formed in this way is not simulated and cannot approach the beauty brought by the original color image or multi-gray level image. Summary of the Invention

[0003] The purpose of the embodiments of the present invention is to provide a method and system for typesetting a highly simulated trademark graphic code, which realizes forming trademarks, LOGOs, and signs with promotional value and visible to the human eye and having a visual communication effect using code points.

[0004] To achieve the above purpose, the embodiments of the present invention provide a method for typesetting a highly simulated trademark graphic code, the method comprising: determining the dot matrix code value, code system, and the shape and size of the image to be generated; determining the mask of the image to be generated according to the shape and size of the image to be generated, the mask of the image to be generated being a 2n-order gray scale image; generating an original dot matrix code binary array according to the dot matrix code value, code system, and the shape and size of the image to be generated; dividing 1% - 100% into 2n dot density intervals evenly; for each gray area of the mask of the image to be generated, dividing the average gray value by 255 to obtain the corresponding sparsity percentage; determining the dot density interval where each sparsity percentage is located; replacing the original dot matrix code binary array according to the code block sparsity parameter corresponding to the dot density interval where the sparsity percentage corresponding to each continuous gray area of the mask of the image to be generated is located to generate a synthesized array of graphic code fusion, the synthesized array of graphic code fusion being a binary array; performing different color renderings on the pixels corresponding to different binary values in the synthesized array of graphic code fusion to obtain the final dot matrix code image as the trademark graphic code.

[0005] Preferably, in each continuous gray-scale region of the final dot matrix code image, the side length of the minimum inscribed square code block is not less than the side length of the minimum readable code block supported by the code system and the number is the largest.

[0006] Preferably, the code block sparsity parameter includes the code block size and the code block distance.

[0007] Preferably, according to different binary values in the synthesized array of the figure-code fusion, performing different color renderings on the pixels corresponding to the binary values to obtain the final dot matrix code image as the trademark graphic code includes: when the value corresponding to the pixel in the synthesized array of the figure-code fusion is 0, the pixel where 0 is located is not color-rendered; when the value corresponding to the pixel in the synthesized array of the figure-code fusion is 1, the pixel where 1 is located is color-rendered, so as to obtain the final dot matrix code image as the trademark graphic code.

[0008] Preferably, the dot density interval is 16.

[0009] An embodiment of the present invention further provides a high-fidelity trademark graphic code typesetting system, the system includes: a code value size determination unit, a mask determination unit, an array generation unit, a fusion unit, and a rendering unit, wherein, the code value size determination unit is used to determine the dot matrix code value, the code system, and the shape and size of the image to be generated; the mask determination unit is used to determine the mask of the image to be generated according to the shape and size of the image to be generated, and the mask of the image to be generated is a 2n-order gray-scale image; the array generation unit is used to generate an original dot matrix code binary array according to the dot matrix code value, the code system, and the shape and size of the image to be generated; the fusion unit is used to: divide 1%-100% into 2n dot density intervals evenly; for each gray-scale region of the mask of the image to be generated, divide the average gray value by 255 to obtain the corresponding sparsity percentage; determine the dot density interval where each sparsity percentage is located; according to the code block sparsity parameter corresponding to the dot density interval where the sparsity percentage corresponding to each continuous gray-scale region of the mask of the image to be generated is located, replace the original dot matrix code binary array to generate a synthesized array of figure-code fusion, and the synthesized array of figure-code fusion is a binary array; the rendering unit is used to perform different color renderings on the pixels corresponding to different binary values in the synthesized array of figure-code fusion to obtain the final dot matrix code image as the trademark graphic code.

[0010] Preferably, in each continuous gray-scale region of the final dot matrix code image, the side length of the minimum inscribed square code block is not less than the side length of the minimum readable code block supported by the code system and the number is the largest.

[0011] Preferably, the code point sparsity parameter includes the code point size and the code point distance.

[0012] Preferably, the rendering unit is configured to: when the value corresponding to a pixel in the composite array of the graphic code fusion is 0, no color rendering is performed on the pixel where 0 is located; when the value corresponding to a pixel in the composite array of the graphic code fusion is 1, color rendering is performed on the pixel where 1 is located, so as to obtain a final dot matrix code image as the trademark graphic code.

[0013] Preferably, the dot density interval is 16.

[0014] Through the above technical solution, by using the high-fidelity trademark graphic code layout method and system provided by the present invention, the problem that traditional dot matrix codes need to separately prepare blank areas for code assignment, which affects the aesthetics and space utilization rate of the packaging material surface, is solved. By using the method of dot matrix codes and preset mask patterns, trademarks, LOGOs, and signs with promotional value and visible to the human eye and having a visual communication effect are formed by code points.

[0015] Other features and advantages of the embodiments of the present invention will be described in detail in the subsequent specific implementation part. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The drawings are used to provide a further understanding of the embodiments of the present invention, and constitute a part of the specification. Together with the following specific implementation, they are used to explain the embodiments of the present invention, but do not constitute a limitation to the embodiments of the present invention. In the drawings:

[0017] Figure 1 is a flowchart of a high-fidelity trademark graphic code layout method provided by an embodiment of the present invention;

[0018] Figure 2 is a schematic diagram of a mask provided by an embodiment of the present invention;

[0019] Figure 3 is a schematic diagram of the original dot matrix code binary array provided by an embodiment of the present invention;

[0020] Figure 4a is a schematic diagram of an image without code block processing provided by an embodiment of the present invention;

[0021] Figure 4b is a schematic diagram of an image after code block processing provided by an embodiment of the present invention;

[0022] Figure 5 is a schematic diagram of an image to be generated provided by an embodiment of the present invention;

[0023] Figure 6 is a schematic diagram of a mask and the final trademark graphic code provided by an embodiment of the present invention;

[0024] Figure 7 is a structural block diagram of a high-fidelity trademark graphic code layout system provided by an embodiment of the present invention.

[0025] Description of Reference Numerals

[0026] 1-code value size determination unit 2-mask determination unit 3-array generation unit

[0027] 4- Fusion unit 5- Rendering unit DETAILED DESCRIPTION

[0028] The specific implementation of the embodiment of the present invention is described in detail below in conjunction with the accompanying drawings. It should be understood that the specific implementation described here is only used to illustrate and explain the embodiment of the present invention, and is not used to limit the embodiment of the present invention.

[0029] Figure 1 The present invention provides a flowchart of a highly simulated trademark graphic code typesetting method.

[0030] like Figure 1 As shown, the method includes:

[0031] Step S101, determining the dot code value, code system and shape and size of the image to be generated;

[0032] Specifically, the embodiment of the present invention uses a dot matrix code system that supports adjustable pixel density per unit area, and micro-dot codes are preferred. Micro-dot codes are sparse dot matrix codes with high robustness. They are a closed encoding algorithm and decoding algorithm. The code image cannot be read by other open source code decoding algorithms. Compared with the traditional dense two-dimensional code that converts code values into binary 1 and 0 and arranges them in the form of deep and shallow code points, the code values of micro-dot codes are converted into binary data and there will be an obvious gap of greater than or equal to 1 data position between the data, and the code value can be a string of any character encoding. The shape of the image to be generated can be any regular image or an irregular image.

[0033] Step S102, determining a mask of the image to be generated according to the shape and size of the image to be generated, wherein the mask of the image to be generated is a 2n-level grayscale image;

[0034] Specifically, in order to directly display trademarks, LOGOs, and signs in the area where product packaging materials or the main body are spray-coded and maintain aesthetics, the trademarks, LOGOs, and signs to be presented need to be integrated with the dot matrix code in one area, replacing the traditional solution of using one area for trademarks, LOGOs, and signs and separately coding a rectangular area, which is less aesthetic and wastes additional product surface space. In the embodiments of the present invention, a mask needs to be set first when generating an image. The shape and size of the mask are the same as those of the image to be generated, and the mask can be a 2n-order grayscale image. If the dot matrix code supports 256-order grayscale changes, n can be any positive integer from 1 to 8, preferably 4. That is to say, the mask is a 16-order grayscale image to ensure the sparsity of the dot matrix code.

[0035] Figure 2 is a schematic diagram of the mask provided by an embodiment of the present invention. Since the general original image has rich colors while the mask has limited gray levels, grayscale classification processing can be performed when generating the mask. First, divide 256 by the gray level of the mask to obtain the interval gray level. For example, if the mask is a 16-order grayscale image, the interval gray level is 256 / 16 = 16; then select a pixel point from the upper left corner of the image to calculate the gray level, traverse around to calculate whether the gray level difference between other pixel points and this pixel point is less than the interval gray level. If not, continue to traverse around until the gray level difference exceeds the interval gray level, then mark it as the region boundary, and the gray levels within this region can be classified into one category; then continue to take a pixel point from the boundary and traverse around until all the pixel points of the entire original image are traversed. At this time, 16 gray level regions will be obtained, and each gray level region is filled with the same gray level value, and the size of the filled gray level value depends on the average gray level of this region in the original image. It should be noted that the people appearing in the present invention Figure 2 are only for illustrative purposes and do not refer to any specific person.

[0036] Step S103: Generate an original dot matrix code binary array according to the dot matrix code value, code system, and the shape and size of the image to be generated;

[0037] Specifically, in the embodiments of the present invention, according to the code value, a dot matrix code is generated through the encoding algorithm unique to the code system and converted into an original dot matrix code binary array, which is composed of "0" and "1". It can be understood that the dot matrix code is divided into several pixels of appropriate size. The pixels with dots correspond to the value 1, and the pixels without dots correspond to the value 0. The shape and size of the original dot matrix code binary array should be the same as those of the image to be generated. As Figure 3 shown in the schematic diagram of the original dot matrix code binary array of an embodiment. For the convenience of clear presentation, Figure 3 only a simple binary array example is provided.

[0038] Step S104: Divide 1% - 100% evenly into 2n dot density intervals;

[0039] Specifically, according to different values of n, 1% - 100% is evenly divided into different dot density intervals. Table 1 shows the dot density intervals when n takes values from 1 to 4 respectively. The dot density intervals when n takes values from 5 to 8 will not be elaborated here.

[0040] Table 1

[0041]

[0042]

[0043] Step S105, for each gray-scale area of the mask of the to-be-generated image, divide the average gray-scale value by 255 to obtain the corresponding sparse percentage.

[0044] Step S106, determine the dot density interval where each of the sparse percentages is located.

[0045] Specifically, in an embodiment of the present invention, if the mask is a 16-bit gray-scale image and the sparse percentage is 35%, then according to Table 1 above, this gray-scale area is located in the dot density interval 6 (31.25% < X ≤ 37.5%).

[0046] Step S107, according to the code block sparse parameters corresponding to the dot density intervals where the sparse percentages corresponding to each continuous gray-scale area of the mask of the to-be-generated image are located, replace the original dot matrix code binary array to generate a synthetic array of code-image fusion, and the synthetic array of code-image fusion is a binary array.

[0047] Preferably, the code block sparse parameters include the code block size and the code block distance, and each dot density interval corresponds to corresponding code block sparse parameters. Specifically, the code block sparse parameters corresponding to each dot density interval can be set according to the actual situation. However, it should be noted that from dot density interval 1 to dot density interval 16, the smaller the code block size in the code block sparse parameters, and the larger the code block distance.

[0048] In an embodiment of the present invention, according to the code block sparse parameters of each continuous gray-scale area, the original dot matrix code binary array at the same position should be adjusted, that is, according to the code block sparse parameters, set the value to 1 in the pixels where code points need to be set, and set the other values to 0.

[0049] Figure 4a It is a schematic diagram of an image without code block processing provided by an embodiment of the present invention. Figure 4bIt is a schematic diagram of the image after code block processing provided by an embodiment of the present invention. In an embodiment of the present invention, in each continuous gray level area of the final dot matrix code image, the side length of the minimum inscribed square code block is not less than the side length of the minimum readable code block supported by the code system and is the largest in number. Thereby, it can be ensured that even when it is an irregular graph, the recognition rate is as high as possible.

[0050] Step S108: According to different binary values in the synthesized array of the graphic code fusion, perform different color renderings on the pixels corresponding to the binary values to obtain the final dot matrix code image as the trademark graphic code.

[0051] Specifically, when the value corresponding to the pixel in the synthesized array of the graphic code fusion is 0, the pixel where 0 is located is not color-rendered. When the value corresponding to the pixel in the synthesized array of the graphic code fusion is 1, the pixel where 1 is located is color-rendered to obtain the final dot matrix code image as the trademark graphic code, as Figure 5 shown. Although Figure 5 it is rendered in black, if the ink used is C, M, Y, K color ink or spot color ink, or even invisible ink, the finally presented pattern can be a color printed pattern. It should be noted that Figure 5 it is only for intuitively showing the pattern obtained by using the method of the present invention, and the people shown in the figure are only for illustrative purposes and do not refer to any specific person.

[0052] Figure 6 It is a schematic diagram of the mask and the final trademark graphic code provided by an embodiment of the present invention. As Figure 6 shown, by using the method provided by the embodiment of the present invention, it is realized that no code is laid at the specified position, different densities of codes are laid at the specified positions, and different gray levels are finally presented, making the trademark and LOGO images composed of codes more vivid, and at the same time ensuring that the codes are readable.

[0053] Figure 7 It is a structural block diagram of a high-fidelity trademark graphic code typesetting system provided by an embodiment of the present invention. As Figure 7As shown in the figure, the system includes: a code value size determination unit 1, a mask determination unit 2, an array generation unit 3, a fusion unit 4, and a rendering unit 5. Among them, the code value size determination unit 1 is used to determine the dot matrix code value, code system, and the shape and size of the image to be generated; the mask determination unit 2 is used to determine the mask of the image to be generated according to the shape and size of the image to be generated, and the mask of the image to be generated is a 2n-order grayscale image; the array generation unit 3 is used to generate an original dot matrix code binary array according to the dot matrix code value, code system, and the shape and size of the image to be generated; the fusion unit 4 is used to: divide 1%-100% evenly into 2n dot density intervals; for each grayscale area of the mask of the image to be generated, divide the average grayscale value by 255 to obtain the corresponding sparse percentage; determine the dot density interval where each sparse percentage is located; according to the code block sparse parameters corresponding to the dot density intervals where the sparse percentages corresponding to each continuous grayscale area of the mask of the image to be generated are located, replace the original dot matrix code binary array to generate a synthetic array of code-image fusion, and the synthetic array of code-image fusion is a binary array; the rendering unit 5 is used to perform different color renderings on the pixels corresponding to different binary values in the synthetic array of code-image fusion to obtain the final dot matrix code image as the trademark graphic code.

[0054] Preferably, in each continuous grayscale area of the final dot matrix code image, the side length of the smallest inscribed square code block is not less than the side length of the smallest readable code block supported by the code system and the number is the largest.

[0055] Preferably, the code point sparse parameters include the code point size and the code point distance.

[0056] Preferably, the rendering unit 5 is used to: when the value corresponding to the pixel in the synthetic array of code-image fusion is 0, no color rendering is performed on the pixel where 0 is located, and when the value corresponding to the pixel in the synthetic array of code-image fusion is 1, color rendering is performed on the pixel where 1 is located to obtain the final dot matrix code image as the trademark graphic code.

[0057] Preferably, the number of dot density intervals is 16.

[0058] The embodiments of the high-fidelity trademark graphic code typesetting system described above are similar to the embodiments of the high-fidelity trademark graphic code typesetting method described above, and will not be elaborated here.

[0059] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0060] The present application is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to the embodiments of the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, as well as the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate means for implementing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0061] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a manufactured article including instruction means, and the instruction means implement the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0062] These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0063] In a typical configuration, a computing device includes one or more processors (CPUs), an input / output interface, a network interface, and a memory.

[0064] The memory may include non-permanent memory in a computer-readable medium, in the form of random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.

[0065] A computer-readable medium includes permanent and non-permanent, removable and non-removable media that can implement information storage by any method or technology. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette tapes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transitory medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer-readable medium does not include transitory computer-readable media, such as modulated data signals and carrier waves.

[0066] It should also be noted that the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the statement "comprising an..." does not exclude the presence of additional identical elements in the process, method, article or device comprising the element.

[0067] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, various changes and modifications can be made to the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included within the scope of the claims of the present application.

Claims

1. A method for typesetting a highly simulated trademark graphic code, characterized in that, The method includes: Determining the dot matrix code value, code system, and the shape and size of the image to be generated; Determine a mask for the image to be generated according to the shape and size of the image to be generated, where the mask of the image to be generated is a n 2-bit grayscale image; Generating an original dot matrix code binary array according to the dot matrix code value, code system, and the shape and size of the image to be generated; Divide 1% - 100% evenly into 2 n dot density intervals; For each gray area of the mask of the image to be generated, dividing the average gray value by 255 to obtain the corresponding sparsity percentage; Determining the dot density interval in which each of the sparsity percentages is located; Replacing the original dot matrix code binary array according to the code block sparsity parameters corresponding to the dot density interval in which the sparsity percentage corresponding to each continuous gray area of the mask of the image to be generated is located, to generate a synthesized array of graphic-code fusion, and the synthesized array of graphic-code fusion is a binary array; Rendering pixels corresponding to different binary values in the synthesized array of graphic-code fusion with different colors to obtain a final dot matrix code image as a trademark graphic code.

2. The high-fidelity trademark graphic code layout method according to claim 1, wherein In each continuous gray area of the final dot matrix code image, the side length of the smallest inscribed square code block is not less than the side length of the smallest readable code block supported by the code system, and the number is the largest.

3. The high-fidelity trademark graphic code layout method according to claim 1, characterized in that The code block sparsity parameters include code block size and code block distance.

4. The high-fidelity trademark graphic code layout method according to claim 1, characterized in that Rendering pixels corresponding to different binary values in the synthesized array of graphic-code fusion with different colors to obtain a final dot matrix code image as a trademark graphic code includes: When the value corresponding to the pixel in the synthesized array of graphic-code fusion is 0, the pixel where 0 is located is not color-rendered, and when the value corresponding to the pixel in the synthesized array of graphic-code fusion is 1, the pixel where 1 is located is color-rendered, to obtain a final dot matrix code image as a trademark graphic code.

5. The high-fidelity trademark graphic code layout method according to claim 1, characterized in that The dot density intervals are 16.

6. A high-fidelity trademark graphic code layout system, characterized in that, The system includes: A code value and size determination unit, a mask determination unit, an array generation unit, a fusion unit, and a rendering unit, where The code value and size determination unit is used to determine the dot matrix code value, code system, and the shape and size of the image to be generated; The mask determination unit is configured to determine a mask for the image to be generated according to the shape and size of the image to be generated, and the mask of the image to be generated is a 2 n -level grayscale image; The array generation unit is used to generate an original dot matrix code binary array according to the dot matrix code value, code system, and the shape and size of the image to be generated; The fusion unit is used for: Divide 1% - 100% evenly into 2 n dot density intervals; For each gray area of the mask of the image to be generated, dividing the average gray value by 255 to obtain the corresponding sparsity percentage; Determining the dot density interval in which each of the sparsity percentages is located; Replacing the original dot matrix code binary array according to the code block sparsity parameters corresponding to the dot density interval in which the sparsity percentage corresponding to each continuous gray area of the mask of the image to be generated is located, to generate a synthesized array of graphic-code fusion, and the synthesized array of graphic-code fusion is a binary array; The rendering unit is used to render pixels corresponding to different binary values in the synthesized array of graphic-code fusion with different colors to obtain a final dot matrix code image as a trademark graphic code.

7. The high-fidelity trademark graphic code layout system according to claim 6, wherein In each continuous gray area of the final dot matrix code image, the side length of the smallest inscribed square code block is not less than the side length of the smallest readable code block supported by the code system, and the number is the largest.

8. The high-fidelity trademark graphic code layout system according to claim 6, characterized in that The code point sparsity parameters include code point size and code point distance.

9. The high-fidelity trademark graphic code layout system according to claim 6, wherein The rendering unit is used for: When the value corresponding to a pixel in the synthesized array of the graphic code fusion is 0, the pixel where 0 is located is not color-rendered. When the value corresponding to a pixel in the synthesized array of the graphic code fusion is 1, the pixel where 1 is located is color-rendered, so as to obtain a final dot matrix code image as the trademark graphic code.

10. The high-fidelity trademark graphic code layout system according to claim 6, characterized in that, The dot density interval is 16.

Images