CN100369059C - Matrix type two-dimensional bar code and its encoding and decoding method - Google Patents
Matrix type two-dimensional bar code and its encoding and decoding method Download PDFInfo
- Publication number
- CN100369059C CN100369059C CNB2006100378519A CN200610037851A CN100369059C CN 100369059 C CN100369059 C CN 100369059C CN B2006100378519 A CNB2006100378519 A CN B2006100378519A CN 200610037851 A CN200610037851 A CN 200610037851A CN 100369059 C CN100369059 C CN 100369059C
- Authority
- CN
- China
- Prior art keywords
- code
- information
- bar code
- unit
- unit information
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention discloses a matrix type two-dimensional bar code and an encoding and decoding method thereof. A code graph of the bar code is formed by the gapless arrangement of n*m rectangular unit information blocks, wherein n and m are positive integers more than one, and n is the same as or different from m. Each rectangular unit information block is formed by the gapless arrangement of two kinds of n'*m' rectangular color block units with different optical features, wherein n' and m' are positive integers more than one, and n' is the same as or different from m'. Each rectangular unit information block comprises a positioning identifier and a data zone, and is characterized in that the shape of the positioning identifier is an L shape or an inverted L shape along the adjacent two edges of the rectangular unit information block. The bar code has the advantages of large capacity, high error correction rates, high fouling resisting capacity, high distortion resisting capacity, multilingual encoding and decoding, separate encryption and decryption, optional size adjustment, omnibearing recognition and reading, etc., and can be applied for various fields.
Description
Technical Field
The invention belongs to the technical field of bar codes, and relates to a matrix type two-dimensional bar code and a coding and decoding method thereof.
Background
The bar code technology is an automatic identification technology formed in the computer application practice, and is a new technology which is developed on the basis of the computer technology and the information technology and integrates coding, printing, identification, data acquisition and processing.
Since the 20 th century and the 70 th era, the one-dimensional bar code gets the general attention of people, has rapid development speed, and is widely applied to the fields of commercial circulation, storage, medical treatment and health, book information, post, railway, transportation and production automation management. The use of the system greatly improves the speed of data acquisition and information processing, improves the working efficiency and makes great contribution to the scientization and modernization of management.
Due to the limited information capacity, the one-dimensional bar code is only an identification of "item" and not a description of "item". The use of one-dimensional barcodes has to rely on the existence of a database. Where there is no database and networking is inconvenient, the use of one-dimensional barcodes is greatly restricted and sometimes becomes meaningless. In addition, the situation that the Chinese characters need to be represented by the one-dimensional bar codes is very inconvenient and has low efficiency. The development of modern high and new technology urgently requires that barcodes are used for representing more information in a limited geometric space, so that the requirement of ever-changing information representation is met. Two-dimensional barcodes are generated to understand the problems that one-dimensional barcodes cannot solve. Because it has the characteristics of high density, high reliability and the like, it can be used to represent data files (including Chinese character files), images and the like. The two-dimensional bar code is the most ideal method for realizing storage, carrying and automatic reading of high-capacity and high-reliability information.
Since the international EAN organization was formally added in 1991, two bar code systems pass through the national standard by 2004, namely the American PDF417 (standard number: GB/T17172-1997) and the Japanese QR code (standard number: GB/T18284-2000); however, these 2 criteria are not "mandatory" criteria, but belong to "recommended" criteria. In the current national standards of two-dimensional bar codes, none of the two-dimensional bar codes belongs to the two-dimensional bar codes with independent intellectual property rights in China. ( Reference is made to: national Standard of Bar code, chinese Standard Press, 2004, ISBN7-5006-3464-3 )
The key that the two-dimensional bar code can not be widely applied in China is that the core technology is registered by foreign manufacturers, namely, the two-dimensional bar code is produced and processed according to the international standard, and considerable patent cost is required, so that the popularization of the very good technology in China is restricted. If China can have a two-dimensional bar code system with complete independent intellectual property rights and put into production and application, the formation of the industry is certainly influenced greatly.
1. Characteristics of two-dimensional bar code
High density: at present, a mature one-dimensional bar code such as an EAN/UPC bar code is used as identification data only due to low density, and the product cannot be described. To know the relevant information about the product, the database must be accessed by reading the bar code. This requires that we must build a database in advance with the code represented by the barcode as the index field. The two-dimensional bar code increases the information density of the bar code by using the size in the vertical direction. In general, the density of the product is dozens to hundreds of times of that of a one-dimensional bar code, so that the product information can be completely stored in the two-dimensional bar code, and the product information can be viewed only by scanning the two-dimensional bar code by using a reading device, so that a database does not need to be established in advance, and the description of the 'article' by using the bar code is really realized.
The method has the following functions: the application of one-dimensional bar codes is based on the fact that it is better to reject (i.e., not read) read than to misread (i.e., not read). A one-dimensional bar code is therefore typically printed along with the information it represents. When the bar code is damaged (e.g., contaminated, deinked, etc.), the bar code may be entered via the keyboard instead of scanned. In view of the above principle, the one-dimensional bar code does not consider the error correction function of the bar code itself, and although the concept of checking characters is introduced, it is limited to prevent misreading. Two-dimensional barcodes can represent thousands of bytes of data, and the information represented is generally not possible to print with the barcode symbol. Without error correction, when some portion of a two-dimensional barcode is damaged, the barcode becomes meaningless, and thus the two-dimensional barcode introduces an error correction mechanism. The error correction mechanism enables the two-dimensional bar code to be correctly read when the two-dimensional bar code is locally damaged due to perforation, dirt and the like (see figure 1). The error correction algorithm of the two-dimensional bar code is the same as that used for an artificial satellite, a VCD, and the like. This error correction mechanism makes two-dimensional bar codes a secure and reliable method of information storage and identification, which is not comparable to one-dimensional bar codes.
Multiple language words can be represented: most one-dimensional bar codes can represent character sets of 10 numbers, 26 English letters and some special characters. The Code 128 barcode with the largest barcode character set can represent no more than 128 ASCII characters. Therefore, it is impossible to use one-dimensional bar code to represent other language characters (such as Chinese characters, japanese characters, etc.). Most two-dimensional barcodes have a byte representation mode, i.e., a mechanism is provided to represent a byte stream. It is known that, regardless of the language, they are represented in machine code when stored in a computer, and the inner code is bytecode. Therefore, the method can try to convert various language character information into a byte stream, and then represent the byte stream by using the two-dimensional bar code, thereby providing an unprecedented way for the bar code representation of various language characters.
Can represent image data: since two-dimensional bar codes can represent byte data, images are stored in byte form, thereby enabling bar code representation of images (e.g., photographs, fingerprints, etc.).
An encryption mechanism may be introduced: the introduction of encryption mechanisms is yet another advantage of two-dimensional barcodes. For example, when we use two-dimensional bar codes to represent photos, we can firstly use a certain encryption algorithm to encrypt image information, and then use the two-dimensional bar codes to represent the photos. When the two-dimensional bar code is identified, a certain decryption algorithm is added, and the represented photo can be recovered. Thus, forgery of various certificates, cards, and the like can be prevented.
2. Application range of two-dimensional bar code
And (4) document making: document documents, purchase orders, customs reports, business documents;
and (4) license authentication: passports, identity cards, registration cards, driving licenses, membership cards, identification cards;
storage and inventory: article checking in logistics centers, storage centers, etc.;
article tracking: meeting materials, production parts, customer service, mail order transportation, maintenance records, dangerous goods, logistics supply and ecological research;
data security: commercial secrets, political intelligence, military secrets, private letters.
3. Application prospect of two-dimensional bar code in China
As the emerging automatic identification technology of the two-dimensional bar code has incomparable advantages compared with other automatic identification technologies, the method plays a great promoting role in the industrial informatization process of China, and comprises the following steps:
A. personnel management: with the social and scientific progress of China, the demand and the increasing increase of people for modern management on personnel are that management objects need to be accurately described on certificates. The two-dimensional bar code, which is an automatic technique with a large cost advantage, is easily accepted by various management departments. Under the condition that a population management comprehensive database in China is difficult to establish, a two-dimensional bar code on a portable identity card can completely contain the identity information of a person and can also comprise the photo information of the person, so that the popularization of the technology is more advantageous than that of developed countries. The cost of the second generation intelligent IC card identity card which is currently exchanged is 20 yuan. Experts believe that if two-dimensional bar code technology is applied, each identity card only needs 3 yuan, namely 10 billion population identity cards in the country, and 170 billion yuan can be saved. (Su Yi in the International finance newspaper, 09 and 28 days 2004, seventh edition)
B. Logistics management: describing an item with a two-dimensional barcode is yet another aspect of two-dimensional barcode applications. It is essential to describe the storage and transportation of goods. Most of the current situations are described by natural language, which greatly influences the information acquisition speed and precision. The two-dimensional bar code is applied to logistics, namely the two-dimensional bar code is manufactured on the package of goods, which cannot be realized by other automatic technologies (such as IC cards). The application of the two-dimensional bar code in logistics certainly accelerates the progress of logistics management modernization.
C. Supply chain and ERP/MRP2: the two-dimensional bar code is adopted as a carrier for information transmission in a supply chain, so that the errors possibly caused by manual input can be effectively avoided, the efficiency of warehousing, delivery, order making, goods checking and inventory is greatly improved, the functions of distribution identification, warranty identification and the like are realized, and offline management can be realized under the condition of inconvenient online. When ERP/MRP2 adopts the two-dimensional bar code to carry out economic unit management, the accuracy and the reliability of a decision-making system are greatly improved
D. National informatization policy: the formulation of a new generation of two-dimensional bar code in china has been incorporated into the research project of the information industry division of 2005 and the work project of the automatic identification technology association of china in 2005. (both work plans have been published externally)
In the national bar Code standard, the U.S. two-dimensional bar Code PDF417 and the Japanese two-dimensional bar Code QR Code can be found, but a two-dimensional bar Code owned by one country cannot be found, and the technical bar Code standard of other countries is only recommended. The reason is that the foreign two-dimensional bar code technology is introduced only when the two-dimensional bar code technology is urgently needed because the one-dimensional bar code cannot meet the market informatization requirement of high-speed growth; but since if the foreign technology is applied in a large amount, a huge amount of patent expenses are paid as if the current year's DVD technology patent is patented, with the consequence that it is serious, the introduced foreign technology can be defined only as a recommended national standard. From this approach we see the urgent need of the market and the enthusiasm that the national relevant departments cannot find excellent nationally-owned two-dimensional barcode technology.
Two-dimensional bar codes are classified into two categories, one is a layer-by-layer type and the other is a matrix type. For the one-dimensional bar code, the layer-arranged two-dimensional bar code is a qualitative leap, the performance is improved by thousand times, the working principle is to reduce the one-dimensional bar code and then stack the one-dimensional bar code, the one-dimensional bar code is an extension of the one-dimensional bar code, and the representative is PDF417 widely applied in the United states at present; the matrix type two-dimensional bar code is a qualitative leap for the layer type two-dimensional bar code, the performance is improved by ten million times, the matrix type two-dimensional bar code is composed of polygonal units with equal central moments and the same shapes, and the two-dimensional bar codes appearing internationally after 2000 almost belong to the matrix type. The matrix type two-dimensional bar code has the advantages of directivity, information storage capacity, error correction and the like compared with the layer type two-dimensional bar code.
Disclosure of Invention
The invention aims to provide a matrix type two-dimensional bar code aiming at the condition.
The invention also aims to provide a coding method of the two-dimensional bar code.
It is still another object of the present invention to provide a decoding method of the above two-dimensional bar code.
After deeply analyzing and researching more than ten kinds of two-dimensional bar codes appearing at home and abroad, a novel matrix type two-dimensional bar Code is designed, and the main body of the novel matrix type two-dimensional bar Code is positioned by a plurality of L-shaped areas, so that the novel matrix type two-dimensional bar Code is called DZ-Code (dot-Code) for convenient expression. The detailed technical scheme is as follows:
a matrix type two-dimensional bar code is characterized in that a code image is formed by gapless arrangement of n multiplied by m rectangular unit information blocks, wherein n and m are positive integers larger than 1, and n and m are the same or different; each rectangular unit information block is formed by arranging two kinds of rectangular color block units with different optical characteristics in an gapless mode, wherein n 'and m' are positive integers larger than 1, n 'and m' are the same or different, each rectangular unit information block comprises a positioning identifier and a data area, and the positioning identifier is in an L shape or a reverse L shape along two adjacent edges of a frame of the rectangular unit information block.
The matrix type two-dimensional bar code has different colors of L positioning identifiers of adjacent unit information blocks in a code picture and consistent arrangement direction.
The matrix type two-dimensional bar code is characterized in that a data area in a unit information block of the matrix type two-dimensional bar code consists of x multiplied by y information units, wherein x and y are positive integers larger than 1, and x and y are the same or different; the information unit is composed of adjacent 4 rectangular color block units to form a rectangle in a shape of a Chinese character 'tian', and represents a 16-system character.
The matrix type two-dimensional bar code has a data area in a unit information block which is composed of 8 multiplied by 8 rectangular color block units with two different colors and represents 16 characters with 16 systems.
The matrix type two-dimensional bar code is characterized in that the different colors have different or dissimilar optical characteristics in a gray scale image.
The encoding method of the matrix type two-dimensional bar code comprises the steps of converting information to be encoded into 16-system data stream through a computer, dividing the data stream into information data code words with specific information bit length, and then carrying out error correction operation on the information data code words to produce error correction code words; generating a code map main frame through a computer, determining the number and arrangement of information units in the code map, wherein the arrangement rule of the information units is that the sum of the sequence numbers of any transversely, longitudinally and obliquely arranged information units is the same or most similar; the error correction code words are filled into the data area by using the information unit as a basic unit to form a unit information block, and a code image is generated.
The coding method comprises the following steps:
A. converting information to be encoded by the matrix two-dimensional barcode of claim 1 into a 16-system string S by a computer;
B. according to the required error correction level, sequentially cutting S into a plurality of 16-system character strings with the length of k according to the length of an information bit k in an error correction level table, and adding an end identifier to the last k-bit string;
error correction grade table
| Error correction level | Code length n | Length k of information bit | Error correctable bit number t [t＝(n-k)/2] | Error correction ratio |
| 0 | 15 | 15 | 0 | 0％ |
| 1 | 15 | 13 | 1 | 6％ |
| 2 | 15 | 11 | 2 | 13％ |
| 3 | 15 | 9 | 3 | 20％ |
| 4 | 15 | 7 | 4 | 27％ |
| 5 | 15 | 5 | 5 | 33％ |
| 6 | 15 | 3 | 6 | 40％ |
C. Encoding all the generated characters of the k-bit 16-system string into a 16-system character string Sn with the code length of 15 bits by using an RS algorithm, namely an error correction code word;
D. generating a code diagram main frame through a computer, determining the number and arrangement of information units in the code diagram, wherein the arrangement rule of the information units is that the sum of the sequence numbers of any information units arranged transversely, longitudinally and obliquely is the same or the closest;
E. sequentially connecting all Sn into a whole string of Sns, and sequentially storing each character in the Sns on an information unit of the whole data area of the code map from high order to low order;
F. expanding the 16-system characters on each information unit into 4 binary bits, namely forming 4 rectangular color block units; expanding the 16-system characters on other information units in the same way to form a data area code image;
G. dividing the code image of the data area into x y unit block data areas, wherein x and y are positive integers larger than 1, x and y are the same or different, and adding a positioning identifier on the border of the x and y unit block data areas to form a code image.
The matrix type two-dimensional bar code coding method further adopts an RSA algorithm to carry out separated encryption during coding.
The encoding method of the matrix type two-dimensional bar code adopts an ASCII encoding mechanism.
The decoding method of the matrix type two-dimensional bar code comprises the steps of restoring a code image into a binary data stream through a digital camera and a computer, decoding according to the inverse operation of the encoding process, and determining the meaning represented by the data stream, wherein an anti-distortion analysis method is added in the decoding method.
The decoding method of the matrix type two-dimensional bar code comprises the following steps of: when reading, firstly, determining the area of the whole bar code according to the edge detection and the positioning identifier, and automatically determining the direction of the bar code according to the existence of definite directionality of the L-shaped positioning identifier; then, the following operations are performed for each unit information block:
A. determining the lengths of 2 edges La and Lb of the unit information block positioning identifier and the included angle between La and Lb, and selecting the starting reading with the included angle closest to 90 degrees;
B. selecting K, wherein the range is 5-20, amplifying the length of the unit information block by K times along the La direction, and amplifying the length of the unit information block by La multiplied by K/Lb times along the Lb direction;
C. selecting one of La and Lb with smaller curvature, and fixing; calculating the local bending angle a of the other, starting from one end thereof, and then translating each point constituting the other edge and the image between the two edges, in the direction of the fixed edge, by a distance such that the perpendicular distance between each point of translation and the fixed edge is multiplied by tan a;
D. sequentially performing the operation of the step C, and performing the operation of the next unit information block after La and Lb are adjusted;
E. each unit information block needs to refer to the edge curvature of the unit information blocks at the periphery, calculate the inclination angle of the unit information block, and then stretch the unit information block according to the inclination angle;
F. the bar code is finally determined.
The invention has the beneficial effects that:
the DZ-Code has high capacity, high error correction rate and high anti-pollution distortion capability, can be read in all directions, and is far beyond the similar foreign two-dimensional bar codes in the aspect of large-area continuous fouling resistance. The method is characterized in that:
1. high capacity: depending on the level of error correction, 5-17 characters or more can be stored per square centimeter.
2. Large area continuous fouling resistance: the error correction rate of large-area continuous fouling is similar to the theoretical error correction rate through experiments.
3. Error correction capability: the random errors can be corrected by 6 error correction levels (6%, 13%, 20%, 27%, 33%, 40%).
4. Distortion resistance: bending resistance (the surface bending degree is less than 90 degrees and can be read), inclination resistance (the inclination angle is less than 45 degrees and can be read), and plane omni-direction (360 degrees and can be read).
5. Multi-language coding and decoding: supports near 100 regional languages and languages, and can also set non-standard language library and character set
6. Separate encryption and decryption: 1024-bit encryption is adopted, the public key and the key are separated, namely the public key can be stored at the bar code generating end, and the key is integrated in the reading equipment, so that the safety of information in the bar code is greatly improved.
7. The size can be adjusted at will: according to the size of the data volume, the size of the bar code can be automatically adjusted, and the bar code can be infinitely extended.
8. Multiple ink designs: can realize printing and printing in a plurality of modes of common ink, invisible ink and infrared.
9. The recognition device: the embedded system design (ARM + Linux) is adopted, and the embedded system can be used as a terminal to independently operate on hardware and can also be used as information input equipment to be integrated into the existing information system. And various light source scanning modes (visible light, ultraviolet light and infrared light) are integrated, and high-speed reading of a hardware set is realized.
The comparison of technical parameters of DZ-Code and mainstream two-dimensional bar Code is shown in Table 1:
TABLE 1
| Contrast item/barcode | DZ-Code | PDF417 (USA) | QRCode (Japan) |
| Maximum storage capacity | Can be expanded infinitely | 1106 (0.2% error correction information) | 2953 (7% error correction information) |
| Error correction information (Unit information segment) | 6％-40％ | 0.2％-40％ | 7％-30％ |
| Continuous area error correction capability (Large area continuous fouling) | Proximity unit information segment Capability of correcting error information | When the stained area exceeds the area occupied by the unit information segment or stain When the identifier or locator is damaged, error correction is not possible. | |
| Directionality of electricity | All-round 360 degrees | Need to determine the direction | All-round |
In addition, in the aspect of multi-language support, the three barcodes have own solutions and have advantages and disadvantages, so that comparison cannot be performed; in the aspect of encryption, the specific two-time 1024-bit encryption of the DZ-Code has one more encryption process than other 2 barcodes. In the aspect of continuous contamination resistance, the DZ-Code greatly improves the error correction capability through differential recombination of unit information segments, and the aspect is superior to other 2 barcodes.
Note: at present, two-dimensional bar codes are researched by some domestic units, such as Shanghai Dragon Bei code and Shenzhen silicon sense GM code, and the technical parameters are not disclosed, so that comparison cannot be carried out. By 5 months in 2005, no technical parameters related to the two-dimensional bar code independently developed in China appear in the domestic paper databases. PDF417 and QR Code are mainstream two-dimensional bar codes in the world, PDF417 is applied to the United states in the 90 th century, QR Code is applied to Japan in the beginning of the century, and QR Code and DZ-Code belong to the matrix two-dimensional bar Code and are more advanced than the layer two-dimensional bar Code PDF417 in structure. (reference: national Standard for Bar code, national standards Press of China, 2004, ISBN 7-5006-3464-3).
Drawings
FIG. 1 is a schematic diagram of a matrix two-dimensional barcode according to the present invention.
FIG. 2 is a schematic diagram of a unit information block of a code pattern of the matrix two-dimensional barcode according to the present invention.
FIG. 3 is a schematic diagram of the positioning identifier of the code pattern of the matrix two-dimensional barcode according to the present invention.
FIG. 4 is the intensity histogram of the ideal state after the binarization processing of the monochromatic code image of the matrix two-dimensional barcode according to the present invention.
FIG. 5 is an intensity histogram of the actual state of the matrix two-dimensional barcode after the binarization processing of the monochromatic code image.
Detailed Description
The technical solution of the present invention is further illustrated by the following examples, but the present invention is not limited thereto.
Example 1
1. Structural description:
unit block: the two-dimensional bar Code DZ-Code is most basically a square block (also called a dot, a unit block, a rectangular color block unit), and the color of each dot is allowed to be one of two predefined colors (color a, color b), namely, 0 or 1 in binary. See fig. 1.
Unit information block: one level larger than the unit block is a larger rectangle (or square) composed of a number of dots (unit blocks), called unit blocks, each of which is composed of 2 parts, one part being a data area and one part being a location identifier. The DZ-Code may be composed of several unit information blocks, such as 3 × 3,4 × 4,5 × 5, all the figures herein are 4 × 4. See fig. 2.
Location identifier: the positioning identifier is composed of a leftmost column of points and a lowermost row of points in the unit information block, and the colors of the positioning identifier are alternatively colorA and colorB according to different positions of the unit information block, so that the positioning identifier of 2 adjacent unit information blocks is ensured to be different in color, and the positioning identifier is similar to the arrangement mode of a chessboard of the chess. See fig. 3.
Information unit: a "field" -shaped square, consisting of 4 adjacent unit squares, is called an information unit. One information unit represents one character of 16-ary data in data.
2. Capacity:
in addition to the location identifier, the DZ-Code area is used to represent the data. Each unit square block can represent 0 or 1, for example, each unit block data area has 64 unit square blocks of 8 × 8, i.e., 16 characters in 16 systems, i.e., 8 ASCII codes. Such as when the error correction rate is 20% (see in particular the error correction level list data below),the information storage ratio is 60% (9/15), so that each unit information block can represent 9.6 16-system characters, 4.8 ASCII codes and 2.4 Chinese characters. The size of the unit information block may be 5 × 5 to 10 × 10mm according to printing accuracy 2 I.e. 25-100 mm 2 All can be used. Sampling in actual test samplesThe 8.25X 8.25 protocol was used. The area of the whole DZ-Code is 6.25cm 2 The characters can be stored as 76.8 ASCII codes and 38.4 Chinese characters of national standard codes. I.e. 12 characters or 6 chinese characters per square centimeter. The DZ-Code can store 5-17 characters or more per square centimeter, depending on the error correction level and print area.
3. Error correction grade table
| Error correction level | Code length n | Length k of information bit | Error correctable bit number t [t＝(n-k)/2] | Error correction ratio |
| 0 | 15 | 15 | 0 | 0％ |
| 1 | 15 | 13 | 1 | 6％ |
| 2 | 15 | 11 | 2 | 13％ |
| 3 | 15 | 9 | 3 | 20％ |
| 4 | 15 | 7 | 4 | 27％ |
| 5 | 15 | 5 | 5 | 33％ |
| 6 | 15 | 3 | 6 | 40％ |
4. Coding method for resisting large-area continuous fouling
In order to ensure high error correction capability, the DZ-Code performs error correction control on read data through the following steps.
A. Converting information to be encoded by the matrix two-dimensional barcode of claim 1 into a 16-system string S by a computer;
B. according to the required error correction level, sequentially cutting S into a plurality of 16-system character strings with the length of k according to the length of an information bit k in an error correction level table, and adding an end identifier to the last k-bit string;
C. encoding all the generated characters of the k-bit 16-system string into a 16-system character string Sn with the code length of 15 bits by using an RS algorithm, namely an error correction code word;
D. generating a code diagram main frame through a computer, determining the number and arrangement of information units in the code diagram, wherein the arrangement rule of the information units is that the sum of the sequence numbers of any information units arranged transversely, longitudinally and obliquely is the same or the closest;
E. sequentially connecting all Sn into a whole string of Sns, and sequentially storing each character in the Sns on an information unit of the whole data area of the code map from high order to low order;
F. expanding the 16-system characters on each information unit into 4 binary bits, namely forming 4 rectangular color block units; expanding the 16-system characters on other information units in the same way to form a data area code image;
G. dividing the code image into x y unit block data areas, where x and y are positive integers greater than 1 and x and y are the same or different (e.g. 4 x 4), and adding positioning identifiers to the borders to form the code image.
5. Anti-distortion capability
As each unit information block adopts the L-shaped positioning identifier, the first step is to determine the whole DZ-Code area according to the edge detection and the positioning identifier during reading. The L-shaped positioning identifier has definite directionality, so that the direction of the bar code can be automatically determined. Then, the following operations are performed for each unit information block:
A. determining the lengths of 2 edges La and Lb of the unit information block positioning identifier and the included angle between La and Lb, and selecting the starting reading with the included angle closest to 90 degrees;
B. selecting K, wherein the range is 5-20, amplifying the length of the unit information block by K times along the La direction, and amplifying the length of the unit information block by La multiplied by K/Lb along the Lb direction;
C. selecting the one with smaller curvature (assuming La) of La and Lb, and fixing; calculating the local bending angle a of the other (say Lb) starting from one end thereof, and then translating each point constituting the other side Lb and the image between the two sides La and Lb in the direction of the fixed side La by a distance which is the perpendicular distance between each point of movement and the fixed side multiplied by tan a;
D. sequentially performing the operation of the step C, and performing the operation of the next unit information block after La and Lb are adjusted;
E. each unit information block needs to refer to the edge curvature of the unit information blocks at the periphery, calculate the inclination angle of the unit information block, and then stretch the unit information block according to the inclination angle;
F. the barcode is finally determined.
6. Multi-language encoding and decoding
Because an ASCII coding mechanism is adopted, nearly 100 regional languages and languages are realized, more character sets can be added in the future, and meanwhile, non-ASCII character sets can be set for realizing special purposes such as special compression, encryption and the like according to special needs.
7. Separated encryption and decryption
Based on RSA algorithm design, the principle is that two very large prime numbers p and q are used for calculating the product n = pq; n is the modulus, Φ (n) = (p-1) (q-1), choosing a number e smaller than Φ (n) that is prime to Φ (n), i.e., e and Φ (n) have no other common factor except 1. Find another number d, so that (ed-1) can be divided exactly by Φ (n). The values e and d are called the encryption key and the decryption key, respectively. The public key is this logarithm (n, e); the private key is this logarithm (n, d).
The specific operation steps are as follows:
A. key generation
1. Two large prime numbers (greater than 100 decimal places) p and q are chosen at will, p not being equal to q, with n = pq being calculated.
2. A natural number e, larger than 1 and smaller than Φ (n), is chosen, e having to be reciprocal to Φ (n).
3. Calculating a decryption key d by using an Euclid algorithm, and satisfying e x d =1 (mod phi (n)), namely ed + r phi (n) =1
4. Records of p and q are destroyed.
Where n and d are also relatively prime. n and e are public keys and n and d are secret keys. d is secret and n is issued to the outside.
B. Encrypting and decrypting information
Let the information to be encrypted be plaintext m, then:
the following calculation is made during encryption: c ≡ me (mod n)
The following calculation is made during decryption: m = cd (mod n), c being ciphertext
And (3) proving that: cd (mod n) ≡ med (mod n) ≡ m1 (mod Φ (n)) ≡ mk Φ (n) +1 (mod n)
Two cases are discussed:
gcd (m, n) =1, defined by Euler's theorem Φ (n) ≡ 1 (mod n), mk Φ (n) ≡ 1 (mod n), mk Φ (n) +1 ≡ m (mod n), i.e. m = cd (mod n)
gcd (m, n) ≠ 1, assuming without loss of generality that m = cp, c is an integer, then gcd (m, q) =1, defined by Euler's theorem Φ (q) ≡ 1 (mod q), (mk Φ (q)) Φ (p) ≡ 1 (mod q), mk Φ (n) ≡ 1 (mod q), so there is r, so that mk Φ (n) ≡ 1 rq, multiplying both sides of the equation by m = cp yields mk Φ (n) +1 ≡ m + rcpq = m + rcn, i.e., mk Φ (n) +1 ≡ m (mod n), i.e., m = cd (mod n)
The security of rsa is that for a large number n, there is no efficient way to decompose it, so that e cannot be obtained knowing n d; likewise, d cannot be obtained when n e is known.
C. Practical solution
P and q adopt more than 100-bit prime numbers, and then a public key and a key are separated, namely the public key can be stored at a bar code generating end, the key is integrated in a reading device, and the reading device only outputs text information.
8. The size can be adjusted at will
The DZ-Code is selected to be of a suitable size, including 2 x 2,3 x 3,4 x 4,5 x 5, \8230;, infinitely extensible, depending on the length of the information text. But the distribution mode of each size is different, and the specific arrangement is shown in the following table (each small square represents an information unit, and the arrangement rule of the information units is that the sum of the sequence numbers of any information units arranged transversely, longitudinally and obliquely is the same or the closest, namely, the algorithm is similar to the nine-square grid).
TABLE 3
TABLE 4
TABLE 5
TABLE 6
9. Multiple ink design
If a common printing method is adopted, the DZ-Code has no anti-counterfeiting characteristic like other bar codes, so that the counterfeiting of the DZ-Code can be effectively controlled only by special ink or a special light source, and infrared with the wavelength of 760 nm-950 nm and ultraviolet with the specific wavelength are selected to identify and read the corresponding DZ-Code.
10. Recognizing and reading equipment
The embedded system design (ARM + Linux) is adopted, and the embedded system can be used as a terminal to independently operate on hardware and can also be used as information input equipment to be integrated into the existing information system. Integrates multiple light source scanning modes (visible light, ultraviolet and infrared), and realizes high-speed reading of a hardware set.
Design specification of image acquisition processing system:
the hardware system consists of a CMOS sensing chip, a corresponding lens, a dual-channel RAM, a DSP, an FPGA and a display.
The CMOS sensing chip collects images from the lens and sequentially writes image data into the RAM under the time sequence control of the FPGA. And after the COMS sensing chip finishes one-time acquisition, the FPGA informs the DSP to start data processing. Meanwhile, the COMS sensing chip and the FPGA are suspended. And after the DSP finishes processing, displaying the result on a display, and informing the FPGA that the next acquisition can be started.
Regarding the performance, the performance of the DSP, and the reading speed of the RAM can be improved by improving the accuracy of the CMOS sensor chip. FIFOs may be added before the DSP if high speed acquisition is to be taken.
11. And (3) error correction control:
in fact, the information to be transmitted by the two-dimensional bar Code DZ-Code is finally changed into binary bits by some coding means, and a binary image is generated and is used as a carrier for information transmission. However, in the transmission of images, that is, DZ-Code, interference of transmission channels, such as what is commonly called scratches and stains, should be accompanied, so that an error control technique should be introduced in the information encoding process.
The project adopts a linear block coding technology. The code word contains three parameters of n, k and d, and the input signal is divided into k.m bit groups, each group comprises k symbols, and each symbol consists of m bits. The coding mode has stronger error correction capability on burst errors.
A code for correcting t symbol errors has the following parameters:
code length: n =2 m -1 symbol, or m (2 m-1) bits;
and (3) information segment: k symbols, or mk bits;
and (4) supervision: n-k =2t symbols, or m (n-k) bits;
minimum code distance: d =2t +1 symbol, or m (2t + 1) bits.
The error patterns that it can correct are:
total length of b 1 Single burst of = (t-1) m +1 bits.
Total length of b 2 Two bursts of = t-3 m +3 bits.
Total length of b i I bursts of = t-2i-1 m +2i-1 bits.
In the coding process, different codeword parameters are selected to obtain codewords with different error correction levels.
In DZ-Code, we use a Code length n of 15=2 4 1, and selecting the k value according to the error correction needs of different levels.
In the encoding process, polynomial x is used 4 + x +1=0, a GF (2) containing 16 elements is constructed 4 ) Domains, as shown in the following table:
| 0 | 0000 |
| α 0 ＝1 | 0001 |
| α 1 ＝α | 0010 |
| α 2 ＝α 2 | 0100 |
| α 3 ＝α 3 | 1000 |
| α 4 ＝α+1 | 0011 |
| α 5 ＝α 2 +α | 0110 |
| α 6 ＝α 3 +α 2 | 1100 |
| α 7 ＝α 3 +α+1 | 1011 |
| α 8 ＝α 2 +1 | 0101 |
| α 9 ＝α 3 +α | 1010 |
| α 10 ＝α 2 +α+1 | 0111 |
| α 11 ＝α 3 +α 2 +α | 1110 |
| α 12 ＝α 3 +α 2+ α+1 | 1111 |
| α 13 ＝α 3 +α 2 +1 | 1101 |
| α 14 ＝α 3 +1 | 1001 |
| α 15 ＝1 | 0001 |
during encoding, each four-digit binary number is converted into a corresponding symbol (namely, a 16-digit character is represented) according to the table. Then, a generator polynomial g (x) = (x- α) is determined according to the selected t value 2 )(x-α 3 )...(x- α 2t ). It is expanded and a generator matrix is obtained from the coefficients of each term. The input information is multiplied by the matrix for every k symbols to obtain a coding result, and the symbols are converted back to binary bits to complete the coding.
The algorithm for deriving the generator matrix from the polynomial is as follows:
let the generator polynomial g (x) after expansion be
g(x)＝A 2t *x 2t +A 2t-1 *x 2t-1 +…+A 1 *x+A 0
In the formula A 2t 、A 2t-1 …A 1 、A 0 Are constant and it is easy to see that they must take on the previously constructed GF (2) 4 ) In the domain. In addition, A 2t =1 is also inevitable.
The generation matrix can be written as follows:
this matrix can be reduced to the following form:
this matrix (which can be seen to be K x N) can be used to generate the final codeword. And taking one group of information symbols at every K bits as a matrix of 1 x K, multiplying the matrix by the generated matrix, and obtaining N elements in the matrix of 1 x N, namely N symbols generated after the input K symbols are coded.
During decoding, received binary information is converted into the symbols, the error position can be calculated from the received code words by using an iterative algorithm, and the error is restored by listing and solving an equation set.
Before decoding, an existing generator matrix is firstly provided to obtain a check matrix which is a (N-K) N matrix. The format is as follows:
grouping every N received symbols as a matrix of 1 x N, and H T Multiplication results in a matrix of 1 x n-K, which we will refer to as S matrix for the moment.
If S matrixAnd if the matrix is 0, the transmission process is indicated to be error-free. And directly entering the next decoding process. Otherwise, the errors are found and corrected using the following iterative procedure. Let S matrix be (S) 1 S 2 S 3 ……S 2t )
TABLE 8
| J | σ (j) (x) | d j | D(j) | j-D(j) |
| -1 | ||||
| 0 | ||||
| 1 | ||||
| 2 | ||||
| … | ||||
| 2t |
Table 8 is filled in as follows.
(1) j = -1, σ (j) (x)＝1，d j ＝s 0 ＝1，D(j)＝0，j-D(j)＝-1。
(2) j =0, σ (j) (x)＝1，d j ＝s 1 ，D(j)＝0，j-D(j)＝0。
(3) The two lines are initial values, and the iterative process is started from the initial values.
When the j +1 step of operation is performed, d is judged j If the value of (1) is 0, then σ (j+1) (x)＝σ (j) (x) D (j + 1) = D (j). If not 0, then find a line before the jth line, for example, the ρ -th line, so that ρ -D (ρ) has the maximum value,
and d is ρ Is not 0. Then
σ (j+1) (x)＝σ (j) (x)+d j d ρ -1 x j-ρ σ (ρ) (x)
D(j+1)＝max[D(j)，D(ρ)+j-ρ]
(4) Iterative iteration to deduce sigma (2t) (x) In that respect The result is a polynomial that is solved, the reciprocal of the resulting root being GF (2) as defined previously by us 4 ) Elements in the domain. The addition of 1 to the number at the index position is the position of the error in the received symbol sequence.
And setting error values at each error position. The original symbols at corresponding positions in the received symbol sequence are replaced by the S matrixes, the S matrixes are recalculated, so that each element in the S matrixes contains the set unknown number, and an S matrix is obtained before, and the S matrixes are equal to each other, so that error values can be eliminated.
The error value is subtracted from the received symbol to obtain the due symbol.
Then, next, the first K information bits in the N-bit symbol are extracted. Reducing them to binary information.
The error correction codeword thus completes the error correction task.
In the DZ-Code, because the Code words generated after coding are scattered and distributed in different space areas of a Code diagram, the problem of channel interference caused by local bar Code breakage can be better solved, and the point is intuitively and easily understood.
12. Image processing
A. Obtaining DZ-Code image
Let the image of the barcode be G (x, y), the height of the barcode in the imageThe degree and the width are recorded as H and W, the threshold value during the image binarization is T, and then when the image is scanned from left to right, the left boundary E (x) of the bar code is obtained 1 ，x 2 ，...，x w ) I.e. by
xi＝min{x|G(x，i)＜T}i＝1，2，......，w-1
Then, solving a linear equation of the left boundary of the bar code by standard Hough transformation:
ρ＝xcosθ+ysinθ
the barcode image is rotated to horizontal using a double-line differential method. Like the left boundary algorithm, the right boundary, the upper boundary and the lower boundary of the bar code can be obtained. Thus, a barcode image is obtained.
Next, a barcode image of each row and each column, i.e., each unit square, is obtained.
Firstly, the image is subjected to edge detection in the horizontal direction by using a canny operator, and then the image is projected in the horizontal direction:
the peak of p (y) corresponds to the bar code's row boundary. Smoothing p (y) with a gaussian function g (y): (y) = p (y) × g (y), then _ (y) is first order differenced and second order differenced, and the set of boundaries is { y _' (y) =0^ _ ^ y (= 0}. Thus, a single-row bar code image can be segmented.
B. Binarization and noise processing
In the acquisition process of the bar code, through photoelectric conversion, the gray level of the module with dark color is g 1 Gray scale of light module is g 2 Then, the gray scale change of the ideal monochrome barcode is as shown in fig. 4, where:
the functional form of v (x) is:
wherein when x is more than or equal to 0, sigma (x) =1; when x is less than or equal to 0, sigma (x) =0
Considering noise, v (x) has the following form:
wherein H is the height of the unit square of the bar code.
Due to the noise effect of the optical system, in practice: w (x) = g (x) × v (x) that is
Wherein k = H (g) 1 -g 2 )，C＝g(x)*Hg 2 ，
The boundary portion is blurred and is more difficult to determine due to the optical noise effects.
Then, a Flourier filtering denoising algorithm is adopted
Calculated, the first order difference of w (x) is:
the second order difference is:
performing Flourier transformation on two sides of W (x) = G (x) × v (x), wherein W (x) = G (x) · B (x)
Wherein:
then there are:
handle
Expanding by using a Toyer series to obtain:
and (3) taking the inverse Fourier transform on two sides:
the high-order operator has great influence on the bar code boundary, so that a good effect can be achieved only by reserving the second order:
now consider how to determine σ
Considering a single boundary e
Then:
thus:
however, in practice, because the ideal independent boundary does not exist due to the influence of the adjacent edge, a boundary with the minimum influence of the adjacent edge can be selected as the independent boundary. Boundary e i And finding a relatively independent boundary by taking the principle that the absolute value of the first order reciprocal of w (x) is maximum, then calculating sigma, and then calculating v (x).
Next, a boundary strength histogram is calculated, and the result is shown in fig. 5. As shown in fig. 5, the boundary strength histogram is a typical bimodal map, and the boundary of the barcode unit module is obtained by using the threshold value obtained by the Ostu algorithm, so that the code of the whole barcode is obtained, i.e., the information stream in the barcode can be obtained by the RS decoding algorithm.
Claims (11)
1. A matrix two-dimensional bar code, the code pattern of which is formed by arranging n x m rectangular unit information blocks without gaps, wherein n and m are positive integers larger than 1, and n is the same as or different from m; each rectangular unit information block is formed by arranging two kinds of rectangular color block units with different optical characteristics in an gapless mode, wherein n 'and m' are positive integers larger than 1, n 'and m' are the same or different, each rectangular unit information block comprises a positioning identifier and a data area, and the positioning identifier is characterized in that the shape of the positioning identifier is an L shape or a reverse L shape along two adjacent sides of a frame of the rectangular unit information block.
2. The matrix type two-dimensional barcode according to claim 1, wherein the color of the L-position identifiers of the adjacent unit information blocks in the code pattern is different, and the arrangement direction is the same.
3. The matrix two-dimensional barcode according to claim 1, wherein the data area in the unit block is comprised of x y information elements, wherein x and y are positive integers greater than 1, x and y being the same or different; the information unit is composed of adjacent 4 rectangular color block units to form a rectangle in a shape of a Chinese character 'tian', and represents a 16-system character.
4. The matrix two-dimensional barcode according to claim 3, wherein the data area in the unit block is composed of 8 x 8 rectangular color block units of two different colors, which represent 16 symbols.
5. Matrix-type two-dimensional barcode according to claim 2 or 4, wherein said different colors are different or dissimilar optical features in a grey scale map.
6. The encoding method of matrix type two-dimensional barcode according to claim 1, wherein the information to be encoded is converted into 16-system data stream by computer, then the data stream is divided into information data code words with specific information bit length, and then the error correction operation is performed on the information data code words to produce error correction code words; generating a code diagram main frame through a computer, determining the number and arrangement of information units in the code diagram, wherein the arrangement rule of the information units is that the sum of the sequence numbers of any information units arranged transversely, longitudinally and obliquely is the same or the closest; the error correction code words are filled into the data area by using the information unit as a basic unit to form a unit information block, and a code image is generated.
7. The encoding method according to claim 6, wherein the encoding process comprises the steps of:
A. converting information to be encoded by the matrix two-dimensional barcode of claim 1 into a 16-system string S by a computer;
B. according to the required error correction level, sequentially cutting S into a plurality of 16-system character strings with the length of k according to the length of an information bit k in an error correction level table, and adding an end identifier to the last k-bit string;
error correction grade table
C. Encoding the generated characters of all the k-bit 16-system strings into 16-system character strings Sn with the code length of 15 bits, namely error correction code words, by using an RS algorithm respectively;
D. generating a code map main frame through a computer, determining the number and arrangement of information units in the code map, wherein the arrangement rule of the information units is that the sum of sequence numbers of any transversely, longitudinally and obliquely arranged information units is the same or most similar;
E. sequentially connecting all Sn into a whole string of Sns, and sequentially storing each character in the Sns on an information unit of the whole data area of the code map from high order to low order;
F. expanding the 16-system characters on each information unit into 4 binary bits, namely forming 4 rectangular color block units; expanding the 16-system characters on other information units in the same way to form a data area code image;
G. dividing the code image of the data area into x y data areas as unit information block data, wherein x and y are positive integers larger than 1, x and y are the same or different, and adding positioning identifiers on the frame to form the code image.
8. The method for encoding matrix two-dimensional bar code according to claim 6, wherein the encoding is performed by using RSA algorithm.
9. The encoding method of matrix type two-dimensional barcode according to claim 6, wherein ASCII encoding mechanism is adopted.
10. The method for decoding a matrix-type two-dimensional barcode according to claim 1, comprising recovering the code pattern into a binary data stream by means of a digital camera and a computer, and decoding the binary data stream by inverse operation of the encoding process to determine the meaning represented by the data stream, wherein an anti-distortion analysis method is added to the decoding method.
11. The method of decoding a matrix-type two-dimensional barcode according to claim 10, wherein the anti-distortion analysis method comprises the steps of: when reading, firstly, determining the area of the whole bar code according to the edge detection and the positioning identifier, and automatically determining the direction of the bar code according to the definite directivity of the L-shaped positioning identifier; then, the following operations are performed for each unit information block:
A. determining the lengths of 2 edges La and Lb of the unit information block positioning identifier and the included angle between La and Lb, and selecting the starting reading with the included angle closest to 90 degrees;
B. selecting K, wherein the range is 5-20, amplifying the length of the unit information block by K times along the La direction, and amplifying the length of the unit information block by La multiplied by K/Lb times along the Lb direction;
C. selecting one of La and Lb with smaller curvature, and fixing; calculating the local bending angle a of the other, starting from one end thereof, and then translating each point constituting the other edge and the image between the two edges, in the direction of the fixed edge, by a distance such that the perpendicular distance between each point of translation and the fixed edge is multiplied by tan a;
D. sequentially performing the operation of the step C, and performing the operation of the next unit information block after La and Lb are adjusted;
E. each unit information block needs to refer to the edge curvature of the unit information blocks at the periphery, calculate the inclination angle of the unit information block, and then stretch the unit information block according to the inclination angle;
F. the bar code is finally determined.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100378519A CN100369059C (en) | 2006-01-18 | 2006-01-18 | Matrix type two-dimensional bar code and its encoding and decoding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100378519A CN100369059C (en) | 2006-01-18 | 2006-01-18 | Matrix type two-dimensional bar code and its encoding and decoding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1801188A CN1801188A (en) | 2006-07-12 |
| CN100369059C true CN100369059C (en) | 2008-02-13 |
Family
ID=36811181
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100378519A Expired - Fee Related CN100369059C (en) | 2006-01-18 | 2006-01-18 | Matrix type two-dimensional bar code and its encoding and decoding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100369059C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101615259B (en) * | 2008-08-01 | 2013-04-03 | 凌通科技股份有限公司 | Method for coding two-dimensional optical identification code, identification system and printed product thereof |
Families Citing this family (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101546387B (en) * | 2006-11-16 | 2012-05-23 | 深圳市天朗时代科技有限公司 | Storage method of multimedia material index information and printed publication thereof |
| CN100511271C (en) * | 2006-11-16 | 2009-07-08 | 深圳市天朗时代科技有限公司 | Two-dimensional decoding method |
| CN101105833B (en) * | 2007-06-12 | 2011-04-06 | 李曙光 | 2D linear graphics coding anti-fake method |
| CN101159028B (en) * | 2007-08-20 | 2015-05-13 | 中兴通讯股份有限公司 | Multiple graphics matrix type two-dimension bar code implementing method and device |
| CN101639899B (en) * | 2008-07-30 | 2013-08-28 | 华为技术有限公司 | Methods and devices for encoding and decoding two-dimension code and terminal |
| CN101645140B (en) * | 2008-08-06 | 2016-10-05 | 华为技术有限公司 | Two-dimensional code generation method, coding/decoding method and device |
| CN101859397B (en) * | 2009-04-10 | 2017-06-27 | 银河联动信息技术（北京）有限公司 | Two-dimensional array code |
| CN101854180B (en) * | 2010-06-01 | 2013-04-24 | 福建新大陆电脑股份有限公司 | Bar code error correcting and decoding device |
| CN101882206B (en) * | 2010-06-01 | 2012-06-27 | 福建新大陆电脑股份有限公司 | Decoding chip of RSS (Really Simple Syndication) bar code |
| CN101908125B (en) * | 2010-06-01 | 2014-07-02 | 福建新大陆电脑股份有限公司 | QR (Quick Response) bar code decoding chip and decoding method thereof |
| CN101944187B (en) * | 2010-09-07 | 2014-04-02 | 龚湘明 | Two-dimensional micro code and processing method and device thereof |
| CN102081748B (en) * | 2011-02-12 | 2013-02-27 | 熊锐 | Bar code pattern and bar code group pattern formed by node matrix and node line, and generation and identification method thereof |
| US9898637B2 (en) * | 2012-11-13 | 2018-02-20 | Kyodo Printing Co., Ltd. | Two-dimensional code |
| CN103049487B (en) * | 2012-12-05 | 2015-09-30 | 北京奇虎科技有限公司 | For the method and system of serialization matrix data elements mark |
| CN103400175B (en) * | 2013-07-31 | 2017-02-08 | 贝壳网际（北京）安全技术有限公司 | Method and device for processing pattern identification code |
| CN104517108B (en) * | 2013-09-29 | 2017-12-22 | 北大方正集团有限公司 | A kind of method and system of determination QR code binary image edge lines |
| CN103530590B (en) * | 2013-10-19 | 2016-02-24 | 高韬 | DPM Quick Response Code recognition system |
| CN104301310A (en) * | 2014-09-25 | 2015-01-21 | 北京亚航天际工贸有限责任公司 | Isolation network data exchange method and system based on bar code fax recognition technology |
| CN104794619B (en) * | 2015-03-25 | 2018-08-24 | 同济大学 | Anti-channel conflict digital information mapping code method for commodity packaging |
| CN104766217B (en) * | 2015-04-21 | 2019-03-29 | 张川 | A kind of merchandise news coding method, coding/decoding method when being disturbed |
| CN104751342B (en) * | 2015-04-21 | 2019-01-11 | 张川 | It is a kind of for tracing the merchandise news decoding method of commodity |
| CN104915702B (en) * | 2015-06-19 | 2019-02-15 | 珠海众能印刷有限公司 | Security code figure, its generation method and generating means with identification point |
| CN106127276B (en) * | 2016-06-27 | 2018-12-21 | 福建联迪商用设备有限公司 | A kind of method and system for quantifying to be stained QRCode |
| CN113420859A (en) * | 2019-03-18 | 2021-09-21 | 创新先进技术有限公司 | Two-dimensional code, and method, device and equipment for generating and identifying two-dimensional code |
| CN111368575B (en) * | 2020-03-09 | 2024-03-26 | 浪潮通用软件有限公司 | One-dimensional bar code encoding and decoding method and system |
| CN113259390B (en) * | 2021-06-25 | 2021-09-14 | 深圳市爱挖网络科技有限公司 | Account safety protection system for recruitment platform |
| CN114169482B (en) * | 2021-12-08 | 2023-07-11 | 福建正孚软件有限公司 | Microcosmic code encryption method and microcosmic code encryption system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6201901B1 (en) * | 1998-06-01 | 2001-03-13 | Matsushita Electronic Industrial Co., Ltd. | Border-less clock free two-dimensional barcode and method for printing and reading the same |
| US6371373B1 (en) * | 1999-05-25 | 2002-04-16 | Matsushita Electric Industrial Co., Ltd. | Method for reading a two-dimensional barcode |
| CN1438603A (en) * | 2003-03-25 | 2003-08-27 | 西安理工大学 | 2-D bar-code automatic reading method based on general office apparatus |
| CN1452117A (en) * | 2003-05-22 | 2003-10-29 | 深圳矽感科技有限公司 | Two-D bar code encoding and decoding method |
| CN1670763A (en) * | 2004-03-15 | 2005-09-21 | 深圳矽感科技有限公司 | A two dimensional bar codes and coding-decoding method thereof |
-
2006
- 2006-01-18 CN CNB2006100378519A patent/CN100369059C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6201901B1 (en) * | 1998-06-01 | 2001-03-13 | Matsushita Electronic Industrial Co., Ltd. | Border-less clock free two-dimensional barcode and method for printing and reading the same |
| US6371373B1 (en) * | 1999-05-25 | 2002-04-16 | Matsushita Electric Industrial Co., Ltd. | Method for reading a two-dimensional barcode |
| CN1438603A (en) * | 2003-03-25 | 2003-08-27 | 西安理工大学 | 2-D bar-code automatic reading method based on general office apparatus |
| CN1452117A (en) * | 2003-05-22 | 2003-10-29 | 深圳矽感科技有限公司 | Two-D bar code encoding and decoding method |
| CN1670763A (en) * | 2004-03-15 | 2005-09-21 | 深圳矽感科技有限公司 | A two dimensional bar codes and coding-decoding method thereof |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101615259B (en) * | 2008-08-01 | 2013-04-03 | 凌通科技股份有限公司 | Method for coding two-dimensional optical identification code, identification system and printed product thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1801188A (en) | 2006-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100369059C (en) | Matrix type two-dimensional bar code and its encoding and decoding method | |
| US9406010B2 (en) | Producing, capturing and using visual identification tags for moving objects | |
| CN102113026B (en) | Method and device for identifying document printing plate | |
| CN110073368B (en) | Method for authenticating an illustration | |
| US5862270A (en) | Clock free two-dimensional barcode and method for printing and reading the same | |
| US5329107A (en) | Dynamically variable machine readable binary code and method for reading and producing thereof | |
| CN102930192B (en) | Security information generates and acquisition methods and relevant apparatus | |
| JP3964390B2 (en) | Graphical barcode generation and decoding | |
| CN105074732A (en) | Information code, information code generation method, information code reader device, and information code usage system | |
| CN106845593A (en) | A kind of rectangle fixes dot matrix information encoding-decoding method | |
| CN102044010A (en) | Method for realizing temporary vehicle number plate information data transmission by utilizing two-dimensional bar codes | |
| CN101303742B (en) | Microminiature Hanxin code and method for generating symbol thereof | |
| JP2024505116A (en) | Dot matrix code construction method, generation and reading method, terminal, and dot matrix code system | |
| JP5998090B2 (en) | Image collation device, image collation method, and image collation program | |
| CN104766349A (en) | Geometrical form graph coding and decoding method applied to external packing of commodities | |
| US20150193900A1 (en) | Composite device and application process and apparatus thereof | |
| CN101571916B (en) | Method for identifying screen code with uniform dot matrix | |
| Goel et al. | A Secure and Optimal QR Code | |
| WO2012035552A2 (en) | Generating a code system using haar wavelets | |
| Ieswaria et al. | Bin Code: Encoding and Decoding of Picture Embedded Barcodes by Novel Intensity Bin | |
| CN111091012A (en) | Bar code generating method of bar code machine and related product | |
| CN109272090B (en) | Anti-counterfeiting two-dimensional code and optical modulation encryption method and production application system thereof | |
| KR20030028777A (en) | CRS-CODE and CRS-CODE encoding and decoding method of the same | |
| Jasim | Proposed method for Analyze the QR code and Detection of Vulnerabilities | |
| KR200281440Y1 (en) | Quatradic bar code applied ID card that cannot be forged |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080213 Termination date: 20110118 |