WO2020143561A1 - 一种快速准确识别的二维码及其绘制方法 - Google Patents
一种快速准确识别的二维码及其绘制方法 Download PDFInfo
- Publication number
- WO2020143561A1 WO2020143561A1 PCT/CN2020/070367 CN2020070367W WO2020143561A1 WO 2020143561 A1 WO2020143561 A1 WO 2020143561A1 CN 2020070367 W CN2020070367 W CN 2020070367W WO 2020143561 A1 WO2020143561 A1 WO 2020143561A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- area
- dimensional code
- data area
- information
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record 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/06009—Record 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/06037—Record 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record 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/08—Record 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 using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means
- G06K19/10—Record 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 using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means at least one kind of marking being used for authentication, e.g. of credit or identity cards
Definitions
- the invention relates to the field of data recognition, in particular to the formation and capture technology of two-dimensional codes.
- Two-dimensional codes especially in industries such as high-tech industries, storage and transportation, wholesale and retail industries, which need to quickly mark information on items, their data recognition speed and safety, storage capacity, are two-dimensional codes Important considerations for development.
- two-dimensional codes are usually in the form of matrix arrays. Encoding and decoding start from the specified starting point of the matrix array. Accurate and fast reading of the positioning starting point is the key to ensuring successful decoding.
- the first prior art is a Chinese patent application with patent publication number CN102034127A, and its technical scheme is shown in FIG. 1. It discloses a large-capacity two-dimensional barcode system and its encoding method.
- the shape feature of the positioning point of the invention is not clear enough, and it is easy to be confused with other contents, which leads to the identification and positioning process of the positioning point taking too long; without auxiliary positioning points, the calculation error probability is large, that is, the accuracy of the information cannot be ensured, nor can the reading be improved.
- Speed the number of positioning points is 3, and the shapes are different, the design does not have consistency and symmetry, and the visual effect is too poor; the positioning process of the invention is to find three positioning points through four dashed outer frames.
- the large image range increases the difficulty of the positioning process; there is no image frame, which leads to edge data pollution and is not conducive to graphic recognition; the special information area (header data unit area) and other information areas have no structural difference, which guarantees The image is clean and tidy, but it increases the difficulty of data identification.
- the overall information is divided into several data units, there is no space between the data units for data protection; it is not scalable and is not conducive to large-capacity storage.
- the prior art 2 is a Chinese patent application with patent publication number CN102243704A, and its technical scheme is shown in FIG. 2. It discloses a two-dimensional code positioning system and a two-dimensional code identification method. The invention sets positioning points at the four end points of the two-dimensional code.
- the shape characteristics of the positioning points are not clear enough, which is easy to be confused with other content, which leads to the identification and positioning process of the positioning point taking too long; no interval zone setting affects positioning and Data reading efficiency; does not involve the partition management of information, which is not conducive to data security and affects the reading of data; no image frame, which leads to edge data pollution and is not conducive to graphic recognition; the design of this patent is also flawed in its scalability , Is not conducive to processing large-capacity data, or that the efficiency when processing large-capacity data is not high.
- Step 1 Encrypt to generate binary input data
- Step 2 Determine the QR code layout based on the input data
- Step 3 Under the specified background, draw a two-dimensional code positioning dot matrix
- Step 4 Draw the binary input data to the data area
- Step 5 Encrypt and generate the basic information binary data in the basic data area.
- the basic information binary data encrypted in step 5 and drawn in the basic data area includes:
- the step 2 includes:
- Step 2.1 Determine the version information according to the input data capacity, and determine the number of main and auxiliary positioning points, and the number of data areas;
- Step 2.2 Calculate the number of information areas in each data area based on the input data and QR code version information
- Step 2.3 Comprehensively calculate the version information of the two-dimensional code, and obtain the overall layout of the two-dimensional code by the number data of each information area.
- the step 4 includes:
- Step 4.1 Set up the pipeline according to the data area, draw the input data to each information area in sequence, and reserve a space between the data areas;
- Step 4.2 Randomly or designatedly select a mask template in the database, and perform mask processing on each data area and the disguised isolation area.
- step 4.1 the drawing pipeline order of different data areas is different.
- the two-dimensional code is used for information authentication in an offline state or a non-network state.
- the two-dimensional code is used for identification of the certificate
- the certificate includes: a license, a business card, and a nameplate.
- the two-dimensional code is used to identify financial documents
- the financial documents include: insurance policies, bills, traffic tickets, and financial statements.
- the two-dimensional code is used for announcement identification.
- the announcement includes: legal documents, certificates, instructions, product packaging, advertisements and printed matter.
- a quick and accurate two-dimensional code including:
- the coding area includes four centrally symmetric main positioning points at four vertices of the coding area,
- the main anchor point and the space around the coding area are the main anchor point and the space around the coding area.
- the coding area further includes auxiliary positioning points set on the edge of the coding area with axisymmetric equal spacing.
- the data area includes:
- 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.
- the data area further includes: a plurality of basic data areas provided along the outer edge of the coding area, where the basic data area contains two-dimensional code version information, parameter information, and orientation information.
- the basic data area includes a first basic data area located on the upper edge and the right edge of the coding area, and a second basic data area located on the lower edge and the left edge of the coding area; the first basic data area and the The second basic data area is symmetrical in center and has the same storage data content, or the basic data area includes a first basic data area located on the upper edge and the left edge of the coding area, and a second basic data located on the lower edge and the right edge of the coding area
- the first basic data area is symmetrical to the center of the second basic data area, and the content of the stored data is the same.
- the two-dimensional code further includes: a frame outline area for reducing data pollution; a camouflage isolation area spaced apart by different data areas; and the plurality of data areas and the camouflage isolation area are masked.
- the positioning points are in the shape of snowflakes; and positioning spacers are provided around the positioning points.
- the two-dimensional code is used for information authentication in an offline state or a non-network state.
- Figure 1 is an example of a two-dimensional code in the prior art
- Figure 2 is an example of a two-dimensional code in the prior art II
- FIG. 3 is a flowchart of a method for drawing a two-dimensional code provided in Embodiment 1 of the present invention
- Embodiment 4 is an overall example diagram of a two-dimensional code provided by Embodiment 2 of the present invention
- Embodiment 2 of the present invention is a partial example diagram of a two-dimensional code provided by Embodiment 2 of the present invention.
- FIG. 6 is an example diagram of a basic information area of a two-dimensional code provided by Embodiment 2 of the present invention
- embodiments of the present invention provide a two-dimensional code drawing method with accurate positioning, high recognition efficiency, and strong scalability. The present invention will be described in detail.
- This embodiment provides a two-dimensional code drawing method for rapid and accurate identification, as shown in FIG. 3, including:
- Step 1 Encrypt to generate binary input data
- Step 2 Determine the QR code version information according to the input data capacity, determine the number of auxiliary positioning points, and the number of the first data area, the second data area, and the third data area;
- Step 3 Based on the input data and QR code version information, calculate the number in each information area;
- Step 4 Comprehensively calculate the two-dimensional code version information, the number of each information area and other data to obtain the overall layout of the two-dimensional code, and draw a dot matrix of positioning points, including the main positioning points and auxiliary positioning points, under the specified background;
- Step 5 Set up the pipeline according to the data area, draw the input data to each information area in sequence, and reserve the interval area;
- Step 6 Randomly or designatedly select a mask template in the database to mask the data and disguise the isolation area;
- Step 7 Encrypt and generate and draw binary data such as version information, orientation information, and mask template information in the basic data area.
- the two-dimensional code version information and the number of each information area are comprehensively calculated by inputting data, and then the two-dimensional code is drawn, which optimizes the data capacity, has scalability, and uses large-capacity storage; the orientation information generated and drawn by encryption is determined
- the direction of the overall data decoding is determined, which determines the downstream or upstream reading of the pipeline in each data area.
- the analyzable data is read downstream, and the analytic data fails to be read upstream.
- the design increases the data security to a certain extent.
- This embodiment provides a two-dimensional code for rapid and accurate identification, as shown in FIGS. 4-6, including: a frame outline area 102 for reducing data pollution, a coding area, and a space between the frame outline area and the coding area
- the main compartment 103; the coding region includes four centrally symmetric main positioning points 100 located at four vertices of the coding region, a plurality of data regions, and a camouflage isolation region 106 spaced by different data regions.
- the coding area further includes four auxiliary positioning points 104 that are located on the edge of the coding area and are symmetrically arranged at equal intervals.
- the main positioning point 100 and the auxiliary positioning points 104 are provided with positioning spacing areas.
- the data area includes: six second-type data areas B1-1, B1-2, B2-1, B2-2, B3-1, B3- of equal size located on the upper and lower edges of the coding area separated by auxiliary positioning points 2.
- the length of the third type data area is equal to the length of the second type data area
- the width of the third type data area is equal to the width of the first type data area.
- the data area further includes: two basic data areas 101 extended along the edge of the coding area, the basic data area includes a first basic data area 301 located on the upper edge and the right edge of the coding area, and a lower edge of the coding area And the second basic data area 302 extending to the left; the first basic data area is symmetrical to the center of the second basic data area, and the content of the stored data is the same.
- the two-dimensional code structure of this embodiment includes four main positioning points 100 and four auxiliary positioning points 104, which have the same shape and are all snowflakes with a central symmetry. Snowflake has obvious characteristics that are different from other data areas, which makes it effective to distinguish between positioning points and data areas and improve positioning efficiency.
- the main anchor points are distributed at the four vertices of the coding area, and the auxiliary anchor points are evenly distributed along the border of the two-dimensional code. In order to maximize the data capacity, except for the fixed points and edges of the coding area, there are no positioning points.
- the dark frame 102 in the peripheral coding area can effectively reduce data pollution.
- the basic data area 101 mainly contains the QR code version information, various parameter information, and orientation information. And the information is divided into upper and lower sets, which are stored in the upper right and lower left areas of the QR code. As shown in FIG. 5, the first basic data area 301 is located at the upper layer, and the second basic data area 302 is located at the lower layer, and the two are symmetrically centered.
- the basic data area while providing basic information, realizes the orientation of the two-dimensional code, ensures the realization of the overall function, and directly relates to whether the data identification is accurate and successful.
- the data area is partitioned. As shown in FIG. 4, the data area is divided into three areas: a first type data area, a second type data area, and a third type data area, and a camouflage space 106 is provided between each partition.
- the setting of the camouflage interval reduces identification errors, reduces information interference, and improves the success rate of two-dimensional code identification.
- the number of the three data areas is directly related to the input data capacity. This partition solves the optimization problem of large data capacity and facilitates capacity expansion.
- the first type information area 201, the second type information area 202, the third type information area 203, the arrangement order difference between different data areas and the arrangement order between similar data areas are correspondingly arranged in different data areas Consistency can not only speed up data reading speed, but also ensure data security.
- the two-dimensional code drawing method provided by the embodiments of the present invention has the following beneficial effects:
- the positioning method of the encrypted pattern of the present invention adopts a snowflake-shaped centrally symmetric positioning pattern, which enhances the reliability of positioning and improves the analytical recognition rate;
- the main and auxiliary positioning points in the encrypted graphics of the present invention are designed as axisymmetric images, reducing image processing errors and accelerating the speed of data analysis;
- the basic data in the encrypted graphics of the present invention is divided into upper and lower layers of information, which can play a directional role and is a guarantee for the analysis process;
- the data partitioning method in the encrypted graphic of the present invention includes the division and arrangement of the information area in the data area, which improves the recognition efficiency under the premise of ensuring data security;
- the light-colored intervals in the encrypted graphics of the present invention avoid data pollution, protect the data integrity of the positioning point, and improve the data analysis success rate from the side;
- the encrypted figure of the present invention is composed of the above parts to form a beautiful center symmetric figure.
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Credit Cards Or The Like (AREA)
- Image Analysis (AREA)
Abstract
一种快速准确识别的二维码及其绘制方法，该方法包括：加密生成二进制输入数据；根据输入数据确定二维码布局；在指定背景下，绘制二维码定位点点阵；绘制二进制输入数据到数据区；加密生成并在基础数据区绘制基础信息二进制数据。该方法解决了现有技术存在的二维码定位可靠性低，识别耗时长，安全性低，不易大量存储的技术问题，定位准确，识别效率高，扩展性强。
Description
本发明涉及数据识别领域，特别是二维码的形成与捕捉技术。
二维码，特别是在高科技行业、储存运输业、批发零售业等需要对物品进行快捷的标示信息的行业广泛使用，其数据的识别速度与识别安全性，存储容量大小，是二维码发展的重要考量因素。此外，二维码通常采用矩阵阵列形式，编码及译码从矩阵阵列的指定起点开始，该定位起点的准确快速读取，是确保译码成功的关键所在。
现有技术一为专利公开号为CN102034127A的中国专利申请，其技术方案如图1所示。其公开了一种大容量二维条码系统及其编码方法。该发明定位点形状特征不够鲜明，容易与其他内容混淆，导致定位点的识别定位过程耗时太长；无辅助定位点，计算出错概率大，即不能确保信息的正确性，也不能提高读取的速度；定位点个数为3个，且形状各异，其设计不具备一致性和对称性，视觉效果太差；该发明定位过程为通过四条虚线外框找到三个定位点，所涉及到的图像范围较大，对定位过程增加了难度；无图像边框，导致边缘数据污染，不利于图形识别；特殊信息区(头文件数据单位区)和其他信息区，在结构上无区别，保证了图像的整洁，但增加了数据识别的难度；整体信息虽然分为若干个数据单位，而数据单位之间并没有间隔区做数据保护；不具有扩展性，不利于大容量的存储。
现有技术二为专利公开号为CN102243704A的中国专利申请，其技术方案如 图2所示。其公开了用于二维码的定位系统，二维码的识别方法。本发明在二维码四个端点处设置定位点，然而，其定位点形状特征不够鲜明，容易与其他内容混淆，导致定位点的识别定位过程耗时太长；无间隔区设置，影响定位以及数据读取效率；不涉及信息的分区管理，不利于数据的安全性，影响数据的读取；无图像边框，导致边缘数据污染，不利于图形识别；该专利在延展性上的设计也有所缺陷，不利于处理大容量数据，或者说在处理大容量数据时的效率并不高。
发明内容
本发明为解决现有技术存在的二维码定位可靠性低，识别耗时长，安全性低，不易大量存储的技术问题，提出一种快速准确识别的二维码绘制方法，包括：
步骤1：加密生成二进制输入数据；
步骤2：根据输入数据确定二维码布局；
步骤3：在指定背景下，绘制二维码定位点点阵；
步骤4：绘制二进制输入数据到数据区；
步骤5：加密生成并在基础数据区绘制基础信息二进制数据。
优选的，所述步骤5加密并在基础数据区绘制的基础信息二进制数据包括：
版本信息，定向信息，掩模模版信息二进制数据。
优选的，所述步骤2包括：
步骤2.1：根据输入数据容量判断版本信息，确定主定位点及辅助定位点个数，以及数据区个数；
步骤2.2：根据输入数据及二维码版本信息，计算各个数据区内信息区的个 数；
步骤2.3：综合计算二维码版本信息，各个信息区个数数据获得二维码整体布局。
优选的，所述步骤4包括：
步骤4.1：按照数据区设定流水线，将输入数据依序绘制至各信息区，并在数据区之间预留间隔区；
步骤4.2：在数据库内随机或指定选择掩模模版，对各数据区及伪装隔离区进行掩模处理。
优选的，所述步骤4.1中，不同数据区的绘制流水线顺序不同。
优选的，所述二维码用于离线状态或无网状态的信息认证。
优选的，所述二维码用于证件识别，所述证件包括：证照，名片，铭牌。
优选的，所述二维码用于财务文件识别，所述财务文件包括：保单，票据，交通罚单，财务报表。
优选的，所述二维码用于公告识别，所述公告包括：法律文书，证书，说明书，产品包装，广告及印刷品。
一种快速准确识别的二维码，包括：
编码区，
所述编码区包括位于编码区四个顶点的四个中心对称的主定位点，
及多个数据区；
所述主定位点及编码区外围的间隔区。
所述编码区还包括位于编码区边线的轴对称等间距设置辅助定位点。
优选的，所述数据区包括：
位于垂直方向被定位点间隔开的等大小的2N个第一类数据区，
位于水平方向被定位点间隔开的等大小的2M个第二类数据区，
以及与第一类数据区和第二类数据区相邻的P个第三类数据区。
优选的，所述第三类数据区的长与所述第二类数据区的长相等，所述第三类数据区的宽与所述第一类数据区的宽相等。
优选的，所述数据区还包括：沿编码区外沿设置的多个基础数据区，所述基础数据区包含二维码版本信息，参数信息，及定向信息。
优选的，所述基础数据区包括位于编码区上边沿及右边沿的第一基础数据区，以及位于编码区下边沿及左边沿的第二基础数据区；所述第一基础数据区与所述第二基础数据区中心对称，存储数据内容相同，或，所述基础数据区包括位于编码区上边沿及左边沿的第一基础数据区，以及位于编码区下边沿及右边沿的第二基础数据区；所述第一基础数据区与所述第二基础数据区中心对称，存储数据内容相同。
优选的，所述二维码还包括：用于降低数据污染的边框轮廓区；间隔不同数据区的伪装隔离区；所述多个数据区及伪装隔离区做掩模处理。
优选的，所述辅助定位点为偶数个；所述定位点为雪花状；所述定位点周围设置定位间隔区。
优选的，所述二维码用于离线状态或无网状态的信息认证。
图1是现有技术一的二维码示例图
图2是现有技术二的二维码示例图
图3是本发明实施例一提供的一种二维码的绘制方法流程图
图4是本发明实施例二提供的二维码的整体示例图
图5是本发明实施例二提供的二维码的部分示例图
图6是本发明实施例二提供的二维码的基础信息区示例图
下面结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护范围。
鉴于现有的方法不能实现高效，高精度，大容量的二维码绘制或识别，本发明实施例提供一种定位准确，识别效率高，扩展性强的二维码绘制方法，以下结合附图对本发明进行详细说明。
实施例一
本实施例提供一种快速准确识别的二维码绘制方法，如图3所示，包括：
步骤1：加密生成二进制输入数据；
步骤2：根据输入数据容量判断二维码版本信息，确定辅助定位点个数，以及第一数据区，第二数据区，第三数据区个数；
步骤3：根据输入数据及二维码版本信息，计算各个信息区内的个数；
步骤4：综合计算二维码版本信息，各个信息区个数等数据获得二维码整体布局，在指定背景下，绘制定位点点阵，包括主定位点及辅助定位点；
步骤5：按照数据区设定流水线，将输入数据依序绘制至各信息区，并预留间隔区；
步骤6：在数据库内随机或指定选择掩模模版，对数据去及伪装隔离区进行 掩模处理；
步骤7：加密生成并在基础数据区绘制二维码版本信息，定向信息，掩模模版信息等二进制数据。
本实施例通过输入数据综合计算二维码版本信息及各个信息区个数，进而绘制二维码，优化了数据容量，具备扩展性，利用大容量存储；通过加密生成并绘制的定向信息，决定了整体数据解码的方向，进而决定了各个数据区流水线顺流读取或逆流读取。其中，顺流读取可解析数据，逆流读取解析失败。该设计在一定程度上增加了数据的安全性。
实施例二
本实施例提供一种快速准确识别的二维码，如图4-6所示，包括：用于降低数据污染的边框轮廓区102，编码区，以及所述边框轮廓区与编码区之间的主间隔区103；所述编码区包括位于编码区四个顶点的四个中心对称的主定位点100，多个数据区及间隔不同数据区的伪装隔离区106。所述编码区还包括位于编码区边线的轴对称等间距设置的4个辅助定位点104，所述主定位点100及辅助定位点104周围设置定位间隔区。所述数据区包括：位于编码区上下边线被辅助定位点间隔开的等大小的6个第二类数据区B1-1，B1-2，B2-1，B2-2，B3-1，B3-2，位于水平方向轴对称的两个定位点之间等大小的2个第一类数据区A0，A3，2个第一类内数据区A1，A2，以及夹于第一类数据区与第二类数据区之间等大小的3个第三类数据区C1，C2，C3。所述第三类数据区的长与所述第二类数据区的长相等，所述第三类数据区的宽与所述第一类数据区的宽相等。所述数据区还包括：沿编码区边线外延设置的2个基础数据区101，所述基础数据区包括位于编码区上边线及右边线外延的第一基础数据区301，以及位于编码区下 边线及左边线外延的第二基础数据区302；所述第一基础数据区与所述第二基础数据区中心对称，存储数据内容相同。
本实施例的二维码结构包括的4个主定位点100，以及4个辅助定位点104，形状一致，均为中心对称的雪花状。雪花状具有的与其他数据区不同的明显特征，使其有效区分定位点和数据区，提高定位效率。主定位点点分布在编码区的四个顶点，辅助定位点沿二维码边框均匀分布。为数据容量的最大化，除编码区定点及边线外，不含定位点。
外围编码区设置的深色边框102，可有效降低数据污染。
基础数据区101，主要包含该二维码版本信息，各种参数信息，以及定向信息。且该信息分为上下两套，分别存放于在二维码上右，以及二维码下左区域。如图5所示，第一基础数据区301区位于上层，第二基础数据区302区位于下层，两者中心对称。该基础数据区，在提供基础信息的同时，实现了二维码的定向，保证了整体功能的实现，直接关系数据识别是否准确成功。
为提高数据识别解析效率，对数据区进行了数据分区。如图4所示，数据区被分为了第一类数据区，第二类数据区，以及第三类数据区三种区域，且在各个分区之间，设置伪装间隔区106。伪装间隔区的设置减少了识别误差，降低了信息干扰，提高二维码识别的成功率。三种数据区的数量与输入数据容量直接相关，该分区很好地解决了大数据容量的优化问题，利于容量扩展。不同数据区内对应设置不同排列顺序的第一类信息区201，第二类信息区202，第三类信息区203，不同数据区之间排列顺序的差异性及同类数据区之间排列顺序的一致性，既可以加快数据读取速度，也可以保证数据安全。
综上所述，本发明的实施例提供的二维码绘制方法，具有以下有益效果：
(1)本发明的加密图形的定位方式采用雪花状的中心对称的定位图案，加强了定位的可靠性，提高解析识别率；
(2)本发明的加密图形中主副定位点设计成轴对称图像，减少了图像处理误差，加快了数据解析的速度；
(3)本发明的加密图形中的基础数据区分为上下两层信息，可以起到定向的作用，是解析过程的保障；
(4)本发明的加密图形中的数据分区方法，包括数据区内信息区的划分与排列，在保障数据安全的前提下，提高了识别效率；
(5)本发明的加密图形中的浅色间隔，避免数据的污染，保护定位点的数据完整性，从侧面提高了数据的解析成功率；
(6)本发明的加密图形，由上述各部分组合，形成了一款美观的中心对称图形。
以上所述的具体实施例，对本发明的目的，技术方案和有益效果进行了进一步详细说明，所应理解的是，以上所述仅为本发明的具体实施例，并不用于限定本发明的保护范围，凡在本发明的精神和原则之内，所做的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
Claims (17)
- 一种快速准确识别的二维码绘制方法，其特征在于，包括：步骤1：加密生成二进制输入数据；步骤2：根据输入数据确定二维码布局；步骤3：在指定背景下，绘制二维码定位点点阵；步骤4：绘制二进制输入数据到数据区；步骤5：加密生成并在基础数据区绘制基础信息二进制数据。
- 如权利要求1所述的快速准确识别的二维码绘制方法，其特征在于，所述步骤5加密并在基础数据区绘制的基础信息二进制数据包括：版本信息，定向信息，掩模模版信息二进制数据。
- 如权利要求1所述的快速准确识别的二维码绘制方法，其特征在于，所述步骤2包括：步骤2.1：根据输入数据容量判断版本信息，确定主定位点及辅助定位点个数，以及数据区个数；步骤2.2：根据输入数据及二维码版本信息，计算各个数据区内信息区的个数；步骤2.3：综合计算二维码版本信息，各个信息区个数数据获得二维码整体布局。
- 如权利要求1所述的快速准确识别的二维码绘制方法，其特征在于，所述步骤4包括：步骤4.1：按照数据区设定流水线，将输入数据依序绘制至各信息区，并在数据区之间预留间隔区；步骤4.2：在数据库内随机或指定选择掩模模版，对各数据区及伪装隔离区进行掩模处理。
- 如权利要求4所述的快速准确识别的二维码绘制方法，其特征在于，所述步骤4.1中，不同数据区的绘制流水线顺序不同。
- 如权利要求1-5所述的快速准确识别的二维码绘制方法，其特征在于，所述二维码用于离线状态或无网状态的信息认证。
- 如权利要求1-5所述的快速准确识别的二维码绘制方法，其特征在于，所述二维码用于证件识别，所述证件包括：证照，名片，铭牌。
- 如权利要求1-5所述的快速准确识别的二维码绘制方法，其特征在于，所述二维码用于财务文件识别，所述财务文件包括：保单，票据，交通罚单，财务报表。
- 如权利要求1-5所述的快速准确识别的二维码绘制方法，其特征在于，所述二维码用于公告识别，所述公告包括：法律文书，证书，说明书，产品包装，广告及印刷品。
- 一种快速准确识别的二维码，其特征在于，包括：编码区，所述编码区包括位于编码区四个顶点的四个中心对称的主定位点，及多个数据区；所述主定位点及编码区外围的间隔区。所述编码区还包括位于编码区边线的轴对称等间距设置辅助定 位点。
- 如权利要求10所述的快速准确识别的二维码，其特征在于，所述数据区包括：位于垂直方向被定位点间隔开的等大小的2N个第一类数据区，位于水平方向被定位点间隔开的等大小的2M个第二类数据区，以及与第一类数据区和第二类数据区相邻的P个第三类数据区。
- 如权利要求10所述的快速准确识别的二维码，其特征在于，所述第三类数据区的长与所述第二类数据区的长相等，所述第三类数据区的宽与所述第一类数据区的宽相等。
- 如权利要10所述的快速准确识别的二维码，其特征在于，所述数据区还包括：沿编码区外沿设置的多个基础数据区，所述基础数据区包含二维码版本信息，参数信息，及定向信息。
- 如权利要求13所述的快速准确识别的二维码，其特征在于，所述基础数据区包括位于编码区上边沿及右边沿的第一基础数据区，以及位于编码区下边沿及左边沿的第二基础数据区；所述第一基础数据区与所述第二基础数据区中心对称，存储数据内容相同，或，所述基础数据区包括位于编码区上边沿及左边沿的第一基础数据区，以及位于编码区下边沿及右边沿的第二基础数据区；所述第一基础数据区与所述第二基础数据区中心对称，存储数据内容相同。
- 如权利要求10-13所述的快速准确识别的二维码，其特征在于，所述二维码还包括：用于降低数据污染的边框轮廓区；间隔不同数据区的伪装隔离区；所述多个数据区及伪装隔离区做掩模处理。
- 如权利要求10-13所述的快速准确识别的二维码，其特征在于，所述辅助定位点为偶数个；所述定位点为雪花状；所述定位点周围设置定位间隔区。
- 如权利要求10-13所述的快速准确识别的二维码，其特征在于，所述二维码用于离线状态或无网状态的信息认证。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US17/421,349 US11386315B2 (en) | 2019-01-07 | 2020-01-05 | 2D barcode enabling quick and accurate code recognition and method for creating same |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910010762.2A CN109447216B (zh) | 2018-12-30 | 2019-01-07 | 一种快速准确识别的二维码 |
| CN201910010794.2 | 2019-01-07 | ||
| CN201910010762.2 | 2019-01-07 | ||
| CN201910010794.2A CN109740716B (zh) | 2018-12-30 | 2019-01-07 | 一种快速准确识别的二维码绘制方法 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2020143561A1 true WO2020143561A1 (zh) | 2020-07-16 |
Family
ID=71522331
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2020/070367 WO2020143561A1 (zh) | 2019-01-07 | 2020-01-05 | 一种快速准确识别的二维码及其绘制方法 |
Country Status (2)
| Country | Link |
|---|---|
| US (1) | US11386315B2 (zh) |
| WO (1) | WO2020143561A1 (zh) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101093553A (zh) * | 2007-07-19 | 2007-12-26 | 成都博古天博科技有限公司 | 一种二维码系统及其识别方法 |
| CN204946052U (zh) * | 2015-02-11 | 2016-01-06 | 北京鼎九信息工程研究院有限公司 | 一种带有二维码的标签 |
| US20170076191A1 (en) * | 2015-09-10 | 2017-03-16 | Alibaba Group Holding Limited | Generating and decoding two-dimensional code |
| CN108764420A (zh) * | 2018-04-24 | 2018-11-06 | 中国人民银行印制科学技术研究所 | 一种二维码及其编码、识别方法、具有防伪功能的产品 |
| CN109447216A (zh) * | 2018-12-30 | 2019-03-08 | 尤尼泰克(嘉兴)信息技术有限公司 | 一种快速准确识别的二维码 |
| CN109740716A (zh) * | 2018-12-30 | 2019-05-10 | 尤尼泰克(嘉兴)信息技术有限公司 | 一种快速准确识别的二维码绘制方法 |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4301775B2 (ja) | 2002-07-18 | 2009-07-22 | シャープ株式会社 | ２次元コード読み取り装置，２次元コード読み取り方法，２次元コード読み取りプログラム及び該プログラムの記録媒体 |
| CN101615259B (zh) | 2008-08-01 | 2013-04-03 | 凌通科技股份有限公司 | 一种二维光学辨识码的识别系统 |
| CN102034127A (zh) | 2009-09-28 | 2011-04-27 | 上海易悠通信息科技有限公司 | 新型大容量二维条码与系统及其编解码方法和应用 |
| CN102243704B (zh) | 2011-07-21 | 2014-04-02 | 我查查信息技术(上海)有限公司 | 用于二维码的定位系统、二维码的识别方法及设备 |
| CN102509143B (zh) | 2011-11-29 | 2014-10-29 | 哈尔滨工业大学 | 连续型大容量多进制条码显示与解析方法 |
| US20180288040A1 (en) * | 2013-09-25 | 2018-10-04 | Jpmorgan Chase Bank, N.A. | System and Method for Biometric Authentication-Based Electronic Notary Public |
| US11361177B2 (en) * | 2013-12-17 | 2022-06-14 | Infotoo International Limited | Composite information bearing devices |
| US9189722B2 (en) * | 2014-03-24 | 2015-11-17 | Cellum Innovacios Es Szolgal Tato Zrt | Systems and methods for motion two dimensional codes |
| CN105279539A (zh) | 2014-06-07 | 2016-01-27 | 王树敏 | 点阵式二维码编码与解码 |
| US10152663B2 (en) * | 2015-09-11 | 2018-12-11 | Graphiclead LLC | Method to store a secret QR code into a colored secure QR code |
| US9805296B2 (en) * | 2016-02-23 | 2017-10-31 | The Chinese University Of Hong Kong | Method and apparatus for decoding or generating multi-layer color QR code, method for recommending setting parameters in generation of multi-layer QR code, and product comprising multi-layer color QR code |
| US10210386B2 (en) * | 2016-03-31 | 2019-02-19 | Facebook, Inc. | Storing identification data as virtual personally identifiable information |
| US11295124B2 (en) * | 2018-10-08 | 2022-04-05 | Xerox Corporation | Methods and systems for automatically detecting the source of the content of a scanned document |
| US11321554B2 (en) * | 2020-01-30 | 2022-05-03 | Universal City Studios Llc | Efficient management of facial recognition systems and methods in multiple areas |
-
2020
- 2020-01-05 WO PCT/CN2020/070367 patent/WO2020143561A1/zh active Application Filing
- 2020-01-05 US US17/421,349 patent/US11386315B2/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101093553A (zh) * | 2007-07-19 | 2007-12-26 | 成都博古天博科技有限公司 | 一种二维码系统及其识别方法 |
| CN204946052U (zh) * | 2015-02-11 | 2016-01-06 | 北京鼎九信息工程研究院有限公司 | 一种带有二维码的标签 |
| US20170076191A1 (en) * | 2015-09-10 | 2017-03-16 | Alibaba Group Holding Limited | Generating and decoding two-dimensional code |
| CN108764420A (zh) * | 2018-04-24 | 2018-11-06 | 中国人民银行印制科学技术研究所 | 一种二维码及其编码、识别方法、具有防伪功能的产品 |
| CN109447216A (zh) * | 2018-12-30 | 2019-03-08 | 尤尼泰克(嘉兴)信息技术有限公司 | 一种快速准确识别的二维码 |
| CN109740716A (zh) * | 2018-12-30 | 2019-05-10 | 尤尼泰克(嘉兴)信息技术有限公司 | 一种快速准确识别的二维码绘制方法 |
Also Published As
| Publication number | Publication date |
|---|---|
| US20220067467A1 (en) | 2022-03-03 |
| US11386315B2 (en) | 2022-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109447216B (zh) | 一种快速准确识别的二维码 | |
| AU2010234172B2 (en) | Two-dimensional array code | |
| CN103794135A (zh) | 由点阵与二维码形成的标识及对其进行生成与识别的方法 | |
| JPH10503304A (ja) | 機械可読なバイナリ・コード | |
| CN102034127A (zh) | 新型大容量二维条码与系统及其编解码方法和应用 | |
| KR102511642B1 (ko) | 물체무늬 코드의 부호화 방법 및 시스템 | |
| CN101127089B (zh) | 一种新的可在印刷媒体上埋入大量信息的实现方法 | |
| CN109522770B (zh) | 一种快速定位的二维码 | |
| CN105303223A (zh) | 一种随机图像防伪标识制备方法、标识及识别方法 | |
| CN102236809A (zh) | Qr码及其制造方法 | |
| CN104951781A (zh) | 字符辨识装置以及识别函数生成方法 | |
| CN103729673A (zh) | 一种三维码及其制作方法 | |
| CN104233907B (zh) | 具有智能微缩二维码的防伪纸及其制备方法和应用 | |
| JP2003122233A (ja) | 真正性証明用の光学構造体、真正性証明用記録体、および確認方法 | |
| CA2757186A1 (en) | Two-dimensional array code | |
| WO2020143561A1 (zh) | 一种快速准确识别的二维码及其绘制方法 | |
| CN102890788A (zh) | 一种新型二维条码的门禁系统的构成方法 | |
| CN109740716B (zh) | 一种快速准确识别的二维码绘制方法 | |
| CN106203564A (zh) | 一种圆‑棱柱组合体表面的二维码的生成和采集方法 | |
| Makwana et al. | Axes re-ordering in parallel coordinate for pattern optimization | |
| CN109615052B (zh) | 一种高识别率的二维码 | |
| CN109740715B (zh) | 一种高识别率的二维码数据区绘制方法 | |
| CN109359715A (zh) | 无效码隐藏平面图形分割互补识别的二维码防伪方法 | |
| WO2020143560A1 (zh) | 一种高识别率的二维码及其数据区绘制方法 | |
| CN203325065U (zh) | 磁图像传感器 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20738234 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 20738234 Country of ref document: EP Kind code of ref document: A1 |