CN109615052B - Two-dimensional code with high recognition rate - Google Patents

Two-dimensional code with high recognition rate Download PDF

Info

Publication number
CN109615052B
CN109615052B CN201910010793.8A CN201910010793A CN109615052B CN 109615052 B CN109615052 B CN 109615052B CN 201910010793 A CN201910010793 A CN 201910010793A CN 109615052 B CN109615052 B CN 109615052B
Authority
CN
China
Prior art keywords
dimensional code
data
type
data area
areas
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910010793.8A
Other languages
Chinese (zh)
Other versions
CN109615052A (en
Inventor
刘少磊
沈怡
罗年庆
祝哲海
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Uni2k Taixing Information Technology Co ltd
Original Assignee
Uni2k Taixing Information Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Uni2k Taixing Information Technology Co ltd filed Critical Uni2k Taixing Information Technology Co ltd
Publication of CN109615052A publication Critical patent/CN109615052A/en
Application granted granted Critical
Publication of CN109615052B publication Critical patent/CN109615052B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/06009Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
    • G06K19/06037Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Credit Cards Or The Like (AREA)
  • Character Discrimination (AREA)

Abstract

The invention relates to the field of data identification, in particular to a two-dimensional code technology. The invention provides a two-dimensional code with high recognition rate. The two-dimensional code comprises a coding region, the coding region comprises a plurality of locating points and a plurality of data regions, and the data regions comprise: the data storage device comprises 2N equal-sized first-class data areas which are positioned at intervals in the vertical direction by positioning points, 2M equal-sized second-class data areas which are positioned at intervals in the horizontal direction by positioning points, and P third-class data areas adjacent to the first-class data areas and the second-class data areas. The method solves the technical problems of long time consumption, high error rate and low safety in two-dimension code identification, improves identification accuracy and identification efficiency, and enhances reliability and safety.

Description

Two-dimensional code with high recognition rate
Technical Field
The invention relates to the field of data identification, in particular to a two-dimensional code technology.
Background
The two-dimensional code is widely used in industries needing quick marking information of articles, such as high-tech industries, storage and transportation industries, wholesale retail industries and the like, and the identification speed and the identification safety of the data are important consideration factors for the development of the two-dimensional code.
The technical scheme of the Chinese patent application with the patent publication number of CN102034127A is shown in figure 1, and discloses a high-capacity two-dimensional bar code system and a coding method thereof. In the figure, a region 120 is a data unit composed of nXn matrix data units, where n is an integer of 7 or more. The capacity in design depends primarily on the size of n. If the data capacity is large, a single data unit is large, the data volume is increased, the value of the partition is lost, and the identification effect is reduced; the special information area (header file data unit area) is not structurally different from other information areas, so that the difficulty of data identification is increased; the whole information is divided into a plurality of data units, but the data units do not contain a spacing area for protecting data, which is not beneficial to pattern recognition.
Disclosure of Invention
The invention provides a two-dimensional code with good identification effect, high identification efficiency and high reliability, which aims to solve the technical problems of long two-dimensional code identification time consumption, high error rate and low safety in the prior art.
In order to achieve the above object, the present invention provides a two-dimensional code with high recognition rate, comprising: a coding region comprising a plurality of anchor points,
a plurality of data areas are provided in the data area,
the data area includes:
2N data areas of the first type of equal size located vertically spaced apart by anchor points,
2M second class data areas of equal size located horizontally spaced apart by anchor points,
and P third-type data areas adjacent to the first-type data areas and the second-type data areas.
Preferably, the length of the third type data area is equal to the length of the second type data area, and the width of the third type data area is equal to the width of the first type data area.
Preferably, the third type data area number p= (the first type data area number 2N/2) ×the second type data area number 2M/2.
Preferably, the positioning point is L in length V Width is L H Is a rectangular shape of (c).
Preferably, the rectangle may be a square.
Preferably, the first type data area includes V columns, 2A rows, and a total of 2a×v pixel points:
a 11 ,a 12 ,…a 1(V)
a 21 ,a 22 ,…,a 2(V)
…,
a (2A)1 ,…,a (2A)(V)
preferably, the first type data area consists of A data areas with length L V The first type information area with the width of fixed width I is formed, and in the first type information area, data are sequentially arranged from left to right or from right to left in a column unit, and the arrangement sequence between adjacent first type information areas is alternated.
Preferably, the second type data area includes 2B columns and H rows, and total h×2b pixels:
b 11 ,b 12 ,…,b 1(2B)
b 21 ,b 22 ,…,b 2(2B)
…,
b (H)1 ,…,b (H)(2B)
preferably, the second type data area is composed of B data areas with a fixed width I and a fixed width L H The second type information area of the data is arranged in the row unit from top to bottom or from bottom to top, and the arrangement sequence between the adjacent second type information areas is alternated.
Preferably, the third type data area includes 2B columns, 2A rows, and a total of 2a×2b pixels:
c 11 ,c 12 ,…c 1(2B)
c 21 ,c 22 ,…,c 2(2B)
…,
c (2A)1 ,…,c (2A)(2B)
preferably, the third type of data area is composed of a third type of information area of a×b×i, and in the third type of information area, data is sequentially arranged from left to right or from right to left in units of columns, and the arrangement sequence between adjacent third type of information areas is alternated.
Preferably, the two-dimensional code further comprises camouflage isolation areas with different data areas.
Preferably, the fixed width I is 1-10 pixels long.
Preferably, the number of the second information areas and the number of the third information areas determine the width of the first type data area, the length of the second type data area, and the length and width of the third type data area according to the number of the first information areas and the number of the second information areas.
Preferably, the plurality of data areas and the camouflage isolation area are subjected to mask processing.
Preferably, the two-dimensional code is used for information authentication in an offline state or a network-free state.
Preferably, the two-dimensional code is used for identifying a certificate, and the certificate comprises: license, name card, nameplate.
Preferably, the two-dimensional code is used for identifying a financial document, and the financial document comprises: policy, ticket, traffic ticket, financial statement.
Preferably, the two-dimensional code is used for advertisement identification, and the advertisement includes: legal documents, certificates, specifications, product packaging, advertising and printed matter.
Drawings
FIG. 1 is a diagram illustrating a prior art two-dimensional code;
FIG. 2 is a diagram illustrating a first type of information area according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a second type of information area according to a first embodiment of the present invention;
FIG. 4 is a diagram illustrating a third type of information area according to a second embodiment of the present invention;
fig. 5 is a two-dimensional code example diagram provided in the second embodiment of the present invention;
fig. 6 is a diagram illustrating an arrangement of two-dimensional code information areas according to a second embodiment of the present invention;
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is evident that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In view of the fact that the existing method cannot realize efficient, high-precision and high-safety two-dimensional code identification, the embodiment of the invention provides a two-dimensional code.
Example 1
The present embodiment provides an arrangement of a first type data area, a second type data area, and a third type data area of a two-dimensional code, as shown in fig. 2-4.
As shown in fig. 2, in the 1 st row of the first type information area, data are sequentially arranged from left to right in a unit of top-down columns, and in the 2 nd row of the first type information area, data are sequentially arranged from right to left in a unit of columns, and the last pixel point of the 1 st row of the first type information area is vertically adjacent to the first pixel point of the 2 nd row of the first type information area.
As shown in fig. 3, in the second type information area of column 1, data are sequentially arranged from top to bottom in units of row from left to right, and in the second type information area of column 2, data are sequentially arranged from bottom to top in units of row, and the last pixel point of the second type information area of column 1 is adjacent to the first pixel point of the second type information area of column 2 from left to right.
As shown in fig. 4, 1 third type information area is arranged from left to right in a unit of top-down columns, and 1 third type information area is arranged from right to left in a unit of top-down columns.
In the information area of the embodiment, the arrangement sequences of the two modes are alternately arranged to form streamline data, which is beneficial to reading the data; different areas are built by adopting information areas with different arrangement sequences, so that the recognition efficiency is improved; the arrangement order of the information areas of different data areas is different, and the corresponding data reading rule of each information area improves the safety of the data.
Example two
The present embodiment provides a two-dimensional code, as shown in fig. 5 and 6, including: the coding region comprises a plurality of positioning points 101, a plurality of data regions and disguised isolation regions with different intervals, wherein the data regions comprise 2 first-class data regions A0 and A1 which are connected between positioning points axially symmetrical in the horizontal direction, 2 second-class data regions B1-1 and B1-2 which are positioned on upper and lower edges and have the same size, and 1 third-class data region C1 which is positioned between the first-class data region and the second-class data region.
The first type data area comprises 9 columns of pixel points:
a 11 ,a 12 ,a 13 ,a 14 ,a 15 ,a 16 ,a 17 ,a 18 ,a 19
a 21 ,a 22 ,a 23 ,a 24 ,a 25 ,a 26 ,a 27 ,a 28 ,a 29
a 31 ,a 32 ,a 33 ,a 34 ,a 35 ,a 36 ,a 37 ,a 38 ,a 39
a 41 ,a 42 ,a 43 ,a 44 ,a 45 ,a 46 ,a 47 ,a 48 ,a 49
the first type data area is composed of a plurality of first type information areas 201 with length of 9 and width of 2, and the data is according to a 11 -a 21 -a 12 -a 22 -a 13 -a 23 -a 14 -a 24 -a 15 -a 25 -a 16 -a 26 -a 17 -a 27 -a 18 -a 28 -a 19 -a 29 -a 39 -a 49 -a 38 -a 48 -a 37 -a 47 -a 36 -a 46 -a 35 -a 45 -a 34 -a 44 -a 33 -a 43 -a 32 -a 42 -a 31 -a 41 ….
The second type of data area includes 9 columns of pixel points:
b 11 ,b 12 ,b 13 ,b 14 ,…,
b 21 ,b 22 ,b 23 ,b 24 ,…,
b 31 ,b 32 ,b 33 ,b 34 ,…,
b 41 ,b 42 ,b 43 ,b 44 ,…,
b 51 ,b 52 ,b 53 ,b 54 ,…,
b 61 ,b 62 ,b 63 ,b 64 ,…,
b 71 ,b 72 ,b 73 ,b 74 ,…,
b 81 ,b 82 ,b 83 ,b 84 ,…,
b 91 ,b 92 ,b 93 ,b 94 ,…
the second type data area is composed of a plurality of second type information areas 202 with length of 2 and width of 9, and the data is according to b 11 -b 12 -b 21 -b 22 -b 31 -b 32 -b 41 -b 42 -b 51 -b 52 -b 61 -b 62 -b 71 -b 72 -b 81 -b 82 -b 91 -b 92 -b 93 -b 94 -b 83 -b 84 -b 73 -b 74 -b 63 -b 64 -b 53 -b 54 -b 43 -b 44 -b 33 -b 34 -b 23 -b 24 -b 13 -b 14 ….
The third type of data area includes a plurality of pixel points:
c 11 ,c 12 ,…,
c 21 ,c 22 ,…,
c 31 ,c 32 ,…,
c 41 ,c 42 ,…,
the third type data area is composed of a plurality of information areas 203 of the third type having a length of 2 and a width of 2, and the data is according to c 11 -c 21 -c 12 -c 22 …, c 32 -c 42 -c 31 -c 41 Sequence of …。
In this embodiment, the fixed width I is 2, and the fixed width is fixed before the information area is calculated, and the length/width of the data area is determined according to the value of the fixed width and the number of the information areas.
In the embodiment, the interval regions exist among different regions, so that the regions are clear, the targeted identification is realized, and the identification speed is improved; the arrangement of the interval region reduces errors, reduces interference and improves success rate.
In addition, the embodiment solves the problem that the two-dimensional code is difficult to draw in large capacity. The data capacity is optimized by adjusting the width of the first type data area or/and adjusting the length of the second type data area, the purpose of maximizing the data in unit area is achieved, and the shape of the unit area is kept unchanged. Of course, the change of the first type data area and the second type data area positively affects the capacity of the third type data area, namely, the increase of the capacity of the first type data area and the second type data area, resulting in the increase of the area capacity of the second type data area, and vice versa.
In summary, the two-dimensional code provided by the embodiment of the invention has the following beneficial effects:
(1) According to the invention, the different data areas correspond to the different data areas, so that the data identifiability is enhanced, and the analysis recognition rate is improved; meanwhile, the arrangement sequence of different data areas causes different reading rules of the assembly line, so that the safety of data is ensured;
(2) The division and arrangement modes of the unit areas can optimize the data capacity, and the maximization of data and the like under the unit area is realized on the premise of ensuring the recognition rate;
(3) The light-colored interval regions in the data regions can reduce interference in the identification process, protect the integrity of data in the data regions and improve the analysis efficiency of the data from the side.
The foregoing embodiments have been provided for the purpose of illustrating the general principles of the present invention in further detail, and are not to be construed as limiting the scope of the invention, as any modification, equivalent replacement, improvement, etc. that comes within the spirit and principles of the present invention are intended to be included in the scope of the present invention.

Claims (17)

1. The utility model provides a high recognition rate's two-dimensional code which characterized in that includes:
the coding region is used for coding the data,
the coding region comprises a plurality of anchor points,
the encoded region further comprises a plurality of data regions,
the data area includes:
2N data areas of the first type of equal size located vertically spaced apart by the plurality of anchor points,
2M second-class data areas of equal size located horizontally spaced apart by the plurality of anchor points,
and P third class data areas positioned between the first class data area and the second class data area;
the third class data area number p= (the first class data area number 2N/2) × (the second class data area number 2M/2);
the length of the third type data area is equal to that of the second type data area, and the width of the third type data area is equal to that of the first type data area.
2. The two-dimensional code of claim 1, wherein the anchor point is L in length V Width is L H Is a rectangular shape of (c).
3. The two-dimensional code of claim 2, wherein the rectangle is a square.
4. The two-dimensional code of claim 1, wherein the first type of data region comprises V columns, 2A rows, and a total of 2A x V pixels:
a 11 ,a 12 ,…a 1(V)
a 21 ,a 22 ,…,a 2(V)
…,
a (2A)1 ,…,a (2A)(V)
5. the two-dimensional code as defined in claim 4, wherein the first type data area is composed of A data areas with length L V The first type information area with the width of fixed width I is formed, and in the first type information area, data are sequentially arranged from left to right or from right to left in a column unit, and the arrangement sequence between adjacent first type information areas is alternated.
6. The two-dimensional code according to claim 5, wherein the second type data area comprises 2B columns, H rows, and a total of H x 2B pixels:
b 11 ,b 12 ,…,b 1(2B)
b 21 ,b 22 ,…,b 2(2B)
…,
b (H)1 ,…,b (H)(2B)
7. the two-dimensional code as defined in claim 6, wherein the second type data area is formed by B data areas having a length of a fixed width I and a width of L H The second type information area of the data is arranged in the row unit from top to bottom or from bottom to top, and the arrangement sequence between the adjacent second type information areas is alternated.
8. The two-dimensional code of claim 7, wherein the third type of data area comprises 2B columns, 2A rows, and a total of 2A x 2B pixels:
c 11 ,c 12 ,…c 1(2B)
c 21 ,c 22 ,…,c 2(2B)
…,
c (2A)1 ,…,c (2A)(2B)
9. the two-dimensional code according to claim 8, wherein the third type data area is composed of a third type information area of a.b.i.in which data is arranged in a row unit in order from left to right or in order from right to left, and an arrangement order between adjacent third type information areas is alternated.
10. The two-dimensional code of any one of claims 1-9, further comprising camouflage isolation areas separating the different data areas.
11. The two-dimensional code according to claim 5 or 7, wherein the fixed width I is 1-10 pixels long.
12. The two-dimensional code according to claim 9, wherein the number of the second type information areas, the number of the third type information areas determine the width of the first type data area, the length of the second type data area, and the length and width of the third type data area according to the number of the first type information areas.
13. The two-dimensional code of claim 10, wherein the plurality of data regions and the camouflage isolation region are masked.
14. The two-dimensional code according to any one of claims 1 to 9, wherein the two-dimensional code is used for information authentication in an offline state or a netless state.
15. The two-dimensional code of any one of claims 1-9, wherein the two-dimensional code is used for identification of a document, the document comprising: license, business card and nameplate.
16. The two-dimensional code of any one of claims 1-9, wherein the two-dimensional code is used for financial document identification, the financial document comprising: policy, ticket, traffic ticket, and financial statement.
17. The two-dimensional code according to any one of claims 1 to 9, wherein the two-dimensional code is used for advertisement identification, the advertisement comprising: legal documents, certificates, specifications, product packaging, advertising and printing.
CN201910010793.8A 2018-12-30 2019-01-07 Two-dimensional code with high recognition rate Active CN109615052B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2018116438442 2018-12-30
CN201811643844 2018-12-30

Publications (2)

Publication Number Publication Date
CN109615052A CN109615052A (en) 2019-04-12
CN109615052B true CN109615052B (en) 2023-05-05

Family

ID=66016305

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910010793.8A Active CN109615052B (en) 2018-12-30 2019-01-07 Two-dimensional code with high recognition rate

Country Status (1)

Country Link
CN (1) CN109615052B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020143560A1 (en) * 2019-01-07 2020-07-16 尤尼泰克(嘉兴)信息技术有限公司 Two-dimensional code having high recognition rate and data area drawing method therefor

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11328301A (en) * 1998-05-12 1999-11-30 Denso Corp Two-dimensional code
CN102034127A (en) * 2009-09-28 2011-04-27 上海易悠通信息科技有限公司 Novel high-capacity two-dimensional barcode and system, encoding and decoding methods and applications thereof

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100414524B1 (en) * 2002-10-31 2004-01-16 주식회사 아이콘랩 Two-dimensional Code having superior decoding property which is possible to control the level of error correcting codes, and method for encoding and decoding the same
JP3996520B2 (en) * 2003-01-30 2007-10-24 株式会社デンソーウェーブ Two-dimensional information code and generation method thereof

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11328301A (en) * 1998-05-12 1999-11-30 Denso Corp Two-dimensional code
CN102034127A (en) * 2009-09-28 2011-04-27 上海易悠通信息科技有限公司 Novel high-capacity two-dimensional barcode and system, encoding and decoding methods and applications thereof

Also Published As

Publication number Publication date
CN109615052A (en) 2019-04-12

Similar Documents

Publication Publication Date Title
CN109447216B (en) Quick and accurate identification two-dimensional code
US5825015A (en) Machine readable binary codes
US3211470A (en) Coded coupon
CN101334849B (en) Two-dimension code label symbol creation method and apparatus
EP2849115B1 (en) Method for decoding matrix-type two-dimensional code
CN105243551B (en) It is adapted to the anti-fake dot pattern decoding method of commodity packaging
RU2014124113A (en) STRUCTURE FOR CODING AN ELEMENT WITH DIGITAL INFORMATION ON THE SURFACE AND METHODS OF APPLYING IN THE TYPE OF METHODS OF SUCH STRUCTURE AND ITS READING
CN109615052B (en) Two-dimensional code with high recognition rate
AU2010234173A1 (en) Two-dimensional array code
US8702011B2 (en) Barcode structure and barcode encoding method
CN101127089A (en) Implement method for embedding large amount of information on printing media
CN102831422A (en) Method for cutting and correcting dislocation of paper note image
EP3312772B1 (en) Graphical indicator
CN109740715B (en) Two-dimensional code data area drawing method with high recognition rate
CN114707623A (en) Lattice code coding method and coding device
CN109522770A (en) A kind of two dimensional code quickly positioned
CN100356399C (en) Two-dimensional barcode card and its decoding method
CN109740716B (en) Two-dimensional code drawing method capable of achieving rapid and accurate identification
WO2020143560A1 (en) Two-dimensional code having high recognition rate and data area drawing method therefor
CN114418050B (en) Anti-counterfeiting matrix code generation method and decoding method
WO2000058105A1 (en) Security image element tiling scheme
WO2020143559A1 (en) Quick positioning method for forming two-dimensional code positioning point dot matrix, and quick positioning method for capturing two-dimensional code positioning point dot matrix
CN103909741A (en) Method and apparatus for printing two-dimensional code by use of 9-pin printer in embedded system
WO2020143561A1 (en) 2d barcode enabling quick and accurate code recognition and method for creating same
EP2819067B1 (en) Method for producing a portable data carrier with chip

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant