CN111127290B - Image authentication method based on AMBTC - Google Patents

Image authentication method based on AMBTC Download PDF

Info

Publication number
CN111127290B
CN111127290B CN201911316925.6A CN201911316925A CN111127290B CN 111127290 B CN111127290 B CN 111127290B CN 201911316925 A CN201911316925 A CN 201911316925A CN 111127290 B CN111127290 B CN 111127290B
Authority
CN
China
Prior art keywords
image
watermark
ambtc
verification
authenticated
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.)
Active
Application number
CN201911316925.6A
Other languages
Chinese (zh)
Other versions
CN111127290A (en
Inventor
蔡碧丽
苏国栋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujian Normal University
Original Assignee
Fujian Normal University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujian Normal University filed Critical Fujian Normal University
Priority to CN201911316925.6A priority Critical patent/CN111127290B/en
Publication of CN111127290A publication Critical patent/CN111127290A/en
Application granted granted Critical
Publication of CN111127290B publication Critical patent/CN111127290B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
    • G06T1/0057—Compression invariant watermarking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0065—Extraction of an embedded watermark; Reliable detection

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

The invention provides an image authentication method based on AMBTC, which comprises the steps of obtaining an image to be authenticated and extracting a corresponding first verification watermark; and performing image authentication on the image to be authenticated according to the first authentication watermark and a preset rule, so that the authentication precision is improved, and the image to be authenticated can resist collage attack.

Description

Image authentication method based on AMBTC
Technical Field
The invention relates to the technical field of image processing, in particular to an image authentication method based on AMBTC.
Background
In 2018, Detection Improved pointer Detection Scheme for Absolute movement Block restriction (an effective AMBTC compressed image authentication Scheme) was proposed in symmetry journal by Hongweine et al, which includes two strategies: LSBR and MSBP. In the LSBR policy, an image is first compressed using a conventional AMBTC technique to obtain an AMBTC compression code. Here, assume that a certain set of compression codes is (h, l, B). Wherein h and l are 8-bit high quantization value and low quantization value, respectively, and B is the bitmap corresponding to the image block. In the LSBR scheme, the low a bits of h and the low b bits of l are freed and used to carry the (a + b) -bit authentication watermark ac. The calculation of the verification watermark ac is shown in the following disclosure:
ac＝fa+b(hM,lM,B),
wherein f isa+b(. cndot.) is a hash operation and the output is (a + b) bits in length. h isMAnother (8-a) bit, l, which is denoted hMThe other (8-b) bit of the finger l. And finally, replacing the low a bit of h by the first a bit of the generated (a + b) bit verification watermark and replacing the low b bit of l by the other b bits to realize the embedding of the verification watermark.
Meanwhile, in order to further improve the quality of the watermark image, MSB transform techniques are proposed to find a set of verification watermarks that minimize image block distortion. By sacrificing a certain computing power, a higher quality watermark image quality is achieved. The method comprises the following steps:
Figure BDA0002326081820000011
the main strategy of MSBP is to: on the basis of LSBR, h is allowedMAnd lMWith a certain variation range (+ -1), then through operation, find one group from 9 groups of combinations to enable local areaThe block variance is minimized so that each local distortion becomes small, and the quality of the watermark image is improved as a whole.
However, the method still has the following disadvantages:
and the defect 1 is that the quality and the verification precision of the watermark image can be further improved. Generally, embedding more authentication watermarks can achieve better authentication accuracy, but at the same time can drastically degrade the quality of the watermark image. Therefore, there is a trade-off between watermark image quality and embedded watermark length. The method is the best scheme for balancing and realizing the compatibility relationship of the two, namely realizing the verification watermark embedding of up to 8 bits and simultaneously realizing the quality of most watermark images close to 30 dB. But there is still a partial image watermark quality below 30 dB. On the other hand, it is also desirable to further improve the watermark quality.
And (2) disadvantage: it is not possible to withstand a tiling attack (a tiling attack: an attack in which a certain part is copied from a certain watermarked image and pasted to another watermarked image). In this method, for each image block, a hash result (verification watermark) is calculated (partially) by its own compression code, and then self-embedding is performed in the LSB replacement manner. Therefore, this method cannot withstand a collage attack.
Disclosure of Invention
Technical problem to be solved
In order to solve the above problems of the prior art, the present invention provides an AMBTC-based image authentication method with high verification accuracy and capable of withstanding a collage attack.
(II) technical scheme
In order to achieve the purpose, the invention adopts the main technical scheme that:
an AMBTC-based image authentication method, comprising the steps of:
s1, acquiring an image to be authenticated, and extracting a corresponding first verification watermark;
and S2, performing image authentication on the image to be authenticated according to the first verification watermark and a preset rule.
(III) advantageous effects
The invention has the beneficial effects that: acquiring an image to be authenticated and extracting a corresponding first verification watermark; and performing image authentication on the image to be authenticated according to the first authentication watermark and a preset rule, so that the authentication precision is improved, and the collage attack can be resisted.
Drawings
FIG. 1 is a flowchart of an AMBTC-based image authentication method according to an embodiment of the present invention;
FIG. 2 is a diagram of a reference table RT according to an embodiment of the present invention;
FIG. 3 is a partial schematic diagram of a solution for misjudgment according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of an adaptively weighted reconstructed image according to an embodiment of the present invention;
fig. 5 is a diagram illustrating an image verification result according to an embodiment of the present invention.
Detailed Description
For the purpose of better explaining the present invention and to facilitate understanding, the present invention will be described in detail by way of specific embodiments with reference to the accompanying drawings.
Example one
Referring to fig. 1, an image authentication method based on AMBTC includes the steps of:
step S1 is preceded by:
and S0, generating a watermark image containing the second verification watermark according to the original image through AMBTC compression.
Step S0 specifically includes:
s01, obtaining corresponding AMBTC compression codes after the novel variant AMBTC compression processing is carried out according to the original image;
step S01 specifically includes:
s011, forming a one-dimensional pixel sequence by each 4 x 4 image block in the original image according to a raster scanning mode, and expressing the one-dimensional pixel sequence as Ib＝{b1,b2,…,b16}；
S012, centroid initialization, from IbAnd deriving U, wherein,
Figure BDA0002326081820000041
and make IbWherein each pixel value is contained in U, and every two elements in U are different, if the number | U | of the elements of U is ≧ 2, two elements are selected from the U to construct an initial centroid set C ═ C1,c2And step S013 is executed; if | U | ═ 1, c1＝c2If yes, go to step S016;
s013, grouping calculation, according to Euclidean theorem, dividing IbAll elements in the group S1And S2The basis of grouping is
Figure BDA0002326081820000042
S014, iteration of the centroids, calculating the centroids of each group
Figure BDA0002326081820000043
|SrI represents SrThe number of middle elements;
s015, according to the formula
Figure BDA0002326081820000044
Determining whether iteration is terminated, epsilon is a constant less than 0, and if not, c1＝c′1,c2＝c′2Step S013 is executed; otherwise, executing step S016;
s016, deriving an AMBTC compression code:
hk＝max(c1,c2),
lk＝min(c1,c2),
Figure BDA0002326081820000045
repeating the above steps for each image block to obtain the AMBTC compression code of the whole original image
Figure BDA0002326081820000046
Wherein h iskRepresenting a high order quantization level value,/kRepresenting the value of the low-order quantization level,
Figure BDA0002326081820000047
a bitmap representing the corresponding image block.
S02, obtaining a new compression code through N-variant AMBTC compression processing according to the AMBTC compression code, and generating a corresponding second verification watermark through a hash function according to the new compression code and the position information;
step S02 specifically includes:
s021, generating a first reference table RT of 4 x 4;
s022, compressing the AMBTC code according to a first parameter N
Figure BDA0002326081820000048
B of (A)kThe first N bit positions are vacated to obtain new compression codes
Figure BDA0002326081820000049
And based on the new compression code
Figure BDA00023260818200000410
And generating a corresponding N-bit second verification watermark through a hash function according to the position information, wherein B'kRepresenting the bitmap after the compression process.
And S03, generating a watermark image according to the new compression code and the second verification watermark.
Step S03 specifically includes:
and generating a watermark image by a bit replacement mode according to the new compression code and the first verification watermark.
S1, acquiring an image to be authenticated, and extracting a corresponding first verification watermark;
step S1 further includes:
and calculating to obtain a third verification watermark from the image to be authenticated according to the second parameter N and the second reference table RT.
And S2, performing image authentication on the image to be authenticated according to the first verification watermark and a preset rule.
Step S2 specifically includes:
and performing image authentication on the image to be authenticated according to the first verification watermark, the third verification watermark and a preset rule.
The image recognition of the image to be authenticated according to the first verification watermark, the third verification watermark and a preset rule specifically comprises the following steps:
and judging whether the first verification watermark and the third verification watermark are identical, if so, judging that the image to be authenticated is not tampered, otherwise, judging that the image to be authenticated is tampered.
Example two
The difference between this embodiment and the first embodiment is that this embodiment will further describe, in combination with a specific application scenario, how the above-described image authentication method based on AMBTC of the present invention is implemented:
the invention mainly comprises 3 aspects: generating a watermark, embedding the watermark and verifying and reconstructing an image;
1. generation of watermarks
Corresponding AMBTC compression code after the original image I is processed by the novel variant AMBTC compression
Figure BDA0002326081820000051
Obtaining a new compression code after N-variant AMBTC compression processing according to the AMBTC compression code, and generating a corresponding second verification watermark through a hash function according to the new compression code and the position information; specifically, it is associated with (h) for each tilek,lk,B′k) Feeding the current block position information k to a hash function to obtain a second verification watermark ackOf length N, and ack＝fN(hk,lk,B′k,k).
2. Embedding of watermarks
(1) Novel variant AMBTC compression process
For each 4 x 4 image block, 16 pixels of the image block are formed into a one-dimensional pixel sequence in a raster scanning mode and are represented as Ib＝{b1,b2,…,b16}. Next, the new AMBTC compression process may be described as follows:
1) centroid initializationFrom IbIn the step (2), U is derived, wherein,
Figure BDA0002326081820000061
and make IbEach pixel value in the U is contained in U, and every two elements in the U are different, if the number of the elements in the U is different|U|≥2Then two elements are selected from them to construct an initial centroid set C ═ C1,c2And jumping to the step 2); if | U | ═ 1, c1＝c2And jumping to the step 5);
2) grouping calculation, according to Euclidean theorem, dividing IbAll elements in the group S1And S2The basis of grouping is
Figure BDA0002326081820000062
Wherein d (b)v,cr)＝(bv-cr)2.，1≤v≤16,1≤r≤2。
3) Iteration of the centroids, calculating the centroids of each group
Figure BDA0002326081820000063
|SrI represents SrThe number of middle elements;
4) judging whether the termination is performed according to a formula
Figure BDA0002326081820000064
Determining whether iteration is terminated, epsilon is a constant less than 0, and if not, c1＝c′1,c2＝c′2Jumping to the step 2); otherwise, executing step 5):
5) deriving an AMBTC compression code:
hk＝max(c1,c2),
lk＝min(c1,c2),
Figure BDA0002326081820000065
repeating the above steps for each image block to obtain the whole original imageAMBTC compression code
Figure BDA0002326081820000066
Wherein h iskRepresenting a high order quantization level value,/kRepresenting the value of the low-order quantization level,
Figure BDA0002326081820000067
a bitmap representing the corresponding image block.
(2) N variant AMBTC compression process
When obtaining
Figure BDA0002326081820000071
By implementing N variant AMBTC techniques, from BkAnd (3) vacating a space of N bits for hiding the second verification watermark, which comprises the following specific steps:
1) generating a 4 x 4 first reference table RT as shown in FIG. 2(a), wherein (a) Bk(ii) a (b) Reference table RT; (c) b'k(N＝2)；(d)B′k(N＝8)；
2) Compressing the AMBTC according to a first parameter N
Figure BDA0002326081820000072
B of (A)kThe first N bit positions are vacated;
wherein, the determination rule of the first N bit positions is as follows: the size of the numbers in the hexagonal box in fig. 2(b) is confirmed from small to large according to RT. FIG. 2(c) is a B 'where N is 2'k(ii) a FIG. 2(d) is a B 'where N is 8'kAnd 'NA' indicates the vacated position.
3) The above process is applied to each block compression code to obtain a new compression code
Figure BDA0002326081820000073
And generating a corresponding N-bit second verification watermark by a hash function according to the new compression code and the position information, wherein B'kRepresenting the compressed bitmap.
(3) When new compression codes are obtained
Figure BDA0002326081820000074
And after the corresponding N-bit second verification watermark, sequentially replacing B 'in the N-bit verification watermark by a bit replacement mode'kN positions (the sequence is confirmed from small to large according to the size of the numbers in the blue hexagonal frame in the RT) are vacated, so that the second verification watermark is embedded, and a watermark image is obtained
Figure BDA0002326081820000075
3. Image verification and reconstruction process
1) Image verification
The first stage is as follows:
suppose the receiving end receives the AMBTC compression code of
Figure BDA0002326081820000076
For each pair
Figure BDA0002326081820000077
The steps of performing image verification are as follows:
1) the corresponding RTs are generated in the same way, (or shared by the sender and receiver).
2) From
Figure BDA00023260818200000710
The first N bit bits are extracted (the extraction sequence of the N bit bits is confirmed from small to large according to the size of the number in the hexagonal box in the RT), and the extracted verification watermarks are connected in series and are marked as first verification watermarks Eack。
3) According to said second parameter N and a second reference table RT, will
Figure BDA0002326081820000078
Compressed into a compressed form
Figure BDA0002326081820000079
And according to the method for generating the watermark, calculating a third verification watermark, namely Rac, from the image to be authenticatedk。
Specifically, the second verification watermark and the third verification watermark have the same generation process, and the difference is that if the watermark image is tampered, the second verification watermark and the third verification watermark are not the same, otherwise, the third verification watermark obtained by calculation is the same as the second verification watermark obtained in the watermark generation process, and the difference between (the second parameter N and the second reference table RT) and (the first parameter N and the first reference table RT) is that the owner is not the same, but accurate verification can be realized only when the values of the second verification watermark and the third verification watermark are the same, that is, N and RT are shared by both the sender and the receiver;
4) if the image has not been tampered with EackShould be consistent with RackAnd (4) equivalence. Thus by comparison Eack(first watermark) and Rack(third watermark), if equal, the block is considered as not tampered; otherwise, the block is considered tampered.
After the above process is performed on each block, a tamper detection result of the entire image can be obtained, which is denoted as TM.
And a second stage:
to address the false positive condition that occurs in the first phase, a second phase tamper verification is performed on the TM. The basic principle is as follows: centered on a block, within 3 x 3 of its surrounding small area. The area is divided into 4 parts, which become left, top, right, bottom, corresponding to the gray black areas of fig. 3(a) - (d). Each portion is a 2 x 3 or 3 x 2 rectangular area. Black indicates a tampered block identified in the first stage, and grey indicates a non-tampered block identified in the first stage. ' indicates the block that currently needs to be authenticated. If a block exceeding 4/6 in a certain area is identified as a tampered block in the above 4 parts (left, upper, right, lower) of the current block, the block is further determined as a tampered block, as shown in fig. 3(e) - (f).
And (4) implementing the two-stage image verification process to obtain a final verification result TM.
(2) Image reconstruction
If a compressed image is reconstructed as required, the compressed image can be reconstructed according to the following steps:
for a pixel to be reconstructed, the reconstructed pixel in the range of 3 x 3 is used (according to the compression code)Reconstructable partial pixels) as a reference, and self pixels are reconstructed by using a self-adaptive weight strategy. For convenience, assume that the pixel to be reconstructed is b'xAnd reconstructed pixels within 3 ═ 3 of the pixel are X ═ b'1,b’2,…,b’N}. Then is current of'xThe pixel values of (a) can be estimated as:
Figure BDA0002326081820000091
wherein,
Figure BDA0002326081820000092
Figure BDA0002326081820000094
to be allocated to xtThe variance of (c).
A related example is given in fig. 4.
For the disadvantage 1, the image area has local similarity in fact, so a strategy of further compressing bitmap bit to make space for hiding the verification watermark is proposed. Thus, N-bit authentication capability can be achieved, N-0-10. Firstly, compared with the method of Wein flood, the method improves the verification precision by 2 bits, and provides a novel misjudgment solution method to ensure a high-precision and accurate image verification result. Meanwhile, in order to ensure the quality of a reconstructed image, two methods are proposed for optimization: the first is to propose a novel AMBTC compression strategy; secondly, a self-adaptive weight strategy is proposed to pre-estimate the pixel to be measured; thereby ensuring image quality. Table 1 shows the comparison of the experimental results of image quality between the present invention and the method of huowen et al.
Table 1 image quality comparison of the present invention with the method of huowen et al (N ═ 2,4,6,8,10)
Figure BDA0002326081820000093
'-' indicates that the method is not provided or is unconditionally implemented.
For the disadvantage 2, the collage attack cannot be resisted. In the method of hong venn et al, for each image block, a hash result (verification watermark) is calculated (partially) by its own compression code, and then self-embedding is performed in the LSB replacement manner. Therefore, this method cannot withstand a collage attack. The invention further feeds the position information of the block into the hash function to ensure that the block can resist the collage attack. Meanwhile, in the verification stage, a novel misjudgment solution is provided, and the image verification effect is further improved.
Wherein: fig. 5(a) shows a tampered compressed image, which has been tampered with 5 regions (5 types of attacks), and the specific tampered region is shown in fig. 5 (a).
Tampering with the value of the quantization level of the region;
b: tampering with the original bits of the bitmap of the region;
c: tampering with the verification watermark bits of the bitmap of the region;
d: splicing and attacking;
e: copy-and-paste attacks (one flower);
the black part indicates: the tampered area is detected as a tampered area, and the white portion represents an untampered area or is detected as an untampered area.
Fig. 5 shows the image verification result (N ═ 10) (a) a tampered LeNa image;
the verification result of the invention is (b) a first stage (TDR is 99.87%); (f) a first stage (TDR ═ 99.97%); (d) blocks that are not correctly detected; (e) an original tampered area;
the verification result of the Hongwen method is (f) a first stage (TDR is 87.35%); (g) a first stage (TDR 87.61%); (h) blocks that are not correctly detected.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.

Claims (6)

1. An AMBTC-based image authentication method is characterized by comprising the following steps:
s1, acquiring an image to be authenticated, and extracting a corresponding first verification watermark;
s2, performing image authentication on the image to be authenticated according to the first verification watermark and a preset rule;
step S1 is preceded by:
s0, generating a watermark image containing a second verification watermark through AMBTC compression according to the original image;
step S0 specifically includes:
s01, obtaining corresponding AMBTC compression codes after new variant AMBTC compression processing according to the original image;
s02, obtaining a new compression code through N-variant AMBTC compression processing according to the AMBTC compression code, and generating a corresponding second verification watermark through a hash function according to the new compression code and the position information;
s03, generating a watermark image according to the new compression code and the second verification watermark;
step S01 specifically includes:
s011, forming a one-dimensional pixel sequence by each 4 x 4 image block in the original image according to a raster scanning mode, and expressing the one-dimensional pixel sequence as Ib＝{b1,b2,…,b16}；
S012, centroid initialization, from IbAnd deriving U, wherein,
Figure FDA0003557657320000011
and make IbWherein each pixel value is contained in U, and every two elements in U are different, if the number | U | of the elements of U is ≧ 2, two elements are selected from the U to construct an initial centroid set C ═ C1,c2And step S013 is executed; if | U | ═ 1, c1＝c2Then, go to step S016;
s013, grouping calculation, according to Euclidean theorem, dividing IbAll elements in the group S1And S2The basis of grouping is
Figure FDA0003557657320000012
Wherein d (b)v,cr)＝(bv-cr)2，1≤v≤16,1≤r≤2；
S014, iteration of the centroids, calculating the centroids of each group
Figure FDA0003557657320000013
bv∈Sr，|SrI represents SrThe number of middle elements;
s015, according to the formula | c1-c′2|≤ε&|c2-c′2Determining whether iteration is terminated or not, wherein epsilon is a constant larger than 0, if not, c1＝c′1,c2＝c′2Step S013 is executed; otherwise, executing step S016;
s016, deriving an AMBTC compression code:
hk＝max(c1,c2),
lk＝min(c1,c2),
Figure FDA0003557657320000021
repeating the above steps for each image block to obtain the AMBTC compression code of the whole original image
Figure FDA0003557657320000022
Wherein h iskRepresenting a high order quantization level value,/kRepresenting the value of the low-order quantization level,
Figure FDA0003557657320000023
a bitmap representing the corresponding image blocks.
2. The AMBTC-based image authentication method according to claim 1, wherein step S02 is specifically:
s021, generating a first reference table RT of 4 x 4;
s022, based on the first parameter N,compressing the AMBTC
Figure FDA0003557657320000024
B of (A)kThe first N bit positions are vacated to obtain new compression codes
Figure FDA0003557657320000025
And based on the new compression code
Figure FDA0003557657320000026
Generating a corresponding N-bit second verification watermark by a hash function according to the position information, wherein Bk' denotes a bitmap after compression processing.
3. The AMBTC-based image authentication method according to claim 1, wherein step S03 specifically includes:
and generating a watermark image by a bit replacement mode according to the new compression code and the second verification watermark.
4. The AMBTC-based image authentication method according to claim 1, wherein step S1 further includes:
and calculating to obtain a third verification watermark from the image to be authenticated according to the second parameter N and the second reference table RT.
5. The AMBTC-based image authentication method according to claim 4, wherein the step S2 is specifically as follows:
and performing image authentication on the image to be authenticated according to the first verification watermark, the third verification watermark and a preset rule.
6. The AMBTC-based image authentication method according to claim 5, wherein the image recognition of the image to be authenticated according to the first verification watermark, the third verification watermark and a preset rule is specifically:
and judging whether the first verification watermark and the third verification watermark are identical, if so, judging that the image to be authenticated is not tampered, otherwise, judging that the image to be authenticated is tampered.
CN201911316925.6A 2019-12-19 2019-12-19 Image authentication method based on AMBTC Active CN111127290B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911316925.6A CN111127290B (en) 2019-12-19 2019-12-19 Image authentication method based on AMBTC

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911316925.6A CN111127290B (en) 2019-12-19 2019-12-19 Image authentication method based on AMBTC

Publications (2)

Publication Number Publication Date
CN111127290A CN111127290A (en) 2020-05-08
CN111127290B true CN111127290B (en) 2022-05-03

Family

ID=70500796

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911316925.6A Active CN111127290B (en) 2019-12-19 2019-12-19 Image authentication method based on AMBTC

Country Status (1)

Country Link
CN (1) CN111127290B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103426141A (en) * 2013-08-09 2013-12-04 深圳大学 Method and system for authenticating image contents
CN105812816A (en) * 2016-03-17 2016-07-27 安徽大学 Compression encryption authentication joint coding method
CN108111855A (en) * 2017-12-21 2018-06-01 北京工业大学 A kind of adaptive code flat blocks based on quaternary tree block coding method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120014447A1 (en) * 2010-07-16 2012-01-19 Sharp Laboratories Of America, Inc. System for low resolution power reduction with high resolution deblocking

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103426141A (en) * 2013-08-09 2013-12-04 深圳大学 Method and system for authenticating image contents
CN105812816A (en) * 2016-03-17 2016-07-27 安徽大学 Compression encryption authentication joint coding method
CN108111855A (en) * 2017-12-21 2018-06-01 北京工业大学 A kind of adaptive code flat blocks based on quaternary tree block coding method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"TSIA_ A Novel Image Authentication Scheme fir AMBTC-Based Compressed Images Using Turtle Shell Based Reference Matrix";Chih-Cheng Chen, Chin-Chen Chang, Chia-Chen Lin, Guo-Dong Su;《IEEE Access》;20191025;全文 *

Also Published As

Publication number Publication date
CN111127290A (en) 2020-05-08

Similar Documents

Publication Publication Date Title
US8200021B2 (en) Image signature matching device
CN105741224B (en) The reversible water mark algorithm divided based on PVO and adaptive block
US8009862B2 (en) Embedding data in images
CN110766708B (en) Image comparison method based on contour similarity
CN108416724B (en) Reversible information hiding method based on multiple predictors
Huo et al. Alterable-capacity fragile watermarking scheme with restoration capability
US11915336B2 (en) Method and device for watermark-based image integrity verification
CN113642577A (en) Low-contrast license plate recognition method, system, equipment and storage medium
CN105828081A (en) Encoding method and encoding device
CN111612683A (en) Data processing method and system
CN111768328A (en) Text image watermark embedding method and system and text image watermark extracting method and system
US8243981B2 (en) Identifying embedded data in an image
CN108491913B (en) Method for authenticating QR (quick response) code with secret beautification function
CN111127290B (en) Image authentication method based on AMBTC
US20170109857A1 (en) Method for generating a data-bearing halftone image, and method for decoding the data-bearing halftone image
CN110417551B (en) Character and picture generation type camouflage and recovery method combined with error diffusion
CN110148079B (en) Digital image tampering detection positioning and self-recovery method
JP2015198385A (en) Image processing apparatus, image processing method and program
US8031905B2 (en) Extracting data from images
CN113628091B (en) Safety information extraction method and device for electronic display screen content reproduction scene
CN115661382A (en) Filtering method based on morphological template angle protection in three-dimensional landform reconstruction
CN109194846A (en) A kind of EMD (n, m, δ) adapting to image steganographic method based on complexity
Chalamala et al. Local binary patterns for digital image watermarking
CN113160028B (en) Information hiding and recovering method and equipment based on colorful character picture and storage medium
US20090129670A1 (en) Identifying Steganographic Data in an Image

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