An anti-interference method for commodity outer packaging based on three-bit circular code

The problem of untraceable product information was solved by generating a three-dimensional circular code with an initial matrix and an anti-interference matrix, enabling rapid recovery and integrity of product packaging information and improving anti-interference capabilities.

CN115511027BActive Publication Date: 2025-10-21TONGJI UNIV
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202211149701.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-21
Publication Date
2025-10-21
Estimated Expiration
2042-09-21

AI Technical Summary

Technical Problem

The lack of unique information labeling during the circulation process makes it impossible to trace products. Some distributors counterfeit products and damage labeling, causing economic losses to manufacturers.

Method used

An anti-interference method based on three-digit circular codes is adopted to generate an initial matrix and two anti-interference matrices. The anti-interference matrix is ​​generated through an XOR operation, and the information is encoded into three-digit circular codes and printed on the outer packaging of the product to achieve encrypted storage and rapid recovery of information.

Benefits of technology

It improves the ability to recover information after the outer packaging of goods is damaged, ensures the integrity of information and rapid decoding, reduces information loss, and improves operational efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115511027B_ABST
    Figure CN115511027B_ABST
Patent Text Reader

Abstract

The application provides an anti-interference method for commodity outer package based on three-position circular code, and relates to circulation commodity anti-fake tracing technology. The method uses a circular graph to carry information contained in a commodity, and generates an associated circular code to increase the anti-interference ability. The information mark on the circulating commodity has the characteristics of uniqueness, anti-interference, large capacity and traceability. The method can improve the anti-interference of the commodity code in the circulation process.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of circulating commodity information anti-counterfeiting and tracing systems. Technical Background

[0002] With the continuous development of the economy and the trend towards marketization, trade flows are becoming increasingly faster and more convenient. However, product manufacturers face a thorny issue: the non-uniqueness of product information labels during the distribution process makes it impossible to trace products. Some distributors also counterfeit products and damage product labels, causing manufacturers to suffer significant economic losses. Therefore, anti-interference processing of product packaging information labels has become a critical issue. Summary of the Invention

[0003] The purpose of the present invention is to provide an anti-interference method for commodity outer packaging based on a three-digit circular code, which can improve the ability to restore commodity information after the commodity outer packaging is damaged.

[0004] In order to achieve the above purpose, the technical solution adopted by the present invention is:

[0005] An anti-interference method for commodity outer packaging based on a three-digit circular code, characterized by comprising the following steps:

[0006] Step 1. Product information collection

[0007] Collect product information and convert various information such as product source into a standard data format and store it in the database for processing in step 2

[0008] Step 2. Generate the original matrix

[0009] The system computer randomly generates a 24-bit binary information sequence, associates it with the product information collected in step 1, forms a one-to-one correspondence, and stores it in the database.

[0010] The information is divided into three groups. A sequence bit is inserted at the beginning of each group. The sequence bit of the first group is 1, and the second and third groups are 0. The original matrix is ​​finally obtained and stored in the database.

[0011] Step 3: Generate anti-interference matrix

[0012] Invert the initial information matrix in the database in step 2 by group to form the second matrix, which is the first anti-interference matrix. Then perform bitwise XOR operation on the two existing matrices to obtain the third matrix, which is the second anti-interference matrix. That is:

[0013] 1) Arrange each set of data in the original matrix in reverse order to obtain the first anti-interference matrix;

[0014] 2) Perform bitwise XOR on the original matrix and the first anti-interference matrix except for the last bit of each group, and obtain a second anti-interference matrix whose last bit of each group is the same as the anti-interference matrix one.

[0015] The above initial matrix and two anti-interference matrices are stored in the database.

[0016] Step 4: Generate a three-digit circular code

[0017] A three-bit circular code is generated using the initial matrix and two anti-interference matrices. The encoding rule is as follows: divide the circle into three equal blocks, separated by three radii from the center, each corresponding to an arc of 2 / 3π. Each block is divided into nine equal-spaced blocks from the inside out, along the same radius. Each block is filled with black or white, corresponding one-to-one with the matrix storing the data, with 1 corresponding to black and 0 corresponding to white. The data group with the sequence bit 1 is the first group, and the data information is arranged from the inside out. After the first group is filled, the second block, arranged clockwise, becomes the corresponding group, and the data is arranged from the inside out, and so on. Using the same method, two anti-interference circular codes containing the information of anti-interference matrix 1 and anti-interference matrix 2 are generated on the left and right sides of the original circular code, respectively. The three matrices generate a total of three-bit circular codes.

[0018] The generated circular code is stored in the database and can be output, printed, and then painted on the outer packaging of the product. It is a complete three-digit circular code containing a total of three digits of circular code, which stores the information of anti-interference matrix 1, original matrix, and anti-interference matrix 2 from left to right.

[0019] Step 5: Read the circular code information

[0020] 1) If the initial circular code image is complete, the system directly reads the initial circular code in the middle. The decoding rule for reading is as follows: Each circular code is divided into three equal blocks, storing three groups of information divided into a matrix. Starting from the group with the position flag set to 1, read from the inside outwards in reverse order, following the method for generating a three-digit circular code in Example 4. Black cells are read as 1, and white cells are read as 0. Then, read the second group of information clockwise from the inside out. Similarly, after the third group, the complete data is obtained.

[0021] 2) If the image information is incomplete, if each of the three initial circular code groups can retain a radius, then due to the circular nature, complete data can be obtained. If the center of the initial circular code is missing, since the data contained in the outer circle of the anti-interference circular code in step 4 corresponds to the inner circle of the initial circular code, the missing information of the initial circular code can be obtained from the outer circle of the anti-interference circular code 1. If both the initial circular code and the anti-interference circular code 1 are partially completely destroyed, due to the acquisition rules of the anti-interference circular code 2 in steps 4 and 3, the original data can be restored by comparing the anti-interference circular code 2 with the initial circular code and the anti-interference circular code 1.

[0022] In step 3, the original information matrix is ​​formed by dividing the original 24-bit data into 3 groups, and adding a 1 to the first bit of the first group, and the first bits of the other two groups are 0, forming a 3*9 information matrix.

[0023] Due to the adoption of the above scheme, the present invention has the following advantages: it can effectively restore damaged information, reduce information loss caused by packaging damage, and has a fast decoding method, which is easy to identify and can improve operating efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The present invention will be better understood and its numerous advantages will become readily apparent as the detailed description taken in conjunction with the accompanying drawings.

[0025] Figure 1 It is a blank model of a circular code.

[0026] Figure 2 It is a 3*8 data matrix.

[0027] Figure 3 It is a 3*9 data matrix.

[0028] Figure 4 There are two 3*9 data matrices.

[0029] Figure 5 It is a complete three-digit circular code. DETAILED DESCRIPTION

[0030] The following describes the key steps in the method and technical solution of the present invention in combination with the accompanying drawings and examples, which is conducive to a better understanding of the method and technical solution of the present invention.

[0031] Step 1. Product information collection

[0032] Collect product information and convert various information such as product source into a standard data format and store it in the database for processing in step 2

[0033] Step 2. Generate the original matrix

[0034] The system computer randomly generates a 24-bit binary information sequence, such as 101001011100011000111011. It is associated with the product information collected in step 1 to form a one-to-one correspondence and stored in the database. The information is divided into three groups: 10100101, 11000110, 00111011. Figure 2 The circular code needs to determine the order. A sequence bit is inserted at the beginning of each group of information. The sequence bit of the first group is 1, and the second and third groups are 0. The original matrix is ​​110100101, 011000110, 000111011. Figure 3, the obtained initial information matrix is ​​stored in the database.

[0035] Step 3: Generate anti-interference matrix

[0036] Invert the initial information matrix in the database in step 2 by group to form the second matrix, which is the first anti-interference matrix. Then perform bitwise XOR operation on the two existing matrices to obtain the third matrix, which is the second anti-interference matrix. That is:

[0037] 1) Arrange each set of data in the original matrix in reverse order to obtain the first anti-interference matrix as follows Figure 4

[0038] 2) Perform bitwise XOR on the original matrix and the first anti-interference matrix except the last bit of each group to obtain the second anti-interference matrix. The last bit of each group is the same as the anti-interference matrix 1. Figure 4 .

[0039] The above initial matrix and two anti-interference matrices are stored in the database.

[0040] Step 4: Generate a three-digit circular code

[0041] According to the initial matrix and two anti-interference matrices, a three-digit circular code is generated as follows: Figure 5 The encoding generation rule is as follows: divide the circle into three equal parts, and separate the three parts with three radii starting from the center of the circle, with each part corresponding to an arc of 2 / 3π; each area is divided into 9 parts from the inside to the outside according to the radius; fill each area with black or white, and black and white correspond to the matrix storing data one by one, 1 corresponds to black, and 0 corresponds to white; the data group with the order bit of 1 is taken as the first group, and the data information is arranged from the inside to the outside; after the first group is filled, the second area arranged clockwise is the corresponding second group, and the data is still arranged from the inside to the outside, and so on. If the first group of data in the original matrix is ​​110100101, then Figure 5 The data of the middle circular code is black, black, white ... Figure 5 The same method is used to generate two anti-interference circular codes containing the information of anti-interference matrix 1 and anti-interference matrix 2 on the left and right sides of the original circular code, and the three matrices generate a total of 3-bit circular codes.

[0042] The generated circular code is stored in the database and can be printed and applied to the outer packaging of the product. Figure 5 A complete three-digit circular code contains three-digit circular codes, which store the information of anti-interference matrix 1, original matrix, and anti-interference matrix 2 from left to right. Figure 5The patterned goods enter the transportation, storage, transfer and other links, commodity management links, and sales and circulation links.

[0043] Step 5: Read the circular code information

[0044] If an accident occurs during the transportation, storage, etc. of the product:

[0045] 1) If the initial circular code image is complete, the system directly reads the initial circular code in the middle. The decoding rule for reading is as follows: Each circular code is divided into three equal blocks, storing three groups of information divided into a matrix. Starting from the group with the position flag set to 1, read from the inside outwards in reverse order, following the method for generating a three-digit circular code in Example 4. Black cells are read as 1, and white cells are read as 0. Then, read the second group of information clockwise from the inside out. Similarly, after the third group, the complete data is obtained.

[0046] 2) If the image information is incomplete, if each of the three initial circular code groups can retain a radius, then due to the circular nature, complete data can be obtained. If the center of the initial circular code is missing, since the data contained in the outer circle of the anti-interference circular code in step 4 corresponds to the inner circle of the initial circular code, the missing information of the initial circular code can be obtained from the outer circle of the anti-interference circular code 1. If both the initial circular code and the anti-interference circular code 1 are partially completely destroyed, due to the acquisition rules of the anti-interference circular code 2 in steps 4 and 3, the original data can be restored by comparing the anti-interference circular code 2 with the initial circular code and the anti-interference circular code 1.

[0047] Compared to conventional product codes on product packaging, the circular code method of the present invention offers advantages and innovations: it improves the product code's anti-interference ability. Due to the characteristics of circular patterns, even if a circular code is partially destroyed, the complete information within the circular code can be obtained by intermittently reading and piecing together the three radii. Even if the center of the circular code is specifically destroyed, the presence of an encrypted backup of the three-digit circular code allows for complementary decoding to yield complete product information, thus enhancing the product code's anti-interference ability.

Claims

1. An anti-interference method for commodity packaging based on a three-digit circular code, characterized in that: The following steps are involved: Step 1. Product information collection Collect product information and convert all kinds of product source information into standard data format and store it in the database for processing in step 2 Step 2. Generate the original matrix The system computer randomly generates a 24-bit binary information sequence, associates it with the product information collected in step 1, forms a one-to-one correspondence, and stores it in the database; Divide the information into three groups; finally, the original matrix is ​​stored in the database; Step 3: Generate anti-interference matrix Invert the initial information matrix in the database in step 2 by group to form the second matrix, which is the first anti-interference matrix. Then perform bitwise XOR operation on the two existing matrices to obtain the third matrix, which is the second anti-interference matrix; that is: 1) Arrange each set of data in the original matrix in reverse order to obtain the first anti-interference matrix; 2) Perform bitwise XOR on the original matrix and the first anti-interference matrix except for the last bit of each group, and obtain a second anti-interference matrix with the last bit of each group being the same as the anti-interference matrix 1; The above initial matrix and two anti-interference matrices are stored in the database; Step 4: Generate a three-digit circular code Generate a three-digit circular code according to the initial matrix and two anti-interference matrices; The generated circular code is stored in the database, printed, and then applied to the outer packaging of the product. A complete three-digit circular code contains three digits of circular code, which store the information of anti-interference matrix 1, original matrix, and anti-interference matrix 2 from left to right. Step 5: Read the circular code information.

2. The anti-interference method according to claim 1, wherein: In step 2, the information is divided into three groups: a sequence bit is inserted at the beginning of each group of information, the sequence bit of the first group is 1, and the sequence bit of the second and third groups is 0.

3. The anti-interference method according to claim 1, wherein: In step 3, the original information matrix is ​​formed by dividing the original 24-bit data into 3 groups, and adding a 1 to the first bit of the first group, and the first bits of the other two groups are 0, forming a 3*9 information matrix.

4. The anti-interference method according to claim 1, wherein: Step 4: Generate a three-digit circular code A three-digit circular code is generated according to the initial matrix and two anti-interference matrices. The coding generation rule is as follows: the circle is divided into three equal blocks, and the three blocks are separated by three radii starting from the center of the circle, and each block corresponds to an arc of 2 / 3π; each area is divided into 9 blocks from the inside to the outside according to the radius; each block is filled with black or white, and black and white correspond one-to-one to the matrix storing the data, 1 corresponds to black, and 0 corresponds to white; the data group with the sequence bit of 1 is used as the first group, and the data information is arranged from the inside to the outside; after the first group is filled, the second area arranged clockwise is used as the corresponding second group, and the data is still arranged from the inside to the outside, and so on; the same method is used to generate two anti-interference circular codes containing the information of anti-interference matrix 1 and anti-interference matrix 2 on the left and right sides of the original circular code, and the three matrices generate a total of 3-bit circular codes.

5. The anti-interference method according to claim 1, wherein: In step 5, circular code information reading includes 1) If the initial circular code image information is complete, the system directly reads the initial circular code in the middle. The decoding rules for reading are as follows: each circular code is divided into three equal blocks, storing three groups of information divided into a matrix; starting from the group with the position flag bit set to 1, read from the inside to the outside in reverse order according to the method of generating a three-digit circular code in Example 4, with black cells reading as 1 and white cells reading as 0; then read the second group of information from the inside to the outside in a clockwise direction, and similarly read the third group to obtain complete data; 2) If the image information is incomplete, if each of the three groups of the initial circular code can retain a radius, then complete data can be obtained due to the circular characteristics; if the center of the initial circular code is missing, since the data contained in the outer circle of the anti-interference circular code in step 4 corresponds to the inner circle of the initial circular code, the missing information of the initial circular code can be obtained through the outer circle of the anti-interference circular code 1; if both the initial circular code and the anti-interference circular code 1 are partially completely destroyed, due to the acquisition rules of the anti-interference circular code 2 in steps 4 and 3, the anti-interference circular code 2 is compared with the initial circular code and the anti-interference circular code 1 to restore the original data.

Citation Information

Patent Citations

  • A graphics information encoding and decoding method for commodity outer packaging

    CN109242510A

  • Anti-interference graph intersection encoding and decoding method for outer package of commodity

    CN113935354A