CN111160502A - Design and decoding method of any shape universal code - Google Patents
Design and decoding method of any shape universal code Download PDFInfo
- Publication number
- CN111160502A CN111160502A CN201911412807.5A CN201911412807A CN111160502A CN 111160502 A CN111160502 A CN 111160502A CN 201911412807 A CN201911412807 A CN 201911412807A CN 111160502 A CN111160502 A CN 111160502A
- Authority
- CN
- China
- Prior art keywords
- code
- area
- shape
- outline
- contour
- 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.)
- Pending
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/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/06046—Constructional details
- G06K19/06056—Constructional details the marking comprising a further embedded marking, e.g. a 1D bar code with the black bars containing a smaller sized coding
-
- 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/1452—Methods for optical code recognition including a method step for retrieval of the optical code detecting bar code edges
Abstract
The invention discloses a design and decoding method of any-shape universal code, belonging to the field of ring code beautification, and determining the universal code outline and filling materials according to the materials provided by users; extracting a maximum inscribed circle of the outline of the universal code to be used as a constraint of an outer ring area of the annular code; encoding the transmission information into a binary system according to the specified error correction rate, and calculating to obtain the position of each data encoding bit of the annular code corresponding to the universal code based on the circle center and the radius of the maximum inscribed circle according to the total number of the transmission information, the radius increment between adjacent rings and the information storage increment; carrying out uniform grid division on the universal code profile, and dividing the universal code profile into an idle area, an annular code area and a shape filling area; and filling the material array in the shape filling area according to the grids to obtain the universal code. The invention embeds the ring code into any shape, fills the idle area to make the idle area close to the shape appointed by the user, and simultaneously fills the inner hole of the ring code, thereby ensuring the coordination of the whole graph.
Description
Technical Field
The invention relates to the technical field of universal codes, in particular to a design and decoding method of universal codes in any shapes.
Background
As a novel two-dimensional code with flexible coding capacity and various ring positions, the annular code can increase the coding interval by controlling the inter-ring distance so as to achieve the beautifying purpose of filling various coding points with any materials, but still cannot get rid of the visual effect that the appearance of the annular code is fixed as a circle. In addition, when the material graph provided by the user needs to keep a large display space, the distance between the rings is too large, the whole annular code looks like a sparse hole, and a large number of blank areas exist between the rings to influence attractiveness. Therefore, how to fill the ring codes is more beautiful, which becomes a great problem of personalized ring code design.
Disclosure of Invention
The invention provides a design and decoding method of any-shape universal code, which is characterized in that a ring code is embedded into any shape, and an idle area is filled to enable the idle area to be close to the shape appointed by a user, and meanwhile, an inner cavity of the ring code is filled, so that the coordination of the whole graph is ensured.
The technical scheme of the invention is realized as follows:
a design method of any-shape universal code specifically comprises the following steps:
s1, determining the universal code contour and filling materials according to the materials provided by the user;
s2, extracting the maximum inscribed circle of the universal code outline as the constraint of the outer ring area of the ring code;
s3, encoding the transmission information into binary according to the appointed error correction rate, and calculating the position of each data encoding bit of the annular code corresponding to the universal code based on the circle center and the radius of the maximum inscribed circle according to the total number of the transmission information, the radius increment between adjacent rings and the information storage increment;
s4, carrying out uniform grid division on the universal code profile, and dividing the universal code profile into an idle area, an annular code area and a shape filling area;
and S5, filling the material array in the shape filling area according to the grids to obtain the universal code.
As a preferred embodiment of the present invention, step S1 specifically includes the following steps:
s101, a user provides a picture with a figure with a standard shape or a main body with a definite outline and materials for beautifying and filling a data coding bit;
s102, extracting the outline of the picture with the main body with the definite outline, and taking the picture as a universal code outline or directly taking the picture with a standard shape as the universal code outline;
s103, selecting at least one positioning material, one correcting material and a plurality of filling materials which are not repeated from the materials.
As a preferred embodiment of the present invention, step S102 further includes the following steps:
judging whether the extracted contour or the figure has an internal and external connected double contour, respectively calculating the area of the extracted contour or the figure, the area of a convex hull of a circumscribed polygon of the extracted contour or the figure, and using the convex hull as the ten-thousand-dimension code contour when the proportion of the extracted contour or the figure and the convex hull of the circumscribed polygon of the extracted contour or the figure is larger than a threshold value, otherwise, using the extracted contour or the figure as the ten-thousand-dimension code contour.
As a preferred embodiment of the present invention, in step S4, the free area is a colorless or light-colored area in the drawing or picture, and the shape filling area is a colored area in the drawing or picture.
As a preferred embodiment of the present invention, step S2 specifically includes the following steps:
s201, determining the center coordinates and the radius of the maximum inscribed circle, limiting the candidate point set in the maximum circumscribed rectangle of the outline, wherein the coordinate of any point of the rectangle is PiCoordinate of contour point is QjThe coordinates of the circle center are as follows:
wherein D (P)i，Qj) Is the Euclidean distance between two points;
and S202, determining the constraint of the outer ring area of the ring code according to the circle center coordinate and the radius.
A decoding method of any shape of ten-thousand codes specifically comprises the following steps:
finding small outline dense points by using an outline detection method, forming the centers of all outlines into a point set, solving a polygonal convex hull of the point set, and determining a coding region of the ten-thousand code;
determining a locator and a corrector on an inner ring of the annular code by adopting a feature matching algorithm, and acquiring the position of the annular code from the universal code;
the annular code is decoded.
As a preferred embodiment of the invention, a contour detection method is utilized to find compact contour points, the centers of all contours form a point set, a polygonal convex hull of the point set is solved, and a coding region of the ten-thousand code is determined; the method specifically comprises the following steps:
the method comprises the steps of finding small outline dense points by using an outline detection method, forming outline centers into a point set, calculating the center of an area where the point set is located, counting the distance from all points of the point set to the center of the area, filtering outliers through distance values to obtain a polygonal convex hull of the point set, extracting an inscribed circle of the polygonal convex hull, and determining the inscribed circle as a coding area of a ten-thousand-dimensional code.
As a preferred embodiment of the present invention, the step of determining the locators and the correctors on the inner ring of the ring code by using the feature matching algorithm, and the step of obtaining the ring code positions from the universal code specifically means that the locators and the correctors on the inner ring of the ring code are determined by using the template matching and shape matching methods, and the ring code positions are obtained from the universal code.
The invention has the beneficial effects that: the ring code is embedded into any shape, and the free area is filled to be close to the shape specified by the user, and meanwhile, the inner hole of the ring code is filled, so that the coordination of the whole graph is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of a method for designing any-shape ten-thousand codes according to the invention;
FIG. 2 is a schematic view of a ten-dimensional code profile partition;
FIG. 3 is a schematic diagram of an example of a method for designing an arbitrary-shaped ten-thousandth code according to the present invention;
FIG. 4 is a diagram of four sets of user-provided material and their corresponding effect of ten-thousand codes;
FIG. 5 is a schematic diagram of an example of a decoding method of an arbitrary-shaped ten-thousand code according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, the invention provides a design method of any-shape universal code, which specifically comprises the following steps:
s1, determining the universal code contour and filling materials according to the materials provided by the user;
step S1 specifically includes the following steps:
s101, providing a picture with a figure (such as a mineral water bottle or a heart-shaped folded paper) with a standard shape or a body with a definite outline by a user and a material for beautifying and filling the shape of a data coding bit;
s102, extracting the outline of the picture with the main body with the definite outline, and taking the picture as a universal code outline or directly taking the picture with a standard shape as the universal code outline; because the provided material may be a non-closed figure, the image has the characteristic of connecting the inner contour and the outer contour, and the convex hull of the contour point can be used as the shape constraint, so that the phenomenon that the circumscribed circle appears in the interlayer in the subsequent steps is avoided. If the annular code has a single contour and the whole is close to a convex shape, the contour can be directly used as the shape constraint of the Wanwei code.
The shape of the ten-thousand code fills the outline of the dependent ring code and the provided graph. When the inner and outer contours of the graph are connected, the maximum inscribed circle is usually located at the widest position of the interlayer of the inner and outer contours, although the shape of the finally generated ten-thousand-dimensional code can be guaranteed to be close to the expectation of a user to the greatest extent, the difficulty degree of decoding is increased by limiting the annular code in a small area, the overall proportion is unbalanced, and the annular code is always arranged sparsely compared with the material of a shape filling area. The better solution is to judge whether the extracted contour or the figure has an internal and external connected double contour, respectively calculate the area of the extracted contour or the figure, the extracted contour or the circumscribed polygonal convex hull of the figure, and use the convex hull as the ten-thousand-dimension code contour when the ratio of the two is larger than a threshold value, otherwise use the extracted contour or the figure as the ten-thousand-dimension code contour.
S103, selecting at least one positioning material, one correcting material and at least fifty filling materials which are not repeated from the materials, wherein the three materials cover the pictures and can not be repeated in a cross mode, and interference on positioning and correcting of the annular code is avoided.
S2, extracting the maximum inscribed circle of the universal code outline as the constraint of the outer ring area of the ring code;
step S2 specifically includes the following steps:
s201, embedding the original annular code in the maximum inscribed circle of the figure outline, wherein the circle is most obviously characterized in that the circle center is always the largest in the shortest distance from the edge of the outline among all points on the plane in the circle. In order to further improve the search speed of the circle center, the candidate point set can be limited in the maximum circumscribed rectangle of the outline, which can be generally obtained by calculation through various image libraries, the circle center coordinate and the radius of the maximum inscribed circle are determined, the candidate point set is limited in the maximum circumscribed rectangle of the outline, the coordinate of any point of the rectangle is PiCoordinate of contour point is QjThe coordinates of the circle center are as follows:
wherein D (P)i，Qj) Is the Euclidean distance between two points;
and S202, determining the constraint of the outer ring area of the ring code according to the circle center coordinate and the radius.
After the circle center C and the outer ring radius d are determined, the number n of the coded rings is determined according to the coding specification of the ring codes and the binary coding length of transmitted information, and the radius of the information auxiliary coding region, namely the radius of the innermost ring of the ring codes is easily calculated by setting the ring radius increment delta r: r is1＝d-(n-1)*Δr。And then, the center position and the traditional design method of the annular code are combined to obtain the coordinate information of each coded bit inside the contour, that is, the procedure of generating the annular code by constraining the radius of the ring by the contour as described in step S3.
S3, encoding the transmission information into binary according to the appointed error correction rate, and calculating the position of each data encoding bit of the annular code corresponding to the universal code based on the circle center and the radius of the maximum inscribed circle according to the total number of the transmission information, the radius increment between adjacent rings and the information storage increment;
s4, carrying out uniform grid division on the universal code profile, and dividing the universal code profile into an idle area, an annular code area and a shape filling area;
the method mainly fills materials in non-annular code areas and non-idle areas inside the outline, and sequentially fills materials by directly adopting a simple grid division method. Because the shape provided by the user or the picture is not completely solid, namely a certain hollow part exists, the material cannot be filled in the area in order to ensure that the similarity between the final picture of the Wanvic code and the original pattern is as high as possible. As shown in fig. 2, the grid is divided into three regions, and the division schemes of the regions are as follows: information coding area (the data bit coding coordinates of the annular code obtained by the calculation of the third step and the fourth step), idle area (colorless or light-colored area in the graph provided by the user), and outline filling area (obvious colored area in the graph provided by the user).
Because the design of the original annular code has the mutual constraint on the ring radius and the coding increment, the size difference of the ring materials is small, and the width and height average values of all the materials can be taken when the grids are divided, or one material size is directly and randomly selected as the size of the grids. Classifying the region to which each grid belongs, paying attention to material processing near the outline of the annular code, reserving half material size to avoid region crossing and influence the accuracy of coded data, namely, filling any material in the dark gray part tightly attached to the outer part of the inner ring in the graph. Because the annular code has a certain error correction function, when the annular code is generated, even if the region is interfered by the border crossing of the shape filling material edge, the information decoding can not generate serious deviation, and the robustness of the decoding process is increased.
And S5, filling the material array in the shape filling area according to the grids to obtain the universal code.
Fig. 3 shows several important link effect diagrams in the design of the universal code from left to right, which mainly include contour outline determination in any shape, contour inscribed circle position and radius calculation for placing the annular code, graph meshing, functional area division and material filling. The calculation accuracy of the parameters in each stage has different influences on the finally generated waney code effect graph, but the quality of the result does not influence the next step, for example, when the deviation of the contour extraction is large, the deviation of the whole waney code contour and the shape of the graph designated by a user is large, but the contour inscribed circle can still be calculated, and operations such as embedding of the annular code and filling of an external area can be performed. Therefore, the design flow of the universal code determined by the patent enables the steps to have certain independence, and provides a good expansion space for the design and later optimization of the algorithm of the steps.
FIG. 4 shows four groups of Wanwei codes generated by any shape, wherein the first two groups are solid, and all positions in the shape need to be filled with materials; the third group is an example of a graph with connected inner and outer contours, and the graph generally has a concave structure, so that when a shape constraint area is constructed, a circumscribed convex polygon can be extracted according to the graph shown in fig. 3, and finally, the generated ten-thousand-dimensional code has no great difference with the shape of an original graph; the fourth group of graphs are graphs with outer outlines but are hollow, and except that the coding area of the ring codes can occupy the blank area of the original graphs, the rest blank areas are required to be always kept in an unfilled state until the generation of the ten-thousand codes is finished.
The invention also provides a decoding method of the universal code with any shape, which comprises the following steps:
finding small outline dense points by using an outline detection method, forming the centers of all outlines into a point set, solving a polygonal convex hull of the point set, and determining a coding region of the ten-thousand code; specifically, a contour detection method is used for finding small contour dense points, the centers of all contours form a point set, the center of a region where the point set is located is calculated, the distance from all points of the point set to the center of the region is counted, outliers are filtered through distance values, a polygonal convex hull of the point set is obtained, an inscribed circle of the polygonal convex hull is extracted, and the inscribed circle is determined to be a coding region of the ten-thousand-dimensional code.
Determining a locator and a corrector on an inner ring of the annular code by adopting characteristic matching algorithms such as a template matching method, a shape matching method and the like, and acquiring the position of the annular code from the universal code;
and decoding the annular code to obtain the information transmitted by the user according to the decoding mode of the traditional annular code.
Fig. 5 shows an exemplary diagram of a main flow of positioning a data encoding area, i.e. a ring code, of a universal code, which sequentially follows from left to right: the method comprises the steps of original drawing, contour extraction, circumscribed convex polygons and inscribed circles, template matching to obtain candidate locators and correctors, and rule screening to obtain the locators and the correctors. All the contours in the original image are extracted first, but care needs to be taken to roughly filter the interference of too small and too large contours, such as central material or noise generated during image acquisition, and the like, in advance through the contour area, and the step does not need to be too fine, because the annular code is composed of a large number of small materials, and the small number of interference areas can not cause too large deviation of the central position coordinates of all the contours. Then, counting the coordinate centers of all the contours, constructing a universal code point set region, calculating the region center, calculating the distance from all points of the point set to the region center, filtering outliers through distance values to obtain a universal code effective region, and calculating an inscribed circle of a circumscribed convex polygon of the point set in the effective region. The circle approaches the outer ring area of the annular code, and even a small amount of deviation exists, the inner ring can not be incomplete. When the deformation of the universal-terrestrial-digital-code acquired by the equipment is not serious, the positions of the candidate locators and the positions of the correctors can be acquired from the area by directly adopting characteristic matching algorithms such as template matching and shape matching in combination with the material uniqueness of the locators and the correctors. In general, six candidate anchor points and three candidate correction points are selected, and according to a permutation and combination method, the three candidate anchor points and one candidate correction point are randomly selected to construct a quadruple (a, b, c, d), and whether the quadruple is a real area is judged according to the following rules:
(1) the length proportion of ab to cd must be close, considering the deformation condition, it is only necessary to set up as 0.7;
(2) ab must intersect with cd;
(3) ab is approximately vertical to the cd line segment, and the included angle is in the range of 80-100 degrees;
(4) the intersection of the ab and cd segments must be near the midpoint of the two segments.
The more accurate locator coordinates and the more accurate corrector coordinates can be obtained through the steps, and then the inner ring, the auxiliary information, the data of each ring, the coded binary system, the transmission content and the like are determined step by step according to the decoding scheme of the traditional ring code.
Therefore, the ring code beautifying scheme provided by the invention, namely the generation of the universal code, has the following advantages:
1. the defect of fixed appearance of the annular code is overcome, and the universal code can be close to any graph provided by a user;
2. the problem that when a material is large, the whole annular code looks sparse due to too large annular distance is solved, the sparse area is filled by fully utilizing the advantage that the annular code decodes all information through the inner ring, and simultaneously, the graph provided by a user is used as appearance constraint to obtain the universal code with better visual effect.
3. The quick and simple decoding process of the ten-thousand-dimensional code is provided, the coding area is determined through the inscribed circle of the dense points, the locator and the corrector are detected by using the feature matching method, the quick and accurate decoding effect can be achieved, and meanwhile, with the development of the field of computer vision, each step of the decoding process has strong expandability.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (8)
1. A design method of any-shape universal code is characterized by comprising the following steps:
s1, determining the universal code contour and filling materials according to the materials provided by the user;
s2, extracting the maximum inscribed circle of the universal code outline as the constraint of the outer ring area of the ring code;
s3, encoding the transmission information into binary according to the appointed error correction rate, and calculating the position of each data encoding bit of the annular code corresponding to the universal code based on the circle center and the radius of the maximum inscribed circle according to the total number of the transmission information, the radius increment between adjacent rings and the information storage increment;
s4, carrying out uniform grid division on the universal code profile, and dividing the universal code profile into an idle area, an annular code area and a shape filling area;
and S5, filling the material array in the shape filling area according to the grids to obtain the universal code.
2. The method for designing any-shaped ten-thousand codes according to claim 1, wherein the step S1 specifically includes the following steps:
s101, a user provides a picture with a figure with a standard shape or a main body with a definite outline and materials for beautifying and filling a data coding bit;
s102, extracting the outline of the picture with the main body with the definite outline, and taking the picture as a universal code outline or directly taking the picture with a standard shape as the universal code outline;
s103, selecting at least one positioning material, one correcting material and a plurality of filling materials which are not repeated from the materials.
3. The method for designing any shape of ten-thousand codes according to claim 2, wherein the step S102 further comprises the steps of:
judging whether the extracted contour or the figure has an internal and external connected double contour, respectively calculating the area of the extracted contour or the figure, the area of a convex hull of a circumscribed polygon of the extracted contour or the figure, and using the convex hull as the ten-thousand-dimension code contour when the proportion of the extracted contour or the figure and the convex hull of the circumscribed polygon of the extracted contour or the figure is larger than a threshold value, otherwise, using the extracted contour or the figure as the ten-thousand-dimension code contour.
4. The method for designing the universal code with the arbitrary shape according to claim 2, wherein the free area in the step S4 is a colorless or light-colored area in the drawing or the picture, and the shape filling area is a colored area in the drawing or the picture.
5. The method for designing any-shaped ten-thousand codes according to claim 1, wherein the step S2 specifically includes the following steps:
s201, determining the center coordinates and the radius of the maximum inscribed circle, limiting the candidate point set in the maximum circumscribed rectangle of the outline, wherein the coordinate of any point of the rectangle is PiCoordinate of contour point is QjThe coordinates of the circle center are as follows:
wherein D (P)i，Qj) Is the Euclidean distance between two points;
and S202, determining the constraint of the outer ring area of the ring code according to the circle center coordinate and the radius.
6. A decoding method of any shape of ten-thousand codes is characterized by comprising the following steps:
finding small outline dense points by using an outline detection method, forming the centers of all outlines into a point set, solving a polygonal convex hull of the point set, and determining a coding region of the ten-thousand code;
determining a locator and a corrector on an inner ring of the annular code by adopting a feature matching algorithm, and acquiring the position of the annular code from the universal code;
the annular code is decoded.
7. The decoding method of any shape of ten-thousand codes according to claim 6, characterized in that, the contour detection method is used to find compact contour points, the centers of all contours are combined into a point set, the polygonal convex hull of the point set is solved, and the coding region of the ten-thousand codes is determined; the method specifically comprises the following steps:
the method comprises the steps of finding small outline dense points by using an outline detection method, forming outline centers into a point set, calculating the center of an area where the point set is located, counting the distance from all points of the point set to the center of the area, filtering outliers through distance values to obtain a polygonal convex hull of the point set, extracting an inscribed circle of the polygonal convex hull, and determining the inscribed circle as a coding area of a ten-thousand-dimensional code.
8. The method for decoding the ten-thousand-dimensional code with the arbitrary shape according to claim 6, wherein the step of determining the locators and the correctors on the inner ring of the annular code by using the feature matching algorithm, and the step of obtaining the positions of the annular code from the ten-thousand-dimensional code by determining the locators and the correctors on the inner ring of the annular code by using the template matching method and the shape matching method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911412807.5A CN111160502A (en) | 2019-12-31 | 2019-12-31 | Design and decoding method of any shape universal code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911412807.5A CN111160502A (en) | 2019-12-31 | 2019-12-31 | Design and decoding method of any shape universal code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111160502A true CN111160502A (en) | 2020-05-15 |
Family
ID=70560003
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911412807.5A Pending CN111160502A (en) | 2019-12-31 | 2019-12-31 | Design and decoding method of any shape universal code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111160502A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447546A (en) * | 2015-11-25 | 2016-03-30 | 林蔚 | Two-dimensional code capable of being embedded with large-ratio graph as well as coding and decoding method and device therefor |
| CN106951812A (en) * | 2017-03-31 | 2017-07-14 | 腾讯科技（深圳）有限公司 | Recognize method, device and the terminal of Quick Response Code |
| CN108764004A (en) * | 2018-06-04 | 2018-11-06 | 空气动力学国家重点实验室 | A kind of cyclic annular coded markings point decoding recognition methods based on coding collar sampling |
| CN108764420A (en) * | 2018-04-24 | 2018-11-06 | 中国人民银行印制科学技术研究所 | A kind of Quick Response Code and its coding, have anti-fraud functional product at recognition methods |
| US20180341831A1 (en) * | 2016-01-28 | 2018-11-29 | Ptc Inc. | User-Designed Machine-Readable Target Codes |
-
2019
- 2019-12-31 CN CN201911412807.5A patent/CN111160502A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447546A (en) * | 2015-11-25 | 2016-03-30 | 林蔚 | Two-dimensional code capable of being embedded with large-ratio graph as well as coding and decoding method and device therefor |
| US20180341831A1 (en) * | 2016-01-28 | 2018-11-29 | Ptc Inc. | User-Designed Machine-Readable Target Codes |
| CN106951812A (en) * | 2017-03-31 | 2017-07-14 | 腾讯科技（深圳）有限公司 | Recognize method, device and the terminal of Quick Response Code |
| CN108764420A (en) * | 2018-04-24 | 2018-11-06 | 中国人民银行印制科学技术研究所 | A kind of Quick Response Code and its coding, have anti-fraud functional product at recognition methods |
| CN108764004A (en) * | 2018-06-04 | 2018-11-06 | 空气动力学国家重点实验室 | A kind of cyclic annular coded markings point decoding recognition methods based on coding collar sampling |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109376830B (en) | Two-dimensional code generation method and device | |
| CN104517089B (en) | A kind of Quick Response Code decodes system and method | |
| US6868420B2 (en) | Method for traversing quadtrees, octrees, and N-dimensional bi-trees | |
| CN111476249B (en) | Construction method of multi-scale large-receptive-field convolutional neural network | |
| CN107346041B (en) | Method and device for determining grating parameters of naked eye 3D display equipment and electronic equipment | |
| CN106767502A (en) | A kind of circle codification index point with start information | |
| CN107577979A (en) | DataMatrix type Quick Response Codes method for quickly identifying, device and electronic equipment | |
| CN108564120A (en) | Feature Points Extraction based on deep neural network | |
| CN113763269B (en) | Stereo matching method for binocular images | |
| CN110659709A (en) | Anti-counterfeiting two-dimensional code and generation, detection and identification method thereof | |
| CN107248142A (en) | A kind of cultural relic fragments method for automatically split-jointing | |
| CN106204540A (en) | Visible detection method | |
| CN109191562A (en) | Three-dimensional rebuilding method based on colored false random coding structure light | |
| CN115131363A (en) | Positioning method and device based on semantic information and terminal equipment | |
| Remacle et al. | Fast and robust mesh generation on the sphere—Application to coastal domains | |
| CN111160502A (en) | Design and decoding method of any shape universal code | |
| CN111784699A (en) | Method and device for carrying out target segmentation on three-dimensional point cloud data and terminal equipment | |
| CN105740870A (en) | Anti-rotation HDO local feature description method for target robust identification | |
| CN106204542B (en) | Visual identity method and system | |
| Remacle et al. | Fast and robust mesh generation on the sphere–application to coastal domains | |
| CN115601283A (en) | Image enhancement method and device, computer equipment and computer readable storage medium | |
| CN110991617B (en) | Construction method of kaleidoscope convolution network | |
| CN110472495B (en) | Deep learning face recognition method based on graphic reasoning global features | |
| Kalinina et al. | Computing concave hull with closed curve smoothing: Performance, concaveness measure and applications | |
| CN113454678A (en) | Three-dimensional facial scan enhancement |
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 |