CN105160619B - A kind of image watermark detection method - Google Patents
A kind of image watermark detection method Download PDFInfo
- Publication number
- CN105160619B CN105160619B CN201510319501.0A CN201510319501A CN105160619B CN 105160619 B CN105160619 B CN 105160619B CN 201510319501 A CN201510319501 A CN 201510319501A CN 105160619 B CN105160619 B CN 105160619B
- Authority
- CN
- China
- Prior art keywords
- image
- watermark
- detected
- watermark signal
- maximum
- 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.)
- Expired - Fee Related
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 24
- 238000005311 autocorrelation function Methods 0.000 claims abstract description 30
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000001914 filtration Methods 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 11
- 238000013507 mapping Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 claims description 6
- 238000012937 correction Methods 0.000 abstract description 7
- 238000000605 extraction Methods 0.000 abstract description 2
- 238000010008 shearing Methods 0.000 abstract description 2
- 150000001875 compounds Chemical class 0.000 abstract 1
- 238000006243 chemical reaction Methods 0.000 description 4
- 238000009826 distribution Methods 0.000 description 4
- 230000009466 transformation Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000013519 translation Methods 0.000 description 2
- 241000023320 Luma <angiosperm> Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical compound COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 238000009827 uniform distribution Methods 0.000 description 1
Landscapes
- Image Processing (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
The invention discloses a kind of image watermark detection method, this method includes：The watermark signal included in extraction image to be detected, as the first watermark signal；Auto-correlation function calculating is carried out to first watermark signal, to generate auto-correlation function image；Reference layout information and the auto-correlation function image are respectively mapped in log-polar system, obtained so that the maximum coordinates point of the two linear correlation values maximum；According to the coordinate value of the maximum coordinates point, image to be detected is restored to obtain correction image；Based on the maximum related value in each correlation between region respectively consistent with the image shape size that reference watermark template is formed in the correction image and reference watermark template, whether judge in the correction image comprising reference watermark signal.The image digital watermark detection method of the present invention can resist the compound geometric attacks such as rotation, shearing and scaling in zone of reasonableness, safe.
Description
The application is a divisional application with the application date of 2011, 8 and 26, and the application number of 201110248307.X, and the invention and creation name of 'an image watermark detection method and system'.
Technical Field
The invention relates to an image digital watermark technology, in particular to an image watermark detection method.
Background
With the development of digital photographing technology and the popularization of internet applications such as e-commerce, digital publishing, news portals, and social networking sites, digital pictures have become a part of people's daily lives. One of the basic attributes of digital pictures is that they are very easy to copy, thus posing a serious threat of digital copyright piracy.
One technical approach to protect the copyright of Digital pictures is to use a Digital Rights Management (DRM) system. The DRM working principle is that a digital picture provider encrypts and protects pictures by using a secret key and establishes an authorization center to control the transmission of the digital pictures. This means that DRM protection of digital picture rights needs to be done in a relatively closed environment, and if malicious users in the DRM system spread the digital pictures out of the system, the DRM system is unable to do so. It is seen that DRM technology is difficult to apply in the open environment of today's society.
Another effective method for protecting the copyright of the digital picture is to adopt an image digital watermarking technology, a copyright owner firstly embeds copyright owner information into the picture, and after the copyright owner finds the infringement, a third party can be prompted to detect the copyright owner information contained in the infringement picture, so that the effect of frightening the copyright infringement is achieved.
In the specific application of the image digital watermarking technology, when detecting whether a certain digital picture contains watermark information or partial content of the watermark information, it is generally difficult to obtain an original picture corresponding to the picture. This requires that the image watermarking technique employed be capable of blind detection, even without the use of the original picture information.
The biggest challenge in blind detection of image digital watermarks is generally geometric attack, that is, operations such as rotation, scaling and cutting are performed on a picture containing a watermark so as to make copyright watermark information possibly contained in the picture undetectable. For geometric attack, the image watermark detection algorithm generally comprises the steps of detecting a template watermark contained in an image carrier, determining geometric attack parameters possibly suffered by an image through template watermark information, recovering an original image carrier which is not attacked by the geometry, and then carrying out next watermark information detection.
Most of the existing blind detection image digital watermarking algorithms cannot effectively solve geometric cutting attack, especially under the condition of combining cutting attack with rotation and scaling attack.
Disclosure of Invention
The invention aims to solve the technical problem of providing a method for detecting the watermark of the image resisting the geometric attack.
In order to solve the technical problem, the invention provides an image watermark detection method. The image watermark detection method comprises the following steps: step one, extracting a watermark signal contained in an image to be detected as a first watermark signal; step two, performing autocorrelation function calculation on the first watermark signal to generate an autocorrelation function image; respectively mapping the reference layout information and the autocorrelation function image to a logarithmic polar coordinate system to obtain a maximum coordinate point which enables the linear correlation value of the reference layout information and the autocorrelation function image to be maximum, wherein the reference layout information and the cartesian coordinate system point P (x, y) of the autocorrelation function image are respectively mapped according to the following expression:
wherein (r, θ) represents the polar diameter and polar angle of a logarithmic polar coordinate, McIs a constant;
restoring the image to be detected according to the coordinate value of the maximum coordinate point to obtain a corrected image; and step five, based on the maximum correlation value in the correlation values between the area in the corrected image, which is consistent with the image shape and size formed by the reference watermark template, and the reference watermark template, judging whether the maximum correlation value is larger than a preset threshold value, and judging whether the corrected image contains the reference watermark signal according to the judgment result, wherein the reference layout information is information which is added to the image in the process of embedding the watermark signal of the image and has a set rule.
According to one embodiment of the invention, in the first step, the gray level histogram of the image to be detected is equalized to obtain an equalized image; and extracting the first watermark signal contained in the image to be detected based on the equalized image.
According to an embodiment of the present invention, in the first step, a high frequency part in the image to be detected is obtained as the first watermark signal by performing prediction filtering on the equalized image.
According to one embodiment of the invention, the prediction filtering is performed by a gaussian high-pass filter or a butterworth high-pass filter.
According to an embodiment of the present invention, if it is determined that the correction image contains the reference watermark signal, the watermark signal in the correction image is obtained and decoded for output.
According to an embodiment of the present invention, in the third step, the mapping result of the reference layout information and the autocorrelation function image is subjected to matched filtering to obtain a maximum coordinate point at which a linear correlation value between the two is maximum.
According to an embodiment of the present invention, a geometric attack parameter for representing a geometric attack on the image to be detected is obtained according to the coordinate value of the maximum coordinate point, and the image to be detected is restored by using the geometric attack parameter to obtain a corrected image.
According to one embodiment of the invention, the maximum correlation value is calculated as follows:
wherein, Wr(x, y) denotes a reference watermark template, which is composed of L modulation blocks, Wr(x,y)＝(wr[1],...,wr[i],...,wr[L])，wr[i]Represents the ith modulation block; b isc(x, y) denotes a central region, corresponding toIn the reference watermark template, also consisting of the corresponding L elements, Bc(x,y)＝(B[1],...,B[i],...,B[L]) Wherein B [ i ]]An area corresponding to the i-th modulation block which is a central area; p (x, y) represents a point of the corrected image; *mA variation of the convolution operation is shown,here denotes a convolution operation.
In short, the present invention provides an image watermark detection method, aiming at the disadvantage of the existing blind detection image algorithm. According to the method, geometric attack parameters of geometric attacks such as rotation, scaling and the like suffered by an image to be detected are calculated according to reference layout information embedded in the image to be detected in advance. Then, according to the geometric attack parameters of geometric attacks such as rotation, scaling and the like, recovering the image to be detected and recovering a corrected image, and the method performs correlation matching on the corrected image and the reference watermark template, determines whether the image to be detected contains the reference watermark template or not, and decodes the contained watermark signal if the image to be detected contains the reference watermark template.
Compared with the prior art, the invention has the following advantages: the image digital watermark detection method can resist the composite geometric attacks of rotation, shearing and scaling within a reasonable range; the reference watermark template of the image digital watermark detection method can be used as a secret key, and an attacker can not detect or erase the watermark even knowing a detection algorithm under the condition of not knowing the secret key; the part with the largest calculated amount of the image digital watermark detection algorithm is convolution calculation, and the convolution calculation can be realized by means of fast Fourier transform with high operation speed, so that the algorithm can obtain higher calculation speed.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
While the invention will be described in connection with certain exemplary implementations and methods of use, it will be understood by those skilled in the art that it is not intended to limit the invention to these embodiments. On the contrary, the intent is to cover all alternatives, modifications and equivalents as included within the spirit and scope of the invention as defined by the appended claims.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
fig. 1 is a flowchart illustrating an image watermark detection method according to a first embodiment of the present invention;
fig. 2 is a schematic structural diagram of an image watermark detection system according to a second embodiment of the present invention;
FIG. 3 is an example of an image generated by an autocorrelation function in accordance with an embodiment of the present invention.
Detailed Description
The following detailed description of the embodiments of the present invention will be provided with reference to the drawings and examples, so that how to apply the technical means to solve the technical problems and achieve the technical effects can be fully understood and implemented. It should be noted that, as long as there is no conflict, the embodiments and the features of the embodiments of the present invention may be combined with each other, and the technical solutions formed are within the scope of the present invention.
Additionally, the steps illustrated in the flow charts of the figures may be performed in a computer system such as a set of computer-executable instructions and, although a logical order is illustrated in the flow charts, in some cases, the steps illustrated or described may be performed in an order different than here.
First embodiment
Fig. 1 shows a flowchart of an image watermark detection method according to a first embodiment of the present invention. The steps of the present embodiment are explained below with reference to fig. 1.
And extracting a watermark signal contained in the image to be detected. The image to be detected is embedded with the watermark signal in the previous watermark embedding process. Since the image to be detected may have been subjected to a geometric attack, the extracted watermark signal may also be a watermark signal affected by the geometric attack. For convenience of explanation, the watermark signal extracted from the image to be detected is hereinafter referred to as a first watermark signal. The details of step 110 and step 120 are described below.
It should be noted that, in the image to be detected of the present embodiment, reference layout information is added in advance. For example, a synchronization template may be embedded in the image to be detected during the previous embedding of the watermark signal in the image to be detected, wherein the synchronization template may be an image with a size equal to that of the image to be detected and defining a pulse peak point. For another example, in the process of embedding a watermark signal into an image to be detected, a plurality of pulse peak points may be regularly (but invisibly) laid out in the watermark information to be embedded, as long as after adding regular reference layout information, the watermark information region embedded in the image to be detected can show regular layout information. In short, the reference layout information is information having a certain (set) rule, which may be any preset rule, attached to the image during the watermark signal embedding process of the image.
And 110, equalizing the gray histogram of the image to be detected to obtain an equalized image.
Specifically, firstly, the gray information of the image to be detected is extracted as the image data to be detected. If the image to be detected is a color image, converting the image to be detected into a YUV color space model, and extracting Y channel information on the model as image data to be detected; and if the image to be detected is a gray image, directly using the gray information as the image data to be detected.
Specifically, for the input of digital color pictures in BMP, JPG, PNG, or the like, the digital color pictures are first decoded, and then the decoded images are subjected to YUV color space conversion. Wherein "Y" in the YUV color space model represents brightness (Luma), that is, a gray value; and "U" and "V" denote chromaticity (Chroma) which is used to describe the color and saturation of an image for specifying the color of a pixel.
And performing color space conversion on the decoded image represented by the RGB color space template, namely converting the information on the RGB color space template into a YUV color space, wherein the color space conversion is as shown in the following formula, and extracting a Y-channel information gray value as image data to be detected for inputting after performing color space conversion.
Y＝0.299R+0.587G+0.114B
U＝0.492(B-Y)
V＝0.877(R-Y)
And acquiring a gray level histogram of the obtained image data to be detected, and then carrying out histogram equalization on the gray level histogram to obtain an image with the gray level histogram equalized.
Specifically, the number of times of occurrence of the gray level of the image to be detected at each gray level is counted according to the gray level value of the image to be detected to obtain a gray level histogram, and then histogram equalization is performed by adopting an adaptive histogram equalization method, so that the probability density function p(s) of the gray level distribution of the image after equalization processing is 1, that is, the probability of occurrence of all the image gray levels is the same.
The histogram of the image is a kind of statistical graph in which the frequency of occurrence of the distribution of the gray levels of all the pixels of the image is displayed in the size of the gray level, and is generally expressed using a two-dimensional coordinate system. The equalization of the gray histogram is to reduce the gray level of the image in exchange for the contrast expansion, and the equalization correction of the gray histogram increases the gray pitch of the image, or the gray is uniformly distributed, increasing the contrast, and thus the details of the image become clear.
And step 120, extracting a watermark signal in the image to be detected, namely a first watermark signal, based on the equalized image obtained in the step 110.
The first watermark signal may be extracted by predictive filtering the equalized image. Preferably, the embodiment employs gaussian high-pass filtering, and the process of gaussian high-pass filtering may include: and performing Gaussian low-pass filtering on the equalized image, calculating a residual error value of the equalized image and the image subjected to the Gaussian low-pass filtering to obtain a high-frequency part in the image to be detected, and taking the obtained high-frequency part as a first watermark signal. More preferably, the template of the gaussian low-pass filtering is as follows:
specifically, the processing method of gaussian low-pass filtering is to multiply pixels by different coefficients in the template, and some pixels in the template are more important than others in terms of coefficient value. As can be seen from the above equation, for a 3 × 3 filter, the value of the coefficient of the pixel at the center of the filter is larger than that of any other pixel. While other pixels farther from the center of the filter appear less important, since the diagonal term is farther from the center than the orthogonally adjacent pixels, it is less important than the four pixels immediately adjacent to the center. The sum of all coefficients in the template in the above is 16, since it is an integer power of 2, which is convenient for computer implementation.
In addition, in this step, besides using a gaussian high-pass filter, a butterworth high-pass filter or the like may be used for prediction filtering, and may even be derived from a natural image probability distribution model.
Step 130, performing autocorrelation function calculation on the watermark signal in the image to be detected extracted in step 120 to generate an autocorrelation function image, which is denoted as f (u, v). The formula may be as follows:
wherein, I represents an image generated by periodically expanding the first watermark signal;
x and y respectively represent coordinate values in the width direction and the height direction of the image I;
m and N respectively represent the width and height of the image I and are equal to the width and height of the image to be detected;
u and v respectively represent coordinate values in the width direction and the height direction of the autocorrelation function;
wherein x, u is 1 … M; y, v is 1 … N.
The autocorrelation function f (u, v) varies with the magnitude of u, v, and the value of f (u, v) exhibits some periodic variation.
More specifically, since the watermark signal in the image to be detected corresponds to a high-frequency portion in the image, the extracted watermark signal (first watermark signal) is a sequence composed of normally distributed, zero-mean random numbers, and the number of the random numbers of the first watermark signal is smaller than the number of pixels of the image to be detected, and therefore, the above formula employs a periodic function generated by expanding (repeatedly copying) the first watermark signal.
The embodiment represents the image to be detected by introducing the autocorrelation image, so that the distribution characteristics, periodicity and other characteristics of the image to be detected can be better reflected, the influence caused by the geometric deformation of translation can be eliminated, and the rotation and scaling of the image to be detected and the geometric attack deformation are mapped to the rotation and scaling of the autocorrelation image one by one.
Step 140, mapping the reference layout information and the autocorrelation function image obtained in step 130 to a logarithmic polar coordinate system, and performing matched filtering on the mapping results of the reference layout information and the autocorrelation function image to obtain a coordinate point with the maximum linear correlation value (maximum coordinate point for short) and a value Pm (r) thereofp,θp)。
Specifically, the image log-polar transformation is a transformation of the image from a cartesian coordinate system to a log-polar coordinate system. Firstly, coordinate transformation is carried out on the reference layout information, the obtained image is recorded as t (r, theta), then coordinate transformation is carried out on the autocorrelation function image, the obtained image is recorded as f (r, theta), then matched filtering is carried out on the image t (r, theta) and the image f (r, theta), namely correlation operation is carried out to obtain a coordinate point with the maximum linear correlation value and a Pm (r, theta) value thereofp,θp). Wherein the mapping formula from the point P (x, y) to the log polar coordinate may be as follows:
wherein (r, θ) represents a polar diameter and a polar angle of a logarithmic polar coordinate, McIs a constant. From the above equation, the mapping transform maps a circular region to a rectangular region. When the image is zoomed under a Cartesian coordinate system, the logarithmic polar coordinate generates translation and has better scale and rotation invariance. As shown below, in the equation s represents a scaling parameter.
Wherein, the matched filtering means obtaining the maximum coordinate point Pm (r) which respectively maps the reference layout information and the autocorrelation function image to the logarithmic polar coordinate systemp,θp) So that the linear correlation value between them is maximized, i.e., g (r, θ) ═ f (r, θ) t (r, θ) reaches a global peak. The correlation operation can be shown as follows,
wherein "o" represents a "correlation" operation; m and N respectively represent the width and height of the autocorrelation function image and the reference layout information under a logarithmic polar coordinate system, and are equal to the width and height of the image to be detected; f (r, theta), t (r, theta) are respectively the representation forms of the autocorrelation function image and the reference layout information in a logarithmic polar coordinate system.
Step 150, obtaining the coordinate value Pm (r) of the maximum coordinate point according to the step 140p,θp) And restoring the image to be detected to obtain a corrected image.
More specifically, a geometric attack parameter representing a geometric attack to which the image to be detected is subjected is obtained according to the coordinate value of the maximum coordinate point, and the image to be detected is restored by using the geometric attack parameter to obtain a corrected image, which will be described in more detail below.
Coordinate value Pm (r) according to maximum coordinate pointp,θp) And obtaining geometric attack parameters representing geometric attacks such as rotation and/or scaling and the like suffered by the image to be detected. Taking the case of performing rotation and scaling as an example, the rotation parameter and the scaling parameter need to be obtained, and according to the property of log-polar mapping, the formula can be expressed as follows:
in the formula, s and d respectively represent a scaling parameter and a rotation parameter;
Mcis a constant;
and N represents the height of the autocorrelation image under a logarithmic polar coordinate system, and is equal to the height of the image to be detected.
And, using the obtained rotation parameter d and the scaling parameter s to recover the image to be detected to obtain a corrected image without geometric attack, as shown in the following formula,
in this embodiment, the geometric attack on the image to be detected is corrected by comparing the reference layout information with the obtained autocorrelation function image. The reference layout information data can be much smaller than the image data to be detected, so the matching speed is high, the calculation time of correlation operation is saved, and the working efficiency is improved.
Step 160, based on the maximum correlation value C in the correlation values between any area of the corrected image consistent with the shape and size of the reference watermark template image and the reference watermark template image (referred to as the reference watermark image for short)maxAnd judging whether the corrected image contains the reference watermark signal or not.
For example, a region (for short, central region) with the center of the corrected image as the center and the shape and size of the image of the reference watermark template are compared with the reference watermark template to obtain a correlation value between the two regions, and then the regions with the same shape and size beside the central region (for example, the central point is shifted by 1 or several pixels to the left, the upper, the right or the lower) are compared with the reference watermark template to obtain a corresponding correlation value, and so on, thereby obtaining the maximum correlation value. The obtaining of the maximum correlation value between any region in the corrected image, which is consistent with the image shape and size formed by the reference watermark template, and the reference watermark template can be calculated according to the following formula:
for example, when the maximum correlation value is greater than a predetermined threshold value, it is determined that the reference watermark signal is included.
When it is determined that the corrected image contains the reference watermark signal based on the maximum correlation value, the watermark signal of the corrected image is acquired and decoded and output.
For example, the coordinate value Pm (r) of the maximum coordinate point obtained in step 140 may be used in a similar manner to the manner of recovering the mode to be detected to obtain the corrected imagep,θp) And restoring the first watermark signal image to obtain a corrected watermark image, and then decoding and outputting the corrected watermark image.
For another example, the maximum correlation value C may be obtainedmaxThe watermark signal is extracted and decoded in the region in the corrected image.
Specifically, the resulting maximum correlation value C is determinedmaxAnd whether the difference is smaller than a preset threshold value T or not is met, if so, the corrected image does not contain the reference watermark signal, otherwise, the corrected image contains the reference watermark signal, and the reference watermark signal is decoded and output. Decoding an output corrected image of a reference watermark signal contained in the image by:
1) inputting a preset reference watermark template with the length of L bits;
2) setting i to 1, wherein i is the ith modulation block of the reference watermark template;
3) if the normalized linear correlation value C of the ith modulation block of the reference watermark template and the corresponding area of the central areaiGreater than ThThe watermark information is correspondingly output as 1, otherwise 0 is output. Wherein, ThThe threshold value is a preset threshold value, and may be generally set to 0. The central region is a central region of the corrected image having the maximum correlation value obtained by performing correlation value calculation with the reference watermark template. Wherein, CiThe calculation formula of (c) can be as follows:
in the formula, MiIs the ith modulation block of the reference watermark template;
Bian ith modulation block region corresponding to the central region;
n is BiLength of region, m represents BiMean of the regions.
4) i is increased by 1, if i < ═ L, then return to step 3); otherwise, ending. The obtained respective bit watermark information is arranged in order to generate a reference watermark signal.
It should be noted that the reference watermark signal is set by a specific application, and can be generally expressed in the form of a white noise (power density spectrum uniform distribution) sequence. The reference watermark signal may be in binary form or gaussian noise form and is modulated by a reference watermark template, e.g. the noise sequence (as the reference watermark template) modulates the reference watermark signal 0100011011. Specifically, the ith modulation block modulates binary information 0 or 1 as follows:
according to the above equation, if the reference watermark signal is to be embedded with binary information bit equal to 1, w is actually embeddedr[i](ii) a If the binary information bit is to be embedded as 0, then-w is actually embeddedr[i]。wr[i]Typically a white noise sequence, wr[i]Is a reference watermarkForm board Wr。
Second embodiment
Fig. 2 is a schematic structural diagram of an image watermark detection system according to a second embodiment of the present invention. The respective component parts of the present embodiment will be described below with reference to fig. 2.
Referring to fig. 2, the extraction module (21) of the embodiment performs the operations of step 110 and step 120 of the first embodiment, the calculation module (22) performs the operations of step 130 and step 140 of the first embodiment, and the correction module (23) and the judgment module (24) perform step 150 and step 160 of the first embodiment, respectively. And will not be elaborated upon here.
Those skilled in the art will appreciate that the modules or steps of the invention described above can be implemented in a general purpose computing device, centralized on a single computing device or distributed across a network of computing devices, and optionally implemented in program code that is executable by a computing device, such that the modules or steps are stored in a memory device and executed by a computing device, fabricated separately into integrated circuit modules, or fabricated as a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
Although the embodiments of the present invention have been described above, the above descriptions are only for the convenience of understanding the present invention, and are not intended to limit the present invention. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (7)
1. An image watermark detection method, comprising:
step one, extracting a watermark signal contained in an image to be detected as a first watermark signal;
performing autocorrelation function calculation on the first watermark signal to generate an autocorrelation function image, wherein the autocorrelation function calculation is performed on the first watermark signal according to the following expression to generate an autocorrelation function image:
wherein, I represents an image generated by periodically expanding the first watermark signal;
x and y respectively represent coordinate values in the width direction and the height direction of the image I;
m and N respectively represent the width and height of the image I and are equal to the width and height of the image to be detected;
u and v respectively represent coordinate values in the width direction and the height direction of the autocorrelation function;
wherein x, u is 1 … M; y, v ═ 1 … N;
step three, mapping the reference layout information and the autocorrelation function image into a logarithmic polar coordinate system respectively to obtain a maximum coordinate point which enables the linear correlation value of the reference layout information and the autocorrelation function image to be maximum, wherein,
mapping the reference layout information and the point P (x, y) of the Cartesian coordinate system of the autocorrelation function image respectively according to the following expression:
wherein (r, θ) represents the polar diameter and polar angle of a logarithmic polar coordinate, McIs a constant;
restoring the image to be detected according to the coordinate value of the maximum coordinate point to obtain a corrected image; and
step five, based on the maximum correlation value of the correlation values between the area in the corrected image, which is consistent with the image shape and size formed by the reference watermark template, and the reference watermark template, judging whether the maximum correlation value is larger than a preset threshold value, and judging whether the corrected image contains the reference watermark signal according to the judgment result,
wherein,
the reference layout information is information with a set rule attached to an image in a watermark signal embedding process of the image;
the maximum correlation value is calculated as follows:
wherein, Wr(x, y) denotes a reference watermark template, which is composed of L modulation blocks, Wr(x,y)＝(wr[1],...,wr[i],...,wr[L])，wr[i]Represents the ith modulation block; b isc(x, y) denotes a central region, corresponding to the reference watermark template, also consisting of the corresponding L elements, Bc(x,y)＝(B[1],...,B[i],...,B[L]) Wherein B [ i ]]An area corresponding to the i-th modulation block which is a central area; p (x, y) represents a point of the corrected image; *mA variation of the convolution operation is shown,here denotes a convolution operation.
2. The method of claim 1, wherein, in step one,
equalizing the gray level histogram of the image to be detected to obtain an equalized image; and
and extracting the first watermark signal contained in the image to be detected based on the equalized image.
3. The method of claim 2, wherein, in step one,
and performing predictive filtering on the equalized image to obtain a high-frequency part in the image to be detected as a first watermark signal.
4. The method of claim 3,
the prediction filtering is performed by a gaussian high-pass filter or a butterworth high-pass filter.
5. The method of claim 1,
and if the corrected image contains the reference watermark signal, acquiring the watermark signal in the corrected image and decoding and outputting the watermark signal.
6. The method according to any one of claims 1 to 5,
in the third step, the mapping result of the reference layout information and the autocorrelation function image is subjected to matched filtering to obtain a maximum coordinate point at which the linear correlation value of the two is maximum.
7. The method of claim 6,
and acquiring a geometric attack parameter for representing the geometric attack on the image to be detected according to the coordinate value of the maximum coordinate point, and recovering the image to be detected by using the geometric attack parameter to obtain a corrected image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510319501.0A CN105160619B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detection method |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110248307.XA CN102956025B (en) | 2011-08-26 | 2011-08-26 | Image watermark detection method and system |
| CN201510319501.0A CN105160619B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detection method |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110248307.XA Division CN102956025B (en) | 2011-08-26 | 2011-08-26 | Image watermark detection method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105160619A CN105160619A (en) | 2015-12-16 |
| CN105160619B true CN105160619B (en) | 2018-07-06 |
Family
ID=47764805
Family Applications (5)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510319501.0A Expired - Fee Related CN105160619B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detection method |
| CN201510319483.6A Expired - Fee Related CN105160618B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detecting system |
| CN201110248307.XA Active CN102956025B (en) | 2011-08-26 | 2011-08-26 | Image watermark detection method and system |
| CN201510320221.1A Expired - Fee Related CN105160621B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detecting system |
| CN201510320159.6A Expired - Fee Related CN105160620B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detection method |
Family Applications After (4)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510319483.6A Expired - Fee Related CN105160618B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detecting system |
| CN201110248307.XA Active CN102956025B (en) | 2011-08-26 | 2011-08-26 | Image watermark detection method and system |
| CN201510320221.1A Expired - Fee Related CN105160621B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detecting system |
| CN201510320159.6A Expired - Fee Related CN105160620B (en) | 2011-08-26 | 2011-08-26 | A kind of image watermark detection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (5) | CN105160619B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106780281A (en) * | 2016-12-22 | 2017-05-31 | 辽宁师范大学 | Digital image watermarking method based on Cauchy's statistical modeling |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160619B (en) * | 2011-08-26 | 2018-07-06 | 北京中盈信安科技发展有限责任公司 | A kind of image watermark detection method |
| CN105976304B (en) * | 2016-05-30 | 2019-05-10 | 北京奇艺世纪科技有限公司 | A kind of insertion of image watermark, detection method and device |
| CN108648132B (en) * | 2018-04-16 | 2020-08-14 | 深圳市联软科技股份有限公司 | Method, system, terminal and medium for generating watermark according to image |
| CN111833231B (en) * | 2019-04-15 | 2023-02-10 | 阿里巴巴集团控股有限公司 | Watermark extraction method, device and system |
| CN110956737B (en) * | 2020-01-07 | 2021-10-12 | 武汉卓目科技有限公司 | Safety line identification method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1022678A2 (en) * | 1999-01-25 | 2000-07-26 | Nippon Telegraph and Telephone Corporation | Method, apparatus and program storage medium for embedding and detecting a digital watermark |
| CN101286224A (en) * | 2008-05-13 | 2008-10-15 | 南京航空航天大学 | Watermark embedding and extraction method based on fractal image coding |
| CN101330610A (en) * | 2008-07-22 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for embedding and extracting watermark as well as processing system |
| CN102122385A (en) * | 2011-02-28 | 2011-07-13 | 北京工业大学 | Digital watermark method capable of simultaneously resisting various attacks |
| CN102156952A (en) * | 2011-03-08 | 2011-08-17 | 南京师范大学 | Copyright-protection-service-oriented remote sensing image digital watermarking method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160619B (en) * | 2011-08-26 | 2018-07-06 | 北京中盈信安科技发展有限责任公司 | A kind of image watermark detection method |
-
2011
- 2011-08-26 CN CN201510319501.0A patent/CN105160619B/en not_active Expired - Fee Related
- 2011-08-26 CN CN201510319483.6A patent/CN105160618B/en not_active Expired - Fee Related
- 2011-08-26 CN CN201110248307.XA patent/CN102956025B/en active Active
- 2011-08-26 CN CN201510320221.1A patent/CN105160621B/en not_active Expired - Fee Related
- 2011-08-26 CN CN201510320159.6A patent/CN105160620B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1022678A2 (en) * | 1999-01-25 | 2000-07-26 | Nippon Telegraph and Telephone Corporation | Method, apparatus and program storage medium for embedding and detecting a digital watermark |
| CN101286224A (en) * | 2008-05-13 | 2008-10-15 | 南京航空航天大学 | Watermark embedding and extraction method based on fractal image coding |
| CN101330610A (en) * | 2008-07-22 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for embedding and extracting watermark as well as processing system |
| CN102122385A (en) * | 2011-02-28 | 2011-07-13 | 北京工业大学 | Digital watermark method capable of simultaneously resisting various attacks |
| CN102156952A (en) * | 2011-03-08 | 2011-08-17 | 南京师范大学 | Copyright-protection-service-oriented remote sensing image digital watermarking method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106780281A (en) * | 2016-12-22 | 2017-05-31 | 辽宁师范大学 | Digital image watermarking method based on Cauchy's statistical modeling |
| CN106780281B (en) * | 2016-12-22 | 2019-12-03 | 辽宁师范大学 | Digital image watermarking method based on Cauchy's statistical modeling |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102956025A (en) | 2013-03-06 |
| CN105160620A (en) | 2015-12-16 |
| CN105160620B (en) | 2018-09-25 |
| CN105160618B (en) | 2018-07-06 |
| CN105160621B (en) | 2018-07-06 |
| CN102956025B (en) | 2015-05-06 |
| CN105160621A (en) | 2015-12-16 |
| CN105160618A (en) | 2015-12-16 |
| CN105160619A (en) | 2015-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wan et al. | A comprehensive survey on robust image watermarking | |
| Mahto et al. | A survey of color image watermarking: State-of-the-art and research directions | |
| Benrhouma et al. | Chaotic watermark for blind forgery detection in images | |
| Malik et al. | Recovery based high capacity reversible data hiding scheme using even-odd embedding | |
| Hosam | Attacking image watermarking and steganography-a survey | |
| CN110084733A (en) | The embedding grammar and system of text image watermark, extracting method and system | |
| CN105160619B (en) | A kind of image watermark detection method | |
| CN111932432B (en) | Blind watermark implanting method, blind watermark detecting method, blind watermark implanting device, blind watermark detecting equipment and storage medium | |
| Ghosal et al. | Application of Lah transform for security and privacy of data through information hiding in telecommunication | |
| Liu et al. | Robust blind image watermarking based on chaotic mixtures | |
| Soualmi et al. | A novel blind medical image watermarking scheme based on Schur triangulation and chaotic sequence | |
| Malik et al. | Histogram and entropy based digital image watermarking scheme | |
| Bukharmetov et al. | Robust method for protecting electronic document on waterway transport with steganographic means by embedding digital watermarks into images | |
| Amirtharajan et al. | Tri-layer stego for enhanced security-A keyless random approach | |
| Liu et al. | An efficient video watermark method using blockchain | |
| Vaidya et al. | Imperceptible watermark for a game-theoretic watermarking system | |
| Zhang et al. | A robust and high-efficiency blind watermarking method for color images in the spatial domain | |
| Al-Otum et al. | Copyright protection of color images for android-based smartphones using watermarking with quick-response code | |
| Melman et al. | Methods for countering attacks on image watermarking schemes: Overview | |
| CN113240569A (en) | Fingerprint image encryption method, device and system | |
| Ling et al. | Watermarking for image authentication | |
| Liu et al. | Wavelet‐Based Color Pathological Image Watermark through Dynamically Adjusting the Embedding Intensity | |
| Soppari et al. | Study of digital watermarking algorithms for digital rights management and their attacks | |
| Chukwuchekwa et al. | Improved DCT based Digital Image Watermarking Technique using Particle Swarm Optimization Algorithm | |
| Bashir et al. | Secure digital watermarking using optimized improved spread spectrum and BCH coding for DIBR 3D-TV system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180706 Termination date: 20190826 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |