Zero watermark generation and detection method, device, equipment, medium and product
By constructing a code data feature matrix to generate zero-watermarked images, the problems of code copyright protection adaptability and logical violation in existing technologies are solved, and a zero-watermarking scheme with high robustness and copyright protection is achieved.
Patent Information
- Application Number
- CN202511247812.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-09-03
- Publication Date
- 2025-10-21
- Estimated Expiration
- 2045-09-03
AI Technical Summary
Existing digital watermarking methods cannot adapt to the characteristics of code data, and embedded watermarks may disrupt the business logic of the code, making it difficult to protect code copyright.
By constructing a feature matrix based on the number of key characters in the code data, a zero-watermark image is generated. Then, by using XOR operation and scrambling, a zero-watermark image not embedded in the code is generated. This image is then used in conjunction with the registration management center for monitoring and copyright information registration.
It effectively resists attacks without affecting code usability, provides copyright protection for code files and post-attack accountability, and safeguards the interests of code owners.
Smart Images

Figure CN120823085A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of zero watermark technology, and in particular to a zero watermark generation and detection method, device, equipment, medium and product. Background Art
[0002] During the transmission process of source code, it faces the risk of illegal transmission, copying and theft, which not only seriously infringes the legitimate rights and interests of developers, but also hinders the healthy development of the cloud computing industry.
[0003] As an important branch of information hiding technology, digital watermarking technology can effectively protect copyright information and achieve tracking and tracing during data flow, and has become a key technical means for data security.
[0004] However, existing digital watermarking methods based on text data mainly use text semantics and text formatting to embed digital watermark information. Code data, as a plain text file, does not support rich text-related settings (such as text style, document layout, etc.), and the embedded watermarking method has the risk of destroying the code business logic. Therefore, there is an urgent need for a solution that adapts to the characteristics of code data without destroying the code business logic to solve the current dilemma faced by code copyright protection. Summary of the Invention
[0005] The present application provides a zero watermark generation and detection method, apparatus, device, medium and product to solve the problem in the prior art that digital watermark information is embedded using text semantics and text format, which is not suitable for code data and will destroy the code business logic.
[0006] To achieve the above objectives, the present invention provides a method for generating a zero watermark, comprising: Constructing a first character quantity set according to the number of each key character in the code data to be protected; wherein the key character is a predefined single character; Constructing a first feature matrix based on the size relationship between different elements in the first character quantity set; A zero-watermark image is generated based on a preset watermark image and the first feature matrix.
[0007] As an improvement to the above solution, constructing a first feature matrix according to the size relationship of different elements in the first character quantity set includes: Compare the p-th element and the q-th element in the first set of character quantities; When the pth element in the first character quantity set is greater than or equal to the qth element, determining the element in the mth row and nth column of the first feature matrix to be a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the first character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the first feature matrix is determined to be a second value.
[0008] As an improvement to the above solution, the first character quantity set is constructed according to the quantity of each key character in the code data to be protected, including: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be protected is traversed, the number of each element in the second single character set in the code data to be protected is counted, and the first character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0009] As an improvement to the above solution, generating a zero-watermark image based on a preset watermark image and the first feature matrix includes: An exclusive-OR operation is performed on the pixel values of the preset watermark image and the first feature matrix to generate the zero-watermark image.
[0010] As an improvement to the above solution, generating a zero-watermark image based on a preset watermark image and the first feature matrix includes: Performing scrambling processing on the preset watermark image and / or the first characteristic matrix to obtain a first watermark image and / or a second characteristic matrix; An exclusive-OR operation is performed on the pixel values of the first watermark image and the first feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the preset watermark image and the second feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the first watermark image and the second feature matrix to obtain the zero-watermark image.
[0011] To achieve the above objectives, the present invention further provides a zero watermark detection method, including: Constructing a second character quantity set according to the number of each key character in the code data to be detected; wherein the key character is a predefined single character; constructing a third feature matrix based on the size relationship of different elements in the second character quantity set; Obtain zero-watermarked images from the registration management center; Obtaining a second watermark image based on the zero watermark image and the third characteristic matrix; According to the similarity between the preset watermark image and the second watermark image, it is determined whether a zero-watermark image is detected.
[0012] As an improvement to the above solution, constructing a third feature matrix according to the size relationship of different elements in the second character quantity set includes: Compare the p-th element and the q-th element in the second set of character quantities; When the pth element in the second character quantity set is greater than or equal to the qth element, determining that the element in the mth row and nth column of the third feature matrix is a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the second character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the third feature matrix is determined to be a second value.
[0013] As an improvement to the above solution, the second character quantity set is constructed according to the quantity of each key character in the code data to be detected, including: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be detected is traversed, the number of each element in the second single character set in the code data to be detected is counted, and the second character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0014] As an improvement to the above solution, the step of determining whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image includes: Calculating the similarity based on the pixel values of the preset watermark image and the pixel values of the second watermark image; When the similarity is greater than a preset similarity threshold, it is determined that a zero-watermark image is detected; When the similarity is less than or equal to the preset similarity threshold, it is determined that no zero-watermark image is detected.
[0015] As an improvement to the above solution, obtaining the second watermark image based on the zero watermark image and the third characteristic matrix includes: An exclusive-OR operation is performed on the zero-watermark image and the third characteristic matrix to obtain the second watermark image.
[0016] As an improvement to the above solution, obtaining the second watermark image based on the zero watermark image and the third characteristic matrix includes: Performing an XOR operation on the pixel values of the zero-watermark image and the third characteristic matrix to obtain a third watermark image; performing an inverse scrambling process on the third watermark image to obtain the second watermark image; or Performing scrambling processing on the third characteristic matrix to obtain a fourth characteristic matrix; performing an XOR operation on the pixel values of the zero watermark image and the fourth characteristic matrix to obtain the second watermark image; or, The third characteristic matrix is scrambled to obtain a fifth characteristic matrix; an exclusive-OR operation is performed on the pixel values of the zero watermark image and the fifth characteristic matrix to obtain a fourth watermark image; and the fourth watermark image is descrambled to obtain the second watermark image.
[0017] To achieve the above objectives, the present invention further provides a zero watermark generation device, comprising: A first constructing module, configured to construct a first character quantity set according to the quantity of each key character in the code data to be protected; A second construction module is configured to construct a first feature matrix based on the size relationship between different elements in the first character quantity set; The first XOR module is used to generate a zero-watermark image based on a preset watermark image and the first feature matrix.
[0018] To achieve the above objectives, the present invention further provides a zero watermark detection device, comprising: A third constructing module is used to construct a second character quantity set according to the quantity of each key character in the code data to be detected; a fourth constructing module, configured to construct a third feature matrix according to a size relationship between different elements in the second character quantity set; An acquisition module is used to obtain a zero-watermark image from a registration management center; A second XOR module is used to obtain a second watermark image based on the zero watermark image and the third characteristic matrix; The detection module is used to determine whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image.
[0019] To achieve the above-mentioned objectives, an embodiment of the present application also provides an electronic device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the above-mentioned zero watermark generation method or the above-mentioned zero watermark detection method when executing the computer program.
[0020] To achieve the above-mentioned purpose, an embodiment of the present application also provides a computer-readable storage medium, which includes a stored computer program; wherein, when the computer program is running, it controls the device where the computer-readable storage medium is located to execute the above-mentioned zero watermark generation method or the above-mentioned zero watermark detection method.
[0021] To achieve the above objectives, an embodiment of the present application further provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the above-mentioned zero watermark generation method or the above-mentioned zero watermark detection method.
[0022] Compared with the prior art, the embodiment of the present application provides a method, device, equipment, medium and product for generating and detecting a zero watermark, which constructs a first character quantity set by the number of each key character in the code data to be protected, and can accurately capture the character distribution characteristics in the code data to be protected, providing a basis for the subsequent construction of the first feature matrix, and achieving deep adaptation with the characteristics of the code data. Moreover, the character distribution characteristics have strong stability, and the zero watermark image constructed using them can effectively resist addition, deletion, reordering and composite attack behaviors, and has higher robustness. Furthermore, the zero watermark image constructed by the embodiment of the present application does not need to be embedded in the code to be protected, will not modify the code file, and can avoid destroying the original business logic of the code. Ultimately, the copyright protection of the code file can be achieved without affecting the availability of the code, providing an effective basis for subsequent accountability for the leakage, theft or illegal transmission of the code file, and safeguarding the interests of the code owner. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] Figure 1 This is a flowchart of a zero watermark generation method provided by an embodiment of the present application; Figure 2 This is a flow chart of a zero watermark detection method provided by an embodiment of the present application; Figure 3 This is a flow chart of a zero watermark generation and detection method provided by an embodiment of the present application; Figure 4 This is a structural block diagram of a zero watermark generation device provided in an embodiment of the present application; Figure 5 This is a structural block diagram of a zero watermark detection device provided in an embodiment of the present application; Figure 6 This is a structural block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0024] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.
[0025] In the description of this application, the size of the serial numbers of the following processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.
[0026] In the description of this application, the terms "exemplary" or "for example" are used to indicate an example, illustration, or description. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.
[0027] In the description of this application, the terms "first," "second," etc. are used to distinguish similar objects and are not necessarily used to describe a specific order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate, so that the embodiments of the application described herein can, for example, be implemented in an order other than that illustrated or described herein. In addition, the terms "including" and "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or device that includes a series of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements that are not explicitly listed or that are inherent to such process, method, product, or device. The term "based on" means "based at least in part on." The term "according to" means "based at least in part on." The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; and the term "some embodiments" means "at least some embodiments." The term "and / or" means at least one of the connected objects, for example, A and / or B, which includes A alone, B alone, and both A and B. Unless otherwise stated, the term "plurality" means two or more than two.
[0028] See also Figure 1 , Figure 1 : is a flowchart of a zero watermark generation method provided in an embodiment of the present application, the zero watermark generation method comprising: S11. Constructing a first character quantity set according to the number of key characters in the code data to be protected; wherein the key characters are predefined single characters; It is worth noting that this embodiment of the application constructs a first character quantity set based on the number of key characters in the code data to be protected. This accurately captures the character distribution characteristics of the code data to be protected, providing a foundation for the subsequent construction of the first feature matrix and achieving deep adaptation to the characteristics of the code data. Furthermore, the character distribution characteristics are highly stable, and the zero-watermark image constructed using them can effectively resist addition, deletion, reordering, and combined attacks, demonstrating enhanced robustness.
[0029] Exemplarily, key characters are predefined single characters that can be defined directly by the user or extracted from a user-defined key information set. Specifically, based on the data structure of the development language used for the code data to be protected, mandatory text symbols in the data structure are used to form a key information set. All single characters of each element in the key data set are extracted, and these single characters are referred to as key characters.
[0030] Exemplarily, a single character set consisting of key characters is set, and the number of key characters appearing in the code data to be protected is directly counted to form a first character quantity set; the first character quantity set is composed of the number of key characters in the code data to be protected, and the total number of its elements is the number of types of key characters in the code data to be protected.
[0031] Exemplarily, the number of each element in the single character set in the code data to be protected can also be counted to form a first character quantity set; the first character quantity set includes not only the number of key characters in the code data to be protected, but also the number of key characters that appear in the key character set but do not appear in the code data to be protected. The set is specifically composed of the number of each element in the key character set in the code data to be protected, and the total number of elements is the total number of elements in the key character set.
[0032] S12. Constructing a first feature matrix based on the size relationship between different elements in the first character quantity set; It is worth noting that the embodiment of the present application not only realizes the feature extraction of the code data to be protected, but also, based on the extracted features, constructs a first feature matrix using character distribution features, which has strong stability, so that the zero-watermark image constructed using it can effectively resist addition, deletion, reordering and composite attack behaviors, and has higher robustness.
[0033] S13. Generate a zero-watermark image based on the preset watermark image and the first feature matrix.
[0034] Exemplarily, the preset watermark image may be provided by a user and used as an original watermark image for subsequent generation and detection of a zero-watermark image.
[0035] The zero-watermark image constructed in this embodiment does not need to be embedded in the protected code, does not modify the code file, and can avoid damaging the original business logic of the code. Ultimately, it can achieve copyright protection for code files without affecting the usability of the code, provide an effective basis for post-event accountability in the event of code file leakage, theft, or illegal transmission, and safeguard the interests of code owners.
[0036] Furthermore, the generated zero-watermark image is registered with a registration management center (e.g., a third-party organization) to facilitate dynamic monitoring and timely detection of abnormal dissemination behavior. Of course, the generated zero-watermark image can also be registered with the registration management center along with the required copyright information (e.g., key k) to facilitate subsequent acquisition of copyright information.
[0037] In an optional embodiment, constructing a first feature matrix according to the size relationship of different elements in the first character quantity set includes: Compare the p-th element and the q-th element in the first set of character quantities; When the pth element in the first character quantity set is greater than or equal to the qth element, determining the element in the mth row and nth column of the first feature matrix to be a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the first character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the first feature matrix is determined to be a second value.
[0038] The embodiment of the present application establishes an orderly first feature matrix construction process by determining whether the element in the mth row and nth column of the first feature matrix is the first value or the second value according to the size relationship between the pth element and the qth element in the first character quantity set, based on the correspondence between p and m, q and n. This can effectively improve the construction speed and lay the foundation for the efficient generation of zero-watermark images.
[0039] For example, to enrich the first feature matrix, it is necessary to fully utilize the first character quantity set and preset the mapping relationship between the element positions of the first feature matrix and the element sizes of the first character quantity set as follows: let the first preset relationship be: p = m, and the second preset relationship be: q = n + (the total number of elements in the first character quantity set ÷ 2); or let the first preset relationship be: p = m + (the total number of elements in the first character quantity set ÷ 2), and the second preset relationship be: q = n. This can maximize the total number of elements in the first feature matrix, thereby improving data security.
[0040] For example, the first character quantity set The total number of elements is 60, that is, the number of the first character set There are 60 elements in it. Traverse the first character quantity set Build The first characteristic matrix of , where r = 30. The value of the element in the mth row and nth column of the first characteristic matrix is , as shown in the formula:
[0041] Where, is the mth element of the first character quantity set, The n+30th element in the first character quantity set.
[0042] Here, the first characteristic matrix consists of 0 and 1. In order to ensure the smooth progress of the subsequent XOR operation, the watermark image is preset as a binary image. In this way, the first watermark image obtained after the scrambling process is also a binary image.
[0043] In an optional embodiment, constructing a first character quantity set according to the quantity of each key character in the code data to be protected includes: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be protected is traversed, the number of each element in the second single character set in the code data to be protected is counted, and the first character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0044] In the embodiment of the present application, after scrambling the first single character set, a second single character set is obtained, and then the number of each element in the second single character set in the code data to be protected is counted to form a first character quantity set, thereby improving the security of the first character quantity set, further ensuring data security, and increasing the difficulty for attackers to extract and forge zero watermarks.
[0045] Specifically, the first single character set is scrambled by Logistic chaotic mapping to obtain the second single character set: Generating a chaotic sequence whose total number of elements is the same as the total number of elements in the first single character set through a Logistic chaotic map; Constructing a one-to-one correspondence between the first single character set and the elements of the chaotic sequence; The chaotic sequence is reordered according to data size, and the first single-character sequence is reordered according to the reordered chaotic sequence to obtain the second single-character set.
[0046] For example, a key information set is constructed based on the data structure of the development language used by the code data to be protected. ,in Indicates that the set includes mandatory text symbols contained in the development language (i.e., code engineering) used by the code data to be protected, such as const, let, {}, (), etc. Indicates the number of selected mandatory text symbols, that is, the total number of elements in the key information set.
[0047] Let the first single character set , ,in Represents all the single characters that make up the elements in K, including 52 uppercase and lowercase letters and symbols ',', '.', '{', '(', '[', '}', ')', ']', a total of 60. This affects the feature matrix of subsequent construction, so in order to ensure randomness, the set Logistic chaotic mapping is used for preprocessing, and its mapping formula is: ;in, represents the control parameter, , , represents the state variable, Indicates the current state, Indicates the next state, Represents the Logistic chaotic mapping function. Take the limit value , studies have shown that when When , the mapping is in a chaotic state, here we take , set the initial state , Represents the total number of elements in the key information set. After scrambling through the mapping formula, the second single character set is obtained as . Traverse the code data to be protected and obtain the first character quantity set , ,in, express The number of the j-th element in the code data to be protected.
[0048] In an optional embodiment, generating a zero-watermark image based on a preset watermark image and the first feature matrix includes: An exclusive-OR operation is performed on the pixel values of the preset watermark image and the first feature matrix to generate the zero-watermark image.
[0049] The embodiment of the present application obtains the second watermark image by directly performing an XOR operation on the zero-watermark image and the first characteristic matrix, thereby being able to quickly generate a zero-watermark image.
[0050] In an optional embodiment, generating a zero-watermark image based on a preset watermark image and the first feature matrix includes: Performing scrambling processing on the preset watermark image and / or the first characteristic matrix to obtain a first watermark image and / or a second characteristic matrix; An exclusive-OR operation is performed on the pixel values of the first watermark image and the first feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the preset watermark image and the second feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the first watermark image and the second feature matrix to obtain the zero-watermark image.
[0051] The embodiment of the present application changes the original pixel arrangement order of the preset watermark image and / or the original element arrangement order of the first characteristic matrix through scrambling processing, so that the original watermark information and / or the first characteristic matrix become disorganized, thereby increasing the difficulty for attackers to extract and forge zero watermarks.
[0052] The present embodiment provides three methods for generating zero-watermark images based on XOR operations and scrambling. Specifically, the preset watermark image is scrambled to obtain a first watermark image; and the pixel values of the first watermark image are XORed with the first feature matrix to obtain the zero-watermark image.
[0053] Specifically, the first characteristic matrix is scrambled to obtain a second characteristic matrix; and an exclusive-OR operation is performed on the pixel values of the preset watermark image and the second characteristic matrix to obtain the zero-watermark image.
[0054] Specifically, the preset watermark image and the first characteristic matrix are scrambled to obtain a first watermark image and a second characteristic matrix; and an exclusive-OR operation is performed on the pixel values of the first watermark image and the second characteristic matrix to obtain the zero watermark image.
[0055] The first feature matrix has a clear number of rows and columns. Based on this structural characteristic, it can be regarded as an image. Therefore, the preset watermark image and the first feature matrix can be scrambled using the Arnold transform (cat face transform). The scrambling of the preset watermark image and the first feature matrix can be the same. The following takes the scrambling of the preset watermark image as an example: For the preset watermark image of order N, the preset watermark image is scrambled by the forward transformation of Arnold transformation (cat face transformation). The forward transformation formula of Arnold transformation is: ;in The pixel coordinates of the image before positive transformation (for example, the preset watermark image); is the pixel coordinate of the image after the positive transformation (for example, the first watermark image); mod is the modulo operation, N is the order of the image to be Arnold transformed (for example, here is the preset watermark image); A is the transformation matrix, which can be set according to actual needs, for example , the embodiments of this application are not specifically limited.
[0056] Furthermore, in order to enhance the security of the first watermark image, the key k is used to perform a forward Arnold transform on the preset watermark image, which can be expressed as , where C is the image before the forward transformation and I is the image after the forward transformation. Specifically, the number of Arnold transformations is used as the key k. The first watermark image is obtained by performing k Arnold transformations on the first watermark image. Compared with only one Arnold transformation, this can improve security and further increase the difficulty for attackers to extract and forge the zero watermark.
[0057] See also Figure 2 , Figure 2 : is a flowchart of a zero watermark detection method provided in an embodiment of the present application, the zero watermark detection method comprising: S21. Constructing a second character quantity set according to the quantity of each key character in the code data to be detected; wherein the key character is a predefined single character; It is worth noting that this embodiment reuses the construction logic of the first character quantity set for the code data to be protected to reconstruct the second character quantity set for the code data to be detected. This ensures the unified feature extraction logic for zero-watermark detection and zero-watermark generation, providing a guarantee for the accurate detection of zero-watermark images. The specific method for constructing the second character quantity set can be referenced to the method for constructing the first character quantity set described above and will not be repeated here.
[0058] Specifically, the code data to be detected is a code file to be detected. Of course, it can also be other forms of data with character features, which is not specifically limited here.
[0059] S22. Constructing a third feature matrix based on the size relationship between different elements in the second character quantity set; Specifically, this embodiment reuses the construction logic of the first feature matrix of the code data to be protected to reconstruct the third character quantity set for the code data to be detected. This ensures the unified feature extraction logic for zero-watermark detection and zero-watermark generation, and provides guarantees for the accurate detection of zero-watermark images. The specific method for constructing the third feature matrix can be referred to the method for constructing the first character quantity set described above, and will not be repeated here.
[0060] S23, obtaining a zero-watermark image from a registration management center; It is worth noting that the registration management center registers the zero-watermark image to prevent the zero-watermark image from being tampered with, ensure the reliability of zero-watermark detection, and avoid interference from unregistered false zero-watermarks. Furthermore, the registration management center also stores corresponding copyright information, such as the key k.
[0061] S24, obtaining a second watermark image based on the zero watermark image and the third characteristic matrix; It is worth noting that when the code data to be detected is copyright protected, the third characteristic matrix generated is aligned with the first characteristic matrix, and then the zero watermark image and the third characteristic matrix can be used to restore the second watermark image that matches the preset watermark image feature.
[0062] S25. Determine whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image.
[0063] The embodiment of the present application uses a corresponding method to detect whether the code data to be detected has a zero watermark image based on the zero watermark image generated by the above method. If so, it means that the code data to be detected has copyright protection. Otherwise, the code data to be detected has no copyright protection.
[0064] The embodiment of the present application reuses the first feature matrix construction logic of the code data to be protected, and reconstructs the third feature matrix for the code data to be detected, fundamentally ensuring the unity of the feature extraction logic in zero watermark detection and zero watermark generation, allowing the third feature matrix to be accurately reproduced, improving the accuracy of zero watermark detection, and then generating a second watermark image with the zero watermark image of the registration management center, which is compared with the preset watermark image to accurately identify the copyright association between the code data to be detected and the preset watermark image, i.e., the original watermark image. The embodiment of the present application relies on the character distribution characteristics of the code data to be detected, and determines the copyright ownership of the code data to be detected by similarity, thereby achieving copyright protection for the code file without affecting the availability of the code, providing an effective basis for subsequent accountability for code file leaks, theft, and illegal transmission, and safeguarding the interests of the code owner.
[0065] In an optional embodiment, constructing a third feature matrix according to the size relationship of different elements in the second character quantity set includes: Compare the p-th element and the q-th element in the second set of character quantities; When the pth element in the second character quantity set is greater than or equal to the qth element, determining that the element in the mth row and nth column of the third feature matrix is a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the second character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the third feature matrix is determined to be a second value.
[0066] The embodiment of the present application establishes an orderly third characteristic matrix construction process by determining whether the element in the mth row and nth column of the third characteristic matrix is the first value or the second value according to the size relationship between the pth element and the qth element in the second character quantity set, and according to the correspondence between p and m, q and n. This can effectively improve the construction speed and lay the foundation for efficient detection of zero-watermark images.
[0067] The specific method for constructing the third feature matrix can refer to the method for constructing the first character quantity set mentioned above, and will not be repeated here.
[0068] In an optional embodiment, constructing a second character quantity set according to the quantity of each key character in the code data to be detected includes: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be detected is traversed, the number of each element in the second single character set in the code data to be detected is counted, and the second character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0069] The embodiment of the present application forms a second character quantity set by counting the number of each element in the scrambled second single character set in the code data to be detected, which is adapted to the generation of the first character quantity set, ensuring the unification of the feature extraction logic in zero watermark detection and zero watermark generation, and improving detection accuracy.
[0070] The specific method for constructing the second character quantity set can refer to the above-mentioned method for constructing the first character quantity set, which will not be repeated here.
[0071] In an optional embodiment, judging whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image includes: Calculating the similarity based on the pixel values of the preset watermark image and the pixel values of the second watermark image; When the similarity is greater than a preset similarity threshold, it is determined that a zero-watermark image is detected; When the similarity is less than or equal to the preset similarity threshold, it is determined that no zero-watermark image is detected.
[0072] The embodiment of the present application compares the similarity between the preset watermark image and the second watermark image; when the similarity is greater than the preset similarity threshold, it is determined that a zero watermark image is detected, indicating that the code data to be detected is copyright protected; when the similarity is less than or equal to the preset similarity threshold, it is determined that no zero watermark image is detected, indicating that the code data to be detected is not copyright protected and there is a possibility of illegal transmission or copying.
[0073] Specifically, the preset watermark image and the second watermark image are binary images, and the similarity between the two is preferably calculated using a pixel-based algorithm, such as Mean Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Normalized Correlation (NC), etc. The embodiments of the present application are not limited to the method for calculating the similarity.
[0074] Exemplarily, NC is used to calculate the similarity between the preset watermark image and the second watermark image:
[0075] Where M represents the number of rows of the preset watermark image, N represents the number of columns of the preset watermark image, represents the pixel value of the second watermark image, Represents the pixel value of the preset watermark image, and XNOR represents the exclusive-or-not operation.
[0076] The closer the calculated NC value is to 1, the more similar the preset watermark image and the second watermark image are. For example, when the preset similarity threshold is 0.75 and the calculated NC value is greater than 0.75, it is determined that a zero-watermark image is detected.
[0077] In an optional embodiment, obtaining the second watermark image based on the zero watermark image and the third characteristic matrix includes: An exclusive-OR operation is performed on the zero-watermark image and the third characteristic matrix to obtain the second watermark image.
[0078] In an embodiment of the present application, when the zero watermark generation method directly performs an XOR operation on the pixel values of the preset watermark image and the first characteristic matrix to generate the zero watermark image, based on the reversibility of the XOR operation, the zero watermark image and the third characteristic matrix are directly XORed, which can restore the second watermark image that matches the characteristics of the preset watermark image.
[0079] In an optional embodiment, obtaining the second watermark image based on the zero watermark image and the third characteristic matrix includes: Performing an XOR operation on the pixel values of the zero-watermark image and the third characteristic matrix to obtain a third watermark image; performing an inverse scrambling process on the third watermark image to obtain the second watermark image; or Performing scrambling processing on the third characteristic matrix to obtain a fourth characteristic matrix; performing an XOR operation on the pixel values of the zero watermark image and the fourth characteristic matrix to obtain the second watermark image; or, The third characteristic matrix is scrambled to obtain a fifth characteristic matrix; an exclusive-OR operation is performed on the pixel values of the zero watermark image and the fifth characteristic matrix to obtain a fourth watermark image; and the fourth watermark image is descrambled to obtain the second watermark image.
[0080] The embodiments of the present application provide three methods for restoring the second watermark image, which respectively correspond to the three methods for generating the zero watermark image based on XOR operation and scrambling processing.
[0081] (1) The generation method is as follows: scrambling the preset watermark image to obtain a first watermark image; performing an XOR operation on the pixel values of the first watermark image and the first characteristic matrix to obtain the zero watermark image. The restoration method is as follows: performing an XOR operation on the pixel values of the zero watermark image and the third characteristic matrix to obtain a third watermark image; performing an inverse scrambling operation on the third watermark image to obtain the second watermark image.
[0082] It is worth noting that, based on the reversibility of the XOR operation, performing an XOR operation on the zero-watermark image and the third characteristic matrix can restore an image (here is the third watermark image) that matches the features of the scrambled preset watermark image (i.e., the first watermark image). Then, by performing inverse scrambling processing on the third watermark image, the scrambling processing of the first watermark image in the zero-watermark generation stage is restored to restore the original watermark image, i.e., the preset watermark image, providing reliable data for subsequent similarity judgment.
[0083] Exemplarily, the third watermark image is descrambled by the inverse transformation of Arnold transformation (cat face transformation). The inverse transformation formula of Arnold transformation is: ;in is the pixel coordinate of the inverse transformed image (for example, the second watermark image); is the pixel coordinate of the image before inverse transformation (for example, the third watermark image); mod is the modulo operation, and N is the order of the image to be Arnold transformed (for example, the second watermark image here); is the inverse transformation matrix, A and are inverse matrices of each other, for example .
[0084] Furthermore, the third watermark image is subjected to an inverse Arnold transform using the key k, which can be expressed as , where C is the image after inverse transformation and I is the image before inverse transformation. Specifically, the number of Arnold transformations is used as the key k, and the second watermark image is obtained by performing inverse transformation of Arnold transformation k times on the third watermark image.
[0085] (2) The generation method is: scrambling the first characteristic matrix to obtain a second characteristic matrix; performing an XOR operation on the pixel values of the preset watermark image and the second characteristic matrix to obtain the zero-watermark image. The restoration method is: scrambling the third characteristic matrix to obtain a fourth characteristic matrix; performing an XOR operation on the pixel values of the zero-watermark image and the fourth characteristic matrix to obtain the second watermark image.
[0086] This embodiment reuses the construction logic of the second feature matrix to construct the fourth feature matrix, ensuring unified feature extraction logic for zero watermark detection and zero watermark generation. Based on the reversibility of the XOR operation, an XOR operation is then performed on the zero-watermark image and the fourth feature matrix to restore an image (here, the second watermark image) that matches the preset watermark image features, providing reliable data for subsequent similarity determination.
[0087] The specific scrambling process can be implemented through Arnold transformation, and reference may be made to the above scrambling process for the preset watermark image, which will not be described in detail here.
[0088] (3) The generation method is: scrambling the preset watermark image and the first characteristic matrix to obtain the first watermark image and the second characteristic matrix; performing an XOR operation on the pixel values of the first watermark image and the second characteristic matrix to obtain the zero watermark image. The restoration method is: scrambling the third characteristic matrix to obtain the fifth characteristic matrix; performing an XOR operation on the pixel values of the zero watermark image and the fifth characteristic matrix to obtain the fourth watermark image; performing an inverse scrambling operation on the fourth watermark image to obtain the second watermark image. The generation method and the restoration method are used to realize the zero watermark generation and detection method provided in the embodiment of the present application. Figure 3 shown.
[0089] The embodiment of the present application reuses the construction logic of the second feature matrix to construct the fifth feature matrix, ensuring the unity of the feature extraction logic in zero watermark detection and zero watermark generation. Then, based on the reversibility of the XOR operation, an XOR operation is performed on the zero watermark image and the fifth feature matrix, which can restore the image (here, the fourth watermark image) that matches the features of the scrambled preset watermark image (i.e., the first watermark image). Finally, by performing an inverse scrambling process on the fourth watermark image, the scrambling process of the first watermark image in the zero watermark generation stage is restored to restore the original watermark image, i.e., the preset watermark image, providing reliable data for subsequent similarity judgment.
[0090] See also Figure 4 , Figure 4 : is a structural block diagram of a zero watermark generation device 10 provided in an embodiment of the present application, wherein the zero watermark generation device 10 includes: A first constructing module 11 is configured to construct a first character quantity set according to the quantity of each key character in the code data to be protected; wherein the key character is a predefined single character; A second construction module 12 is configured to construct a first feature matrix based on the size relationship between different elements in the first character quantity set; The first XOR module 13 is configured to generate a zero-watermark image based on a preset watermark image and the first feature matrix.
[0091] Optionally, the second building module 12 is specifically configured to: Compare the p-th element and the q-th element in the first set of character quantities; When the pth element in the first character quantity set is greater than or equal to the qth element, determining the element in the mth row and nth column of the first feature matrix to be a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the first character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the first feature matrix is determined to be a second value.
[0092] Optionally, the first building module 11 is specifically configured to: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be protected is traversed, the number of each element in the second single character set in the code data to be protected is counted, and the first character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0093] Optionally, the first XOR module 13 is specifically configured to: An exclusive-OR operation is performed on the pixel values of the preset watermark image and the first feature matrix to generate the zero-watermark image.
[0094] Optionally, the first XOR module 13 is specifically configured to: Performing scrambling processing on the preset watermark image and / or the first characteristic matrix to obtain a first watermark image and / or a second characteristic matrix; An exclusive-OR operation is performed on the pixel values of the first watermark image and the first feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the preset watermark image and the second feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the first watermark image and the second feature matrix to obtain the zero-watermark image.
[0095] It is worth noting that the working process of each module in the zero watermark generation device 10 described in the embodiment of the present application can refer to the working process of the zero watermark generation method described in the above embodiment, and achieve the same beneficial effects, which will not be repeated here.
[0096] See also Figure 5 , Figure 5 : is a structural block diagram of a zero watermark detection device 20 provided in an embodiment of the present application, wherein the zero watermark detection device 20 includes: The third constructing module 21 is used to construct a second character quantity set according to the number of each key character in the code data to be detected; wherein the key character is a predefined single character; A fourth constructing module 22 is configured to construct a third feature matrix according to the size relationship between different elements in the second character quantity set; An acquisition module 23 is used to acquire a zero-watermark image from a registration management center; A second XOR module 24 is configured to obtain a second watermark image based on the zero watermark image and the third characteristic matrix; The detection module 25 is configured to determine whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image.
[0097] Optionally, the fourth building module 22 is specifically configured to: Compare the p-th element and the q-th element in the second set of character quantities; When the pth element in the second character quantity set is greater than or equal to the qth element, determining that the element in the mth row and nth column of the third feature matrix is a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the second character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the third feature matrix is determined to be a second value.
[0098] Optionally, the third building module 21 is specifically configured to: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be detected is traversed, the number of each element in the second single character set in the code data to be detected is counted, and the second character quantity set is formed according to the arrangement order of the elements of the second single character set.
[0099] Optionally, the detection module 25 is specifically configured to: Calculating the similarity based on the pixel values of the preset watermark image and the pixel values of the second watermark image; When the similarity is greater than a preset similarity threshold, it is determined that a zero-watermark image is detected; When the similarity is less than or equal to the preset similarity threshold, it is determined that no zero-watermark image is detected.
[0100] Optionally, the second XOR module 24 is specifically configured to: An exclusive-OR operation is performed on the zero-watermark image and the third characteristic matrix to obtain the second watermark image.
[0101] Optionally, the second XOR module 24 is specifically configured to: Performing an XOR operation on the pixel values of the zero-watermark image and the third characteristic matrix to obtain a third watermark image; performing an inverse scrambling process on the third watermark image to obtain the second watermark image; or Performing scrambling processing on the third characteristic matrix to obtain a fourth characteristic matrix; performing an XOR operation on the pixel values of the zero watermark image and the fourth characteristic matrix to obtain the second watermark image; or, The third characteristic matrix is scrambled to obtain a fifth characteristic matrix; an exclusive-OR operation is performed on the pixel values of the zero watermark image and the fifth characteristic matrix to obtain a fourth watermark image; and the fourth watermark image is descrambled to obtain the second watermark image.
[0102] It is worth noting that the working process of each module in the zero watermark detection device 20 described in the embodiment of the present application can refer to the working process of the zero watermark detection method described in the above embodiment, and achieve the same beneficial effects, which will not be repeated here.
[0103] In addition, an embodiment of the present application further provides a computer-readable storage medium, which includes a stored computer program; wherein, when the computer program is run, it controls the device where the computer-readable storage medium is located to execute the zero watermark generation method described in any of the above embodiments, or the zero watermark detection method described in any of the above embodiments.
[0104] In addition, an embodiment of the present application further provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the zero watermark generation method described in any of the above embodiments, or the zero watermark detection method described in any of the above embodiments.
[0105] See also Figure 6 , Figure 6 This is a block diagram of an electronic device 30 provided in an embodiment of the present application. The electronic device 30 includes a processor 31, a memory 32, and a computer program stored in the memory 32 and executable on the processor 31. When the processor 31 executes the computer program, the steps in the above-described zero watermark generation method embodiment are implemented. Alternatively, when the processor 31 executes the computer program, the functions of the modules / units in the above-described device embodiments are implemented.
[0106] For example, the computer program may be divided into one or more modules / units, which are stored in the memory 32 and executed by the processor 31 to complete the present application. The one or more modules / units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the electronic device 30.
[0107] The electronic device 30 may include, but is not limited to, a processor 31 and a memory 32. Those skilled in the art will appreciate that the schematic diagram is merely an example of the electronic device 30 and does not limit the electronic device 30. The electronic device 30 may include more or fewer components than shown, or may combine certain components or different components. For example, the electronic device 30 may also include input and output devices, network access devices, buses, and the like.
[0108] The processor 31 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor. The processor 31 is the control center of the electronic device 30 and connects various parts of the entire electronic device 30 using various interfaces and lines.
[0109] The memory 32 can be used to store the computer programs and / or modules. The processor 31 implements the various functions of the electronic device 30 by running or executing the computer programs and / or modules stored in the memory 32 and accessing the data stored in the memory 32. The memory 32 may primarily include a program storage area and a data storage area. The program storage area may store an operating system and at least one application required for a function (such as sound playback or image playback); the data storage area may store data generated based on the use of the mobile phone (such as audio data and a phone book). Furthermore, the memory 32 may include high-speed random access memory (RAM) and non-volatile memory, such as a hard disk, internal memory, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, at least one disk storage device, a flash memory device, or other volatile solid-state storage device.
[0110] If the modules / units integrated in the electronic device 30 are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the present application can implement all or part of the processes in the above-mentioned method embodiments by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor 31, it can implement the steps of each of the above-mentioned method embodiments. The computer program includes computer program code, which can be in source code form, object code form, executable file, or some intermediate form. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium.
[0111] It should be noted that the device embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed across multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment. In addition, in the drawings of the device embodiments provided in this application, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art can understand and implement the present invention without inventive work.
[0112] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications are also considered to be within the scope of protection of the present application.
Claims
1. A zero watermark generation method, characterized in that: include: Constructing a first character quantity set according to the number of each key character in the code data to be protected; wherein the key character is a predefined single character; Constructing a first feature matrix based on the size relationship between different elements in the first character quantity set; A zero-watermark image is generated based on a preset watermark image and the first feature matrix.
2. The zero watermark generation method according to claim 1, wherein: The step of constructing a first feature matrix according to the size relationship between different elements in the first character quantity set includes: Compare the p-th element and the q-th element in the first set of character quantities; When the pth element in the first character quantity set is greater than or equal to the qth element, determining the element in the mth row and nth column of the first feature matrix to be a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the first character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the first feature matrix is determined to be a second value.
3. The zero watermark generation method according to claim 1, wherein: The step of constructing a first character quantity set according to the quantity of each key character in the code data to be protected includes: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be protected is traversed, the number of each element in the second single character set in the code data to be protected is counted, and the first character quantity set is formed according to the arrangement order of the elements of the second single character set.
4. The zero watermark generation method according to claim 1, wherein: The generating of a zero-watermark image based on a preset watermark image and the first feature matrix includes: An exclusive-OR operation is performed on the pixel values of the preset watermark image and the first feature matrix to generate the zero-watermark image.
5. The zero watermark generation method according to claim 1, wherein: The generating of a zero-watermark image based on a preset watermark image and the first feature matrix includes: Performing scrambling processing on the preset watermark image and / or the first characteristic matrix to obtain a first watermark image and / or a second characteristic matrix; An exclusive-OR operation is performed on the pixel values of the first watermark image and the first feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the preset watermark image and the second feature matrix to obtain the zero-watermark image; or, an exclusive-OR operation is performed on the pixel values of the first watermark image and the second feature matrix to obtain the zero-watermark image.
6. A zero watermark detection method, characterized in that: include: Constructing a second character quantity set according to the number of each key character in the code data to be detected; wherein the key character is a predefined single character; constructing a third feature matrix based on the size relationship of different elements in the second character quantity set; Obtain zero-watermarked images from the registration management center; Obtaining a second watermark image based on the zero watermark image and the third characteristic matrix; According to the similarity between the preset watermark image and the second watermark image, it is determined whether a zero-watermark image is detected.
7. The zero watermark detection method according to claim 6, wherein: The step of constructing a third feature matrix according to the size relationship between different elements in the second character quantity set includes: Compare the p-th element and the q-th element in the second set of character quantities; When the pth element in the second character quantity set is greater than or equal to the qth element, determining that the element in the mth row and nth column of the third feature matrix is a first value; wherein p and m have a first preset relationship, and q and n have a second preset relationship; When the p-th element in the second character quantity set is smaller than the q-th element, the element in the m-th row and n-th column of the third feature matrix is determined to be a second value.
8. The zero watermark detection method according to claim 6, wherein: The step of constructing a second character quantity set according to the quantity of each key character in the code data to be detected includes: Extracting all single characters of each element in the preset key data set to form a first single character set; Performing scrambling processing on the first single character set to obtain a second single character set; The code data to be detected is traversed, the number of each element in the second single character set in the code data to be detected is counted, and the second character quantity set is formed according to the arrangement order of the elements of the second single character set.
9. The zero watermark detection method according to claim 6, wherein: The determining whether a zero-watermark image is detected based on the similarity between the preset watermark image and the second watermark image includes: Calculating the similarity based on the pixel values of the preset watermark image and the pixel values of the second watermark image; When the similarity is greater than a preset similarity threshold, it is determined that a zero-watermark image is detected; When the similarity is less than or equal to the preset similarity threshold, it is determined that no zero-watermark image is detected.
10. The zero watermark detection method according to claim 6, wherein: The obtaining of a second watermark image based on the zero watermark image and the third characteristic matrix includes: An exclusive-OR operation is performed on the zero-watermark image and the third characteristic matrix to obtain the second watermark image.
11. The zero watermark detection method according to claim 6, wherein: The obtaining of a second watermark image based on the zero watermark image and the third characteristic matrix includes: Performing an XOR operation on the pixel values of the zero-watermark image and the third characteristic matrix to obtain a third watermark image; performing an inverse scrambling process on the third watermark image to obtain the second watermark image; or Performing scrambling processing on the third characteristic matrix to obtain a fourth characteristic matrix; performing an XOR operation on the pixel values of the zero watermark image and the fourth characteristic matrix to obtain the second watermark image; or, The third characteristic matrix is scrambled to obtain a fifth characteristic matrix; an exclusive-OR operation is performed on the pixel values of the zero watermark image and the fifth characteristic matrix to obtain a fourth watermark image; and the fourth watermark image is descrambled to obtain the second watermark image.
12. A zero watermark generation device, characterized in that: include: A first constructing module, configured to construct a first character quantity set according to the quantity of each key character in the code data to be protected; A second construction module is configured to construct a first feature matrix based on the size relationship between different elements in the first character quantity set; The first XOR module is used to generate a zero-watermark image based on a preset watermark image and the first feature matrix.
13. A zero watermark detection device, characterized in that: include: A third constructing module is used to construct a second character quantity set according to the quantity of each key character in the code data to be detected; a fourth constructing module, configured to construct a third feature matrix according to a size relationship between different elements in the second character quantity set; An acquisition module is used to obtain a zero-watermark image from a registration management center; A second XOR module is used to obtain a second watermark image based on the zero watermark image and the third characteristic matrix; The detection module is used to determine whether a zero-watermark image is detected based on the similarity between the preset watermark image and the two watermark images.
14. An electronic device, characterized in that: The invention comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the zero watermark generation method according to any one of claims 1 to 5, or the zero watermark detection method according to any one of claims 6 to 11 when executing the computer program.
15. A computer-readable storage medium, characterized in that The computer-readable storage medium includes a stored computer program; wherein, when the computer program is run, it controls the device where the computer-readable storage medium is located to execute the zero watermark generation method according to any one of claims 1 to 5, or the zero watermark detection method according to any one of claims 6 to 11.
16. A computer program product, characterized in that The invention comprises a computer program / instruction, which, when executed by a processor, implements the zero watermark generation method according to any one of claims 1 to 5, or the zero watermark detection method according to any one of claims 6 to 11.
Citation Information
Patent Citations
Zero watermark method and device and watermark extraction method and device
CN104217390A
Invariant moment and Hilbert code based zero watermarking method of vector residential place
CN106204411A
Color image zero watermarking method based on fast quaternion generalized polar complex exponential transformation
CN109919824A
Self-adaptive zero-watermark method combining visual password and enhanced singular value decomposition
CN111882477A
Robust color image zero-watermarking method based on SURF and DCT features
CN111968027A