CN107203798A - A kind of generation and recognition methods for limiting access type figure ground Quick Response Code - Google Patents
A kind of generation and recognition methods for limiting access type figure ground Quick Response Code Download PDFInfo
- Publication number
- CN107203798A CN107203798A CN201710372064.8A CN201710372064A CN107203798A CN 107203798 A CN107203798 A CN 107203798A CN 201710372064 A CN201710372064 A CN 201710372064A CN 107203798 A CN107203798 A CN 107203798A
- Authority
- CN
- China
- Prior art keywords
- mrow
- matrix
- msubsup
- response code
- quick response
- 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.)
- Granted
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/06046—Constructional details
-
- 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/1408—Methods for optical code recognition the method being specifically adapted for the type of code
- G06K7/1417—2D bar codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Complex Calculations (AREA)
Abstract
The invention discloses a kind of generation and recognition methods for limiting access type figure ground Quick Response Code, generation phase：Data are classified, all data are arranged with a matrix type, in the obscuring layer that the secure key data of high priority is incorporated into the low resolution of the Quick Response Code by encoder, the practical communication data of low priority are incorporated into the high-resolution high definition of Quick Response Code layer, the stealth of secure key data is realized, and is finally mapped as Quick Response Code.Cognitive phase：Image in 2 D code is extracted, first in the way of fuzzy DSP, high priority hidden safety key is extracted, key data is correct, it was demonstrated that the two-dimension code safe, then barcode scanning people has corresponding authority, high definition DSP is carried out to Quick Response Code again, actual communication data is extracted by decoder.Present invention limitation uses crowd, when be assigned to and packaged key（Have permission to access）, complete information can be decoded；When without when（Lack of competence）, the essential information of no potential safety hazard can only be decoded.
Description
Technical field
The present invention relates to a kind of generation and recognition methods for limiting access type figure ground Quick Response Code, and in particular to Yi Zhongtong
The generation and recognition methods of the limitation access type figure ground Quick Response Code of wavelet transformation realization are crossed, belongs to image information encoding and decoding skill
Art field.
Background technology
With personal electric pay industry rise, Quick Response Code with its easily and efficiently advantage be widely used.
Quick Response Code is to be used to record in the chequered with black and white figure that two dimensional surface is distributed by certain rule with certain particular geometric figure
Numerical chracter information." 0 ", the concept of " 1 " bit stream, black pattern counterlogic " 1 " ratio are dexterously utilized on coding
Spy, white pattern counterlogic " 0 " bit, Quick Response Code can in the both direction of a plane expressing information, therefore very little simultaneously
Quick Response Code have storage bulk information ability.It is shown by image input device, by photoelectric scanning device according to rule
Then automatically recognized.
In recent years, criminal carries out the situation of financial crime repeatly by being implanted into fishing website, virus etc. in Quick Response Code
See not fresh, however Quick Response Code it as acting on for internet interface apparently there is irreplaceability at present, therefore how to ensure
People are not utilized while being communicated using Quick Response Code by criminal, it would be highly desirable to solve, so one kind can provide safety
The Quick Response Code of discriminating is just ready to appear.
The content of the invention
The technical problems to be solved by the invention are：A kind of generation and knowledge for limiting access type figure ground Quick Response Code is provided
Other method, when generating and recognizing Quick Response Code, it is necessary to add and read the hidden safety key with high priority, is made with limiting
Crowd, ensures the information security of two-dimentional code communication.
The present invention uses following technical scheme to solve above-mentioned technical problem：
A kind of generation and recognition methods for limiting access type figure ground Quick Response Code, the generation method includes following step
Suddenly：
Step 1, key data is added in original communication data, binary data is constituted, binary data is carried out
Classification and the highest priority of key data；
Step 2, key data and all communication datas are converted into the square formation that element value is -1 or 1, and each side
The row, column of battle array is all equal, all square formations is combined into matrix D, D form is as follows：
Step 3, the quick Haar wavelet transform inverse transformations of 2D are carried out to matrix D, is converted to used in matrix X, transfer process small
Wave conversion order of matrix number is equal with the line number or columns of matrix D；
Step 4, matrix X is mapped as Quick Response Code, the size of the Quick Response Code is matrix X line number and the product of columns, square
A color lump of each element correspondence Quick Response Code, represents these color lumps with normalized gray scale, obtains figure ground two in battle array X
Tie up code；
The recognition methods comprises the following steps：
Step 5, figure ground Quick Response Code is extracted, figure ground Quick Response Code is converted to by matrix by image procossing；
Step 6, the key data in the matrix obtained step 5 by the quick haar wavelet transforms of 2D is decoded come solution
The exponent number of wavelet transform matrix used during code for matrix D line number or columns 1/2；
Step 7, key data information is checked, if key checks mistake, not decoded communications data, if key verification is just
Really, then key data and communication data in the matrix obtained step 5 by the quick haar wavelet transforms of 2D decode come,
The exponent number of the wavelet transform matrix used in decoding process is equal with the line number of matrix D or columns.
As a preferred embodiment of the present invention, step 3 conversion formula is：
Wherein, Xu,vThe element of representing matrix X u rows v row, dm,nThe element of representing matrix D m rows n row, p is matrix D
Line number or columns, HpThe wavelet transform matrix arranged for p rows p,Represent HpThe element of line n v row,Represent HpM rows u is arranged
Element.
As a preferred embodiment of the present invention, the wavelet transform matrix HpForm it is as follows：
As a preferred embodiment of the present invention, the formula of the quick haar wavelet transforms of 2D described in step 6 is：
Wherein,The element of matrix m rows n row for decoding is represented,Represent what is obtained through step 5 image procossing
The element of matrix u rows v row, HqThe wavelet transform matrix arranged for q rows q, q=p/2,Represent HqThe element of line n v row,Represent HqThe element of m rows u row.
As a preferred embodiment of the present invention, the formula of the quick haar wavelet transforms of 2D described in step 7 is：
Wherein,The element of matrix m rows n row for decoding is represented,Expression is obtained through step 5 image procossing
Matrix u rows v row element, HpThe wavelet transform matrix arranged for p rows p,Represent HpThe element of line n v row,Table
Show HpThe element of m rows u row.
The present invention uses above technical scheme compared with prior art, with following technique effect：
1st, the inventive method has effect of the limitation using crowd, (has when be assigned to and packaged key
Authority is accessed), complete information can be decoded；When without when (lack of competence), the basic letter of no potential safety hazard can only be decoded
Breath.
2nd, the inventive method has the preferential effect of safety, and Quick Response Code is read out according to data priority, and safety is close
The highest priority of key.
3rd, the inventive method introduces the concept of level in Quick Response Code：High definition layer and obscuring layer.
4th, it is that dominant safe color lump, easily quilt are added in Quick Response Code mostly compared to existing safe planar bar code technology
Copy or crack；And the inventive method is the image that the secure data of high priority is incorporated into Quick Response Code with certain coding rule
In, it has stealthy characteristic.
Brief description of the drawings
Fig. 1 is the integrated stand composition of generation and the recognition methods of present invention limitation access type figure ground Quick Response Code.
Fig. 2 is the flow chart of generation phase in the inventive method.
Fig. 3 is the flow chart of cognitive phase in the inventive method.
Fig. 4 is two levels of a Quick Response Code embodiment in the inventive method.
Embodiment
Embodiments of the present invention are described below in detail, the example of the embodiment is shown in the drawings.Below by
The embodiment being described with reference to the drawings is exemplary, is only used for explaining the present invention, and is not construed as limiting the claims.
As shown in figure 1, the present invention proposes that a kind of limitation access type figure ground Quick Response Code realized by wavelet transformation is given birth to
Into identification technology, it can apply to limitation and uses crowd, when with being assigned to and during packaged key (permission to access),
Complete information can be decoded；When without when (lack of competence), the essential information of no potential safety hazard can only be decoded.It is not continued to use
Existing Quick Response Code standard but the image background with Quick Response Code.Even if the image in 2 D code of the present invention can be imitated, but because not
It with packaged safe key (lack of competence), also can not further be accessed, more be pacified by limiting access crowd and realizing
Complete two-dimentional code communication.During generation：Utilize quick Haar wavelet transform inverse transformation (IFHWT：inverse fast Haar wavelet
Transform), data are encoded, the key data of high priority is incorporated into the obscuring layer of the low resolution of the Quick Response Code
In, the real data of low priority is incorporated into the high-resolution high definition of Quick Response Code layer, the stealth of key data is realized.Know
When other：Utilize quick haar wavelet transform (FHWT：Fast Haar wavelet transform), first with fuzzy DSP (numerals
Signal transacting) mode, extract the stealthy key of high priority, key data is correct, it was demonstrated that the two-dimension code safe, then to Quick Response Code
High definition DSP is carried out, the data for being actually needed transmission is extracted, makes two-dimentional code communication safer.
The inventive method includes two stages：Generation phase and cognitive phase.
1st, as shown in Fig. 2 generation phase comprises the following steps：
Step 1：Binary data is classified, key data highest priority, other actual communication datas can be with
Assign medium or low priority；
Step 2：Binary data is encoded, key and practical communication data are respectively put into the two of a Quick Response Code
In layer；
Step 2-1：All data are arranged with a matrix type, arrangement mode is：
Element value is -1 or 1 wherein in D matrix, wherein the data of m rows, n row are dm,n；
Step 2-2：2D IFHWT conversion is carried out to above-mentioned data, the data matrix D of input matrix X is converted into, then square
Battle array X u rows, the element of v row are：
HereFor matrix HpOne element of m rows, n row, the H of p rows p rowpTransformation matrix is as follows：
Step 3：Each element matrix X being mapped as in pixel p*p Quick Response Code, i.e. matrix corresponds to Quick Response Code
A color lump, the element value in matrix X is changed into { 0,1/4,1/2,3/4,1 }, and this simple each pixel of Quick Response Code is gathered around
There are 5 values, can be indicated with 5 normalized gray scales, form a black white image with Quick Response Code feature.
2nd, as shown in figure 3, cognitive phase comprises the following steps：
Step 1：Quick Response Code is extracted；
Step 2：Carry out image procossing to Quick Response Code in the way of fuzzy DSP, as obscuring layer, now script pixel p*
P Quick Response Code is then changed into pixel q*q Quick Response Code (q=p/2), and this is the concept based on average gray, i.e., several adjacent
Pixel has certain average gray.At this moment, practical communication data division information is lost, only remaining priority in 2 D code information
Higher key data, can be decoded out, its decoding process is by q rank 2D FHWT conversion：
Key information is reduced；
Step 3：Check key information；
Step 3-1：Key checks mistake, does not carry out high definition DSP processing to Quick Response Code, does not decode real data, it is ensured that logical
The security of letter；
Step 3-2：Key verification is correct, and high definition DSP processing is carried out to Quick Response Code, passes through p rank 2D FHWT conversion decodings institute
Some data, reduce the communication information, as high definition layer, and its decoding process is：
Below using pixel 16*16 Quick Response Code as embodiment：
1st, binary data is classified, according to aforementioned claim, the placement regulation of its matrix is as follows：
D11、D12、D21、D22It is 8*8 matrix, wherein D11For the safe key of high priority, other are medium or low
The practical communication data of priority.
2nd, the process of generation Quick Response Code and identification Quick Response Code is distinguished as shown in Figures 2 and 3, wherein 2D IFHWT and 2D
FHWT mathematical modelings are expressed as：
3rd, the transformation matrix H of core during FHWT is convertedpLiterary style rule it is as follows, by 8 ranks, 16 ranks distinguish exemplified by, with such
Push away：
4th, pixel 16*16 Quick Response Code, its high definition layer and obscuring layer is as shown in Figure 4.
The technological thought of above example only to illustrate the invention, it is impossible to which protection scope of the present invention is limited with this, it is every
According to technological thought proposed by the present invention, any change done on the basis of technical scheme each falls within the scope of the present invention
Within.
Claims (5)
1. a kind of generation and recognition methods for limiting access type figure ground Quick Response Code, it is characterised in that the generation method bag
Include following steps：
Step 1, key data is added in original communication data, binary data is constituted, binary data is classified
And the highest priority of key data；
Step 2, key data and all communication datas are converted into the square formation that element value is -1 or 1, and each square formation
Row, column is all equal, and all square formations are combined into matrix D, and D form is as follows：
Step 3, the quick Haar wavelet transform inverse transformations of 2D are carried out to matrix D, is converted to the small echo used in matrix X, transfer process and becomes
Change order of matrix number equal with the line number or columns of matrix D；
Step 4, matrix X is mapped as Quick Response Code, during the size of the Quick Response Code is matrix X line number and the product of columns, matrix X
One color lump of each element correspondence Quick Response Code, represents these color lumps with normalized gray scale, obtains figure ground Quick Response Code；
The recognition methods comprises the following steps：
Step 5, figure ground Quick Response Code is extracted, figure ground Quick Response Code is converted to by matrix by image procossing；
Step 6, the key data in the matrix obtained step 5 by the quick haar wavelet transforms of 2D decodes to decode
The exponent number of the wavelet transform matrix used in journey for matrix D line number or columns 1/2；
Step 7, key data information is checked, if key checks mistake, not decoded communications data, if key verification is correct,
Key data and communication data in the matrix for being obtained step 5 by the quick haar wavelet transforms of 2D are decoded come decoding
During the exponent number of wavelet transform matrix that uses it is equal with the line number of matrix D or columns.
2. the generation and recognition methods of access type figure ground Quick Response Code are limited according to claim 1, it is characterised in that institute
Stating step 3 conversion formula is：
<mrow>
<msub>
<mi>X</mi>
<mrow>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
</msub>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>p</mi>
</msubsup>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>p</mi>
</msubsup>
<msub>
<mi>d</mi>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<msubsup>
<mi>H</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mi>p</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>u</mi>
</mrow>
<mi>p</mi>
</msubsup>
</mrow>
Wherein, Xu,vThe element of representing matrix X u rows v row, dm,nThe element of representing matrix D m rows n row, p is the line number of matrix D
Or columns, HpThe wavelet transform matrix arranged for p rows p,Represent HpThe element of line n v row,Represent HpThe member of m rows u row
Element.
3. the generation and recognition methods of access type figure ground Quick Response Code are limited according to claim 2, it is characterised in that institute
The form for stating wavelet transform matrix Hp is as follows：
4. the generation and recognition methods of access type figure ground Quick Response Code are limited according to claim 2, it is characterised in that step
The formula of the quick haar wavelet transforms of 2D described in rapid 6 is：
<mrow>
<mover>
<msub>
<mi>d</mi>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
<mo>^</mo>
</mover>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>u</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>q</mi>
</msubsup>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>v</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>q</mi>
</msubsup>
<mover>
<msub>
<mi>X</mi>
<mrow>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
</msub>
<mo>^</mo>
</mover>
<msubsup>
<mi>H</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mi>q</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mi>q</mi>
</msubsup>
</mrow>
Wherein,The element of matrix m rows n row for decoding is represented,Represent the matrix obtained through step 5 image procossing
The element of u rows v row, HqThe wavelet transform matrix arranged for q rows q, q=p/2,Represent HqThe element of line n v row,Table
Show HqThe element of m rows u row.
5. the generation and recognition methods of access type figure ground Quick Response Code are limited according to claim 1, it is characterised in that step
The formula of the quick haar wavelet transforms of 2D described in rapid 7 is：
<mrow>
<mover>
<mrow>
<msub>
<msup>
<mi>d</mi>
<mo>&prime;</mo>
</msup>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>n</mi>
</mrow>
</msub>
</mrow>
<mo>^</mo>
</mover>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>u</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>p</mi>
</msubsup>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>v</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>p</mi>
</msubsup>
<mover>
<msub>
<mi>X</mi>
<mrow>
<mi>u</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
</msub>
<mo>^</mo>
</mover>
<msubsup>
<mi>H</mi>
<mrow>
<mi>n</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mi>p</mi>
</msubsup>
<msubsup>
<mi>H</mi>
<mrow>
<mi>m</mi>
<mo>,</mo>
<mi>v</mi>
</mrow>
<mi>p</mi>
</msubsup>
</mrow>
Wherein,The element of matrix m rows n row for decoding is represented,Represent the square obtained through step 5 image procossing
The element of battle array u rows v row, HpThe wavelet transform matrix arranged for p rows p,Represent HpThe element of line n v row,Represent HpThe
The element of m rows u row.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710372064.8A CN107203798B (en) | 2017-05-24 | 2017-05-24 | A kind of generation and recognition methods limiting access type figure ground two dimensional code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710372064.8A CN107203798B (en) | 2017-05-24 | 2017-05-24 | A kind of generation and recognition methods limiting access type figure ground two dimensional code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107203798A true CN107203798A (en) | 2017-09-26 |
| CN107203798B CN107203798B (en) | 2019-10-01 |
Family
ID=59906118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710372064.8A Active CN107203798B (en) | 2017-05-24 | 2017-05-24 | A kind of generation and recognition methods limiting access type figure ground two dimensional code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107203798B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109241807A (en) * | 2018-08-17 | 2019-01-18 | 湖南大学 | A kind of remote two dimensional code localization method |
| CN113110778A (en) * | 2021-04-20 | 2021-07-13 | 树根互联股份有限公司 | Graphical interface display method, terminal, readable storage medium and electronic equipment |
| CN116776909A (en) * | 2023-08-28 | 2023-09-19 | 四川星点网络技术有限公司 | Bottle lid two-dimensional code system of tracing to source |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103226723A (en) * | 2013-04-26 | 2013-07-31 | 福建鸿博印刷股份有限公司 | Combined two-dimensional code anti-counterfeiting method capable of preventing copy |
| WO2013155603A1 (en) * | 2012-04-20 | 2013-10-24 | A Thinking Ape Technologies | Systems and methods for displaying animations on a mobile device |
| CN103646265A (en) * | 2013-11-26 | 2014-03-19 | 鸿博股份有限公司 | Two-dimensional code anti-counterfeiting method based on near infrared spectrum analysis |
| US20140164580A1 (en) * | 2012-12-09 | 2014-06-12 | Lab Tech LLC | Systems and methods for configuring a managed device using an image |
| CN103886545A (en) * | 2014-04-17 | 2014-06-25 | 上海理工大学 | Transformation domain printing-scanning resistant digital watermarking method based on computer-generated holography |
| CN104268498A (en) * | 2014-09-29 | 2015-01-07 | 杭州华为数字技术有限公司 | Two-dimension code recognition method and terminal |
-
2017
- 2017-05-24 CN CN201710372064.8A patent/CN107203798B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013155603A1 (en) * | 2012-04-20 | 2013-10-24 | A Thinking Ape Technologies | Systems and methods for displaying animations on a mobile device |
| US20140164580A1 (en) * | 2012-12-09 | 2014-06-12 | Lab Tech LLC | Systems and methods for configuring a managed device using an image |
| CN103226723A (en) * | 2013-04-26 | 2013-07-31 | 福建鸿博印刷股份有限公司 | Combined two-dimensional code anti-counterfeiting method capable of preventing copy |
| CN103646265A (en) * | 2013-11-26 | 2014-03-19 | 鸿博股份有限公司 | Two-dimensional code anti-counterfeiting method based on near infrared spectrum analysis |
| CN103886545A (en) * | 2014-04-17 | 2014-06-25 | 上海理工大学 | Transformation domain printing-scanning resistant digital watermarking method based on computer-generated holography |
| CN104268498A (en) * | 2014-09-29 | 2015-01-07 | 杭州华为数字技术有限公司 | Two-dimension code recognition method and terminal |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109241807A (en) * | 2018-08-17 | 2019-01-18 | 湖南大学 | A kind of remote two dimensional code localization method |
| CN109241807B (en) * | 2018-08-17 | 2021-04-20 | 湖南大学 | Remote two-dimensional code positioning method |
| CN113110778A (en) * | 2021-04-20 | 2021-07-13 | 树根互联股份有限公司 | Graphical interface display method, terminal, readable storage medium and electronic equipment |
| CN116776909A (en) * | 2023-08-28 | 2023-09-19 | 四川星点网络技术有限公司 | Bottle lid two-dimensional code system of tracing to source |
| CN116776909B (en) * | 2023-08-28 | 2023-11-03 | 四川星点网络技术有限公司 | Bottle lid two-dimensional code system of tracing to source |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107203798B (en) | 2019-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pandya et al. | A Survey on QR Codes: in context of Research and Application | |
| Ansari et al. | Multipurpose image watermarking in the domain of DWT based on SVD and ABC | |
| CN104616244B (en) | Image watermark insertion and extracting method based on BP neutral net compression domains | |
| CN103646264B (en) | A kind of dimension code anti-counterfeit method of multiple information encryption | |
| Ahmad et al. | Data hiding based on improved exploiting modification direction method and Huffman coding | |
| Rani et al. | Data security through qr code encryption and steganography | |
| CN107203798A (en) | A kind of generation and recognition methods for limiting access type figure ground Quick Response Code | |
| CN104766111B (en) | Combined anti-fake mark and generation method based on the same ID and device | |
| Kim et al. | Self-embedding fragile watermarking scheme to detect image tampering using AMBTC and OPAP approaches | |
| CN109816077A (en) | A kind of hidden method of two-dimensional barcode information, device, electronic equipment and storage medium | |
| CN104217387B (en) | A kind of image watermark based on qualified insertion is embedded, the method and apparatus of extraction | |
| Wu et al. | SVD-based self-embedding image authentication scheme using quick response code features | |
| CN102968654A (en) | Method and system for producing information recognizable by naked eyes in plane of two-dimensional (2D) code and 2D code | |
| Jude Hemanth et al. | A modified genetic algorithm for performance improvement of transform based image steganography systems | |
| CN107944527A (en) | A kind of encryption of anti-fake two-dimension code and coding/decoding method | |
| CN106156738A (en) | A kind of read method of the automotive license plate ciphertext graph picture of band encryption QR Quick Response Code | |
| CN104835106B (en) | A kind of full frequency-domain subband data waterprint embedded method based on wavelet decomposition | |
| CN110363269A (en) | More image encryption methods based on vector quantization and interference | |
| CN110097159B (en) | QR code security authentication method and system based on Hamming code | |
| CN101877117A (en) | Digital image copyright protection method based on lifting wavelet and singular value decomposition | |
| CN110097488A (en) | The generation of stealthy digital watermarking and extracting method and device | |
| Noore et al. | Embedding biometric identifiers in 2D barcodes for improved security | |
| CN110689360A (en) | Agricultural product two-dimensional code anti-counterfeiting inspection method based on watermark library | |
| CN101817268A (en) | Application of digital watermarking in RFID technology | |
| Li et al. | A recoverable chaos‐based fragile watermarking with high PSNR preservation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |