CN111723891A - Graphic code generation method and device and computer readable storage medium - Google Patents
Graphic code generation method and device and computer readable storage medium Download PDFInfo
- Publication number
- CN111723891A CN111723891A CN201910202662.XA CN201910202662A CN111723891A CN 111723891 A CN111723891 A CN 111723891A CN 201910202662 A CN201910202662 A CN 201910202662A CN 111723891 A CN111723891 A CN 111723891A
- Authority
- CN
- China
- Prior art keywords
- data
- graphic
- rule
- code
- carried
- 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
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004590 computer program Methods 0.000 claims description 10
- 230000006870 function Effects 0.000 claims description 9
- 238000009877 rendering Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 20
- 238000010276 construction Methods 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 229910001006 Constantan Inorganic materials 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
-
- 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/06093—Constructional details the marking being constructed out of a plurality of similar markings, e.g. a plurality of barcodes randomly oriented on an object
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Generation (AREA)
Abstract
The disclosure provides a graphic code generation method, a graphic code generation device and a computer readable storage medium, and relates to the technical field of identification codes. The graphic code generation method disclosed by the invention comprises the following steps: acquiring target iteration times based on a preset iteration rule according to data to be carried; and generating a graphic code of the data to be carried according to a preset self-similarity set graphic generation rule and the target iteration times. By the method, the data to be carried can be converted into the iteration processing times of the self-similarity set graph, and the graph code of the data is generated according to the preset self-similarity set graph generation rule, so that the information to be carried is prevented from being directly identified from the graph code, and the safety of the carried information is improved; and even if the pattern generation rule is cracked, the pattern code carrying harmful information is difficult to forge, so that the potential safety hazard is reduced.
Description
Technical Field
The present disclosure relates to the field of identification code technology, and in particular, to a method and an apparatus for generating a graphic code, and a computer-readable storage medium.
Background
With the development of mobile internet and the great popularization of smart phones, many applications use two-dimensional codes as carriers of information dissemination. From social friend-adding to mobile payment, two-dimensional codes are ubiquitous. Because the two-dimensional code has universality, specific content of the information can be easily identified when the information is transmitted, and an attacker can easily imitate the two-dimensional code by utilizing rules in the information to steal assets or phishing, so that potential safety hazards are caused.
Disclosure of Invention
An object of the present disclosure is to provide a scheme for generating a graphic code, which improves the security of the bearer information.
According to an aspect of some embodiments of the present disclosure, there is provided a graphic code generation method, including: acquiring target iteration times based on a preset iteration rule according to data to be carried; and generating a graphic code of the data to be carried according to a preset self-similarity set graphic generation rule and the target iteration times.
In some embodiments, the graphic code generation method further includes: intercepting the data to be carried into a plurality of copies with the length not exceeding the preset length in sequence; obtaining the target iteration times based on the preset iteration rule as follows: acquiring target iteration times based on a preset iteration rule according to each data; the method for generating the graphic code of the data to be carried according to the preset self-similarity set graphic generation rule and the target iteration number comprises the following steps: generating a graphic code of single data according to a preset self-similarity set graphic generation rule and the target iteration times corresponding to each data; and combining the graphic codes of the single data according to a preset arrangement rule and a data sequence to obtain the graphic codes of the data to be carried.
In some embodiments, the graphic code generation method further includes: acquiring a check code based on a predetermined algorithm according to the target iteration times; and drawing the check code in the graphic code.
In some embodiments, the graphic code generation method further includes: splicing target iteration times according to the data sequence, and acquiring a check code based on a preset algorithm; and drawing the check code at a preset position in the graphic code or by adopting a preset color.
In some embodiments, the predetermined iteration rule comprises a predetermined function.
In some embodiments, the predetermined self-similarity set graph generation rule comprises a Comptor triple point set rule.
In some embodiments, the predetermined arrangement rule is a circular arrangement from inside to outside or from outside to inside.
By the method, the data to be carried can be converted into the iteration processing times of the self-similarity set graph, and the graph code of the data is generated according to the preset self-similarity set graph generation rule, so that the information to be carried is prevented from being directly identified from the graph code, and the safety of the carried information is improved; and even if the pattern generation rule is cracked, the pattern code carrying harmful information is difficult to forge, so that the potential safety hazard is reduced.
According to an aspect of some other embodiments of the present disclosure, there is provided a graphic code generation apparatus including: an iteration number obtaining unit configured to obtain a target iteration number based on a predetermined iteration rule according to data to be carried; and the graph drawing unit is configured to generate a graph code of the data to be carried according to a preset self-similarity set graph generation rule and the target iteration number.
In some embodiments, the graphic code generation apparatus further includes: a data dividing unit configured to sequentially cut data to be carried into a plurality of copies not exceeding a predetermined length; the iteration number obtaining unit is configured to obtain a target iteration number based on a predetermined iteration rule according to each piece of data; the graphics-rendering unit is configured to: generating a graphic code of single data according to a preset self-similarity set graphic generation rule and the target iteration times corresponding to each data; and combining the graphic codes of the single data according to a preset arrangement rule and a data sequence to obtain the graphic codes of the data to be carried.
In some embodiments, the graphic code generation apparatus further includes: a check code acquisition unit configured to acquire a check code based on a predetermined algorithm according to a target iteration number; the graphic drawing unit is further configured to draw the check code in the graphic code.
In some embodiments, the graphic code generation apparatus further includes: the check code acquisition unit is configured to splice target iteration times according to the data sequence and acquire a check code based on a predetermined algorithm; the graphic drawing unit is further configured to draw the check code at a predetermined position in the graphic code, or in a predetermined color.
According to an aspect of further embodiments of the present disclosure, a graphic code generation apparatus is provided, including: a memory; and a processor coupled to the memory, the processor configured to perform any of the above graphical code generation methods based on instructions stored in the memory.
The graphic code generating device can convert the data to be carried into the iterative processing times of the self-similarity set graph, and generate the graphic code of the data according to the preset self-similarity set graph generating rule, thereby avoiding directly identifying the information to be carried from the graphic code and improving the safety of the carried information; and even if the pattern generation rule is cracked, the pattern code carrying harmful information is difficult to forge, so that the potential safety hazard is reduced.
According to an aspect of still further embodiments of the present disclosure, a computer-readable storage medium is provided, on which computer program instructions are stored, which instructions, when executed by a processor, implement the steps of any of the above graphical code generation methods.
By executing the instructions stored in the computer-readable storage medium, the data to be carried can be converted into the iteration processing times of the self-similarity set graph, and the graph code of the data is generated according to the preset self-similarity set graph generation rule, so that the information to be carried is prevented from being directly identified from the graph code, and the safety of the bearing information is improved; and even if the pattern generation rule is cracked, the pattern code carrying harmful information is difficult to forge, so that the potential safety hazard is reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this disclosure, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure and not to limit the disclosure. In the drawings:
fig. 1 is a flow diagram of some embodiments of a graphical code generation method of the present disclosure.
FIG. 2 is a schematic diagram of a construction process of a Comptol triple point set.
Fig. 3 is a flow diagram of further embodiments of a graphical code generation method of the present disclosure.
Fig. 4 is a flowchart of still other embodiments of a graphical code generation method of the present disclosure.
Fig. 5 is a schematic diagram of one embodiment of a graphical code of the present disclosure.
Fig. 6 is a schematic diagram of an embodiment of a graphic code generation apparatus of the present disclosure.
Fig. 7 is a schematic diagram of another embodiment of a graphic code generation apparatus according to the present disclosure.
Fig. 8 is a schematic diagram of yet another embodiment of a graphic code generation apparatus of the present disclosure.
Detailed Description
The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.
A flow diagram of some embodiments of a graphical code generation method of the present disclosure is shown in fig. 1.
In step 101, a target iteration number is obtained based on a predetermined iteration rule according to data to be carried. In some embodiments, the predetermined iteration rule may be a function with the data to be carried as an unknown number, for example, the formula f (x) ═ ax + b as the predetermined iteration rule, where x is the data to be carried and a, b are constants; alternatively, f (z) ═ z may be selected2+ c as a predetermined iteration rule, where z is the data to be carried and c is a constant.
In step 102, a graph code of data to be carried is generated according to a preset self-similarity set graph generation rule and a target iteration number. In some embodiments, the predetermined self-similarity set graph generation rule may be a fractal theory based rule, such as a cantore trimpot set rule.
A schematic diagram of a construction process of a cantor triple point set is shown in fig. 2, wherein a closed interval [0, 1] is divided into three segments, and only two closed intervals [0, 1/3] and [2/3, 1] are left after the middle 1/3 segment is removed; then, the remaining two closed intervals are respectively divided into three sections in average, the middle section is also removed, and then four closed intervals are left: [0, 1/9], [2/9, 1/3], [2/3, 7/9] and [8/9, 1 ]; the middle 1/3 segment between each cell is deleted repeatedly. After the continuous division, the remaining cell segments form a three-segment constantan set.
Because the generation rule itself does not carry information in the generation rule based on the self-similarity set graph, the reading end cannot obtain carried data in a rule deciphering mode, and the safety of bearing information is improved. Similarly, even if the graph generation rule is broken, it is difficult to generate the graph code in the embodiment that can be read based on the hazard information (such as property damage or fishing), so that the potential safety hazard is reduced.
Because the rule of the fractal theory jumps out of the traditional fence of one-dimensional line, two-dimensional plane, three-dimensional stereo and even four-dimensional space-time, the concept of decimal dimension is provided, the description of the real attribute and state of a complex system is approached better, and the diversity and complexity of objective things are met better, so that the fractal theory is helpful to carry richer decimal dimension information in the space of integer dimension, and the effective application of the graphic code space is achieved.
In some embodiments, the predetermined iteration rule is required to ensure that the number of iterations based on any feasible data to be carried is an integer. In other embodiments, in order to avoid uncertainty of data obtained based on the iteration number, the iteration number of the graph processing of the preset iteration rule has a one-to-one relationship with the data to be carried, so that the difficulty of data analysis is reduced, and the accuracy of the data analysis is improved.
In some embodiments, a predetermined iteration rule matched with the graphic code generating end is stored in the legal reading end, so that after the iteration times based on the predetermined self-similarity set graphic generating rule are obtained based on the graphic code, the carried data can be obtained through analysis based on the predetermined iteration rule, and data reading is completed.
A flow diagram of further embodiments of the disclosed graphical code generation method is shown in fig. 3.
In step 301, the data to be carried is sequentially truncated into a plurality of shares not exceeding a predetermined length. For example, the data may be processed in a predetermined system, with each bit or several bits as one piece of data.
In step 302, a target number of iterations is obtained based on a predetermined iteration rule from each piece of data. In some embodiments, the iteration number information may be obtained by substituting data into a predetermined function with the data to be carried as an unknown number.
In step 303, a graph code of a single data set is generated according to a predetermined self-similarity set graph generation rule and a target iteration number corresponding to each data set. If the Kangtol three-point set rule is adopted and the iteration number is 3, the graph of the 4 th row shown in FIG. 2 is the graph code of the single data.
In step 304, the graphic codes of the single data are combined according to the preset arrangement rule and the data sequence to obtain the graphic code of the data to be carried. In some embodiments, the order of combining may be from top to bottom, left to right, inside to outside, or outside to inside, or any predetermined combination rule. In some embodiments, the reading end completes the splicing of the data carried by the graphic codes of multiple single data by adopting the graphic data splicing sequence matched with the generating end, so as to ensure that the data is correctly spliced and recovered.
By the method, longer data can be grouped to form the graphic codes respectively, the difficulty in drawing the graphic or the small color block caused by overlarge iteration times is avoided, the definition of the image is ensured, the data quantity of the graphic codes which can be carried in the readable range of the image can be increased, and the method is favorable for expanding application.
A flow chart of still further embodiments of the graphical code generation method of the present disclosure is shown in fig. 4.
In step 401, the data to be carried is sequentially truncated into a plurality of shares not exceeding a predetermined length.
In step 402, a target number of iterations is obtained based on a predetermined iteration rule from each piece of data.
In step 403, the target iteration times are spliced according to the data sequence, and the check code is obtained based on a predetermined algorithm. In some embodiments, the check code may be obtained by performing a predetermined encryption operation, such as a hash operation, after splicing the target iteration times according to the data interception sequence.
In step 404, a graph code of a single data set is generated according to a predetermined self-similarity set graph generation rule and a target iteration number corresponding to each data set.
In step 405, the graphic codes of the single data are combined according to the predetermined arrangement rule and the data sequence to obtain the graphic code of the data to be carried.
In step 406, the check code is drawn at a predetermined position in the graphic code, or in a predetermined color, such as the outermost layer or the innermost layer of the graphic, or in a different color, so that the check code can be distinguished from the graphic code at the reading end. The finally drawn graph can be as shown in fig. 5, in which the check code is arranged at the outermost layer, and the graph code of single data is drawn in a ring-shaped layered manner.
By the method, the check code can be added into the graphic code, the reading section can utilize the check code to check the information of other parts of the obtained graphic code, and when the check is successful, the scanning success of the graphic code is determined, so that the misreading of the information is avoided.
A schematic diagram of one embodiment of a graphical code generation apparatus of the present disclosure is shown in fig. 6. The iteration number obtaining unit 601 can obtain a target iteration number based on a predetermined iteration rule according to data to be carried. In some embodiments, the predetermined iteration rule may be a function of the data to be carried as an unknown.
The graph drawing unit 602 can generate a graph code of data to be carried according to a predetermined self-similarity set graph generation rule and a target iteration number. In some embodiments, the predetermined self-similarity set graph generation rule may be a fractal theory based rule, such as a cantore trimpot set rule.
The graphic code generating device can convert the data to be carried into the iterative processing times of the self-similarity set graph and generate the graphic code of the data according to the preset self-similarity set graph generating rule, thereby avoiding directly identifying the information to be carried from the graphic code and improving the safety of the carried information
In some embodiments, as shown in fig. 6, the graphic code generation apparatus may further include a data segmentation unit 603 capable of sequentially truncating the data to be carried into a plurality of copies not exceeding a predetermined length. For example, the data may be processed in a predetermined system, with each bit or several bits as one piece of data. The iteration number acquisition unit 601 can acquire a target iteration number based on a predetermined iteration rule from each piece of data. The graph drawing unit 602 can obtain the target iteration times based on a predetermined iteration rule according to each piece of data, and combine the graph codes of the single pieces of data according to a predetermined arrangement rule and a data sequence to obtain the graph codes of the data to be carried.
The graphic code generation device can respectively form the graphic codes after grouping longer data, avoids the difficulty in drawing the graphs or the small color block caused by overlarge iteration times, ensures the definition of the images, can increase the data quantity which can be carried by the graphic codes in a readable range, and is beneficial to expanding application.
In some embodiments, as shown in fig. 6, the graphic code generating apparatus may further include a check code obtaining unit 604, which is capable of splicing the target iteration times according to the data sequence and obtaining the check code based on a predetermined algorithm. In some embodiments, the check code may be obtained by performing a predetermined encryption operation, such as a hash operation, after splicing the target iteration times according to the data interception sequence. The graphic drawing unit 602 can draw the check code at a predetermined position in the graphic code or with a predetermined color on the basis of the graphic code formed based on the target number of iterations.
The graphic code generating device can add the check code in the graphic code, the reading section can utilize the check code to check the information of other parts of the obtained graphic code, and when the check is successful, the scanning of the graphic code is determined to be successful, so that the misreading of the information is avoided.
Fig. 7 is a schematic structural diagram of an embodiment of a graphic code generation apparatus according to the present disclosure. The graphic code generation apparatus includes a memory 701 and a processor 702. Wherein: the memory 701 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory is used for storing the instructions in the corresponding embodiments of the graphic code generation method above. Processor 702 is coupled to memory 701 and may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 702 is configured to execute instructions stored in the memory, so as to avoid directly identifying information to be carried from a graphic code, improve the security of information bearing, and reduce the potential safety hazard of scanning the graphic code.
In one embodiment, as also shown in fig. 8, the graphic code generation apparatus 800 includes a memory 801 and a processor 802. The processor 802 is coupled to the memory 801 by a BUS 803. The graphic code generation apparatus 800 may also be connected to an external storage device 805 through a storage interface 804 to call external data, and may also be connected to a network or another computer system (not shown) through a network interface 806. And will not be described in detail herein.
In the embodiment, the data instruction is stored in the memory, and the instruction is processed by the processor, so that the information to be carried can be prevented from being directly identified from the graphic code, the safety of information bearing is improved, and the potential safety hazard of scanning the graphic code is reduced.
In another embodiment, a computer readable storage medium has stored thereon computer program instructions which, when executed by a processor, implement the steps of the method in the corresponding embodiment of the graphic code generation method. As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Thus far, the present disclosure has been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.
Finally, it should be noted that: the above examples are intended only to illustrate the technical solutions of the present disclosure and not to limit them; although the present disclosure has been described in detail with reference to preferred embodiments, those of ordinary skill in the art will understand that: modifications to the specific embodiments of the disclosure or equivalent substitutions for parts of the technical features may still be made; all such modifications are intended to be included within the scope of the claims of this disclosure without departing from the spirit thereof.
Claims (12)
1. A method for generating a graphic code comprises the following steps:
acquiring target iteration times based on a preset iteration rule according to data to be carried;
and generating a graphic code of the data to be carried according to a preset self-similarity set graphic generation rule and the target iteration times.
2. The method of claim 1, further comprising:
intercepting the data to be carried into a plurality of copies with the length not exceeding the preset length in sequence;
the target iteration times obtained based on the preset iteration rule are as follows: acquiring target iteration times based on a preset iteration rule according to each data;
the generating of the graphic code of the data to be carried according to the preset self-similarity set graphic generation rule and the target iteration number comprises the following steps:
generating a graphic code of single data according to a preset self-similarity set graphic generation rule and the target iteration times corresponding to each data; and combining the graphic codes of the single data according to a preset arrangement rule and a data sequence to obtain the graphic codes of the data to be carried.
3. The method of claim 1, further comprising:
acquiring a check code based on a predetermined algorithm according to the target iteration times;
and drawing the check code in the graphic code.
4. The method of claim 2, further comprising:
splicing the target iteration times according to a data sequence, and acquiring a check code based on a preset algorithm;
and drawing the check code at a preset position in the graphic code or by adopting a preset color.
5. The method of claim 1, wherein,
the predetermined iteration rule comprises a predetermined function; and/or the presence of a gas in the gas,
the predetermined self-similarity set graph generation rule comprises a Comptor triple point set rule.
6. The method according to claim 2, wherein the predetermined arrangement rule is from top to bottom, from left to right, from inside to outside or from outside to inside, or from inside to outside or from outside to inside in a circular arrangement.
7. A graphic code generation apparatus, comprising:
an iteration number obtaining unit configured to obtain a target iteration number based on a predetermined iteration rule according to data to be carried;
and the graph drawing unit is configured to generate a graph code of the data to be carried according to a preset self-similarity set graph generation rule and the target iteration number.
8. The apparatus of claim 7, further comprising:
a data dividing unit configured to sequentially cut data to be carried into a plurality of copies not exceeding a predetermined length;
the iteration number obtaining unit is configured to obtain a target iteration number based on a predetermined iteration rule according to each piece of data;
the graphics-rendering unit is configured to:
generating a graphic code of single data according to a preset self-similarity set graphic generation rule and the target iteration times corresponding to each data; and combining the graphic codes of the single data according to a preset arrangement rule and a data sequence to obtain the graphic codes of the data to be carried.
9. The apparatus of claim 7, further comprising:
a check code obtaining unit configured to obtain a check code based on a predetermined algorithm according to the target iteration number;
the graphic drawing unit is further configured to draw the check code in the graphic code.
10. The apparatus of claim 8, further comprising:
the check code acquisition unit is configured to splice the target iteration times according to a data sequence and acquire a check code based on a predetermined algorithm;
the graphic drawing unit is further configured to draw the check code at a predetermined position in the graphic code, or in a predetermined color.
11. A graphic code generation apparatus, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of any of claims 1-6 based on instructions stored in the memory.
12. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910202662.XA CN111723891A (en) | 2019-03-18 | 2019-03-18 | Graphic code generation method and device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910202662.XA CN111723891A (en) | 2019-03-18 | 2019-03-18 | Graphic code generation method and device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111723891A true CN111723891A (en) | 2020-09-29 |
Family
ID=72563013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910202662.XA Pending CN111723891A (en) | 2019-03-18 | 2019-03-18 | Graphic code generation method and device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111723891A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070064973A1 (en) * | 2005-09-13 | 2007-03-22 | Canon Kabushiki Kaisha | Adaptive mark placement |
| US20080309676A1 (en) * | 2007-06-14 | 2008-12-18 | Microsoft Corporation | Random-access vector graphics |
| CN108280500A (en) * | 2017-01-06 | 2018-07-13 | 百度在线网络技术（北京）有限公司 | Coding method, coding/decoding method, relevant apparatus and the equipment of Quick Response Code |
| CN108563559A (en) * | 2018-03-12 | 2018-09-21 | 平安普惠企业管理有限公司 | A kind of test method of identifying code, device, terminal device and storage medium |
| CN108710932A (en) * | 2018-05-21 | 2018-10-26 | 周冰 | A kind of two-dimensional code generation method, device and electronic equipment |
-
2019
- 2019-03-18 CN CN201910202662.XA patent/CN111723891A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070064973A1 (en) * | 2005-09-13 | 2007-03-22 | Canon Kabushiki Kaisha | Adaptive mark placement |
| US20080309676A1 (en) * | 2007-06-14 | 2008-12-18 | Microsoft Corporation | Random-access vector graphics |
| CN108280500A (en) * | 2017-01-06 | 2018-07-13 | 百度在线网络技术（北京）有限公司 | Coding method, coding/decoding method, relevant apparatus and the equipment of Quick Response Code |
| CN108563559A (en) * | 2018-03-12 | 2018-09-21 | 平安普惠企业管理有限公司 | A kind of test method of identifying code, device, terminal device and storage medium |
| CN108710932A (en) * | 2018-05-21 | 2018-10-26 | 周冰 | A kind of two-dimensional code generation method, device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109308681B (en) | Image processing method and device | |
| US10803174B2 (en) | Bit-level data generation and artificial intelligence techniques and architectures for data protection | |
| CN107329861A (en) | A kind of multiplex roles method of testing and device | |
| US10558447B2 (en) | Application push method, and a service device | |
| US10873900B2 (en) | Method for wireless fidelity connection and related products | |
| US20210200971A1 (en) | Image processing method and apparatus | |
| CN104392151B (en) | A kind of method for protecting software and system | |
| CN106384071A (en) | Two-dimensional code scanning recognition processing method and device | |
| CN109829520B (en) | Image processing method and device | |
| US9836666B2 (en) | High speed searching for large-scale image databases | |
| CN111723891A (en) | Graphic code generation method and device and computer readable storage medium | |
| CN109544433A (en) | Watermark embedding method, device, terminal and storage medium | |
| CN108985420B (en) | Coding and decoding method and decoding system of information code | |
| CN114298699B (en) | Method for generating and acquiring non-homogeneous general evidence and device | |
| CN115757535A (en) | Data query method, data storage method and device and electronic equipment | |
| CN114461418A (en) | Inter-process communication method and device and electronic equipment | |
| WO2022182751A1 (en) | N-dimensional model techniques and architectures for data protection | |
| CN109977716A (en) | A kind of data decoding method, terminal and storage medium | |
| CN105139059A (en) | Two-dimensional code generation method and device | |
| CN110990665A (en) | Data processing method, device, system, electronic equipment and storage medium | |
| CN116205916B (en) | Method and device for detecting defects of small electric power sample, computer equipment and storage medium | |
| US10977861B1 (en) | Inferring quality in point cloud-based three-dimensional objects using topographical data analysis | |
| KR101689165B1 (en) | Apparatus and method for encrypting data using image | |
| CN110968454B (en) | Method and apparatus for determining recovery data for lost data blocks | |
| CN109769250B (en) | Method, terminal and system for identifying pseudo base station |
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 |