CN107944525A - A kind of method and system of the expansion Quick Response Code capacity based on data segmentation - Google Patents
A kind of method and system of the expansion Quick Response Code capacity based on data segmentation Download PDFInfo
- Publication number
- CN107944525A CN107944525A CN201710971166.1A CN201710971166A CN107944525A CN 107944525 A CN107944525 A CN 107944525A CN 201710971166 A CN201710971166 A CN 201710971166A CN 107944525 A CN107944525 A CN 107944525A
- Authority
- CN
- China
- Prior art keywords
- quick response
- response code
- data
- main thread
- sub
- 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
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
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of method and system of the expansion Quick Response Code capacity based on data segmentation, this method passes through input data, obtain input data byte length a and different level of error correction corresponding to maximum amount of data b, compare the size of a and b, judge whether to need partition data, if a ＞ b, data are divided into c parts, c part data that segmentation obtains are divided into two groups of x and y, main thread instantiates a sub-line journey and transmits y group data to sub-line journey, sub-line journey receives y groups data and sequentially generates y Quick Response Code matrix, x group data are sequentially generated Quick Response Code matrix and render Quick Response Code by main thread, sub-line journey is by y Quick Response Code matrix algebraic eqation to main thread, main thread receives y Quick Response Code matrix and renders y Quick Response Code.This method can make Quick Response Code represent more data volumes, can also improve the formation efficiency of Quick Response Code and the response efficiency of browser, greatly expand the capacity of Quick Response Code, expand the application range of Quick Response Code.
Description
Technical field
The present invention relates to information technology field, and in particular to a kind of method of the expansion Quick Response Code capacity based on data segmentation
And system.
Background technology
With the development of information technology, people need to represent more information, bar code skill in what a limited number of space
Art develops two-dimensional bar code later on from one-dimensional bar code.Two-dimensional bar code is also known as Quick Response Code (two-dimensional
Barcode it is) according to certain rules in the chequered with black and white figure of plane (two-dimensional space) distribution with certain specific geometric figure
Record data symbol information.Quick Response Code on coding dexterously using form computer-internal logical foundations " 0 ",
The concept of " 1 " bit stream, represents data message with the corresponding geometrical body of binary system using several, passes through picture input
Equipment or photoelectric scanning device automatically identifying and reading are to realize that information automatically processes.Quick Response Code has some general character of barcode technology：Often
Kind coded format (or code system) has its specific character set；Each character occupies certain space；With certain verifying function
Deng.Quick Response Code also has the characteristics that information automatic identification function to not going together and processing figure are rotationally-varying at the same time.Quick Response Code
Can have in horizontal and vertical two orientation expressing information, therefore substantial amounts of information can be expressed in the area of very little at the same time
The features such as high density, large capacity, it is possible to two-dimentional representation data file (including Chinese character, numeral, symbol), picture etc..
Quick Response Code is the large capacities such as various certificates and card, the storage of highly reliable information, carries and the ideal method of automatically identifying and reading.Current
In common Quick Response Code, code system mainly has：Data Matrix、MaxiCode、Aztec、QR Code、Vericode、PDF417、
Ultracode, Code49, Code16K etc..QR Code codes are to be invented by Japanese DW companies for 1994.QR Code codes are current
Using commonplace Quick Response Code, the coding of text message is very suitable for.Different versions, such as QR are further included in some code systems
Code codes just include version 1~40.
Although prior art Quick Response Code can record the information more much more than one-dimensional bar code in the plane of limited areal,
But a Quick Response Code, which removes, is used for the functional graphic areas such as position sensing, positioning, correction and for expressing coded format, version, version
The preamble of this information etc., the capacity for being actually used in recording data information are also very limited amount of.Such as a version 20
QRCode codes, number of modules 97*97, functional graphic account for 659 modules, and preamble takes 67 modules, for recording data letter
The number of modules of breath only has 8683 modules, and data capacity is 1085 code words, wherein further including error correction code word.It can be seen that its information is held
Amount is also very limited amount of, and prior art Quick Response Code is not suitable for handing over information content the coding and record of big text, image etc..
The method of some existing increase Quick Response Code capacity, still, increased capacity is still limited, moreover, some methods increase
While adding capacity, the also identification to Quick Response Code brings certain difficulty.
The generating process of Quick Response Code is very rigorous, it then follows certain coding flow and rule, any step of coding is all
It cannot malfunction, calculating process is very complicated, including data encoding, Error Correction of Coding, etc..
In view of this, the expansion of Quick Response Code capacity needs further to be studied.
The content of the invention
It is an object of the invention to provide a kind of method and system of the expansion Quick Response Code capacity based on data segmentation, purpose
It is to solve traditional two-dimensional code data finite capacity, can not represent the information of big data quantity, application range tool is limited
Problem.
To reach above-mentioned purpose, the technical proposal of the invention is realized in this way：
A kind of method of the expansion Quick Response Code capacity based on data segmentation, it is characterised in that comprise the following steps：
Input data, obtains the length a of input data byte, obtains the maximum corresponding to the different level of error correction of Quick Response Code
Data volume b；
Compare the size of a and b, if a≤b, data are encoded according to the Quick Response Code coding rule of standard, generate
Quick Response Code matrix, Quick Response Code is rendered to by Quick Response Code matrix；
If a ＞ b, the quantity for determining generation Quick Response Code is c,OrderFirst part of data is partitioned into,
Its byte length is e, e=a- (c-1) * d；Remaining c-1 parts of data are partitioned into successively, its byte length is d；
Obtained c part data will be split and be divided into two groups, 1~x parts of data are x group data, (x+1)th~c parts of data
For y group data；
Main thread instantiates a sub-line journey, and main thread transmits y group data to sub-line journey；
Sub-line journey receives y group data,
X group data are sequentially generated Quick Response Code matrix by main thread, and Quick Response Code matrix is rendered Quick Response Code；Sub-line journey will
Y group data sequentially generate Quick Response Code matrix；
Sub-line journey is by y Quick Response Code matrix algebraic eqation to main thread；
Main thread receives y Quick Response Code matrix, and y Quick Response Code matrix is rendered to y Quick Response Code by main thread.
The Quick Response Code is QR codes, i.e. quick response matrix code.
Wherein, input is two-dimensional code data to be encoded, the number of data segmentation and the quantity of generation Quick Response Code be by
What the maximum amount of data corresponding to the length of the input data byte level of error correction different with Quick Response Code was together decided on.
The generating process of Quick Response Code in the present invention, is by Quick Response Code product process of the data according to standard, i.e., is compiled through data
After code, Error Correction of Coding, arrangement module, addition mask, the final information of construction, the Quick Response Code matrix of generation, by the Quick Response Code of generation
Matrix is rendered to the Quick Response Code shown on the page.
If a ＞ b, the quantity for determining generation Quick Response Code is:This is the minimum two-dimentional number of codes of required generation,
And the number of segmentation needed for data.AndD is the data word of the impartial segmentation of remaining data in addition to first part of data
The length of section.E is the length of first part of data byte of segmentation, when data impartial can be split：E=d, when data can not be equal
When segmentation, e ≠ d.
Preferably,X group data are sequentially generated Quick Response Code matrix by y=c-x, main thread, and by Quick Response Code
Matrix renders the process of Quick Response Code and y group data sequentially generates to Quick Response Code matrix is synchronous to carry out with sub-line journey, therefore, when the two
During spent time approximately equal, system work efficiency highest, root is it is found by researches that when satisfactionIt is main during y=c-x
X group data are sequentially generated Quick Response Code matrix and render Quick Response Code spent time T1 and sub-line journey by y groups data successively by thread
Generate Quick Response Code matrix spent time T2 approximately equals.
The sub-line journey is by can just monitor after main thread instantiation and receive the data of main thread, and to main thread
Transmit data；And main thread transmits y groups data to sub-line journey and sub-line journey reception y groups data synchronously carry out, sub-line journey is by y
It is also synchronously to carry out that a Quick Response Code matrix, which is transmitted to main thread and main thread y Quick Response Code matrix of reception,.
Preferably, when sub-line journey by y Quick Response Code matrix algebraic eqation to main thread after, close sub-line journey, to save computer
Resource.
It is a further object of the present invention to provide a kind of system of the expansion Quick Response Code capacity based on data segmentation, including：
Input unit, for input data；
Acquiring unit, for obtaining the length a of input data byte, obtains corresponding to the different level of error correction of Quick Response Code
Maximum amount of data b；
Comparing unit, for comparing the size of a and b, if a≤b, by algorithm unit main thread module by data according to
The Quick Response Code coding rule of standard is encoded, and generates Quick Response Code matrix, Quick Response Code matrix is rendered to Quick Response Code；If a ＞
B, then split data by data partitioning unit；
Data partitioning unit, in the case of relatively obtaining a ＞ b in comparing unit, determines the quantity of generation Quick Response Code
For c,OrderFirst part of data is partitioned into, its byte length is e, e=a- (c-1) * d；It is partitioned into successively
Remaining c-1 parts of data, its byte length are d；C part data that segmentation obtains are divided into two groups, 1~x parts of data are x
Group data, (x+1)th~c parts of data are y group data；
Algorithm unit, including main thread module, instantiation module and sub-line journey module, the instantiation module is used for will be main
Threading models instantiate a sub- threading models；Main thread module is used to x group data sequentially generating Quick Response Code matrix, and by two
Dimension code matrix renders Quick Response Code；Main thread module is additionally operable to transmit y group data to sub-line journey module, and receives sub-line journey module
Y Quick Response Code matrix of transmission, y Quick Response Code is rendered to by y Quick Response Code matrix；Sub-line journey module is used to receive main thread mould
Y group data are sequentially generated Quick Response Code matrix by the y group data of block transmission, and give y Quick Response Code matrix algebraic eqation to main thread mould
Block.
Compared with prior art, the invention has the advantages that：
Traditional Quick Response Code generating process is combined by the present invention with the scheme that data are split, and promotes Quick Response Code to represent
More data, can also improve the formation efficiency of Quick Response Code and the response efficiency of browser, greatly expand Quick Response Code institute
The data volume that can be represented, improves the application range of Quick Response Code.
Brief description of the drawings
Fig. 1 is the work flow diagram of the expansion Quick Response Code capacity method based on data segmentation.
Embodiment
The present invention provides a kind of method of the expansion Quick Response Code capacity based on data segmentation, and the idiographic flow that method is realized is such as
Shown in Fig. 1, the purpose of this method is to solve traditional two-dimensional code data finite capacity, and use scope has certain limitation
Problem.
The method of expansion Quick Response Code capacity of the present invention based on data segmentation includes the following steps：
Input two-dimensional code data to be encoded；
The length a of input data byte is obtained, obtains the maximum amount of data b corresponding to the different level of error correction of Quick Response Code；
The number of data segmentation and the quantity of generation Quick Response Code are together decided on by the two parameters；
Judge whether a≤b sets up, data avoid the need for splitting when a≤b is set up, and data just need to divide when a≤b is invalid
Cut；
If a≤b is set up, not partition data, as long as determining one Quick Response Code of generation；
Data are encoded according to the Quick Response Code coding rule of standard, i.e., through data encoding, Error Correction of Coding, arrangement mould
The processes such as block, addition mask, the final information of construction are encoded；Generate Quick Response Code matrix to be rendered；By two dimension on the page
Code matrix is rendered to Quick Response Code；
If a≤b is invalid, the quantity for determining generation Quick Response Code is：This is the minimum two-dimentional yardage for needing to generate
Amount, and the minimum number that data needs are split；
Round up, makeD is the byte length of remainder data in addition to first part of data；
E=a- (c-1) * d are made, when data impartial can be split：E=d；
First part of data is partitioned into, its byte length is：E, when data impartial can not be split, is first partitioned into the first number
According to, then split remaining data is impartial；
Remaining c-1 parts of data are partitioned into successively, its byte length is：D, after first part of data is split, remaining
Data impartial can be split；
Obtained c part data will be split and be divided into two groups, 1~x parts of data are x group data, (x+1)th~c parts of data
For y group data,Y=c-x, experiment learn that main thread generates a Quick Response Code matrix and renders Quick Response Code institute
Take time about 31.7ms, sub-line journey generate Quick Response Code matrix the time required to be about 21.5ms, when main thread is by x group data
Sequentially generate Quick Response Code matrix and render Quick Response Code spent time T1 and y group data are sequentially generated into Quick Response Code matrix with sub-line journey
During spent time T2 approximately equals, that is, work asDuring y=c-x, system work efficiency highest；
Main thread instantiates a sub-line journey, and sub-line journey and main thread can be with concurrent workings, for improving the work of system
Efficiency；
Main thread transmits y group data to sub-line journey；
Sub-line journey receives y group data, and sub-line journey receives data and main thread sends data and synchronously carries out；
X group data are sequentially generated Quick Response Code matrix by main thread, and render Quick Response Code；Meanwhile sub-line journey is by y group data
Sequentially generate Quick Response Code matrix；This two step is carried out at the same time, and during time-consuming approximately equal, system work efficiency highest；
Sub-line journey by y Quick Response Code matrix algebraic eqation to main thread, because sub-line journey can not carry out the Quick Response Code matrix of generation
Render, rendered so needing to pass it to main thread；
Main thread receives y Quick Response Code matrix, and main thread receives Quick Response Code matrix and sub-line journey transfer matrix to main thread
Synchronously carry out；
Y Quick Response Code matrix is rendered to y Quick Response Code by main thread；
Sub-line journey is closed, for saving computer resource.
The present embodiment additionally provides a kind of system of the expansion Quick Response Code capacity based on data segmentation, including：
Input unit, for input data；
Acquiring unit, for obtaining the length a of input data byte, obtains corresponding to the different level of error correction of Quick Response Code
Maximum amount of data b；
Comparing unit, for comparing the size of a and b, if a≤b, by algorithm unit main thread module by data according to
The Quick Response Code coding rule of standard is encoded, and generates Quick Response Code matrix, Quick Response Code matrix is rendered to Quick Response Code；If a ＞
B, then split data by data partitioning unit；
Data partitioning unit, in the case of relatively obtaining a ＞ b in comparing unit, determines the quantity of generation Quick Response Code
For c,OrderFirst part of data is partitioned into, its byte length is e, e=a- (c-1) * d；It is partitioned into successively
Remaining c-1 parts of data, its byte length are d；C part data that segmentation obtains are divided into two groups, 1~x parts of data are x
Group data, (x+1)th~c parts of data are y group data；
Algorithm unit, including main thread module, instantiation module and sub-line journey module, the instantiation module is used for will be main
Threading models instantiate a sub- threading models；Main thread module is used to x group data sequentially generating Quick Response Code matrix, and by two
Dimension code matrix renders Quick Response Code；Main thread module is additionally operable to transmit y group data to sub-line journey module, and receives sub-line journey module
Y Quick Response Code matrix of transmission, y Quick Response Code is rendered to by y Quick Response Code matrix；Sub-line journey module is used to receive main thread mould
Y group data are sequentially generated Quick Response Code matrix by the y group data of block transmission, and give y Quick Response Code matrix algebraic eqation to main thread mould
Block.
It the above is only the embodiment of the present invention, limitation in any form not done to the present invention, it is every
Any simple modification, equivalent variations or the modification that technical spirit according to the present invention makes embodiment of above, still fall within
The protection domain of technical solution of the present invention.
Claims (5)
- A kind of 1. method of the expansion Quick Response Code capacity based on data segmentation, it is characterised in that comprise the following steps：Input data, obtains the length a of input data byte, obtains the maximum data corresponding to the different level of error correction of Quick Response Code Measure b；Compare the size of a and b, if a≤b, data are encoded according to the Quick Response Code coding rule of standard, generation two dimension Code matrix, Quick Response Code is rendered to by Quick Response Code matrix；If a ＞ b, the quantity for determining generation Quick Response Code is c,OrderIt is partitioned into first part of data, its byte Length is e, e=a- (c-1) * d；Remaining c-1 parts of data are partitioned into successively, its byte length is d；C part data that segmentation obtains are divided into two groups, 1~x parts of data are x group data, and (x+1)th~c parts of data are y groups Data；Main thread instantiates a sub-line journey, and main thread transmits y group data to sub-line journey；Sub-line journey receives y group data,X group data are sequentially generated Quick Response Code matrix by main thread, and Quick Response Code matrix is rendered Quick Response Code；Sub-line journey is by y groups Data sequentially generate Quick Response Code matrix；Sub-line journey is by y Quick Response Code matrix algebraic eqation to main thread；Main thread receives y Quick Response Code matrix, and y Quick Response Code matrix is rendered to y Quick Response Code by main thread.
- 2. the method for the expansion Quick Response Code capacity according to claim 1 based on data segmentation, it is characterised in that described Quick Response Code is QR codes.
- 3. the method for the expansion Quick Response Code capacity according to claim 1 based on data segmentation, it is characterised in thatY=c-x.
- 4. the method for the expansion Quick Response Code capacity according to claim 1 based on data segmentation, it is characterised in that work as sub-line Journey by y Quick Response Code matrix algebraic eqation to main thread after, close sub-line journey.
- A kind of 5. system of the expansion Quick Response Code capacity based on data segmentation, it is characterised in that including：Input unit, for input data；Acquiring unit, for obtaining the length a of input data byte, obtains the maximum corresponding to the different level of error correction of Quick Response Code Data volume b；Comparing unit, for comparing the size of a and b, if a≤b, by algorithm unit main thread module by data according to standard Quick Response Code coding rule encoded, generate Quick Response Code matrix, Quick Response Code matrix is rendered to Quick Response Code；If a ＞ b, Data are split by data partitioning unit；Data partitioning unit, in the case of relatively obtaining a ＞ b in comparing unit, the quantity for determining generation Quick Response Code is c,OrderFirst part of data is partitioned into, its byte length is e, e=a- (c-1) * d；It is partitioned into remaining successively C-1 parts of data, its byte length are d；C part data that segmentation obtains are divided into two groups, 1~x parts of data are x group numbers According to (x+1)th~c parts of data are y group data；Algorithm unit, including main thread module, instantiation module and sub-line journey module, the instantiation module are used for main thread One sub- threading models of module instanceization；Main thread module is used to x group data sequentially generating Quick Response Code matrix, and by Quick Response Code Matrix renders Quick Response Code；Main thread module is additionally operable to transmit y group data to sub-line journey module, and receives sub-line journey module transmission Y Quick Response Code matrix, y Quick Response Code matrix is rendered to y Quick Response Code；Sub-line journey module is used to receive main thread module biography Y group data are sequentially generated Quick Response Code matrix by the y group data passed, and give y Quick Response Code matrix algebraic eqation to main thread module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710971166.1A CN107944525A (en) | 2017-10-18 | 2017-10-18 | A kind of method and system of the expansion Quick Response Code capacity based on data segmentation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710971166.1A CN107944525A (en) | 2017-10-18 | 2017-10-18 | A kind of method and system of the expansion Quick Response Code capacity based on data segmentation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107944525A true CN107944525A (en) | 2018-04-20 |
Family
ID=61936238
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710971166.1A Pending CN107944525A (en) | 2017-10-18 | 2017-10-18 | A kind of method and system of the expansion Quick Response Code capacity based on data segmentation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107944525A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109885048A (en) * | 2019-01-30 | 2019-06-14 | 成都飞机工业（集团）有限责任公司 | AGV trolley information automatic interaction device and control method under a kind of secure environment |
| CN109919279A (en) * | 2019-02-28 | 2019-06-21 | 尤尼泰克(嘉兴)信息技术有限公司 | A kind of extended method of two dimensional code |
| WO2021169502A1 (en) * | 2020-02-27 | 2021-09-02 | Changsha Pixel Code Technology Co. Ltd | A pixel image as well as its processing method and application system |
| CN113344158A (en) * | 2021-05-12 | 2021-09-03 | 齐品(杭州)网络科技有限公司 | Method for obtaining large-capacity two-dimensional code information carrier |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103530669A (en) * | 2013-11-08 | 2014-01-22 | 成都博格科技有限公司 | Data information two-dimensional code encoding method |
| CN106919882A (en) * | 2015-12-28 | 2017-07-04 | 航天信息股份有限公司 | A kind of method that two-dimentional digital content switchs to pure digi-tal symbolic coding |
-
2017
- 2017-10-18 CN CN201710971166.1A patent/CN107944525A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103530669A (en) * | 2013-11-08 | 2014-01-22 | 成都博格科技有限公司 | Data information two-dimensional code encoding method |
| CN106919882A (en) * | 2015-12-28 | 2017-07-04 | 航天信息股份有限公司 | A kind of method that two-dimentional digital content switchs to pure digi-tal symbolic coding |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109885048A (en) * | 2019-01-30 | 2019-06-14 | 成都飞机工业（集团）有限责任公司 | AGV trolley information automatic interaction device and control method under a kind of secure environment |
| CN109919279A (en) * | 2019-02-28 | 2019-06-21 | 尤尼泰克(嘉兴)信息技术有限公司 | A kind of extended method of two dimensional code |
| CN109919279B (en) * | 2019-02-28 | 2020-12-08 | 尤尼泰克(嘉兴)信息技术有限公司 | Two-dimensional code expansion method |
| WO2021169502A1 (en) * | 2020-02-27 | 2021-09-02 | Changsha Pixel Code Technology Co. Ltd | A pixel image as well as its processing method and application system |
| CN113344158A (en) * | 2021-05-12 | 2021-09-03 | 齐品(杭州)网络科技有限公司 | Method for obtaining large-capacity two-dimensional code information carrier |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101645140B (en) | Two-dimensional code generation method, coding/decoding method and device | |
| Zhao et al. | Cutie: Learning to understand documents with convolutional universal text information extractor | |
| CN107944525A (en) | A kind of method and system of the expansion Quick Response Code capacity based on data segmentation | |
| US9177238B2 (en) | Techniques for generating customized two-dimensional barcodes | |
| US9208420B2 (en) | Techniques for generating customized two-dimensional barcodes | |
| CN110879937A (en) | Method and device for generating webpage from document, computer equipment and storage medium | |
| CN101639899A (en) | Methods and devices for encoding and decoding two-dimension code and terminal | |
| CN111695439A (en) | Image structured data extraction method, electronic device and storage medium | |
| CN107392270B (en) | Two-dimensional code generation method | |
| CN112446207A (en) | Title generation method and device, electronic equipment and storage medium | |
| CN103530669A (en) | Data information two-dimensional code encoding method | |
| JP2019079347A (en) | Character estimation system, character estimation method, and character estimation program | |
| CN113157927A (en) | Text classification method and device, electronic equipment and readable storage medium | |
| CN113704614A (en) | Page generation method, device, equipment and medium based on user portrait | |
| CN103761532B (en) | Label space dimensionality reducing method and system based on feature-related implicit coding | |
| CN113051500A (en) | Phishing website identification method and system fusing multi-source data | |
| CN112825129A (en) | Location embedding for document processing | |
| CN114005126A (en) | Table reconstruction method and device, computer equipment and readable storage medium | |
| CN113869017A (en) | Table image reconstruction method, device, equipment and medium based on artificial intelligence | |
| CN113255767B (en) | Bill classification method, device, equipment and storage medium | |
| CN110738050A (en) | Text recombination method, device and medium based on word segmentation and named entity recognition | |
| US9082175B2 (en) | Method for retrieving associated information using an image | |
| CN114138243A (en) | Function calling method, device, equipment and storage medium based on development platform | |
| CN116610304B (en) | Page code generation method, device, equipment and storage medium | |
| CN107273961A (en) | A kind of method that color 2 D code is automatically generated according to template |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180420 |
|
| RJ01 | Rejection of invention patent application after publication |