CN106228103A - A kind of recognition methods of double-deck code - Google Patents
A kind of recognition methods of double-deck code Download PDFInfo
- Publication number
- CN106228103A CN106228103A CN201610576220.8A CN201610576220A CN106228103A CN 106228103 A CN106228103 A CN 106228103A CN 201610576220 A CN201610576220 A CN 201610576220A CN 106228103 A CN106228103 A CN 106228103A
- Authority
- CN
- China
- Prior art keywords
- code
- district
- point
- dot matrix
- code district
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1408—Methods for optical code recognition the method being specifically adapted for the type of code
- G06K7/1426—Multi-level bar codes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1443—Methods for optical code recognition including a method step for retrieval of the optical code locating of the code in an image
Abstract
The invention discloses the recognition methods of a kind of double-deck code, including identifying the step of the track codes being positioned at top layer at high speeds and identifying the step of the some horizontal and vertical parity check code being positioned at bottom under the low speed.Identify track codes under described high speed specifically comprises the following steps that (1) reads the image at least one complete code district, track basis；(2) coding is determined according to the width of the data line segment on the data wire in code district, single track basis；(3) coding of data line segments all on described data wire is combined, calculates the code value in whole code district.Use the recognition methods of double-deck code of the present invention, have under high velocity environment, tentatively identify location, under low speed environments, accurately identify the feature of location, and the feature that recognition efficiency is high, simultaneously the highest to the request memory of the hardware identified, low cost.
Description
Technical field
The invention belongs to identification code technical field, be specifically related to the recognition methods of a kind of some horizontal and vertical parity check code.
Background technology
Two-dimensional bar code/Quick Response Code (2-dimensional bar code) is with certain specific geometric figure, by certain
The chequered with black and white graphic recording data symbol information that rule is distributed in plane (on two-dimensional directional)；On coding ingenious
Ground utilizes the concept of " 0 ", " 1 " bit stream constituting computer-internal logical foundations, uses several corresponding with binary system
Geometrical body represents word numerical information, by image input device or photoelectric scanning device automatically identifying and reading with realize information from
Dynamic process: it has some general character of barcode technology: every kind of code system has its specific character set；Each character occupies certain width
Degree；There is certain verifying function etc..The most also there is the information automatic identification function to different rows and process figure rotation change
Change point.
For the information age now, it has, and storage capacity is big, confidentiality is high, traceability is high, damage resistance is strong, redundant
Greatly, the characteristic such as cost is cheap, obtain in multiple fields such as list, safe and secret, tracking, license, stock taking, data redundants
Extensively application.In use, owing to its information memory capacity is big, therefore for the hardware requirement during identifying, such as after
The requirement of the CPU internal memory that platform processes is bigger so that the hardware cost of identification is higher, simultaneously because information memory capacity is big, identification
Speed is also the highest, and during identifying, it is necessary to the just code district to whole Quick Response Code, could identify, therefore identify
Requiring the highest, it is mainly reflected on the hardware to scanning, thus cost of the most just having deducted a percentage.
Simultaneously, for the speed during identifying, if containing much information of code storage, scan the most accordingly
Speed the most just ratio is relatively low, then the efficiency for whole identification process can impact.
Summary of the invention
In order to solve the problems referred to above, it is an object of the invention to provide the recognition methods of a kind of some horizontal and vertical parity check code, have at high velocity environment
The most tentatively identify location, under low speed environments, accurately identify the feature of location, and the feature that recognition efficiency is high, simultaneously to identification
The request memory of hardware the highest, low cost.
For achieving the above object, the present invention is achieved by techniques below scheme:
The recognition methods of double-deck code of the present invention, including identify at high speeds the track codes being positioned at top layer step and
The step of the some horizontal and vertical parity check code being positioned at bottom is identified under low speed.
Further, specifically comprising the following steps that of track codes is identified under described high speed
(1) image at least one complete code district, track basis is read；
Wherein, described track codes is made up of code district, some track bases；
Code district, described track basis includes being positioned at the centrage of centre and being positioned at the data wire of centrage both sides
Data wire in code district, single track basis is equal by some segment length, width data wire spacer segment arrangement not etc.
Composition；
(2) coding is determined according to the width of the data line segment on the data wire in code district, single track basis；
(3) coding of data line segments all on described data wire is combined, calculates the code value in whole code district.
Further, the specifically comprising the following steps that of identification point horizontal and vertical parity check code under described low speed
1) image at least one complete code district, dot matrix basis is read；
Wherein, described some horizontal and vertical parity check code is made up of several code districts, dot matrix basis；
Code district, described dot matrix basis includes dot matrix alignment code district and the dot array data code district that code-point is respectively distributed；
2) code-point in code district, dot matrix basis is classified as code-point and the code-point in dot array data code district in dot matrix alignment code district；
3) grid element center that the code-point in dot matrix alignment code district is formed is defined as the central point in dot array data code district；
4) according to the quantity of the code-point in dot array data code district and the orientation of the central point in distance dot matrix numeric data code district, really
The coding of the code-point in fixed point battle array numeric data code district；
5) coding of all code-points in described dot array data code district is combined, calculates the code value in whole code district.
Further, the code-point in code district, dot matrix basis is classified as code-point and the dot array data code district in dot matrix alignment code district
The step 2 of code-point) in, particularly as follows:
By whether having adjacent code-point in the range of the code district, 1/8 dot matrix basis around the code-point in code district, dot matrix basis
As criterion, if there being adjacent code-point, then judge that this code-point is the code-point in dot matrix alignment code district；If it is not, judge to be somebody's turn to do
Code-point is the code-point in dot array data code district.
Further, described high speed > 10cm/s, described low speed≤10cm/s；Described track codes uses carbon-free printing
Material, is developed the color by radiation of visible light；Described some horizontal and vertical parity check code uses the printing material of carbon containing, is developed the color by infrared ray radiation.
Further, line exposure mode is used during described identification track codes；During described identification point horizontal and vertical parity check code
Use the pattern of exposed frame.
Further, code district, described dot matrix basis is the matrix distribution of 5*5；Described dot matrix alignment code is distinguished and is distributed in described square
The periphery of battle array；Described dot array data code distinguishes the mid portion being distributed in described matrix.
Further, described dot matrix alignment code district include the positioned parallel straight line that is made up of code-point and with described positioned parallel
The two perpendicular positioning lines that straight line is perpendicular；Article two, described perpendicular positioning line is respectively arranged with the position horizontal-shift of a code-point.
Further, the code-point being located along the same line in described positioned parallel straight line is 5；In described perpendicular positioning line
The code-point being located along the same line is 4；Described dot array data code district includes 3*3 Ge Ma district；Each described code district has 1-4
Data point and a centre spot.
Further, the distance between code-point and the code-point in numeric data code district in described dot matrix alignment code district is more than 3/16
The size in code district, individual dot matrix basis；The distance between data point and centre spot in described dot array data code district is less than 1/16
The size in code district, individual dot matrix basis.
Compared with prior art, the invention has the beneficial effects as follows:
In the recognition methods of double-deck code of the present invention, it is to include the identification to track codes and the identification of some horizontal and vertical parity check code,
Wherein, track codes is to make use of under high-speed condition, only need to determine the rough location on current straight line, it is ensured that identify position mistake
Cheng Zhong, the most on the same line without departing from, then when position is precisely identified by needs, then reduce scanning speed,
Hence into the identification of a horizontal and vertical parity check code, it is the some horizontal and vertical parity check code form more simplified than Quick Response Code by employing, by the base in a horizontal and vertical parity check code
Plinth code divides into alignment code district and numeric data code district, during reading, only needs first to be classified by the code-point in a horizontal and vertical parity check code, the most really
The central point in given data code district, then according to quantity and the central point in range data code district of the code-point in numeric data code district, really
The coding of code-point in given data code district, last need to carry out coded combination to code-point in numeric data code district, calculate code value.Should
The recognition method of some horizontal and vertical parity check code is simple, background process is the most quick, simultaneously without all code-points being carried out the calculating of code value, and
And only need to use two 16bit (1 32bit) data that code-point is described, thus the highest to the request memory identifying hardware,
Therefore low cost.
Therefore, the two is effectively combined together, not only improves the efficiency of scanning recognition, simultaneously to scanning recognition
Hardware requirement is the highest, also reduces cost accordingly.
Accompanying drawing explanation
Below in conjunction with the accompanying drawings the detailed description of the invention of the present invention is described in further detail, wherein:
Fig. 1 is the flow chart of the track codes identification in the described double-deck code recognition methods of the present invention；
Fig. 2 is the flow chart of the some horizontal and vertical parity check code identification in the described double-deck code recognition methods of the present invention；
Fig. 3 is the schematic diagram of the described some horizontal and vertical parity check code of the present invention；
Fig. 4 be the present invention described some horizontal and vertical parity check code in the schematic diagram in code district, basis；
Fig. 5 is the schematic diagram of the described track codes of the present invention；
Fig. 6 is the schematic diagram in the code district, track basis in the described track codes of the present invention.
In figure:
1: code district, dot matrix basis
11: dot matrix alignment code district
111: positioned parallel line 112: perpendicular positioning line
12: dot array data code district
121: data point 122: centre spot
2: code district, track basis
21: centrage
22: data wire
221: data line segment
Detailed description of the invention
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are illustrated, it will be appreciated that preferred reality described herein
Execute example be merely to illustrate and explain the present invention, be not intended to limit the present invention.
The recognition methods of double-deck code of the present invention, specifically, is to include two continuous print steps successively, i.e. at height
In the case of speed, carry out the identification of track codes；At low speeds, the identification of a horizontal and vertical parity check code is carried out.Wherein, the separation of speed exists
10cm/s, it is generally the case that the identification scanning carrying out a horizontal and vertical parity check code scans at 10m/ in about 10cm/s, the identification carrying out a horizontal and vertical parity check code
s.In real process, the determination of this speed can also carry out suitable adjustment.
Wherein, as it is shown in figure 1, for the identification of above-mentioned track codes, specifically include following steps:
S101: read the image at least one complete code district, track basis；
Wherein, described track codes is made up of code district, some track bases 2；
Code district, described track basis 2 includes the centrage 21 being positioned at centre and is positioned at the data wire 22 of centrage both sides；
Data wire 22 in code district, single track basis 2 is equal by some segment length, between width data line segment 221 not etc.
Every rearranging；
S102: determine volume according to the width of the data line segment 221 on the data wire 22 in code district, single track basis 2
Code；
S103: the coding of data line segments all on described data wire is combined, calculates the code value in whole code district.
Wherein, shown in Fig. 5, the centrage 21 in the code district, track basis 2 of described track codes can be straight line, it is possible to
To be curve, its in anyhow intersecting, a plurality of mutually intersect, and be positioned at the data wire 22 of described centrage 21 both sides then with its phase
The most parallel.Wherein, minimum between described centrage 21 and centrage 21 width is identify scanning device Breadth Maximum 1/2.
Described data wire 22 is then the data line segment 221 that different in width, Disjunct distribution, and length are equal, described data line segment 221
Between 1 times-10 times of the width of a length of centrage 21, centered by its width between 0.1 times-2 times of the width of line 21, spacing
Centered by then 0.1 times-2 times of line 21 width.
Wherein, the data line segment 221 in data wire 22 uses binary recording information, wherein thick than centrage 21 number
According to line segment 221, then it represents that 1, the data line segment 221 thinner than centrage 22, then it represents that 0；Meanwhile, at the width of data line segment 221
Change, illustrates relevant synchronizing signal and the signal that turns round, and wherein synchronizing signal uses data line segment 221 table of the thickest width
Show, and represent that this code district, track basis 2 has finished, be prepared to enter into next code district, track basis 2；The described signal that turns round is adopted
During entering next code district, track basis 2, the data line segment 221 scanned is not the thickest width, then table turns round.
It addition, in scanning process, each straight length differs in code district, track basis 2, then synchronizing signal can be used to carry out polishing.
The present embodiment is formed a data field by 2*8 data line segment 221 in code district, track basis 2.Simultaneously at center
The position that line 21 intersects anyhow is provided with a horizontal and vertical parity check code, the most then can set at centrage 21, it is also possible to do not set, and purpose is used for
Position more accurately.Wherein thick lines represent 1, and hachure represents 0, and every 16 bit synchronization codes are spaced by one group of synchronous code.
As in figure 2 it is shown, the recognition methods of of the present invention some horizontal and vertical parity check code, specifically comprise the following steps that
S201: read the image at least one complete basic code district 1, code-point position uses bivector to represent, i.e. (x,
y)；This horizontal and vertical parity check code by several basis code districts 1 form, the most as shown in Figures 2 and 3, described basis code district 1 have include location
Code district 11 and numeric data code district 12.
S202: the code-point in code district 1, basis is classified as alignment code district 11 and the code-point in numeric data code district 12, and it is the most such as
Under:
By using basis code district 1 in code-point around 1/8 basic code district 1 in the range of whether have adjacent code-point as
Criterion, if there being adjacent code-point, then judges that this code-point is the code-point in alignment code district；If it is not, judge that this code-point is as number
According to the code-point in code district.Therefore according to above scheme the most simply, efficiently by the code-point 12 in alignment code district 11 and numeric data code district
Orderly classification；
S203: the grid element center formed described in the code-point in alignment code district 11 is defined as the central point in numeric data code district；
S204: according to the quantity of the code-point in numeric data code district and the orientation of the central point in range data code district, determine number
Coding according to the code-point in code district；
S205: the coding of all code-points in described numeric data code district is combined, calculates the code value in whole code district.
After an image is acquired, the shooting effect of image to the correct image of picked-up, can be made to clap relative to vertical
The effect of the generation taken the photograph, when so can effectively avoid obtaining image, scaling deformation, inclination and distortion and the motion of image become
Shape etc., and then improve recognition efficiency further.
The recognition methods of of the present invention some horizontal and vertical parity check code, the identification carried out on the basis of being built upon a horizontal and vertical parity check code, wherein, institute
Stating a horizontal and vertical parity check code and specifically included several code districts 1, basis, each code district 1, basis includes alignment code district 11 and numeric data code district
12, described alignment code district 11 is used for positioning, and numeric data code district 12 is used for encoding.
What code district, described basis presented in the present embodiment is the matrix distribution of 5*5, but is also not limited to the square shown in Fig. 3
Battle array, according to the demand of data volume, can do the adjustment of appropriateness.
Described alignment code district 11 is distributed in the periphery of described matrix, and described numeric data code district 12 is distributed in the centre of described matrix
Part.Wherein, described ground bit code district 11 include the positioned parallel straight line 111 that is made up of code-point and with described positioned parallel straight line
111 two perpendicular perpendicular positioning lines 112, are respectively arranged with the position horizontal-shift of a code-point in described two described perpendicular positioning lines,
For distinguishing horizontal and vertical position relationship.
In the present embodiment, the code-point being located along the same line in described positioned parallel straight line is 5, described perpendicular positioning
The code-point being located along the same line in line is 4, wherein has one to offset by position.For numeric data code district, include 3*3 code
District, in this yard of district, there are 1-4 data point 121 and a centre spot 122 in each yard of district, and wherein data point 121 is at least
1, up to 4.
For the distribution of the code-point in alignment code district 11 and numeric data code district 12, the code-point in described alignment code district 11 and data
The distance between code-point in code district 12 is more than the size in 3/16 basic code district 1；Data point in described numeric data code district 12 and
Distance between centre spot is less than the size in 1/16 basic code district 1.
In the double-deck code design that the present invention uses, track codes is positioned at top layer, uses carbon-free printing material, by visible
Light colour developing identifies, dot matrix code bit, in the bottom of track codes, is used the printing material of carbon containing, can be identified by infrared ray.Hot
When outside line is radiated at the surface of described double-deck code, track codes becomes transparence, is i.e. the some horizontal and vertical parity check code that can identify bottom；When visible
When light irradiates, then track codes colour developing, thus be identified.Wherein, during identifying track codes, use line exposure mode, know
During other some horizontal and vertical parity check code, use the pattern of exposed frame.
Meanwhile, some horizontal and vertical parity check code and track codes position in the picture all use bivector to represent, and obtain image it
After, all include the process to correct image.
The double-deck code design that the present invention utilizes, it is simply that effectively the two combined, utilizes code layer to print material simultaneously
Material
The above, be only presently preferred embodiments of the present invention, and the present invention not makees any pro forma restriction, therefore
Every without departing from technical solution of the present invention content, any amendment of above example being made according to the technical spirit of the present invention,
Equivalent variations and modification, all still fall within the range of technical solution of the present invention.
Claims (10)
1. the recognition methods of a double-deck code, it is characterised in that:
Including identifying the step of the track codes being positioned at top layer at high speeds and identifying the step of the some horizontal and vertical parity check code being positioned at bottom under the low speed
Suddenly.
The recognition methods of double-deck code the most according to claim 1, it is characterised in that:
Specifically comprising the following steps that of track codes is identified under described high speed
(1) image at least one complete code district, track basis is read；
Wherein, described track codes is made up of code district, some track bases；
Code district, described track basis includes being positioned at the centrage of centre and being positioned at the data wire of centrage both sides
Data wire in code district, single track basis is equal by some segment length, width data wire spacer segment arrangement group not etc.
Become；
(2) coding is determined according to the width of the data line segment on the data wire in code district, single track basis；
(3) coding of data line segments all on described data wire is combined, calculates the code value in whole code district.
The recognition methods of double-deck code the most according to claim 1, it is characterised in that:
Under described low speed, identification point horizontal and vertical parity check code specifically comprises the following steps that
1) image at least one complete code district, dot matrix basis is read；
Wherein, described some horizontal and vertical parity check code is made up of several code districts, dot matrix basis；
Code district, described dot matrix basis includes dot matrix alignment code district and the dot array data code district that code-point is respectively distributed；
2) code-point in code district, dot matrix basis is classified as code-point and the code-point in dot array data code district in dot matrix alignment code district；
3) grid element center that the code-point in dot matrix alignment code district is formed is defined as the central point in dot array data code district；
4) according to the quantity of the code-point in dot array data code district and the orientation of the central point in distance dot matrix numeric data code district, determine a little
The coding of the code-point in battle array numeric data code district；
5) coding of all code-points in described dot array data code district is combined, calculates the code value in whole code district.
The recognition methods of double-deck code the most according to claim 3, it is characterised in that:
Code-point in code district, dot matrix basis is classified as the code-point in dot matrix alignment code district and the step of the code-point in dot array data code district
2) in, particularly as follows:
By using whether have in the range of the code district, 1/8 dot matrix basis around the code-point in code district, dot matrix basis adjacent code-point as
Criterion, if there being adjacent code-point, then judges that this code-point is the code-point in dot matrix alignment code district；If it is not, judge this code-point
For the code-point in dot array data code district.
The recognition methods of double-deck code the most according to claim 1, it is characterised in that:
Described high speed > 10cm/s, described low speed≤10cm/s；
Described track codes uses carbon-free printing material, is developed the color by radiation of visible light；
Described some horizontal and vertical parity check code uses the printing material of carbon containing, is developed the color by infrared ray radiation.
The recognition methods of double-deck code the most according to claim 1, it is characterised in that:
Line exposure mode is used during described identification track codes；
The pattern of exposed frame is used during described identification point horizontal and vertical parity check code.
The recognition methods of the most according to claim 3 some horizontal and vertical parity check code, it is characterised in that:
Code district, described dot matrix basis is the matrix distribution of 5*5；
Described dot matrix alignment code distinguishes the periphery being distributed in described matrix；
Described dot array data code distinguishes the mid portion being distributed in described matrix.
The recognition methods of the most according to claim 7 some horizontal and vertical parity check code, it is characterised in that:
Described dot matrix alignment code district includes the positioned parallel straight line that is made up of code-point and perpendicular with described positioned parallel straight line
Two perpendicular positioning lines；
Article two, described perpendicular positioning line is respectively arranged with the position horizontal-shift of a code-point.
The recognition methods of the most according to claim 7 some horizontal and vertical parity check code, it is characterised in that:
The code-point being located along the same line in described positioned parallel straight line is 5；
The code-point being located along the same line in described perpendicular positioning line is 4；
Described dot array data code district includes 3*3 Ge Ma district；
There are 1-4 data point and a centre spot in each described code district.
The recognition methods of the most according to claim 9 some horizontal and vertical parity check code, it is characterised in that:
The distance between code-point and the code-point in numeric data code district in described dot matrix alignment code district is more than 3/16 dot matrix basis code
The size in district；
The distance between data point and centre spot in described dot array data code district is less than code district, 1/16 dot matrix basis
Size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610576220.8A CN106228103B (en) | 2016-07-20 | 2016-07-20 | A kind of recognition methods of bilayer code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610576220.8A CN106228103B (en) | 2016-07-20 | 2016-07-20 | A kind of recognition methods of bilayer code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106228103A true CN106228103A (en) | 2016-12-14 |
| CN106228103B CN106228103B (en) | 2019-05-10 |
Family
ID=57532082
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610576220.8A Active CN106228103B (en) | 2016-07-20 | 2016-07-20 | A kind of recognition methods of bilayer code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106228103B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108189027A (en) * | 2017-12-19 | 2018-06-22 | 朱宁波 | mobile robot control method |
| CN109978108A (en) * | 2017-12-27 | 2019-07-05 | 田雪松 | Dot matrix encoding and decoding method |
| CN109978106A (en) * | 2017-12-27 | 2019-07-05 | 田雪松 | Dot matrix coded base and dot matrix code identification method |
| CN113269003A (en) * | 2021-06-02 | 2021-08-17 | 海特锐（天津）科技有限公司 | Wheel hub bar code reading method, encoding method, reading system and storage medium thereof |
| CN113435556A (en) * | 2021-07-14 | 2021-09-24 | 三维码（厦门）网络科技有限公司 | Code generation and decoding method and anti-counterfeiting method of dot matrix code |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5189289A (en) * | 1989-05-17 | 1993-02-23 | Fujitsu Limited | Distinguishing bar code types by comparing bar block sizes |
| CN1517937A (en) * | 2003-01-17 | 2004-08-04 | 福建中安电子技术有限公司 | Double-layer code reader |
| CN103793735A (en) * | 2014-01-28 | 2014-05-14 | 河海大学 | Circular two-dimensional bar code and encoding and decoding method thereof |
| CN204965916U (en) * | 2015-09-25 | 2016-01-13 | 成都通通印防伪票证标签有限公司 | Double -deck two -dimensional code antifalsification label |
-
2016
- 2016-07-20 CN CN201610576220.8A patent/CN106228103B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5189289A (en) * | 1989-05-17 | 1993-02-23 | Fujitsu Limited | Distinguishing bar code types by comparing bar block sizes |
| CN1517937A (en) * | 2003-01-17 | 2004-08-04 | 福建中安电子技术有限公司 | Double-layer code reader |
| CN103793735A (en) * | 2014-01-28 | 2014-05-14 | 河海大学 | Circular two-dimensional bar code and encoding and decoding method thereof |
| CN204965916U (en) * | 2015-09-25 | 2016-01-13 | 成都通通印防伪票证标签有限公司 | Double -deck two -dimensional code antifalsification label |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108189027A (en) * | 2017-12-19 | 2018-06-22 | 朱宁波 | mobile robot control method |
| CN109978108A (en) * | 2017-12-27 | 2019-07-05 | 田雪松 | Dot matrix encoding and decoding method |
| CN109978106A (en) * | 2017-12-27 | 2019-07-05 | 田雪松 | Dot matrix coded base and dot matrix code identification method |
| CN113269003A (en) * | 2021-06-02 | 2021-08-17 | 海特锐（天津）科技有限公司 | Wheel hub bar code reading method, encoding method, reading system and storage medium thereof |
| CN113435556A (en) * | 2021-07-14 | 2021-09-24 | 三维码（厦门）网络科技有限公司 | Code generation and decoding method and anti-counterfeiting method of dot matrix code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106228103B (en) | 2019-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106228103B (en) | A kind of recognition methods of bilayer code | |
| CN106096488B (en) | A kind of recognition methods of horizontal and vertical parity check code | |
| CN100377167C (en) | Two-dimensional code area precisive positioning method for two-dimensional recognition | |
| EP0757823B1 (en) | Machine readable binary codes | |
| JP5905642B2 (en) | Decoding method for matrix type two-dimensional code | |
| CN100433038C (en) | Method for reading a symbol having encoded information | |
| CN101794404A (en) | Method for coding and reading invisible two-dimensional codes | |
| CN103632182A (en) | Three-dimensional (3D) image code generating and analyzing methods and device thereof | |
| CN110084080A (en) | Method, apparatus, two dimensional code and the trolley two dimensional code identification and generated | |
| RU2729399C1 (en) | Method for detection and recognition of visual markers of long range and high density | |
| CN1862560A (en) | 2-D barcode system capable of fast positioning based on positioning graph | |
| US8534565B2 (en) | Two-dimensional optical identification device with same gray level for quick decoding and decoding method therefor | |
| CN102081748A (en) | Bar code pattern and bar code group pattern formed by node matrix and node line, and generation and identification method thereof | |
| CN106909869A (en) | A kind of sampling grid partitioning method and device of matrix two-dimensional code | |
| US20200210664A1 (en) | Optically Readable Markers | |
| CN101527770B (en) | Encoding and decoding method for microdot matrix | |
| US7377449B2 (en) | Synchronous two-dimensional barcode system with all-around information, and reading method thereof | |
| US20230394704A1 (en) | Optically Readable Markers | |
| CN110926370B (en) | Measurement method and system | |
| CN102810152B (en) | Can fast decoding etc. gray scale two-dimensional optical identification code device and coding/decoding method | |
| JP2006252491A (en) | Tag for image identification and image identification system | |
| CN113988241A (en) | Anti-counterfeiting label, forming method thereof, anti-counterfeiting method and printed matter | |
| JP2006331322A (en) | Retrieval tag and information retrieval system using it | |
| CN102622573B (en) | Method for decoding micro code array | |
| Niu et al. | A novel coding method for multiple system barcode based on QR code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |