CN109120277B - Three-dimensional graph three-view coding and decoding method for commodity outer package - Google Patents
Three-dimensional graph three-view coding and decoding method for commodity outer package Download PDFInfo
- Publication number
- CN109120277B CN109120277B CN201810964257.7A CN201810964257A CN109120277B CN 109120277 B CN109120277 B CN 109120277B CN 201810964257 A CN201810964257 A CN 201810964257A CN 109120277 B CN109120277 B CN 109120277B
- Authority
- CN
- China
- Prior art keywords
- information
- commodity
- dimensional
- matrix
- view
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Cash Registers Or Receiving Machines (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a three-dimensional graph three-view coding and decoding method for commodity outer packaging, and relates to an anti-counterfeiting tracing technology of circulating commodities. The method adopts the discretized information coding matrix as the unique unit package identity information, and processes data processing such as parity check, coding, discretization, decoding and the like are carried out on the matrix information, so that the information label on the circulating commodity has the characteristics of uniqueness, anti-interference performance, large capacity, traceability and the like. By using the method, on one hand, the traceability of the commodity in circulation is improved; on the other hand, the method is beneficial to decoding matrix information and improving query efficiency.
Description
Technical Field
The invention relates to the field of information anti-counterfeiting tracing systems for circulating commodities.
Technical Field
With the continuous development and marketing trend of economy, the circulation of trade is faster and more convenient. However, the problem that the commodity production enterprises face is troublesome, in the commodity circulation process, the non-uniqueness of the information labels of the produced commodities causes that the commodities cannot be traced back in the circulation process, and the imitation of some dealers on the commodities and the damage to the commodity labels cause the production enterprises to suffer huge economic losses.
Therefore, how to prevent the phenomena of irreproducibility and damage to the mark in the commodity circulation process, solve the problems of commodity circulation, commodity fleeing and the like of the circulated commodities becomes a problem which is widely concerned by domestic and foreign scholars, and a plurality of methods for solving the problems are provided, wherein the problems are mainly laser anti-counterfeiting, label anti-counterfeiting, ink anti-counterfeiting and other printing types, and the traditional anti-counterfeiting methods are easy to forge and artificially damage in the commodity circulation, so that the effective anti-counterfeiting and commodity fleeing prevention effects cannot be achieved.
But no clear three-view coding and decoding method based on the three-dimensional graph exists for the low-cost commodity outer package information printing anti-counterfeiting technology.
Disclosure of Invention
The invention aims to provide a three-dimensional graph three-view coding and decoding method for commodity outer packaging, which can effectively carry out anti-counterfeiting tracing and damaged information repair on commodities in circulation. The method adopts the discretized information coding matrix as the unique unit package identity information, and processes data processing such as parity check, coding, discretization, decoding and the like are carried out on the matrix information, so that the information label on the circulating commodity has the characteristics of uniqueness, anti-interference performance, large capacity, traceability and the like. By using the method, on one hand, the traceability of the commodity in circulation is improved; on the other hand, the method is beneficial to decoding matrix information and improving query efficiency.
In order to achieve the above purposes, the invention adopts the technical scheme that:
a three-dimensional graph three-view coding and decoding method applied to commodity outer packaging is characterized by comprising the following steps:
1) collecting commodity information
Collecting commodity information and converting the commodity information into a standard data format;
2) generating a stereoscopic graphic
Randomly generating an information sequence by a computer, associating the information sequence with the commodity information acquired in the step 1) to form a coded information sequence with the length of 27 bits, such as 101110000011001001000011111, and then forming a three-dimensional graph in a one-to-one correspondence relationship, as shown in fig. 3;
3) stereo graphic coding
Reading information of the three-dimensional graph from three view angles of a front view, a left view and a top view of the three-dimensional graph by using perspective and projection methods to obtain a coding matrix, wherein the matrix is associated with the three-dimensional graph and corresponding commodity information to form a one-to-one corresponding relation;
4)
rearranging a coding matrix
Adding elements in the coding matrix in the step 3), converting the code into a 6 × 5 matrix, wherein a front view coding matrix is shown in fig. 7, a left view coding matrix is shown in fig. 8, a top view coding matrix is shown in fig. 9, in the matrix, "1" is replaced by a dot, "0" is replaced by a blank, the matrix is replaced by a lattice, a front view lattice is shown in fig. 10, a left view lattice is shown in fig. 11, and a top view lattice is shown in fig. 12. Respectively printing the three view matrixes of the three-dimensional graph in the step 2) on the corresponding surfaces of the outer package of the commodity, and marking the commodity;
5) information storage
Storing the original information of the commodity, the transformation rule and the coding rule in a database;
6) information decoding
And carrying out image recognition on the dot matrix of the outer package of the commodity, collecting dot matrix information, recovering data according to a decoding rule, and restoring the commodity information.
The stereo graphic coding specifically comprises: reading the information of the stereo graph from the three view angles of the front view, the left view and the top view of the stereo graph in the step 2) by using a perspective and projection method to obtain three coding matrixes. The front view coding matrix is shown in fig. 4, the left view coding matrix is shown in fig. 5, the top view coding matrix is shown in fig. 6, and the coding matrices are associated with the three-dimensional graph in the step 2) and the corresponding commodity information to form a one-to-one correspondence relationship;
3.1) As shown in FIG. 4, a stereographic is defined with the following front projection rules:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each column are sequentially read from front to back, 9 squares are provided in total, and each square stores the states of 3 squares. Arranging the states in all the squares to form a sequence with the length of 27 bits;
3.2) As shown in FIG. 5, a stereographic is specified with the following left view projection rules:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each horizontal row are sequentially read from left to right, 9 squares are provided in total, and each square stores the states of 3 squares. The states in all the squares are arranged to form a sequence of 27 bits in length.
3.3) As shown in FIG. 6, the top view projection rule for a solid figure is defined as follows:
comparing the three-dimensional graph with the original graph, wherein the square preservation mark is 1, the square discarding mark is 0, the states of 3 squares in each vertical row are sequentially read from top to bottom, 9 squares are totally provided, and each square stores the states of 3 squares. The states in all the squares are arranged to form a sequence of 27 bits in length.
3.4) adding a code string with the length of 3 bits in front of the sequence with the length of 27 bits as a view identification code to form a sequence with the length of 30 bits;
the view identification code rules are as follows: 111 denotes a front view, 110 denotes a left view, and 101 denotes a top view.
Due to the adoption of the technical scheme, the commodity flow direction with the matrix information label can be effectively traced, and the anti-counterfeiting commodity and the commodity with the damaged information matrix have better recovery characteristics of the information matrix. The information flow direction of the enterprise management commodities can be enabled, commodity channel conflict is reduced, and the operation efficiency is improved.
Drawings
Fig. 1 is a schematic diagram of three projection angles of three views of a perspective view.
Fig. 2 is a schematic diagram of an original cube used to generate a stereoscopic graphic.
Fig. 3 is a perspective view including commodity information.
Fig. 4 is a schematic perspective view of a front view containing merchandise information.
Fig. 5 is a schematic left side view of a three-dimensional figure containing commodity information.
Fig. 6 is a schematic top view of a three-dimensional figure containing commodity information.
Fig. 7 is a schematic diagram of a front view transformation matrix.
Fig. 8 is a schematic diagram of a left view transformation matrix.
Fig. 9 is a schematic diagram of a top view transformation matrix.
Fig. 10 is a schematic diagram of a front view transformation matrix lattice.
FIG. 11 is a left view transform matrix lattice diagram.
FIG. 12 is a schematic diagram of a top view transformation matrix lattice.
Detailed Description
The following description focuses on three key steps in the technical scheme of the method of the present invention with reference to the accompanying drawings and examples, which are helpful for better understanding of the technical scheme of the method of the present invention.
Firstly, converting commodity information into a three-dimensional graph
As shown in fig. 1, three view projection planes of the stereo image are respectively: the front view corresponds to the X0Z plane, i.e., the V plane, the left view corresponds to the YOZ plane, i.e., the W plane, and the top view corresponds to the XOZ plane, i.e., the H plane.
As shown in fig. 2, the original pattern is composed of 27 blocks, and the 27 blocks are combined in a format of 3 × 3 × 3, respectively, in length, width, and height. The 27 blocks are numbered from top to bottom, from left to right, and from front to back from right from 1 to 27, and the 27 blocks are respectively stored or discarded to obtain a three-dimensional figure, as shown in fig. 3, the three-dimensional figure is obtained by combining the original figure with the commodity information, and the three-dimensional figure has a total power of 27 of 2. The commodities correspond to the three-dimensional graphs one by one, and the commodity information is converted into the three-dimensional graphs to be stored.
Secondly, converting the three-dimensional graph into a matrix
1) As shown in fig. 4, a front projection rule is defined for a solid figure as follows:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each column are sequentially read from front to back, 9 squares are provided in total, and each square stores the states of 3 squares. The states in all the squares are arranged to form a sequence of 27 bits in length: 101110000011001001000011111.
2) as shown in fig. 5, a stereogram is defined to have the following left view projection rule:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each horizontal row are sequentially read from left to right, 9 squares are provided in total, and each square stores the states of 3 squares. The states in all the squares are arranged to form a sequence of 27 bits in length.
3) As shown in fig. 6, the top view projection rule for one solid figure is defined as follows:
comparing the three-dimensional graph with the original graph, wherein the square preservation mark is 1, the square discarding mark is 0, the states of 3 squares in each vertical row are sequentially read from top to bottom, 9 squares are totally provided, and each square stores the states of 3 squares. The states in all the squares are arranged to form a sequence of 27 bits in length.
4) Adding a code string with the length of 3 bits in front of the sequence with the length of 27 bits as a view identification code to form a sequence with the length of 30 bits. The view identification code rules are as follows: 111 denotes a front view, 110 denotes a left view, and 101 denotes a top view.
5) As shown in fig. 7, 8 and 9, the 30-bit-long sequence is converted into a 6 × 5 matrix. Fig. 7 is a front view transformation matrix, fig. 8 is a left view transformation matrix, and fig. 9 is a top view transformation matrix, the matrix is converted into a dot matrix, and the dot matrix is printed on the outer package of the commodity, so that the labeling of the commodity information is completed.
Third, decoding
According to the coding rule, the commodity information of each commodity corresponds to three views, and each view corresponds to one dot matrix. Decoding is the reverse processing process of encoding, three-dimensional graphs can be recovered through the three dot matrixes, the three-dimensional graphs are compared, the three-dimensional graphs are recovered, and finally commodity information is recovered.
Claims (4)
1. A three-view coding and decoding method of a three-dimensional graph applied to commodity outer packaging is characterized by comprising the following steps:
1) collecting commodity information
Collecting commodity information and converting the commodity information into a standard data format;
2) generating a stereoscopic graphic
Randomly generating an information sequence by a computer, associating the information sequence with the commodity information acquired in the step 1) to form a coded information sequence with the length of 27 bits, and then forming a three-dimensional graph in one-to-one correspondence;
3) stereo graphic coding
Reading the information of the stereo graph from the three view angles of the front view, the left view and the top view of the stereo graph in the step 2) by using a perspective and projection method to obtain three coding matrixes; the coding matrix is correlated with the three-dimensional graph in the step 2) and the corresponding commodity information to form a one-to-one corresponding relation;
3.1) for a solid figure, the front projection rule is defined as follows:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each column are sequentially read from front to back, 9 squares are provided in total, and each square stores the states of 3 squares; arranging the states in all the squares to form a sequence with the length of 27 bits;
3.2) for a stereographic, the left view projection rule is as follows:
comparing the three-dimensional graph with the original graph, wherein the square storage mark is 1, the square discarding mark is 0, the states of 3 squares in each horizontal row are sequentially read from left to right, 9 squares are provided in total, and each square stores the states of 3 squares; arranging the states in all the squares to form a sequence with the length of 27 bits;
3.3) for a solid figure, the top view projection rule is defined as follows:
comparing the three-dimensional graph with the original graph, wherein the square preservation mark is 1, the square discarding mark is 0, the states of 3 squares in each vertical row are read in sequence from top to bottom, 9 squares are provided in total, and each square stores the states of 3 squares; arranging the states in all the squares to form a sequence with the length of 27 bits;
3.4) adding a code string with the length of 3 bits in front of the sequence with the length of 27 bits as a view identification code to form a sequence with the length of 30 bits;
the view identification code rules are as follows: 111 a front view, 110 a left view, 101 a top view;
4) rearranging a coding matrix
Adding elements into the coding matrix in the step 3), converting the codes into a 6 x 5 matrix, replacing '1' with a dot and '0' with a blank in the matrix, replacing the matrix with a dot matrix, respectively printing the three view matrixes of the three-dimensional graph in the step 2) on the corresponding surfaces of the outer package of the commodity, and marking the commodity;
5) information storage
Storing the original information of the commodity, the transformation rule and the coding rule in a database;
6) matrix information decoding
Carrying out image recognition on the dot matrix in the step 4) of commodity outer packaging, collecting dot matrix information, recovering data according to a decoding rule, and restoring commodity information.
2. The method for encoding and decoding the three-dimensional image applied to the outer package of the commodity according to claim 1, wherein the step 3) converts the three-dimensional image into a matrix.
3. The three-view coding and decoding method of the three-dimensional graphics applied to the outer package of the commodity according to claim 1, wherein the decoding of the matrix information in the step 6) is an inverse processing process of coding, and the three-dimensional graphics restored by the three-view matrix are comprehensively compared to finally restore an original graphic, and are compared by a database to obtain the commodity information;
the specific scheme of the comprehensive comparison is as follows: if the three-dimensional figures are the same, the restored three-dimensional figure is the original figure;
if two of the three stereo graphs are the same, the two graphs represent the original graph;
if the three-dimensional figures are different, respectively aligning the six surfaces of the three-dimensional figures, and superposing the six surfaces together to obtain a new three-dimensional figure, wherein the new three-dimensional figure is the original figure.
4. The method for encoding and decoding three-dimensional graphics for outer packaging of commodities as claimed in claim 1, wherein the code in lattice form has three characteristics: the distribution of the presence or absence of information points, the position distribution of information points, and the density distribution of information points.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810964257.7A CN109120277B (en) | 2018-08-23 | 2018-08-23 | Three-dimensional graph three-view coding and decoding method for commodity outer package |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810964257.7A CN109120277B (en) | 2018-08-23 | 2018-08-23 | Three-dimensional graph three-view coding and decoding method for commodity outer package |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109120277A CN109120277A (en) | 2019-01-01 |
| CN109120277B true CN109120277B (en) | 2021-06-08 |
Family
ID=64860706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810964257.7A Active CN109120277B (en) | 2018-08-23 | 2018-08-23 | Three-dimensional graph three-view coding and decoding method for commodity outer package |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109120277B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2741005A1 (en) * | 2008-10-31 | 2010-05-06 | Quadraxis | Process of correcting an image provided on a support which is subsequently submitted to a deformation process |
| FR2973910A1 (en) * | 2011-04-05 | 2012-10-12 | Franck Andre Marie Guigan | REFLECTIVE AUTHENTICATION METHOD AND DEVICE |
| CN104347089A (en) * | 2013-08-02 | 2015-02-11 | 日立乐金光科技株式会社 | Information recording media, information reproduction apparatus, and information reproducing method |
| CN106155299A (en) * | 2015-04-23 | 2016-11-23 | 青岛海信电器股份有限公司 | A kind of method and device that smart machine is carried out gesture control |
| CN107092948A (en) * | 2017-05-16 | 2017-08-25 | 李峰 | A kind of anti-counterfeit structure and method for anti-counterfeit based on stereochemical structure three-dimension code |
-
2018
- 2018-08-23 CN CN201810964257.7A patent/CN109120277B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2741005A1 (en) * | 2008-10-31 | 2010-05-06 | Quadraxis | Process of correcting an image provided on a support which is subsequently submitted to a deformation process |
| FR2973910A1 (en) * | 2011-04-05 | 2012-10-12 | Franck Andre Marie Guigan | REFLECTIVE AUTHENTICATION METHOD AND DEVICE |
| CN104347089A (en) * | 2013-08-02 | 2015-02-11 | 日立乐金光科技株式会社 | Information recording media, information reproduction apparatus, and information reproducing method |
| CN106155299A (en) * | 2015-04-23 | 2016-11-23 | 青岛海信电器股份有限公司 | A kind of method and device that smart machine is carried out gesture control |
| CN107092948A (en) * | 2017-05-16 | 2017-08-25 | 李峰 | A kind of anti-counterfeit structure and method for anti-counterfeit based on stereochemical structure three-dimension code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109120277A (en) | 2019-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100369059C (en) | Matrix type two-dimensional bar code and its encoding and decoding method | |
| CN103929187B (en) | Anti-interference matrix information encoding and decoding method for merchandise outer packaging | |
| CN102800243B (en) | Anti-counterfeiting annular code and encoding method thereof | |
| CN102930192B (en) | Security information generates and acquisition methods and relevant apparatus | |
| CN102508910A (en) | Image retrieval method based on minimum projection errors of multiple hash tables | |
| CN109344940B (en) | Three-dimensional lattice projection graph coding and decoding method for commodity outer package | |
| CN105279539A (en) | Dot-matrix two-dimensional code coding and decoding | |
| CN104794619B (en) | Anti-channel conflict digital information mapping code method for commodity packaging | |
| CN104751342A (en) | Commodity information coding and decoding method for tracking commodities | |
| CN101957929A (en) | Method for identifying object on basis of two-dimensional lattice code | |
| CN109120277B (en) | Three-dimensional graph three-view coding and decoding method for commodity outer package | |
| CN113935354A (en) | Anti-interference graph intersection point coding and decoding method for commodity outer package | |
| CN103778453B (en) | Writable two-dimensional bar code based on fault-tolerant mechanism and generating method thereof | |
| CN109919277B (en) | Enciphered colour triangular code coding and decoding method for commodity external package | |
| CN111062456A (en) | Two-dimensional code encryption algorithm | |
| CN103927572A (en) | Encoding graph block and method and device for forming lattice graph through encoding graph block | |
| CN109242509B (en) | Lattice character information coding and decoding method for commodity outer package | |
| CN109409901B (en) | Punching type information coding and decoding method for commodity outer package | |
| CN104766349B (en) | Geometry form figure decoding method applied to commodity outer packing | |
| CN102804203B (en) | Physical image is decoded | |
| CN109359999B (en) | Encoding and decoding method for two-dimensional line segment graph of commodity outer package | |
| CN101159040A (en) | Recognition card with variable feature code | |
| CN113919384B (en) | Encryption gray-scale image coding and decoding method for commodity outer package | |
| CN115564461A (en) | Encoding and decoding method for alphabetic information directed line segments for commodity external packaging | |
| CN113919383B (en) | Hexagonal information encoding and decoding method for commodity outer package |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |