CN109829842A - A kind of addition image blind watermarking method based on frequency domain - Google Patents
A kind of addition image blind watermarking method based on frequency domain Download PDFInfo
- Publication number
- CN109829842A CN109829842A CN201811563428.1A CN201811563428A CN109829842A CN 109829842 A CN109829842 A CN 109829842A CN 201811563428 A CN201811563428 A CN 201811563428A CN 109829842 A CN109829842 A CN 109829842A
- Authority
- CN
- China
- Prior art keywords
- image
- watermark
- frequency domain
- code
- dimensional
- 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
Abstract
The addition image blind watermarking method based on frequency domain that the invention discloses a kind of, the following steps are included: watermark information is generated as QR code watermark figure according to the version number of QR code and the error-correction level of QR code by 1., 2. the size equal part that QR code watermark figure is pressed in input, and the gradient of each section is calculated using Image differentiation, 3. the highest multiple regions image of average gradient carries out the conversion in airspace to frequency domain in pair step 2,4. pair watermarking images are encoded and are superimposed with frequency domain obtained in step 3,5. inverse transformations for carrying out airspace to frequency domain obtain the output after addition watermark.Watermark extracting is the inverse process of watermark superposition.The present invention is using superposition digital blind watermark, under the premise of guaranteeing that original image is basically unchanged, is superimposed QR code watermark conversion process by design part frequency domain, effectively remains image major part raw information, avoid the information loss as caused by the superposition of full figure frequency domain.
Description
Technical field
The present invention relates to technical field of image processing more particularly to a kind of addition image blind watermarking methods based on frequency domain.
Background technique
Digital watermark technology is to be directly embedded into some identification informations, i.e. digital watermarking in digital carrier or indirect table
Show, and do not influence the use value of original vector, while being not easy to be ascertained and modify again.But it can be identified and be distinguished by producer
Recognize.Hide information in the carrier by these, can achieve confirmation content creator, buyer, transmission secret information or
The purpose of whether carrier is tampered judged.
Digital watermarking be protection information security, realize it is anti-fake trace to the source, the effective way of copyright protection, be Information Hiding Techniques
The important branch and research direction of research field.For example, the intellectual property protection of copyright, including digital music, three-dimensional are dynamic
Picture, video, scan image；Bill anti-counterfeit in business transaction, the development of the image input-output equipment of high quality make to forge more
It is easy to add；The true and false of certificate identifies, including identity card, passport, driver's license, academic certificate, credentials；Audio-visual-data is hidden
Identify and distort prompt；Covert communications and its confrontation.
Digital watermark technology has the special feature that: 1, safety, the information of digital watermarking should be safe, it is difficult to distort or
It forges, there is lower false detection rate, when raw content changes, digital watermarking should change, and to repetition added with very
Strong repellence；
2, concealment, digital watermarking can not consciousness, do not influence the normal use of protected data；
3, robustness, refer to undergo it is a variety of be not intended to or intentional signal processing after, digital watermarking remains to holding part
Integrality simultaneously can accurately be identified；
4, sensibility, after distribution, transmission, use process, digital watermarking can accurately judge whether data are usurped
Change.
To add digital blind watermark by frequency domain means, realizing image copyright in the case where not destroying original artwork
Protection and tracking.It is proposed a kind of addition image blind watermarking method based on frequency domain.
Summary of the invention
In view of above-mentioned technical background, it is an object of the invention to: in the case where not destroying original artwork, pass through frequency domain hand
Duan Tianjia digital blind watermark realizes the protection and tracking of image copyright.
In order to solve the above technical problems, the present invention provides a kind of addition image blind watermarking method based on frequency domain, including
Following steps:
Step 1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；
Step 2: the original image of input is pressed the size equal part of QR code watermark figure, and is calculated respectively using Image differentiation
Partial average gradient；
Step 3: the conversion in airspace to frequency domain is carried out to the highest multiple regions image of average gradient in step 2；
Step 4: watermarking images are encoded and are superimposed with frequency domain obtained in step 3；
Step 5: the inverse transformation for carrying out airspace to frequency domain obtains the output after addition watermark, the image exported；
Wherein, the average gradient includes the X of two-dimensional digital image, the differential in Y-direction, partial differential, amplitude, angle.
Preferably, the conversion regime of the airspace to frequency domain is constructed by two-dimensional fast fourier transform.
Preferably, the QR code watermark figure includes author's watermark, performing artist's watermark, record person watermark of recording a video；It calculates
The software full name watermark of machine software copyright, software abbreviation watermark, software version watermark, copyright owner and record date watermark.
Preferably, the region average gradient algorithm the following steps are included:
Step S1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；
Step S2: pressing original image the size equal part of QR code watermark figure, and the gradient of each section is calculated using Image differentiation；
First differential is realized respectively using X-direction and Y-direction, finds out amplitude, realizes image gradient effect.One-dimensional differential formulas: Δ f
=f (x+1)-f (x) needs to complete the differential in XY both direction for two-dimensional digital picture, and the vector of gradient can indicate
Are as follows:
The amplitude of the vector are as follows:
The deflection of the vector are as follows:
Then partial differential is asked to XY both direction respectively, obtains gradient；
It is that region template carries out convolutional calculation using Sobel operator, the Sobel warp factor includes two group of 3 × 3 square
Battle array, it is respectively horizontal and vertical, Sobel operator and original image are done into convolution, obtain horizontal and vertical brightness difference approximation,
Formula is as follows:
Wherein, A represents original image, and Gx and Gy represent the gray value of image of horizontal and vertical edge detection, specific to calculate
It is as follows:
Gx=(- 1) * f (x-1, y-1)+0*f (x, y-1)+1*f (x+1, y-1)+(- 2) * f (x-1, y)+0*f (x, y)+2*
F (x+1, y)+(- 1) * f (x-1, y+1)+0*f (x, y+1)+1*f (x+1, y+1)=[f (x+1, y-1)+2*f (x+1, y)+f (x+
1,y+1)]-[f(x-1,y-1)+2*f(x-1,y)+f(x-1,y+1)]
Gy=1*f (x-1, y-1)+2*f (x, y-1)+1*f (x+1, y-1)+0*f (x-1, y) 0*f (x, y)+0*f (x+1,
Y)+(- 1) * f (x-1, y+1)+(- 2) * f (x, y+1)+(- 1) * f (x+1, y+1)=[f (x-1, y-1)+2f (x, y-1)+f (x+
1,y-1)]-[f(x-1,y+1)+2*f(x,y+1)+f(x+1,y+1)]
Wherein, f (a, b) represents the gray value of (a, b) point.
Step S3: airspace is carried out to the highest area image of average gradient in step 2 using two dimensional discrete Fourier transform
To the conversion of frequency domain；
Two-dimentional fast Fourier FFT is obtained by calculating FFT one-dimensional twice, the line number of image, columns is made to be all satisfied 2
N times side, if conditions are not met, first meeting 2 n times to image zero padding before calculating FFT；
The two dimensional image f (x, y) of one M row N column is first in one-dimensional discrete Fu that a length is N by row queue variable y
Leaf transformation, then by calculated result by column to variable x do a length be M Fourier transformation obtain the Fourier transformation of the image
As a result, as shown in formula:
It is exactly following two parts that above formula, which is disassembled, is first obtained F (x, v), then obtains F (u, v) by F (x, v):
Every a line is carried out discrete Fourier transform to the one-dimensional N point sequence of every a line and is obtained F (x, u) by N number of point, then right
F (x, u) is obtained by column to the discrete Fourier transform that each column are done with M point, just obtains the direct computation of DFT of two dimensional image f (x, y)
Leaf transformation F (u, v).
Step S4: watermarking images are encoded and are superimposed with frequency domain obtained in step S3；
Step S5: the inverse transformation for carrying out airspace to frequency domain obtains the image after addition watermark；
The mode of the inverse transformation are as follows: the two dimensional image f (x, y) of M row N column, when doing inverse Fourier transform, first to column
To doing one-dimensional inverse Fourier transform, then one-dimensional inverse Fourier transform is done to row, is shown below:
Preferably, the level of error correction of the QR code is that the mistake of maximum 30% can be corrected.
Preferably, the coding mode in the step S4 is encoded using random sequence.
A kind of addition image blind watermarking method based on frequency domain proposed by the present invention, beneficial effect are: the present invention utilizes
It is superimposed digital blind watermark, under the premise of guaranteeing that original image is basically unchanged, is superimposed at the transformation of QR code watermark by design part frequency domain
Reason, effectively remains image major part raw information, avoids the information loss as caused by the superposition of full figure frequency domain.
Detailed description of the invention
Fig. 1 is the flow diagram of present invention superposition watermark.
The flow diagram of the position Fig. 2 watermark extracting of the invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.
Embodiment 1
A kind of addition image blind watermarking method based on frequency domain, comprising the following steps:
Step 1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；QR
Code watermark figure includes author's watermark, performing artist's watermark, record person watermark of recording a video；The software full name of Copyright in Computer Software
Watermark, software abbreviation watermark, software version watermark, copyright owner and record date watermark；
Step 2: the original image of input is pressed the size equal part of QR code watermark figure, and is calculated respectively using Image differentiation
Partial average gradient；
Step 3: the conversion in airspace to frequency domain is carried out to the highest multiple regions image of average gradient in step 2；Airspace
Conversion regime to frequency domain is constructed by two-dimensional fast fourier transform；
Step 4: watermarking images are encoded and are superimposed with frequency domain obtained in step 3；
Step 5: the inverse transformation for carrying out airspace to frequency domain obtains the output after addition watermark, the image exported；
Wherein, average gradient includes the X of two-dimensional digital image, the differential in Y-direction, partial differential, amplitude, angle.
The algorithm of region average gradient the following steps are included:
Step S1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；QR
The mode of code is divided into Model1 and Model2 both of which, uses Model2 in the present invention.In view of the attack to watermark, to mention
The agility and defense of high digital watermarking, the version for presetting QR code is 1, i.e. 21*21.The level of error correction of QR code is H, i.e., maximum
30% mistake can be corrected.
Step S2: pressing original image the size equal part of QR code watermark figure, and the gradient of each section is calculated using Image differentiation；
First differential is realized respectively using X-direction and Y-direction, finds out amplitude, realizes image gradient effect.One-dimensional differential formulas: Δ f
=f (x+1)-f (x) needs to complete the differential in XY both direction for two-dimensional digital picture, and the vector of gradient can indicate
Are as follows:
The amplitude of vector are as follows:
The deflection of vector are as follows:
Then partial differential is asked to XY both direction respectively, obtains gradient；
For discrete image, the mathematic(al) representation of first differential is equivalent to the difference of two adjacent pixels.Image gradient
Algorithm is the grey scale change for considering some neighborhood of each pixel of image, and it is region mould that Sobel operator is chosen in the present invention
Plate carries out convolutional calculation.Sobel warp factor are as follows:
Sobel warp factor includes two group of 3 × 3 matrix, respectively horizontal and vertical, and Sobel operator is done with original image
Convolution obtains horizontal and vertical brightness difference approximation, and formula is as follows:
Wherein, A represents original image, and Gx and Gy represent the gray value of image of horizontal and vertical edge detection, specific to calculate
It is as follows:
Gx=(- 1) * f (x-1, y-1)+0*f (x, y-1)+1*f (x+1, y-1)+(- 2) * f (x-1, y)+0*f (x, y)+2*
F (x+1, y)+(- 1) * f (x-1, y+1)+0*f (x, y+1)+1*f (x+1, y+1)=[f (x+1, y-1)+2*f (x+1, y)+f (x+
1,y+1)]-[f(x-1,y-1)+2*f(x-1,y)+f(x-1,y+1)]
Gy=1*f (x-1, y-1)+2*f (x, y-1)+1*f (x+1, y-1)+0*f (x-1, y) 0*f (x, y)+0*f (x+1,
Y)+(- 1) * f (x-1, y+1)+(- 2) * f (x, y+1)+(- 1) * f (x+1, y+1)=[f (x-1, y-1)+2f (x, y-1)+f (x+
1,y-1)]-[f(x-1,y+1)+2*f(x,y+1)+f(x+1,y+1)]
Wherein, f (a, b) represents the gray value of (a, b) point.
Step S3: airspace is carried out to the highest area image of average gradient in step 2 using two dimensional discrete Fourier transform
To the conversion of frequency domain.
The basic thought of Computing Two-dimensional Discrete Fourier Transform DFT separability is that DFT is separated into dimension DFT twice.Therefore
Two-dimentional fast Fourier fft algorithm can be obtained with by calculating FFT one-dimensional twice.According to the meter of Fast Fourier Transform (FFT)
It calculates and requires, need the line number of image, columns to be all satisfied 2 n times side, if conditions are not met, first to mend to image before calculating FFT
Zero with the n times of satisfaction 2.The two dimensional image f (x, y) of one M row N column, first doing a length by row queue variable y is the one-dimensional of N
Discrete Fourier transform, then by calculated result by column to variable x do a length be M Fourier transformation can be obtained by the figure
The Fourier transformation of picture is as a result, as shown in formula:
It is exactly following two parts that above formula, which is disassembled, is first obtained F (x, v), then obtains F (u, v) by F (x, v):
Every a line is carried out discrete Fourier transform to the one-dimensional N point sequence of every a line and is obtained F (x, u) by N number of point, then right
F (x, u) is obtained by column to the discrete Fourier transform that each column are done with M point, just obtains the direct computation of DFT of two dimensional image f (x, y)
Leaf transformation F (u, v).
Step S4: encoding watermarking images and be superimposed with frequency domain obtained in step S3, and coding mode uses random sequence
Coding.
Step S5: the inverse transformation for carrying out airspace to frequency domain obtains the image after addition watermark.
The mode of inverse transformation are as follows: the two dimensional image f (x, y) of M row N column, when doing inverse Fourier transform, first to column to doing
One-dimensional inverse Fourier transform, then one-dimensional inverse Fourier transform is done to row, it is shown below:
Embodiment 2
The picture exported to embodiment 1 carries out aggressive experiment, to verify the addition image blind watermarking side based on frequency domain
The robustness of method.
Picture after watermarking is smeared respectively, is sheared, is scaled, is rotated, JPEG compression, PS, screenshotss, brightness tune
After section, form and aspect adjusting, saturation degree adjusting, contrast adjustment, denoising, U.S. figure software processing, watermark can be extracted.
Embodiment 3
For the image of web page, addition image blind watermarking method of the use based on frequency domain is added treated back
Scape picture can also extract watermark after screenshot.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Anyone skilled in the art in the technical scope disclosed by the present invention, according to the technique and scheme of the present invention and its
Inventive concept is subject to equivalent substitution or change, should be covered by the protection scope of the present invention.
Claims (6)
1. a kind of addition image blind watermarking method based on frequency domain, it is characterised in that: the following steps are included:
Step 1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；
Step 2: the original image of input is pressed the size equal part of QR code watermark figure, and calculates each section using Image differentiation
Average gradient；
Step 3: the conversion in airspace to frequency domain is carried out to the highest multiple regions image of average gradient in step 2；
Step 4: watermarking images are encoded and are superimposed with frequency domain obtained in step 3；
Step 5: the inverse transformation for carrying out airspace to frequency domain obtains the output after addition watermark, the image exported；
Wherein, the average gradient includes the X of two-dimensional digital image, the differential in Y-direction, partial differential, amplitude, angle.
2. a kind of addition image blind watermarking method based on frequency domain according to claim 1, it is characterised in that: the airspace
Conversion regime to frequency domain is constructed by two-dimensional fast fourier transform.
3. a kind of addition image blind watermarking method based on frequency domain according to claim 1, it is characterised in that: the QR code
Watermark figure includes author's watermark, performing artist's watermark, record person watermark of recording a video；The software full name water of Copyright in Computer Software
Print, software abbreviation watermark, software version watermark, copyright owner and record date watermark.
4. a kind of addition image blind watermarking method based on frequency domain according to claim 1, it is characterised in that: the region
The algorithm of average gradient the following steps are included:
Step S1: watermark information is generated as by QR code watermark figure according to the error-correction level of the version number of QR code and QR code；
Step S2: pressing original image the size equal part of QR code watermark figure, and the gradient of each section is calculated using Image differentiation；It utilizes
X-direction and Y-direction realize first differential respectively, find out amplitude, one-dimensional differential formulas: Δ f=f (x+1)-f (x), for two
The digital picture of dimension, needs to complete the differential in XY both direction, and the vector of gradient may be expressed as:
The amplitude of the vector are as follows:
The deflection of the vector are as follows:
Then partial differential is asked to XY both direction respectively, obtains gradient；
It is that region template carries out convolutional calculation using Sobel operator, the Sobel warp factor includes two group of 3 × 3 matrix, point
Wei not be horizontal and vertical, Sobel operator and original image are done into convolution, obtain horizontal and vertical brightness difference approximation, formula
It is as follows:
Wherein, A represents original image, and Gx and Gy represent the gray value of image of horizontal and vertical edge detection, and specific calculating is as follows:
Gx=(- 1) * f (x-1, y-1)+0*f (x, y-1)+1*f (x+1, y-1)+(- 2) * f (x-1, y)+0*f (x, y)+2*f (x+
1, y)+(- 1) * f (x-1, y+1)+0*f (x, y+1)+1*f (x+1, y+1)=[f (x+1, y-1)+2*f (x+1, y)+f (x+1, y+
1)]-[f(x-1,y-1)+2*f(x-1,y)+f(x-1,y+1)]
Gy=1*f (x-1, y-1)+2*f (x, y-1)+1*f (x+1, y-1)+0*f (x-1, y) 0*f (x, y)+0*f (x+1, y)+(-
1) * f (x-1, y+1)+(- 2) * f (x, y+1)+(- 1) * f (x+1, y+1)=[f (x-1, y-1)+2f (x, y-1)+f (x+1, y-
1)]-[f(x-1,y+1)+2*f(x,y+1)+f(x+1,y+1)]
Wherein, f (a, b) represents the gray value of (a, b) point；
Step S3: airspace is carried out to frequency to the highest area image of average gradient in step 2 using two dimensional discrete Fourier transform
The conversion in domain；
Two-dimentional fast Fourier FFT is obtained by calculating FFT one-dimensional twice, the line number of image, columns is made to be all satisfied 2 n
Power, if conditions are not met, first meeting 2 n times to image zero padding before calculating FFT；
The two dimensional image f (x, y) of one M row N column is first the one-dimensional discrete Fourier that a length is N by row queue variable y and becomes
Change, then by calculated result by column to variable x do a length be M Fourier transformation obtain the Fourier transformation knot of the image
Fruit, as shown in formula:
It is exactly following two parts that above formula, which is disassembled, is first obtained F (x, v), then obtains F (u, v) by F (x, v):
Every a line is carried out discrete Fourier transform to the one-dimensional N point sequence of every a line and is obtained F (x, u) by N number of point, then to obtaining F
(x, u), to the discrete Fourier transform that each column are done with M point, just obtains the discrete Fourier transform of two dimensional image f (x, y) by column
F(u,v)；
Step S4: watermarking images are encoded and are superimposed with frequency domain obtained in step S3；
Step S5: the inverse transformation for carrying out airspace to frequency domain obtains the image after addition watermark；
The mode of the inverse transformation are as follows: the two dimensional image f (x, y) of M row N column, when doing inverse Fourier transform, first to column to doing
One-dimensional inverse Fourier transform, then one-dimensional inverse Fourier transform is done to row, it is shown below:
5. a kind of addition image blind watermarking method based on frequency domain according to claim 4, it is characterised in that: the QR code
Level of error correction be maximum 30% mistake can correct.
6. a kind of addition image blind watermarking method based on frequency domain according to claim 4, it is characterised in that: the step
Coding mode in S4 is encoded using random sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811563428.1A CN109829842B (en) | 2018-12-20 | 2018-12-20 | Blind watermark adding method for image based on frequency domain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811563428.1A CN109829842B (en) | 2018-12-20 | 2018-12-20 | Blind watermark adding method for image based on frequency domain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109829842A true CN109829842A (en) | 2019-05-31 |
| CN109829842B CN109829842B (en) | 2023-01-10 |
Family
ID=66859936
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811563428.1A Active CN109829842B (en) | 2018-12-20 | 2018-12-20 | Blind watermark adding method for image based on frequency domain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109829842B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111105337A (en) * | 2019-12-19 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Watermark processing method, information display method and related device |
| CN111461955A (en) * | 2020-03-31 | 2020-07-28 | 上海德易车信息科技有限公司 | Method and device for automatically increasing digital blind watermark in screenshot, electronic equipment and storage medium |
| CN111737662A (en) * | 2020-06-16 | 2020-10-02 | 北京达佳互联信息技术有限公司 | Watermark adding method, watermark extracting method, watermark adding device, watermark extracting device and electronic equipment |
| CN111932432A (en) * | 2020-10-14 | 2020-11-13 | 腾讯科技（深圳）有限公司 | Blind watermark implanting method, blind watermark detecting method, blind watermark implanting device, blind watermark detecting equipment and storage medium |
| CN113221078A (en) * | 2021-03-25 | 2021-08-06 | 贵州大学 | Watermark tracking algorithm for information screenshot leakage of instant messaging system |
| CN114463156A (en) * | 2022-01-21 | 2022-05-10 | 浪潮卓数大数据产业发展有限公司 | Method for adding blind watermark to electronic contract |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120128199A1 (en) * | 2009-06-04 | 2012-05-24 | A.T Communications Co., Ltd. | Watermark information embedding device, watermark information processing system, watermark information embedding method, and program |
| CN108449527A (en) * | 2018-03-28 | 2018-08-24 | 南京吉印信息科技有限公司 | A kind of digital watermark method and system for taking the photograph attack for the anti-screen of remote sensing images |
-
2018
- 2018-12-20 CN CN201811563428.1A patent/CN109829842B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120128199A1 (en) * | 2009-06-04 | 2012-05-24 | A.T Communications Co., Ltd. | Watermark information embedding device, watermark information processing system, watermark information embedding method, and program |
| CN108449527A (en) * | 2018-03-28 | 2018-08-24 | 南京吉印信息科技有限公司 | A kind of digital watermark method and system for taking the photograph attack for the anti-screen of remote sensing images |
Non-Patent Citations (1)
| Title |
|---|
| 郑秋梅等: "数字图像水印的主要几种算法研究", 《自动化与仪器仪表》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111105337A (en) * | 2019-12-19 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Watermark processing method, information display method and related device |
| CN111105337B (en) * | 2019-12-19 | 2022-05-17 | 腾讯科技（深圳）有限公司 | Watermark processing method, information display method and related device |
| CN111461955A (en) * | 2020-03-31 | 2020-07-28 | 上海德易车信息科技有限公司 | Method and device for automatically increasing digital blind watermark in screenshot, electronic equipment and storage medium |
| CN111737662A (en) * | 2020-06-16 | 2020-10-02 | 北京达佳互联信息技术有限公司 | Watermark adding method, watermark extracting method, watermark adding device, watermark extracting device and electronic equipment |
| CN111932432A (en) * | 2020-10-14 | 2020-11-13 | 腾讯科技（深圳）有限公司 | Blind watermark implanting method, blind watermark detecting method, blind watermark implanting device, blind watermark detecting equipment and storage medium |
| CN113221078A (en) * | 2021-03-25 | 2021-08-06 | 贵州大学 | Watermark tracking algorithm for information screenshot leakage of instant messaging system |
| CN113221078B (en) * | 2021-03-25 | 2024-03-12 | 贵州大学 | Watermark tracking method for instant messaging system information screen capture leakage |
| CN114463156A (en) * | 2022-01-21 | 2022-05-10 | 浪潮卓数大数据产业发展有限公司 | Method for adding blind watermark to electronic contract |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109829842B (en) | 2023-01-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109829842A (en) | A kind of addition image blind watermarking method based on frequency domain | |
| Tang et al. | A feature-based robust digital image watermarking scheme | |
| CN110084733B (en) | Text image watermark embedding method and system and text image watermark extracting method and system | |
| Ma et al. | Local geometric distortions resilient watermarking scheme based on symmetry | |
| Li et al. | Localized image watermarking in spatial domain resistant to geometric attacks | |
| Rai et al. | SVM based robust watermarking for enhanced medical image security | |
| CN103606127B (en) | anti-copy image watermarking method based on optical microstructure | |
| CN102622545A (en) | Picture file tracking method | |
| Hou et al. | Detection of hue modification using photo response nonuniformity | |
| Monga et al. | Image authentication under geometric attacks via structure matching | |
| CN111680273A (en) | Watermark embedding method, device, electronic equipment and readable storage medium | |
| Cedillo-Hernandez et al. | Improving dft-based image watermarking using particle swarm optimization algorithm | |
| Gul et al. | SVD based image manipulation detection | |
| CN112085643A (en) | Image desensitization processing method, verification method, device, equipment and medium | |
| Basheer et al. | A robust NIfTI image authentication framework to ensure reliable and safe diagnosis | |
| Nejati et al. | Fragile watermarking based on QR decomposition and Fourier transform | |
| Su | Color image watermarking: algorithms and technologies | |
| US11361177B2 (en) | Composite information bearing devices | |
| Riad et al. | Pre-processing the cover image before embedding improves the watermark detection rate | |
| Nawaz et al. | A novel hybrid discrete cosine transform speeded up robust feature-based secure medical image watermarking algorithm | |
| CN116051349A (en) | BRISK-FREAK-based medical image watermarking method | |
| Araghi et al. | Analysis and evaluation of template based methods against geometric attacks: a survey | |
| El-Bendary et al. | An efficient hidden marking approach for forensic and contents verification of digital images | |
| US10726513B2 (en) | Information bearing devices and authentication devices including same | |
| CN112434727A (en) | Identity document authentication method and system |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 266500 No. 77, Lingyan Road, LINGSHANWEI sub district office, Huangdao District, Qingdao City, Shandong Province Applicant after: Issa Technology Co.,Ltd. Applicant after: QINGDAO YISA DATA TECHNOLOGY Co.,Ltd. Address before: 108, 102 / F, building 17, yard 6, Jingshun East Street, Chaoyang District, Beijing Applicant before: BEIJING YISA TECHNOLOGY Co.,Ltd. Applicant before: QINGDAO YISA DATA TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 266500 business premises, No. 77, Lingyan Road, LINGSHANWEI sub district office, Huangdao District, Qingdao City, Shandong Province Applicant after: Issa Technology Co.,Ltd. Applicant after: QINGDAO YISA DATA TECHNOLOGY Co.,Ltd. Address before: 266500 No. 77, Lingyan Road, LINGSHANWEI sub district office, Huangdao District, Qingdao City, Shandong Province Applicant before: Issa Technology Co.,Ltd. Applicant before: QINGDAO YISA DATA TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |