WO2019113810A1 - Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales - Google Patents

Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales Download PDF

Info

Publication number
WO2019113810A1
WO2019113810A1 PCT/CN2017/115765 CN2017115765W WO2019113810A1 WO 2019113810 A1 WO2019113810 A1 WO 2019113810A1 CN 2017115765 W CN2017115765 W CN 2017115765W WO 2019113810 A1 WO2019113810 A1 WO 2019113810A1
Authority
WO
WIPO (PCT)
Prior art keywords
watermark
value
vertices
matrix
embedding
Prior art date
Application number
PCT/CN2017/115765
Other languages
English (en)
Chinese (zh)
Inventor
彭翔
王启垒
何文奇
刘晓利
Original Assignee
深圳大学
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 深圳大学 filed Critical 深圳大学
Priority to PCT/CN2017/115765 priority Critical patent/WO2019113810A1/fr
Publication of WO2019113810A1 publication Critical patent/WO2019113810A1/fr

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

Definitions

  • the invention belongs to the field of three-dimensional digital watermarking, and in particular relates to a three-dimensional blind watermark embedding and extracting detection method and device in a partial spherical coordinate system.
  • 3D digital models are increasingly appearing in people's field of vision as a new form of digital media.
  • 3D digital models are becoming an important form of digital media.
  • the illegal possession, theft, modification, and dissemination of the three-dimensional digital model are also increasing, and the intellectual property protection of the three-dimensional digital model is imminent.
  • digital watermark can also be used to protect intellectual property rights of 3D digital models.
  • the research on more mature digital watermarking technology is mostly concentrated on one-dimensional or two-dimensional digital carriers such as audio, image and video.
  • the 3D model watermark can be divided into a blind watermark and a non-blind watermark.
  • the latter needs the original model when detecting the watermark, while the former does not need it.
  • the non-blind The watermark value is not large, and the blind watermark technology has practical application value.
  • the watermark is further divided into a checkable watermark, a readable watermark, and a visible watermark according to the content.
  • the detection result of the watermark detectable is a binary form of 0 or 1.
  • the detection result of the readable watermark is a string form, and the detection result of the visible watermark is an image form. Undoubtedly, the detection result of the visible watermark is more intuitive and meaningful.
  • the carrier of the three-dimensional model watermark is different.
  • the vertices of the 3D model are irregular sampling, and there is no natural ordering, which makes no direct mathematical tools to process them, so the watermark embedding is very difficult.
  • 3D non-blind watermark can also extract watermark by means of resampling and realignment, while blind watermark can only rely on its own watermark. Watermark extraction, embedding difficulty and extraction difficulty is more, which is one of the reasons why most 3D model watermarks use non-blind detection.
  • the invention provides a method and a device for embedding and extracting a three-dimensional blind watermark in a partial spherical coordinate system, aiming at realizing invisibility embedding of a watermark of a three-dimensional digital model, realizing online blind extraction of the watermark after embedding, and the watermark content is meaningful Visual watermark.
  • the present invention provides a three-dimensional blind watermark embedding and extraction detection method in a partial spherical coordinate system, the method comprising: a blind watermark embedding step S1 and a blind watermark extraction detecting step S2;
  • the blind watermark embedding step S1 includes:
  • Step S11 pre-processing the original watermark image to be embedded, and obtaining the attribute value (L, J, I) of the watermark element of the original watermark image;
  • L is the row index code value
  • J is the column index code value
  • I is the element value, ie the energy value
  • Step S12 Filter all candidate vertices satisfying the screening condition from the three-dimensional model to be embedded in the watermark according to the first preset screening condition;
  • Step S13 establishing a local spherical coordinate system under the custom for the candidate vertices, and determining a spherical coordinate value of each of the candidate vertices among them, ⁇ , r are three attribute values of each candidate vertex satisfying the screening condition;
  • Step S14 comparing the attribute value of the watermark element with the attribute value of all candidate vertices satisfying the screening condition, searching for a candidate vertex that has the smallest difference from the attribute value of the watermark element as a point embedded in the watermark element, and changing the candidate The position of the vertex in its spherical coordinate system, making it
  • the value of ⁇ is equal to the row index code value L and the column index code value J of the watermark element, respectively, and the r value thereof is equal to the element value I of the watermark element to embed the index code value and the energy value of the watermark element;
  • the candidate vertices are culled in all candidate vertices satisfying the screening condition, and all the watermark elements of the original watermark image are traversed until the above is completely embedded;
  • the blind watermark extraction detecting step S2 includes:
  • Step S21 Filter all possible embedded vertices satisfying the screening condition from the three-dimensional model to be detected according to the first preset screening condition;
  • Step S22 establishing a local spherical coordinate system under the custom embedding vertices, and determining a spherical coordinate value of each of the possible embedded vertices among them, ⁇ , r are three attribute values of each possible embedding vertex that satisfy the screening condition;
  • Step S23 combining the attribute values of the possible embedding vertices with the index value and the energy value extraction of each of the possible embedding vertices satisfying the screening condition in the three-dimensional model, to obtain a matrix S4;
  • Step S24 inversely transforming the matrix S4 back into the airspace to obtain an extracted watermark image
  • Step S25 Calculate a correlation between the extracted watermark image and the original watermark image by using a watermark correlation calculation formula, and if the correlation is greater than an experience threshold, prove that the three-dimensional model includes a watermark.
  • the invention also provides a three-dimensional blind watermark embedding and extracting detecting device in a partial spherical coordinate system, the device comprising: a blind watermark embedding module and a blind watermark extraction detecting module;
  • the blind watermark embedding module includes:
  • a pre-processing sub-module configured to pre-process the original watermark image to be embedded, to obtain an attribute value (L, J, I) of the watermark element of the original watermark image;
  • L is the row index code value
  • J is the column index code value
  • I is the element value, ie the energy value
  • a first screening sub-module configured to filter, from the three-dimensional model of the watermark to be embedded, all candidate vertices satisfying the screening condition according to the first preset screening condition
  • a first coordinate system establishing submodule configured to establish a local spherical coordinate system under the custom vertices, and determine a spherical coordinate value of each of the candidate vertices among them, ⁇ , r are three attribute values of each candidate vertex satisfying the screening condition;
  • a watermark embedding sub-module configured to compare a property value of the watermark element with an attribute value of all candidate vertices satisfying a filter condition, and search for a candidate vertex that has the smallest difference from the attribute value of the watermark element as a point at which the watermark element is embedded , changing the position of this candidate vertex in its spherical coordinate system, making it
  • the value of ⁇ is equal to the row index code value L and the column index code value J of the watermark element, respectively, and the r value thereof is equal to the element value I of the watermark element to embed the index code value and the energy value of the watermark element;
  • the candidate vertices are culled in all candidate vertices satisfying the screening condition, and all the watermark elements of the original watermark image are traversed until the above is completely embedded;
  • the blind watermark extraction detection module includes:
  • a second screening sub-module configured to filter, from the three-dimensional model to be detected, all possible embedded vertices satisfying the screening condition according to the first preset screening condition
  • a second coordinate system establishing submodule configured to establish a local spherical coordinate system under the custom embedding vertices, and determine a spherical coordinate value of each of the possible embedded vertices among them, ⁇ , r are three attribute values of each possible embedding vertex that satisfy the screening condition;
  • An extraction submodule configured to perform an index value and an energy value extraction on the possible embedded vertex satisfying the filter condition in the three-dimensional model in combination with the attribute value of the possible embedding vertex, to obtain a matrix S4;
  • An inverse transform sub-module configured to inverse transform the matrix S4 back into the airspace to obtain an extracted watermark image
  • the determining sub-module is configured to calculate a correlation between the extracted watermark image and the original watermark image by using a watermark correlation calculation formula, and if the correlation is greater than an experience threshold, prove that the three-dimensional model includes a watermark.
  • the present invention has the beneficial effects that the method and device for three-dimensional blind watermark embedding and extracting detection in a partial spherical coordinate system provided by the present invention include a watermark embedding portion and a watermark extraction detecting portion, wherein the watermark embedding portion
  • the processing process is: pre-processing the embedded original watermark image, obtaining the energy value and the index value to be embedded, and then screening out the candidate vertices satisfying the condition from the three-dimensional model of the watermark to be embedded according to the first preset screening condition, and The local spherical coordinate system of the candidate vertices is established.
  • the processing process of the watermark extraction detection part is: first, according to the first
  • the preset filter condition selects the three-dimensional model to be detected and may embed the vertices to establish a partial spherical sitting that may embed the vertices.
  • the target system obtains the spherical coordinate value, and extracts the index value and the energy value, then inversely transforms back into the spatial domain to obtain the extracted watermark image, and finally performs correlation calculation on the extracted watermark image and the original watermark image to determine whether the three-dimensional model contains a watermark;
  • the invention realizes the invisibility embedding of the watermark of the three-dimensional digital model, and does not need to be repeatedly embedded, can realize the online blind extraction of the watermark after embedding, and can resist the affine transformation attack and the shear attack, and the watermark
  • the content is a meaningful visual watermark, which has great practical value.
  • FIG. 1 is a schematic flow chart of a method for embedding and extracting a three-dimensional blind watermark in a partial spherical coordinate system according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a blind watermark embedding step according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of a three-dimensional digital model of a watermark to be embedded according to an embodiment of the present invention
  • FIG. 6 is a three-dimensional digital model embedded in a watermark according to an embodiment of the present invention.
  • FIG. 7 is a schematic flowchart of a blind watermark extraction detection step according to an embodiment of the present invention.
  • FIG. 8 is a watermark image obtained by performing watermark extraction on a three-dimensional model embedded in a watermark according to an embodiment of the present invention.
  • FIG. 9 is a schematic block diagram of a three-dimensional blind watermark embedding and extracting detection apparatus in a partial spherical coordinate system according to an embodiment of the present invention.
  • the invention provides a new blind watermarking method for transform domain coding in a partial spherical coordinate system, including embedding Into the part and the extraction detection part, the main implementation idea is: embedding the index value and energy value of the spectrum energy matrix of the original watermark image into the custom coordinates of the local spherical coordinate system of the model vertex, and then extracting the local spherical coordinate system The index value and the energy value are inversely transformed back into the spatial domain to obtain the extracted watermark image, and the watermark image is compared with the original watermark image to determine whether the watermark is included; wherein the transform domain of the embedded portion is a two-dimensional discrete cosine transform The transform domain of the extracted detection portion is a two-dimensional inverse discrete cosine transform, and the watermark image is a binary image.
  • blind watermark embedding step S1 blind watermark extraction detection step S2;
  • the blind watermark embedding step S1 includes:
  • Step S11 pre-processing the original watermark image to be embedded, and obtaining the attribute value (L, J, I) of the watermark element of the original watermark image;
  • L is the row index coded value
  • J is the column index coded value
  • I is the element value, ie, the energy value
  • a picture with a size of W1 ⁇ W2 and a content of the letter L is selected as the original watermark picture, which is denoted as S; as shown in FIG. 3, the original watermark picture is obtained, and FIG. 4 is obtained by preprocessing the original watermark picture. image.
  • the step S11 specifically includes:
  • Step S111 using a two-dimensional discrete cosine transform formula to perform two-dimensional discrete cosine transform on the original watermark image to be embedded, to obtain a spectral matrix S1 of the discrete cosine transform domain of the original watermark image;
  • the two-dimensional discrete cosine transform formula is:
  • W1 represents the length of the original watermark picture
  • W2 represents the width of the original watermark picture
  • the original watermark picture is a binary watermark picture
  • the matrix of the original watermark picture is represented as f(x, y)
  • S1(u, v A spectral matrix obtained by discrete cosine transform of a matrix f(x, y) of the original watermark image, the spectral matrix being a real matrix with positive and negative coefficients.
  • Step S112 extracting the positive and negative coefficient matrix of the spectrum matrix S1 as the recovery key K1, performing absolute value on the spectrum matrix S1, and performing normalization processing to obtain a matrix S2, and the maximum value of the matrix S2.
  • the recovery key K2 As the recovery key K2;
  • the spectrum coefficient matrix is used as the secret key K1
  • the normalization coefficient is used as the secret key K2
  • the scrambling parameter is used as the secret key K3.
  • Step S113 performing Arnold scrambling on the matrix S2 by using a scrambling matrix to obtain a matrix S3, where the scrambling matrix is:
  • each element in the matrix S3 has three Attribute values (m, n, I), where m is the row index value, n is the column index value, and I is the element value, ie the energy value;
  • Step S114 using the following formula to respectively encode the attribute values m, n of each element in the matrix S3 into an angle value, to obtain a new attribute value (L, J, I) of each element of the matrix S3;
  • ⁇ and ⁇ are preset constants, ⁇ is a value between 0 and 1, and considering the invisibility of the watermark, the alpha value should be set to a value between 0 and 0.5, and this value is embedded.
  • the visual effect of the 3D model is minimally determined as the basis for determination; thus, the new attribute value (L, J, I) of each element of the matrix S3 is obtained, where L is the row index encoding value and J is the column index encoding value.
  • I is an energy value
  • L i represents an index code value of the i-th row
  • J j represents an index code value of the j-th column.
  • Step S12 Filter all candidate vertices satisfying the screening condition from the three-dimensional model to be embedded in the watermark according to the first preset screening condition;
  • a three-dimensional model to be embedded in the watermark is a vertex of the three-dimensional model to be embedded in the watermark, and the watermark information is embedded in the attributes of the vertex.
  • the first preset screening condition includes: a first screening condition, a second screening condition, and a third screening condition, wherein the first screening condition is a centroid neighbor point of a vertex and a centroid of a ring neighbor point
  • the distance maximum ratio needs to be smaller than the threshold A
  • the second screening condition is that the normal angle under two different definitions of the centroid of a ring neighbor point needs to be greater than the threshold B
  • the third screening condition is that the candidate vertex is not Neighbor point.
  • the reason for setting the second screening condition is that when the local spherical coordinate system is established for the vertices of the three-dimensional model, it is required that the normal n a and the normal n t of the vertices of each three-dimensional model cannot overlap or cannot coincide.
  • the step S12 specifically includes:
  • Step S121 the centroid link neighbor point three-dimensional model is calculated to be embedded watermarks vertices V i to Z i, are connected to a ring neighbor point Z i and V i, and to calculate the appropriate distance, if each of the distance If the maximum ratio is greater than the threshold A, the vertex is culled, and all the vertices of the three-dimensional model are traversed by the operation to obtain all the first candidate vertices satisfying the condition;
  • Step S122 calculating normal directions n a and n t for the first candidate vertex, if the angle between the normal n a and the normal n t is less than the threshold B, then the first candidate vertex is eliminated, for all The first candidate vertex traverses this operation to obtain all second candidate vertices satisfying the condition;
  • n a is defined as:
  • n t is defined as:
  • Step S123 it is checked whether all the second candidate vertices satisfying the condition have vertices which are mutually neighbors, and if so, cull them, and the remaining second candidate vertices are candidate vertices of the watermark embedding.
  • Step S13 establishing a local spherical coordinate system under the custom for the candidate vertices, and determining a spherical coordinate value of each of the candidate vertices among them, ⁇ , r are three attribute values of each candidate vertex satisfying the screening condition;
  • step S13 needs to establish respective local spherical coordinate systems for the watermarkable candidate vertices obtained in step S12, and determine the spherical coordinate values of each candidate vertex.
  • the general spherical coordinate system and the rectangular coordinate system are transformed as follows:
  • step S13 the spherical coordinate value Finding the spherical coordinate value of the candidate vertex for the customized encoded spherical coordinate value
  • the formula is as follows:
  • (x, y, z) is the coordinate value of the candidate vertex in the Cartesian coordinate system
  • (x 0 , y 0 , z 0 ) is the centroid point coordinate of the ring neighbor of the candidate vertex
  • ⁇ is the centroid point to the neighbor point The mean of the distance.
  • the candidate vertex V i its spherical coordinate system is determined by the one-ring neighbor centroids Z i , n a , n t obtained in step 12, and the centroid Z i is taken as the origin of the spherical coordinate system, and the centroid normal is n a
  • the normal n t is projected into the plane defined by the centroid Z i and the normal n a , and the obtained projection vector is taken as the X axis of the spherical coordinate system.
  • the angle between the vector of the centroid Z i to the vertex V i and the Z axis of the spherical coordinate system is recorded as
  • the forward angle referred to the X-axis spherical coordinates is ⁇ i
  • the centroid Z i to vertex V i is the distance from the centroid Z i to the ratio of the distance of a ring neighbor point vertex V i mean is denoted r i.
  • the spherical coordinate value of each candidate vertex can be regarded as its three attributes, these three attributes do not change with the change of the coordinate system, and have strong stability.
  • Step S14 comparing the attribute value of the watermark element with the attribute value of all candidate vertices satisfying the screening condition, searching for a candidate vertex that has the smallest difference from the attribute value of the watermark element as a point embedded in the watermark element, and changing the candidate The position of the vertex in its spherical coordinate system, making it
  • the value of ⁇ is equal to the row index code value L and the column index code value J of the watermark element, respectively, and the r value thereof is equal to the element value I of the watermark element to embed the index code value and the energy value of the watermark element;
  • the candidate vertices are culled in all candidate vertices satisfying the screening condition, and all the watermark elements of the original watermark image are traversed until the above is completely embedded;
  • the step S14 is an embedded part of the watermark.
  • the embedding of the watermark image needs to first consider the visual difference between the 3D model and the original 3D model after embedding the watermark, so additional constraints are needed when embedding the watermark. From step 11 and step 13, respectively, the attribute values of the original watermark image and the three attribute values of the candidate vertex are obtained, and the embedding is performed according to the size of the watermark element attribute value I, in the order of whether it is large to small or small to large. You can set it yourself.
  • the essence of the step of embedding the watermark is to determine which candidate vertex is embedded by the watermark element by the attribute value difference, and then determine the coordinate value of the candidate vertex after the position is changed by the watermark element attribute value; wherein, by changing the candidate vertex in it Position in the spherical coordinate system, making it
  • the value of ⁇ (under the custom) is equal to the index code value L, J of the watermark element, respectively, such that its r value (under the custom) is equal to the watermark element value I, that is, the distance between the vertex and the centroid point of mass and the centroid to one
  • the ratio of the mean value of the ring neighbor point distance is equal to the watermark element value I, thereby realizing the purpose of embedding the index information and the energy value.
  • the blind watermark extraction detecting step S2 includes:
  • Step S21 Filter all possible embedded vertices satisfying the screening condition from the three-dimensional model to be detected according to the first preset screening condition;
  • the step S21 includes:
  • Step S211 the centroid point of a neighboring ring vertex V i of the three-dimensional model calculated Z i to be detected, are connected to a ring neighbor point Z i and V i, and to calculate the appropriate distance, if the respective distance
  • the maximum ratio is greater than the threshold A (the threshold set when the watermark is embedded), then the vertex is culled, and all the vertices of the three-dimensional model are traversed by the operation to obtain all the first possible embedded vertices satisfying the condition;
  • Step S212 calculating normals n a and n t under two different definitions for the first possible embedded vertex, if the angle between the centroid normal n a and the normal n t of the vertex-ring neighbor point is less than the threshold B (the threshold set when the watermark is embedded), then culling the first possible embedded vertex, traversing the operation for all the first possible embedding vertices, and obtaining all the second possible embedding vertices satisfying the condition;
  • the threshold B the threshold set when the watermark is embedded
  • n a is defined as:
  • n t is defined as:
  • Step S213 it is checked whether all the second possible embedding vertices satisfying the condition have vertices which are mutually neighbors, and if so, cull them, and the remaining second possible embedding vertices are the finally selected possible embedding vertices.
  • Step S22 establishing a local spherical coordinate system under the custom embedding vertices, and determining a spherical coordinate value of each of the possible embedded vertices among them, ⁇ , r are three attribute values of each possible embedding vertex that satisfy the screening condition;
  • step S22 is to establish a local spherical coordinate system and acquire a spherical coordinate value. From step 21, it is possible to embed the vertices. Step 22 needs to establish respective spherical coordinate systems for these possible embedding vertices, and determine the spherical coordinate values of each possible embedding vertex, and the spherical coordinate values are the values of the custom encoding when the watermark is embedded. .
  • the establishment of the local spherical coordinate system and the acquisition of the spherical coordinate value are as follows in step S13, thereby obtaining the possible embedding of the vertex.
  • Step S23 combining the attribute values of the possible embedding vertices with the index value and the energy value extraction of each of the possible embedding vertices satisfying the screening condition in the three-dimensional model, to obtain a matrix S4;
  • the step S23 includes:
  • Step S231 using the following formula to attribute the attribute value of the possible embedding vertex Perform anti-coding
  • Step S232 establishing a zero matrix S4 of the same size as the matrix S3, each matrix element has three attributes (m, n, 0), m and n are row and column values, respectively, and the possible vertices are embedded.
  • the value of ⁇ satisfies the following inequality
  • the r value of the possible embedding vertex is replaced by the zero value of the m row and n column of the matrix S3; all possible embedding vertices are traversed to find the vertex satisfying the index threshold condition, and the r value is replaced
  • a new matrix S4 is obtained;
  • ⁇ 1 and ⁇ 2 respectively represent a set threshold value, which satisfies the above inequality
  • the value of ⁇ is the index value
  • the corresponding r value is the energy value.
  • Step S24 inversely transforming the matrix S4 back into the airspace to obtain an extracted watermark image
  • the step S24 includes:
  • Step S241 using the recovery key K3 in step S113 as a restore key, Arnold reduction of the matrix S4, to obtain a reduction matrix S5;
  • Step S242 multiplying the elements in the reduction matrix S5 by the recovery key K2 to obtain a matrix S6;
  • Step S243 using the recovery key K1 in step S112 to multiply the matrix S6, thereby obtaining a spectrum matrix S7;
  • Step S244 performing a two-dimensional inverse discrete cosine transform on the spectrum matrix S7 by using a two-dimensional inverse discrete cosine transform formula to obtain a matrix S8, where the matrix S8 is an extracted watermark image, and the two-dimensional inverse discrete cosine transform formula as follows:
  • S8(x, y) represents a watermark image matrix S8 obtained by inverse discrete cosine transform from the extracted spectral matrix S7(u, v); S8 is as shown in FIG.
  • Step S25 Calculate a correlation between the extracted watermark image and the original watermark image by using a watermark correlation calculation formula, and if the correlation is greater than an experience threshold, prove that the three-dimensional model includes a watermark.
  • the watermark correlation calculation formula is:
  • W1 represents the length of the original watermark picture
  • W2 represents the width of the original watermark picture
  • S(i,j) represents the matrix of the original watermark picture
  • S(i,j) represents the matrix of the extracted watermark picture
  • ⁇ represents the watermark correlation Degree
  • the invention also provides a three-dimensional blind watermark embedding and extraction detecting device in a partial spherical coordinate system. As shown in FIG. 9, the device comprises: a blind watermark embedding module 1 and a blind watermark extraction detecting module 2.
  • the blind watermark embedding module 1 includes:
  • the pre-processing sub-module 11 is configured to pre-process the original watermark image to be embedded, and obtain the attribute value (L, J, I) of the watermark element of the original watermark image;
  • L is the row index code value
  • J is the column index code value
  • I is the element value, ie the energy value
  • a first screening sub-module 12 configured to filter, from the three-dimensional model of the watermark to be embedded, all candidate vertices satisfying the screening condition according to the first preset screening condition;
  • a first coordinate system establishing sub-module 13 configured to establish a local spherical coordinate system under the customization of the candidate vertices, and determine a spherical coordinate value of each of the candidate vertices among them, ⁇ , r are three attribute values of each candidate vertex satisfying the screening condition;
  • the watermark embedding sub-module 14 is configured to compare the attribute value of the watermark element with the attribute value of all the candidate vertices satisfying the filtering condition, and search for a candidate vertex that has the smallest difference from the attribute value of the watermark element as the watermark element embedded in the watermark element.
  • ⁇ is equal to the row index code value L and the column index code value J of the watermark element, respectively, and the r value thereof is equal to the element value I of the watermark element to embed the index code value and the energy value of the watermark element;
  • the candidate vertices are culled in all candidate vertices satisfying the screening condition, and all the watermark elements of the original watermark image are traversed until the above is completely embedded;
  • the blind watermark extraction detection module 2 includes:
  • a second screening sub-module 21 configured to filter, from the three-dimensional model to be detected, all possible embedded vertices satisfying the screening condition according to the first preset screening condition
  • a second coordinate system establishing sub-module 22 configured to establish a local spherical coordinate system under the custom embedding vertices, and determine a spherical coordinate value of each of the possible embedded vertices among them, ⁇ , r are three attribute values of each possible embedding vertex that satisfy the screening condition;
  • the extraction sub-module 23 is configured to perform an index value and an energy value extraction on the possible embedded vertex satisfying the filter condition in the three-dimensional model in combination with the attribute value of the possible embedding vertex, to obtain a matrix S4;
  • the determining sub-module 25 is configured to calculate a correlation between the extracted watermark image and the original watermark image by using a watermark correlation calculation formula, and if the correlation is greater than an experience threshold, prove that the three-dimensional model includes a watermark.
  • the invention provides a method and device for three-dimensional blind watermark embedding and extracting detection in a partial spherical coordinate system, and combines the idea of airspace and frequency domain to realize invisibility embedding of watermark (so-called invisibility embedding refers to model embedding After the watermark, it does not cause obvious visual difference of the model) and the blind detection of the watermarked 3D model, without the participation of the original 3D model, and can resist the affine attack and the cut attack, and the watermark is a visual watermark, which has Great practical value.

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

L'invention concerne un procédé et un appareil de détection d'intégration et d'extraction d'un filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales, applicables au domaine des filigranes numériques tridimensionnels. Une partie d'intégration (S1) consiste : à prétraiter tout d'abord une image de filigrane d'origine à intégrer pour obtenir une valeur d'énergie et une valeur d'indice à intégrer, puis à filtrer des sommets candidats satisfaisant une condition à partir d'un modèle tridimensionnel d'un filigrane à intégrer, à établir des systèmes de coordonnées sphériques locales des sommets candidats, et enfin à intégrer des informations d'indice et la valeur d'énergie en effectuant une substitution d'attribut sous la contrainte de l'invisibilité, ce qui permet d'achever un processus d'intégration de l'image de filigrane ; et une partie de détection d'extraction (S2) consiste : à filtrer tout d'abord des sommets intégrés possibles, à établir des systèmes de coordonnées sphériques locales des sommets intégrés possibles pour obtenir des valeurs de coordonnées sphériques, à extraire la valeur d'indice et la valeur d'énergie, puis à réaliser une transformation inverse pour revenir à un domaine spatial pour obtenir une image de filigrane extraite, et enfin à réaliser un calcul pertinent sur l'image de filigrane extraite et l'image de filigrane d'origine pour déterminer si le filigrane est présent. L'intégration d'invisibilité et l'extraction aveugle d'un filigrane aveugle visuel de modèle tridimensionnel sont obtenues.
PCT/CN2017/115765 2017-12-13 2017-12-13 Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales WO2019113810A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/115765 WO2019113810A1 (fr) 2017-12-13 2017-12-13 Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/115765 WO2019113810A1 (fr) 2017-12-13 2017-12-13 Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales

Publications (1)

Publication Number Publication Date
WO2019113810A1 true WO2019113810A1 (fr) 2019-06-20

Family

ID=66819832

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/115765 WO2019113810A1 (fr) 2017-12-13 2017-12-13 Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales

Country Status (1)

Country Link
WO (1) WO2019113810A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1487421A (zh) * 2003-08-11 2004-04-07 深圳大学 基于虚拟光学的三维数字水印嵌入/检测方法及装置
CN101178805A (zh) * 2007-12-12 2008-05-14 北京航空航天大学 基于Octree编码的三维网格数字盲水印方法
CN101833743A (zh) * 2010-04-01 2010-09-15 杭州电子科技大学 基于图像的三维网格模型盲水印方法
CN102622721A (zh) * 2012-03-06 2012-08-01 福建师范大学 基于深度图像映射的三维网格模型盲水印方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1487421A (zh) * 2003-08-11 2004-04-07 深圳大学 基于虚拟光学的三维数字水印嵌入/检测方法及装置
CN101178805A (zh) * 2007-12-12 2008-05-14 北京航空航天大学 基于Octree编码的三维网格数字盲水印方法
CN101833743A (zh) * 2010-04-01 2010-09-15 杭州电子科技大学 基于图像的三维网格模型盲水印方法
CN102622721A (zh) * 2012-03-06 2012-08-01 福建师范大学 基于深度图像映射的三维网格模型盲水印方法

Similar Documents

Publication Publication Date Title
Yarlagadda et al. Satellite image forgery detection and localization using gan and one-class classifier
Lu et al. Multimedia forensic hash based on visual words
Kashyap et al. An evaluation of digital image forgery detection approaches
CN108335256B (zh) 局部球坐标系下的三维盲水印嵌入和提取检测方法及装置
Thajeel et al. State of the art of copy-move forgery detection techniques: a review
Mohammed et al. Boosting image forgery detection using resampling features and copy-move analysis
Hashmi et al. A copy-move image forgery detection based on speeded up robust feature transform and Wavelet Transforms
Cao et al. A recursive embedding algorithm towards lossless 2D vector map watermarking
Luo et al. Convolutional neural networks-based stereo image reversible data hiding method
Flenner et al. Resampling forgery detection using deep learning and a-contrario analysis
CN103377457A (zh) 一种矢量地理数据精确认证脆弱水印方法
Liu et al. Zero-watermarking method for resisting rotation attacks in 3D models
Nawaz et al. Single and multiple regions duplication detections in digital images with applications in image forensic
Diwan et al. Unveiling copy-move forgeries: Enhancing detection with SuperPoint keypoint architecture
Taya et al. Detecting tampered regions in JPEG images via CNN
WO2019113810A1 (fr) Procédé et appareil de détection d'intégration et d'extraction de filigrane aveugle tridimensionnel dans un système de coordonnées sphériques locales
CN116823940A (zh) 一种三维场景移动物体检测方法
Muzaffer et al. Recent keypoint based copy move forgery detection techniques
Bertojo et al. A very fast copy-move forgery detection method for 4k ultra hd images
Nataraj et al. Holistic image manipulation detection using pixel co-occurrence matrices
Dixit et al. Copy-move image forgery detection using frequency-based techniques: a review
Patel et al. Review of digital image forgery detection
Wu et al. Review of digital watermarking for 2d-vector map
Banerjee et al. Biometric steganography using face geometry
Fang et al. A fire detection and localisation method based on keyframes and superpixels for large-space buildings

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17934568

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 22.09.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17934568

Country of ref document: EP

Kind code of ref document: A1