WO2023169516A1 - 一种水印嵌入方法、装置、设备及可读存储介质 - Google Patents

一种水印嵌入方法、装置、设备及可读存储介质 Download PDF

Info

Publication number
WO2023169516A1
WO2023169516A1 PCT/CN2023/080523 CN2023080523W WO2023169516A1 WO 2023169516 A1 WO2023169516 A1 WO 2023169516A1 CN 2023080523 W CN2023080523 W CN 2023080523W WO 2023169516 A1 WO2023169516 A1 WO 2023169516A1
Authority
WO
WIPO (PCT)
Prior art keywords
sub
block
blocks
watermark
target
Prior art date
Application number
PCT/CN2023/080523
Other languages
English (en)
French (fr)
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 咪咕视讯科技有限公司
Publication of WO2023169516A1 publication Critical patent/WO2023169516A1/zh

Links

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 present disclosure relates to the technical field of watermark processing, and in particular to a watermark embedding method, device, equipment and readable storage medium.
  • Digital rights management includes authentication technology, encryption technology, digital watermark technology, tamper-proof hardware modules and smart card technology.
  • digital watermark technology is a typical information hiding method, and its content covers text, text and images.
  • Embodiments of the present disclosure provide a watermark embedding method, device, equipment and readable storage medium to reduce the impact of watermarks on original video content.
  • embodiments of the present disclosure provide a watermark embedding method, including:
  • the watermark is embedded in a target sub-block of the plurality of sub-blocks, wherein the texture complexity of the target sub-block is greater than a texture complexity threshold.
  • embodiments of the present disclosure also provide a watermark embedding device, including:
  • the first dividing module is used to divide the target frame in the video sequence into multiple sub-block;
  • a first acquisition module configured to acquire the texture complexity of the plurality of sub-blocks
  • a first embedding module configured to embed the watermark in a target sub-block of the plurality of sub-blocks, wherein the texture complexity of the target sub-block is greater than a texture complexity threshold.
  • embodiments of the present disclosure also provide an electronic device, including: a transceiver, a memory, a processor, and a program stored in the memory and executable on the processor. When the processor executes the program, the above is implemented. The steps in the watermark embedding method.
  • embodiments of the present disclosure also provide a readable storage medium, a program is stored on the readable storage medium, and when the program is executed by a processor, the steps in the watermark embedding method as described above are implemented.
  • a watermark is embedded in a target sub-block among a plurality of sub-blocks included in the target frame, wherein the texture complexity of the target sub-block is greater than a texture complexity threshold. Therefore, in the embodiment of the present disclosure, by analyzing the texture complexity of the sub-block, a target sub-block whose texture complexity is greater than the texture complexity threshold is selected to insert a watermark. Since the texture of the target sub-blocks is relatively complex, embedding watermarks in these sub-blocks can reduce the impact on their original content. Therefore, using the solution of the embodiment of the present disclosure, the impact of the watermark on the original video content can be reduced.
  • Figure 1 is one of the flow charts of a watermark embedding method provided by an embodiment of the present disclosure
  • Figure 2 is a schematic diagram of the positional relationship of sub-blocks provided by an embodiment of the present disclosure
  • Figure 3 is the second flow chart of the watermark embedding method provided by the embodiment of the present disclosure.
  • FIG 4 is the encryption algorithm flow chart of Advanced Encryption Standard (AES).
  • AES Advanced Encryption Standard
  • Figure 5 is a schematic diagram of the S_box table
  • Figure 6 is a schematic diagram of row displacement processing
  • Figure 7 is a schematic diagram of a column obfuscation processing diagram
  • Figure 8 is a structural diagram of a watermark embedding device provided by an embodiment of the present disclosure.
  • the term "and/or” describes the association relationship of associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone. these three situations.
  • the character "/” generally indicates that the related objects are in an "or” relationship.
  • the term “plurality” refers to two or more than two, and other quantifiers are similar to it.
  • Figure 1 is a flow chart of a watermark embedding method provided by an embodiment of the present disclosure. As shown in Figure 1, it includes the following steps:
  • Step 101 For a target frame in the video sequence, divide the target frame into multiple sub-blocks.
  • the target frame may be any video frame in the video sequence.
  • the target frame can be divided into n (n ⁇ 2) 4 ⁇ 4 sub-blocks.
  • n (n ⁇ 2) 4 ⁇ 4 sub-blocks Assume that the brightness component at the (x, y) position is f (x, y), where f (x, y) can be expressed as:
  • B k represents the brightness of the k-th sub-block
  • f k (i, j) represents the brightness component at the (i, j) position in the k-th sub-block.
  • Step 102 Obtain the texture complexity of the multiple sub-blocks.
  • the variance of the pixels of the first sub-block is obtained, and the variance is used as the texture complexity of the first sub-block; where, The first sub-block is any sub-block of the plurality of sub-blocks.
  • the variance of the pixels of each sub-block is used as the texture complexity of the sub-block.
  • Embedding watermarks in texture detail areas ensures good invisibility without affecting video quality. Therefore, in the embodiment of the present disclosure, watermarks are selected to be embedded in sub-blocks with complex textures.
  • the obtained sub-block needs to be DCT transformed.
  • F(i,j) represents the DCT transform coefficient
  • DCT represents the discrete cosine transform
  • f(i,j) represents the pixel value at position (i,j).
  • Z represents the DCT transformation coefficient matrix
  • the texture complexity of each sub-block may be determined according to the variance of each sub-block.
  • the variance is calculated as shown in the following formulas (5) and (6):
  • ⁇ 2 (k) represents the variance of the k-th sub-block
  • f k (i, j) represents the pixel value of the k-th sub-block at position (i, j)
  • ⁇ (k) represents the pixel mean of the k-th sub-block.
  • gray(k) represents the pixel mean value of the k-th sub-block
  • f k (k) represents the brightness component of the k-th sub-block.
  • Step 103 Embed the watermark in a target sub-block of the plurality of sub-blocks, wherein the texture complexity of the target sub-block is greater than a texture complexity threshold.
  • the watermark is embedded in the target sub-blocks. For example, if the number of the target sub-blocks is greater than a certain preset value, the watermark can be embedded in the target sub-blocks.
  • the texture complexity threshold determines the texture complexity threshold. Afterwards, the texture complexity of the plurality of sub-blocks is compared with the texture complexity threshold respectively to obtain a comparison result. When compared according to the If it is determined that the number of target sub-blocks in the plurality of sub-blocks meets the preset requirements, the watermark is embedded in the target sub-block of the plurality of sub-blocks. For example, the number of comparison results whose texture complexity is greater than the texture complexity threshold can be determined from the comparison results, and whether the number meets the preset requirements can be determined.
  • the comparison result corresponds to each sub-block one-to-one, when the comparison result is that the number of comparison results whose texture complexity is greater than the texture complexity threshold meets the preset requirements, that is, the target sub-block among the plurality of sub-blocks The number of blocks meets the preset requirements, so that it can be determined whether the current frame can be used as a frame for embedding watermarks.
  • the texture complexity threshold is determined as follows:
  • DCT transform coefficients of the plurality of sub-blocks are obtained, wherein the DCT transform coefficients can be obtained according to the process described in the foregoing embodiments. Thereafter, an intermediate DC coefficient value is determined from the DC coefficients of the DCT transform coefficients of the plurality of sub-blocks, and the variance corresponding to the sub-block whose DC coefficient is the intermediate DC coefficient value is used as the texture complexity threshold.
  • multiple sub-blocks are traversed to obtain the DC coefficients of multiple sub-blocks.
  • the average value of the DC coefficients of multiple sub-blocks is obtained as the intermediate DC coefficient value, or the DC coefficient closest to the average value among the DC coefficients of the multiple sub-blocks is used as the intermediate DC coefficient value.
  • the variance corresponding to the sub-block whose DC coefficient is the intermediate value of the DC coefficient is used as the texture complexity threshold. That is to say, if the DC coefficient of a certain sub-block is the DC coefficient intermediate value, then the variance of the sub-block is used as the texture complexity threshold T.
  • the variances of multiple sub-blocks are compared with the texture complexity threshold to determine whether a certain sub-block can be used to embed a watermark, and whether the target frame can be used as a frame for embedding a watermark.
  • the sub-block can be used as a target sub-block, that is, the sub-block is a texture complex area. Otherwise, the sub-block is a smooth texture area and is not suitable for embedding watermarks.
  • the number of target sub-blocks it is determined whether the frame can be used as a frame for embedding watermarks. The preset requirements can be set as needed.
  • the target frame may serve as a frame for embedding a watermark, and the watermark may be embedded in a target sub-block of the target frame.
  • the watermark embedding when embedding a watermark, may be determined in the target sub-block. parameters, and embed a watermark in the target sub-block according to the watermark embedding parameters.
  • W represents the watermark matrix
  • w(x,y) represents the pixel value at (x,y)
  • m and n are non-negative integers.
  • the watermark embedding parameters are determined in the target sub-block using the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks and the embedding strength of the target sub-block.
  • the watermark embedding parameter is used to affect the embedding position of the watermark in the target sub-block.
  • sub-block 20 its adjacent sub-blocks are 21-28 in the figure. Normally, for a sub-block located in the middle of the image, it can have 8 neighboring sub-blocks. However, for a sub-block located at the image boundary, it may have less than 8 neighboring sub-blocks.
  • the watermark embedding parameters are determined in the target sub-block using the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks:
  • C'(k) represents the watermark embedding parameter of the k-th target sub-block, represents the weighted average of the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks, ⁇ represents the embedding strength, and watermark(k) represents the binarized value corresponding to the watermark.
  • the embedding strength ⁇ is determined based on the variance of the k-th target sub-block and the preset coefficient.
  • ⁇ 2 (k) represents the variance of the k-th target sub-block
  • ⁇ represents the preset coefficient, which can be set as needed, and the general value is 0.8.
  • ⁇ and ⁇ represent weight factors respectively, which are generally set based on actual experience.
  • C x represents the DCT transformation coefficient of adjacent sub-blocks
  • q represents the total number of adjacent sub-blocks
  • p and q are positive integers
  • p is less than q.
  • the first p adjacent sub-blocks can be sub-blocks located on the same diagonal as the target sub-block, which correspond to the same weight; the other qp sub-blocks can be the positive sub-blocks of the target sub-block. Sub-blocks in the upper, lower, left, and right directions correspond to the same weight.
  • the 1st to 4th sub-blocks can be sub-blocks on the diagonal of the target sub-block (sub-blocks 21, 23, 26 in Figure 2, 28);
  • the 5th to 8th sub-blocks can be directly above (sub-block 22 in Figure 2), above and below (sub-block 27 in Figure 2), directly to the left (sub-block 24 in Figure 2), The sub-block in the right direction (sub-block 25 in Figure 2).
  • Equation (11) Since the watermark after preprocessing is a binary image, the watermark is embedded with "1" or "0". The rule is as shown in Equation (11):
  • C'(k) represents the watermark embedding parameter of the k-th target sub-block, Represents the average value of watermark embedding parameters of adjacent sub-blocks.
  • the 1st to 4th sub-blocks can be sub-blocks on the diagonal of the target sub-block (sub-blocks 21, 23, 26 in Figure 2, 28), the weight factor is ⁇ ; the 5th to 8th sub-blocks can be directly above (sub-block 22 in Figure 2), up-down (sub-block 27 in Figure 2), or directly to the left (sub-block 27 in Figure 2)
  • the sub-block 24) and the sub-block in the right direction (sub-block 26 in Figure 2) have a weight factor of ⁇ .
  • the watermark is embedded in the target sub-block among the plurality of sub-blocks included in the target frame, where the texture complexity of the target sub-block is greater than the texture complexity threshold. Therefore, in the embodiment of the present disclosure, by analyzing the texture complexity of the sub-block, a target sub-block whose texture complexity is greater than the texture complexity threshold is selected to insert a watermark. Since the texture of the target sub-blocks is relatively complex, embedding watermarks in these sub-blocks can reduce the impact on their original content. Therefore, using the solution of the embodiment of the present disclosure, the impact of the watermark on the original video content can be reduced.
  • Figure 3 is a flow chart of a watermark processing method provided by an embodiment of the present disclosure. As shown in Figure 3, it includes the following steps:
  • Step 301 Encrypt the watermark.
  • any method can be used to encrypt the watermark, thereby ensuring the security and robustness of the watermark.
  • the watermark to be embedded is first binarized.
  • the specific processing method is expressed as formula (8).
  • the Advanced Encryption Standard (Advanced Encryption Standard, AES) encryption algorithm is used to encrypt it.
  • AES Advanced Encryption Standard
  • encryption methods such as Data Encryption Standard (DES) can also be used.
  • DES Data Encryption Standard
  • the embodiments of the present disclosure do not limit the encryption methods used.
  • the AES algorithm mainly includes four operating steps, namely key addition layer (also called round key addition, English Add Round Key), byte substitution layer (SubByte), row shift layer (Shift Rows), and column confusion layer ( Mix Column). Only the last round of processing differs from the previous rounds in the number of rounds of the AES algorithm.
  • key addition layer also called round key addition, English Add Round Key
  • byte substitution layer SubByte
  • row shift layer Shift Rows
  • Mix Column Mix Column
  • the main function of the byte substitution layer is to map the input matrix from one byte to another byte through the S_box table. After mapping, the matrix dimensions remain unchanged, and only the internal values change.
  • the S_box table is calculated through a certain method and is an array with 256 byte elements.
  • S_box there is also an inverse S_box, which is used for data processing during decryption.
  • the S_box table is shown in Figure 5.
  • FIG. 6 it is a schematic diagram of row displacement processing.
  • the row displacement processing layer is a manual diffusion layer of AES. By positionally replacing the bytes of the matrix, the transformation on a single bit is diffused to affect the entire state, thereby achieving an avalanche effect.
  • decrypting you need to perform the opposite line shifting process as when encrypting.
  • FIG. 7 it is a schematic diagram of the column obfuscation processing diagram.
  • the column obfuscation sub-layer is a more complex diffusion layer in the AES algorithm. It performs an obfuscation operation on each column of the input matrix, so that each input byte affects 4 output bytes. After multiple rounds of processing, the combination of row displacement sublayer and column confusion sublayer makes each byte of the matrix rely on 16 plaintext bytes.
  • the ciphertext output after the above encryption process is used as the final result of watermark preprocessing.
  • Step 302 embedding process, including:
  • the target frame is divided into multiple sub-blocks according to the size of the video frame. Specifically, mainly based on the brightness component of the target frame, it is refined into 4 ⁇ 4 brightness residual data.
  • each sub-block perform integer DCT transformation on each sub-block to obtain its DCT transformation coefficient, and determine whether a certain sub-block is a texture-complex sub-block (that is, whether it is a texture-complex area) based on the variance corresponding to each sub-block and the texture complexity threshold. , and determine whether the subframe can be used to embed watermarks based on the number of subblocks determined to be texture complex.
  • step 302 reference may be made to the description of steps 101 to 103.
  • step 302 may also be executed first, and then step 301 may be executed.
  • the security of video data is ensured through encryption preprocessing of watermarks.
  • a more reasonable watermark embedding method can be adaptively selected to improve the adaptability to coding characteristics and reduce the impact on the original video content.
  • FIG. 8 is a structural diagram of a watermark embedding device provided by an embodiment of the present disclosure. As shown in Figure 8, the watermark embedding device 800 includes:
  • the first dividing module 801 is used to divide the target frame in the video sequence into multiple sub-blocks
  • the first obtaining module 802 is used to obtain the texture complexity of the multiple sub-blocks
  • the first embedding module 803 is configured to embed the watermark in a target sub-block of the plurality of sub-blocks, where the texture complexity of the target sub-block is greater than a texture complexity threshold.
  • the first acquisition module 802 is configured to acquire the variance of the pixels of the first sub-block for the first sub-block among the plurality of sub-blocks, and use the variance as the first sub-block.
  • block texture Complexity wherein, the first sub-block is any sub-block of the plurality of sub-blocks.
  • the first embedding module 803 is configured to embed the watermark in the target sub-block if the number of the target sub-blocks in the plurality of sub-blocks meets preset requirements.
  • the first embedded module 803 includes:
  • the first determination sub-module is used to determine the texture complexity threshold; the first comparison sub-module is used to compare the texture complexity of the multiple sub-blocks with the texture complexity threshold respectively to obtain the comparison result; the first embedding A sub-module configured to embed the watermark in the target sub-block of the plurality of sub-blocks when the comparison result indicates that the number of target sub-blocks in the plurality of sub-blocks meets the preset requirements.
  • the first determination sub-module includes:
  • An acquisition unit is used to obtain the discrete cosine transform DCT transform coefficients of the plurality of sub-blocks; a first determination unit is used to determine the DC coefficient intermediate value from the DC coefficients of the DCT transform coefficients of the plurality of sub-blocks; the second determination unit is A unit configured to use the variance corresponding to the sub-block whose DC coefficient is the intermediate value of the DC coefficient as the texture complexity threshold.
  • the first embedded sub-module includes:
  • the first determining unit is used to determine watermark embedding parameters in the target sub-block; the first embedding unit is used to embed a watermark in the target sub-block according to the watermark embedding parameters.
  • the first determining unit is configured to use the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks and the embedding strength of the target sub-block, in the target sub-block. block to determine the watermark embedding parameters.
  • the first determination unit is configured to determine the target sub-block in the target sub-block by using the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks according to the following formula: Watermark embedding parameters:
  • C'(k) represents the watermark embedding parameter of the k-th target sub-block, represents the weighted average of the DCT transform coefficients of the sub-blocks adjacent to the target sub-block among the plurality of sub-blocks, ⁇ represents the embedding strength, and watermark(k) represents the binarized value corresponding to the watermark.
  • the embedding strength ⁇ is determined based on the variance of the k-th target sub-block and the preset coefficient.
  • ⁇ and ⁇ represent weight factors respectively
  • C x represents the DCT transform coefficient of adjacent sub-blocks
  • q represents the total number of adjacent sub-blocks
  • p and q are positive integers
  • p is less than q.
  • the device further includes: an encryption module, used to encrypt the watermark; and the first embedding module 803, used to embed the encrypted encryption in the target sub-block.
  • the device provided by the embodiments of the present disclosure can execute the above method embodiments, and its implementation principles and technical effects are similar, and will not be described again in this embodiment.
  • each functional unit in various embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above integrated units can be implemented in the form of hardware or software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a processor-readable storage medium.
  • the technical solution of the present disclosure is essentially or contributes to the existing technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods described in various embodiments of the present disclosure.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code. .
  • An embodiment of the present disclosure provides an electronic device, including: a memory, a processor, and a program stored on the memory and executable on the processor; the processor is configured to read the program in the memory to implement The steps in the watermark embedding method are as described previously.
  • Embodiments of the present disclosure also provide a readable storage medium.
  • a program is stored on the readable storage medium.
  • the program is executed by a processor, each process of the above watermark embedding method embodiment is implemented, and the same technical effect can be achieved. In order to avoid Repeat, I won’t go into details here.
  • the readable storage medium can be any available media or data storage device that the processor can access, including but not limited to magnetic storage (such as floppy disks, hard disks, tapes, magneto-optical (MO), etc.), optical storage (such as compact discs) Disk (CD), Digital Versatile Disc (DVD), Blu-ray Disc (BD), High-Definition Versatile Disc (HVD), etc.), and semiconductor memories (such as ROM, Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), non-volatile memory (NAND FLASH), solid state drive (Solid State Disk, SSD)), etc. .
  • magnetic storage such as floppy disks, hard disks, tapes, magneto-optical (MO), etc.
  • optical storage such as compact discs) Disk (CD), Digital Versatile Disc (DVD), Blu-ray Disc (BD), High-Definition Versatile Disc (HVD), etc.
  • the methods of the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is better. implementation. According to this understanding, the technical solution of the present disclosure can be embodied in the form of a software product in essence or that contributes to the existing technology.
  • the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk). ), includes several instructions to cause a terminal (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in various embodiments of the present disclosure.
  • modules, units, sub-modules, sub-units, etc. can be implemented in one or more Application Specific Integrated Circuits (ASIC), Digital Signal Processing (DSP), Digital Signal Processing Equipment ( DSP Device (DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (FPGA), general-purpose processor, controller, microcontroller, microprocessor, used Other electronic documents that perform the functions described in this disclosure element or its combination.
  • ASIC Application Specific Integrated Circuits
  • DSP Digital Signal Processing
  • DSPD Digital Signal Processing Equipment
  • PLD Programmable Logic Device
  • FPGA Field-Programmable Gate Array

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

一种水印嵌入方法、装置、设备及可读存储介质，涉及水印处理技术领域，以降低水印对原始视频内容的影响。包括：对于视频序列中的目标帧，将目标帧划分为多个子块（101）；获取所述多个子块的纹理复杂度（102）；在多个子块的目标子块中嵌入水印（103），其中，目标子块的纹理复杂度大于纹理复杂度阈值。

Description

一种水印嵌入方法、装置、设备及可读存储介质
相关申请的交叉引用
本申请主张在2022年3月11日在中国提交的中国专利申请No.202210239512.8的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及水印处理技术领域，尤其涉及一种水印嵌入方法、装置、设备及可读存储介质。
背景技术
由于超高清视频内容制作的复杂性和成本问题，其对应的视频服务在安全方面面临很多的挑战，对视频内容版权的保护也提出了更高要求。
数字版权管理的关键技术包括有认证技术、加密技术、数字水印技术、防篡改硬件模块和智能卡技术。其中，数字水印技术是一种典型的信息隐藏方法，其内容涵盖文字、文本以及图像。
但是，相关技术的水平嵌入方法，在码流中加入水印后，水印图片对原始视频内容的影响较大。
发明内容
本公开实施例提供一种水印嵌入方法、装置、设备及可读存储介质，以降低水印对原始视频内容的影响。
第一方面，本公开实施例提供了一种水印嵌入方法，包括：
对于视频序列中的目标帧，将所述目标帧划分为多个子块；
获取所述多个子块的纹理复杂度；
在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
第二方面，本公开实施例还提供一种水印嵌入装置，包括：
第一划分模块，用于对于视频序列中的目标帧，将所述目标帧划分为多 个子块；
第一获取模块，用于获取所述多个子块的纹理复杂度；
第一嵌入模块，用于在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
第三方面，本公开实施例还提供一种电子设备，包括：收发机、存储器、处理器及存储在存储器上并可在处理器上运行的程序，所述处理器执行所述程序时实现如上所述的水印嵌入方法中的步骤。
第四方面，本公开实施例还提供一种可读存储介质，所述可读存储介质上存储程序，所述程序被处理器执行时实现如上所述的水印嵌入方法中的步骤。
在本公开实施例中，在目标帧所包括的多个子块中的目标子块嵌入水印，其中，目标子块的纹理复杂度大于纹理复杂度阈值。因此，在本公开实施例中，通过对子块的纹理复杂度进行分析，选择纹理复杂度大于纹理复杂度阈值的目标子块插入水印。由于目标子块的纹理较为复杂，因此，在这些子块中嵌入水印可减少对其原始内容的影响，从而，利用本公开实施例的方案，可降低水印对原始视频内容的影响。
附图说明
图1是本公开实施例提供的水印嵌入方法的流程图之一；
图2是本公开实施例提供的子块位置关系示意图；
图3是本公开实施例提供的水印嵌入方法的流程图之二；
图4是高级加密标准(Advanced Encryption Standard，AES)的加密算法流程图；
图5是S_box表的示意图；
图6是行位移处理的示意图；
图7是列混淆处理图的示意图；
图8是本公开实施例提供的水印嵌入装置的结构图。
具体实施方式
本公开实施例中术语“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。
本公开实施例中术语“多个”是指两个或两个以上，其它量词与之类似。
下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本公开一部分实施例，并不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
参见图1，图1是本公开实施例提供的水印嵌入方法的流程图，如图1所示，包括以下步骤：
步骤101、对于视频序列中的目标帧，将所述目标帧划分为多个子块。
其中，所述目标帧可以是视频序列中的任意视频帧。
在此步骤中，可将目标帧划分为n(n≥2)个4×4的子块。假设，(x,y)位置处的亮度分量为f(x,y)，其中，f(x,y)可表示为：
其中，Bk表示第k个子块亮度，fk(i,j)表示第k个子块中，(i,j)位置处的亮度分量。
步骤102、获取所述多个子块的纹理复杂度。
在此步骤中，对于所述多个子块中的第一子块，获取所述第一子块的像素的方差，并将所述方差作为所述第一子块的纹理复杂度；其中，所述第一子块为所述多个子块的任一子块。
也就是说，在此是以每个子块的像素的方差作为该子块的纹理复杂度。纹理复杂度越大，表示该子块中的纹理细节越多；反之，则表示该子块中的纹理细节越少。在纹理细节区域中嵌入水印，可以保证良好的不可见性而且不影响视频质量。因此，本公开实施例中，选择在纹理复杂的子块中嵌入水印。
为将水印嵌入至整数离散余弦变换(Discrete Cosine Transform，DCT)系数中，需要将得到的子块进行DCT变换，视频序列的二维4×4的DCT变换系数表示如公式(2)：
F(i,j)＝DCT|f(i,j)|,0≤i,j＜4  (2)
其中，F(i，j)表示DCT变换系数，DCT表示离散余弦变换，f(i,j)表示位置(i,j)的像素值。
对公式(2)进一步展开如公式(3)所示：
其中，N表示视频序列的图像帧的尺寸，i＝0，1，2，3；j＝0，1，2，3。
将上述公式(3)转换成矩阵表示，则目标子块的DCT变换系数矩阵为：
其中，Z表示DCT变换系数矩阵，X表示原始像素块的像素矩阵，H表示变换矩阵，E表示修正矩阵，其所有元素值都为1/128，代表矩阵相乘。
如前所述，在纹理细节区域中嵌入水印，可以保证良好的不可见性而且不影响视频质量。其中，DCT变换系数中的高频信息可以表示图像的纹理细节。因此，在本公开实施例中，可根据每个子块的方差来确定每个子块的纹理复杂度。其中，方差计算如下式(5)、(6)所示：

其中，σ2(k)表示第k个子块的方差，fk(i,j)表示第k个子块在位置(i,j)的像素值，μ(k)表示第k个子块的像素均值，等同于gray(k)。gray(k)表示第k个子块的像素均值，fk(k)表示第k个子块的亮度分量。
步骤103、在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
在此步骤中，为了进一步降低嵌入水印对原始内容的影响，若所述多个子块中所述目标子块的数量满足预设要求，在所述目标子块中嵌入所述水印。例如，若所述目标子块的数量大于某个预设值时，可在所述目标子块中嵌入所述水印。
具体的，首先确定纹理复杂度阈值。之后，将所述多个子块的纹理复杂度分别和所述纹理复杂度阈值进行比较，得到比较结果。当根据所述比较结 果确定所述多个子块中目标子块的数量满足预设要求，在所述多个子块的目标子块中嵌入所述水印。例如，可从比较结果中，确定比较结果为纹理复杂度大于纹理复杂度阈值的比较结果的个数，并判断该个数是否满足预设要求。因为比较结果和每个子块是一一对应的，因此，当比较结果为纹理复杂度大于纹理复杂度阈值的比较结果的个数满足预设要求时，也即，所述多个子块中目标子块的数量满足预设要求，从而可确定该当前帧是否可作为嵌入水印的帧。
其中，所述纹理复杂度阈值按照如下方式确定：
获得所述多个子块的DCT变换系数，其中，DCT变换系数的获取可按照前述实施例描述的过程获取。之后，从所述多个子块的DCT变换系数的直流系数中，确定直流系数中间值，将直流系数为所述直流系数中间值的子块所对应的方差，作为所述纹理复杂度阈值。
具体应用中，遍历多个子块，得到多个子块的直流系数。之后，求取多个子块的直流系数的均值，作为所述直流系数中间值，或者，利用多个子块的直流系数中，最接近所述均值的直流系数，作为所述直流系数中间值。之后，将直流系数为所述直流系数中间值的子块所对应的方差，作为所述纹理复杂度阈值。也就是说，如果某个子块的直流系数为所述直流系数中间值，那么，将该子块的方差作为纹理复杂度阈值T。
在确定了阈值之后，将多个子块的方差和所述纹理复杂度阈值进行比较，从而确定某个子块是否可用于嵌入水印，以及，确定该目标帧是否可以作为用于嵌入水印的帧。
当某个子块的方差大于该纹理复杂度阈值，该子块可作为目标子块，也即，该子块为纹理复杂区域。否则，该子块为纹理平滑区域，不合适嵌入水印。根据所述目标子块的数量，判定该帧是否可作为用于嵌入水印的帧。其中，所述预设要求可根据需要设置。例如，当所述比较结果表示所述多个子块中目标子块的数量为全部子块的数量的1/2时，也即有超过一半的帧的方差都大于该纹理复杂度阈值，那么，该目标帧可以作为用于嵌入水印的帧，并可以在目标帧的目标子块中嵌入所述水印。
在本公开实施例中，在嵌入水印时，可在所述目标子块中确定水印嵌入 参数，并根据所述水印嵌入参数，在所述目标子块中嵌入水印。
其中，所述水印可预先经过二值化处理，其表示为式(7)所示：
W＝{w(x,y)|0≤x≤m,0≤y≤n},w(x,y)∈{0,1}   (7)
其中，W表示水印矩阵，w(x,y)代表(x,y)处的像素值，m、n为非负整数。
在具体应用中，利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数与所述目标子块的嵌入强度，在所述目标子块中确定所述水印嵌入参数。其中，所述水印嵌入参数用于影响水印在该目标子块中的嵌入位置。
如图2所示，对于子块20来说，它的相邻子块为图中的21-28。通常情况下，对于位于图像中部的子块，它可以有8个相邻子块。但是，对于位于图像边界的子块，其具有的相邻子块的数量可能少于8个。
具体的，利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数，在所述目标子块中确定所述水印嵌入参数：
其中，C'(k)表示第k个目标子块的水印嵌入参数，表示所述多个子块中与所述目标子块相邻的子块的DCT变换系数的加权平均值，θ表示嵌入强度，watermark(k)表示所述水印对应的二值化值。
在此，所述嵌入强度θ根据第k个目标子块的方差和预设系数确定。对于不同的子块嵌入强度θ的取值不同，可以自适应于各个子块的具体内容。具体的，θ可以表示为：
θ＝σ2(k)·μ   (9)
其中，σ2(k)表示第k个目标子块的方差，μ表示预设系数，根据需要设置，一般取值为0.8。
在此，根据各与所述目标子块相邻的子块的DCT变换系数以及各相邻的子块对应的权重，确定具体的，根据以下公式(10)确定
其中，ρ、φ分别代表权重因子，一般根据实际经验设置，Cx表示相邻的子块的DCT变换系数，q表示相邻子块的总数，p、q为正整数，且p小于q。
其中，由于不同的相邻子块对目标子块中水印嵌入位置的影响效果不同， 因此，其对应的权重不同。通常情况下，前p个相邻的子块，可以是与该目标子块位于相同的对角线上的子块，其对应相同的权重；其他q-p个子块，可以是该目标子块的正上、正下、正左、正右方向上的子块，其对应相同的权重。
对于目标子块具有8个相邻子块的情形来说，第1至4个子块，可以为该目标子块的对角线上的子块(图2中的子块21，23，26，28)；第5至8个子块，可以是该子块正上(图2中的子块22)、上下(图2中的子块27)、正左(图2中的子块24)、正右方向的子块(图2中的子块25)。
由于预处理之后的水印是二值图像，因此，水印嵌入的是“1”或者“0”，规则如式(11)所示：
其中，C'(k)表示第k个目标子块的水印嵌入参数，表示相邻子块的水印嵌入参数的平均值。
以p＝4，q＝8为例，上述(10)可转化为：
对于目标子块具有8个相邻子块的情形来说，第1至4个子块，可以为该目标子块的对角线上的子块(图2中的子块21，23，26，28)，其权重因子为ρ；第5至8个子块，可以是该子块正上(图2中的子块22)、上下(图2中的子块27)、正左(图2中的子块24)、正右方向的子块(图2中的子块26)，其权重因子为φ。
由上可以看出，在本公开实施例中，在目标帧所包括的多个子块中的目标子块嵌入水印，其中，目标子块的纹理复杂度大于纹理复杂度阈值。因此，在本公开实施例中，通过对子块的纹理复杂度进行分析，选择纹理复杂度大于纹理复杂度阈值的目标子块插入水印。由于目标子块的纹理较为复杂，因此，在这些子块中嵌入水印可减少对其原始内容的影响，从而，利用本公开实施例的方案，可降低水印对原始视频内容的影响。
参见图3，图3是本公开实施例提供的水印处理方法的流程图，如图3所示，包括以下步骤：
步骤301、对水印进行加密。
在本公开实施例中，可采用任意的方法对水印进行加密，从而确保水印的安全性与稳健性。
(1)二值化水印图像：
待嵌入的水印首先经过二值化处理。其具体的处理方式表示为公式(8)所示。
(2)AES加密处理
在本公开实施例中，使用高级加密标准(Advanced Encryption Standard，AES)加密算法对其进行加密。在实际应用中，还可利用数据加密标准(Data Encryption Standard，DES)等加密方法，本公开实施例不对所使用的加密方法进行限制。
AES算法主要包括四个操作步骤，分别是密钥加法层(也叫轮密钥加，英文Add Round Key)、字节代换层(SubByte)、行位移层(Shift Rows)、列混淆层(Mix Column)。AES算法在处理的轮数上只有最后一轮操作与前面的轮处理有所不同。在代码实现中，对于水印矩阵W和加密密钥k，统一规定长度为16个字节，如果字符串长度不足，则在字符串末尾追加特定字符进行补足。由于16字节的设定，在实际加密中需要进行共计10次的轮处理。
如图4所示，为AES的加密算法流程图。
在密钥加法层中，对于明文和密钥两个输入参数，需要对其进行按字节异或操作，得到一个新的4×4矩阵，并将其输出至下一层。
字节代换层的主要功能就是让输入的矩阵通过S_box表完成从一个字节到另一个字节的映射，映射后矩阵维度保持不变，仅内部取值发生变化。其中，S_box表是通过一定的方法计算出来的，是一个拥有256个字节元素的数组。与S_box相对应，同样存在逆S_box，用于解密时的数据处理。其中，S_box表如图5所示。
如图6所示，为行位移处理的示意图。行位移处理层属于AES手动的扩散层，通过对矩阵的字节进行位置上的置换，从而使单个位上的变换扩散到影响整个状态当中，从而达到雪崩效应。在解密时，需要执行与加密时相反的行位移处理。
如图7所示，为列混淆处理图的示意图。列混淆子层是AES算法中较为复杂的扩散层，其通过对输入矩阵的每一列执行混淆操作，从而使输入的每个字节都会影响到4个输出字节。行位移子层和列混淆子层的组合经过多轮处理以后，使得矩阵的每个字节都依赖于16个明文字节。
经过上述加密处理后输出的密文，作为水印预处理的最终结果。
步骤302、嵌入过程，包括：
(1)对于视频序列中的目标帧，将所述目标帧划分为多个子块。
在此，依据视频帧的尺寸，将目标帧划分为多个子块。具体的，主要基于目标帧的亮度成分，将其细化分为4×4的亮度残差数据。
(2)获取所述多个子块的纹理复杂度。
具体的，对各个子块进行整数DCT变换，得到其DCT变换系数，并依据各个子块对应的方差以及纹理复杂度阈值确定某个子块是否为纹理复杂子块(即，是否为纹理复杂区域)，以及根据判定为纹理复杂子块的数量确定该子帧是否可以被用于嵌入水印。
其中，步骤302可参照前述步骤101至103的描述。
当然，在实际应用中，也可先执行步骤302，再执行步骤301。
通过以上描述可以看出，在本公开实施例中，通过对水印的加密预处理保障了视频数据的安全性。通过对屏幕内容序列的纹理进行分析，可以自适应性的选择更加合理的水印嵌入方式，提高对于编码特性的适配程度，减少对视频原始内容的影响。
本公开实施例还提供了一种水印嵌入装置。参见图8，图8是本公开实施例提供的水印嵌入装置的结构图。如图8所示，水印嵌入装置800包括：
第一划分模块801，用于对于视频序列中的目标帧，将所述目标帧划分为多个子块；
第一获取模块802，用于获取所述多个子块的纹理复杂度；
第一嵌入模块803，用于在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
可选的，所述第一获取模块802，用于对于所述多个子块中的第一子块，获取所述第一子块的像素的方差，并将所述方差作为所述第一子块的纹理复 杂度；其中，所述第一子块为所述多个子块的任一子块。
其中，所述第一嵌入模块803用于，若所述多个子块中所述目标子块的数量满足预设要求，在所述目标子块中嵌入所述水印。
可选的，所述第一嵌入模块803包括：
第一确定子模块，用于确定纹理复杂度阈值；第一比较子模块，用于将所述多个子块的纹理复杂度分别和所述纹理复杂度阈值进行比较，得到比较结果；第一嵌入子模块，用于当所述比较结果表示所述多个子块中目标子块的数量满足预设要求，在所述多个子块的目标子块中嵌入所述水印。
可选的，所述第一确定子模块包括：
获取单元，用于获得所述多个子块的离散余弦变换DCT变换系数；第一确定单元，用于从所述多个子块的DCT变换系数的直流系数中，确定直流系数中间值；第二确定单元，用于将直流系数为所述直流系数中间值的子块所对应的方差，作为所述纹理复杂度阈值。
可选的，所述第一嵌入子模块包括：
第一确定单元，用于在所述目标子块中确定水印嵌入参数；第一嵌入单元，用于根据所述水印嵌入参数，在所述目标子块中嵌入水印。
可选的，所述第一确定单元，用于利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数与所述目标子块的嵌入强度，在所述目标子块中确定所述水印嵌入参数。
可选的，所述第一确定单元，用于按照如下公式，利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数，在所述目标子块中确定所述水印嵌入参数：
其中，C'(k)表示第k个目标子块的水印嵌入参数，表示所述多个子块中与所述目标子块相邻的子块的DCT变换系数的加权平均值，θ表示所述嵌入强度，watermark(k)表示所述水印对应的二值化值。
其中，所述嵌入强度θ根据第k个目标子块的方差和预设系数确定。
其中，根据各与所述目标子块相邻的子块的DCT变换系数以及各相邻 的子块对应的权重，确定
可选的，根据以下公式确定
其中，ρ、φ分别代表权重因子，Cx表示相邻的子块的DCT变换系数，q表示相邻子块的总数，p、q为正整数，且p小于q。
可选的，所述装置还包括：加密模块，用于对所述水印进行加密；所述第一嵌入模块803，用于在所述目标子块中嵌入加密后的所述加密。
本公开实施例提供的装置，可以执行上述方法实施例，其实现原理和技术效果类似，本实施例此处不再赘述。
需要说明的是，本公开实施例中对单元的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个处理器可读取存储介质中。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本公开各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
本公开实施例提供了一种电子设备，包括：存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序；所述处理器，用于读取存储器中的程序实现如前所述的水印嵌入方法中的步骤。
本公开实施例还提供一种可读存储介质，可读存储介质上存储有程序，该程序被处理器执行时实现上述水印嵌入方法实施例的各个过程，且能达到相同的技术效果，为避免重复，这里不再赘述。其中，所述的可读存储介质， 可以是处理器能够存取的任何可用介质或数据存储设备，包括但不限于磁性存储器(例如软盘、硬盘、磁带、磁光盘(magneto-optical，MO)等)、光学存储器(例如激光唱片(Compact Disk，CD)、数字通用光盘(Digital Versatile Disc，DVD)、蓝光光碟(Blu-ray Disc，BD)、高清通用光盘(High-Definition Versatile Disc，HVD)等)、以及半导体存储器(例如ROM、可擦除可编程只读存储器(Erasable Programmable Read-Only Memory，EPROM)、带电可擦可编程只读存储器(Electrically Erasable Programmableread only memory，EEPROM)、非易失性存储器(NAND FLASH)、固态硬盘(Solid State Disk，SSD))等。。
需要说明的是，在本文中，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者装置不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者装置所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者装置中还存在另外的相同要素。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到上述实施例方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。根据这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁盘、光盘)中，包括若干指令用以使得一台终端(可以是手机，计算机，服务器，空调器，或者网络设备等)执行本公开各个实施例所述的方法。
可以理解的是，本公开实施例描述的这些实施例可以用硬件、软件、固件、中间件、微码或其组合来实现。对于硬件实现，模块、单元、子模块、子单元等可以实现在一个或多个专用集成电路(Application Specific Integrated Circuits，ASIC)、数字信号处理器(Digital Signal Processing，DSP)、数字信号处理设备(DSP Device，DSPD)、可编程逻辑设备(Programmable Logic Device，PLD)、现场可编程门阵列(Field-Programmable Gate Array，FPGA)、通用处理器、控制器、微控制器、微处理器、用于执行本公开所述功能的其它电子单 元或其组合中。
上面结合附图对本公开的实施例进行了描述，但是本公开并不局限于上述的具体实施方式，上述的具体实施方式仅仅是示意性的，而不是限制性的，本领域的普通技术人员在本公开的启示下，在不脱离本公开宗旨和权利要求所保护的范围情况下，还可做出很多形式，均属于本公开的保护之内。

Claims (15)

  1. 一种水印嵌入方法，包括：
    对于视频序列中的目标帧，将所述目标帧划分为多个子块；
    获取所述多个子块的纹理复杂度；
    在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
  2. 根据权利要求1所述的方法，其中，所述获取所述多个子块的纹理复杂度，包括：
    对于所述多个子块中的第一子块，获取所述第一子块的像素的方差，并将所述方差作为所述第一子块的纹理复杂度；其中，所述第一子块为所述多个子块的任一子块。
  3. 根据权利要求1所述的方法，其中，所述在所述多个子块的目标子块中嵌入所述水印，包括：
    确定纹理复杂度阈值；
    将所述多个子块的纹理复杂度分别和所述纹理复杂度阈值进行比较，得到比较结果；
    当根据所述比较结果确定所述多个子块中目标子块的数量满足预设要求，在所述多个子块的目标子块中嵌入所述水印。
  4. 根据权利要求3所述的方法，其中，所述确定纹理复杂度阈值，包括：
    获得所述多个子块的离散余弦变换DCT变换系数；
    从所述多个子块的DCT变换系数的直流系数中，确定直流系数中间值；
    将直流系数为所述直流系数中间值的子块所对应的方差，作为所述纹理复杂度阈值。
  5. 根据权利要求3所述的方法，其中，所述在所述多个子块的目标子块中嵌入所述水印，包括：
    在所述目标子块中确定水印嵌入参数；
    根据所述水印嵌入参数，在所述目标子块中嵌入水印。
  6. 根据权利要求5所述的方法，其中，所述在所述目标子块中确定水印 嵌入参数，包括：
    利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数与所述目标子块的嵌入强度，在所述目标子块中确定所述水印嵌入参数。
  7. 根据权利要求6所述的方法，其中，按照如下公式，利用所述多个子块中与所述目标子块相邻的子块的DCT变换系数，在所述目标子块中确定所述水印嵌入参数：
    其中，C'(k)表示第k个目标子块的水印嵌入参数，表示所述多个子块中与所述目标子块相邻的子块的DCT变换系数的加权平均值，θ表示所述嵌入强度，watermark(k)表示所述水印对应的二值化值。
  8. 根据权利要求7所述的方法，其中，所述嵌入强度θ根据第k个目标子块的方差和预设系数确定。
  9. 根据权利要求7所述的方法，其中，根据各与所述目标子块相邻的子块的DCT变换系数以及各相邻的子块对应的权重，确定
  10. 根据权利要求9所述的方法，其中，根据以下公式确定
    其中，ρ、φ分别代表权重因子，Cx表示相邻的子块的DCT变换系数，q表示相邻子块的总数，p、q为正整数，且p小于q。
  11. 根据权利要求1至10任一项所述的方法，其中，所述方法还包括：
    对所述水印进行加密；
    所述在所述多个子块的目标子块中嵌入所述水印，包括：
    在所述目标子块中嵌入加密后的所述加密。
  12. 根据权利要求1所述的方法，其中，所述在所述多个子块的目标子块中嵌入所述水印，包括：
    若所述多个子块中所述目标子块的数量满足预设要求，在所述目标子块中嵌入所述水印。
  13. 一种水印嵌入装置，包括：
    第一划分模块，用于对于视频序列中的目标帧，将所述目标帧划分为多 个子块；
    第一获取模块，用于获取所述多个子块的纹理复杂度；
    第一嵌入模块，用于在所述多个子块的目标子块中嵌入所述水印，其中，所述目标子块的纹理复杂度大于纹理复杂度阈值。
  14. 一种电子设备，包括：存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序；其中，所述处理器，用于读取存储器中的程序实现如权利要求1至12中任一项所述的水印嵌入方法中的步骤。
  15. 一种可读存储介质，用于存储程序，其中，所述程序被处理器执行时实现如权利要求1至12中任一项所述的水印嵌入方法中的步骤。
PCT/CN2023/080523 2022-03-11 2023-03-09 一种水印嵌入方法、装置、设备及可读存储介质 WO2023169516A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210239512.8A CN116777719A (zh) 2022-03-11 2022-03-11 一种水印嵌入方法、装置、设备及可读存储介质
CN202210239512.8 2022-03-11

Publications (1)

Publication Number Publication Date
WO2023169516A1 true WO2023169516A1 (zh) 2023-09-14

Family

ID=87936072

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/080523 WO2023169516A1 (zh) 2022-03-11 2023-03-09 一种水印嵌入方法、装置、设备及可读存储介质

Country Status (2)

Country Link
CN (1) CN116777719A (zh)
WO (1) WO2023169516A1 (zh)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001111973A (ja) * 1999-08-04 2001-04-20 Ddi Corp 動画像電子透かし装置
WO2003056515A1 (en) * 2001-12-21 2003-07-10 The University Of Surrey Digital watermarking
JP2008288885A (ja) * 2007-05-17 2008-11-27 Mitsubishi Electric Corp 電子透かし埋め込み装置、電子透かし検出装置、電子透かし埋め込みプログラム及び電子透かし検出プログラム
CN101504758A (zh) * 2009-03-17 2009-08-12 陕西科技大学 基于dct算法数字图像水印嵌入方法
CN102142131A (zh) * 2011-05-12 2011-08-03 北京大学 基于加密相息图的数字图像水印嵌入、提取方法及其系统
CN103049880A (zh) * 2012-12-19 2013-04-17 焦点科技股份有限公司 基于离散余弦变换的数字水印方法
CN110191343A (zh) * 2019-06-03 2019-08-30 河海大学 一种基于方差分析的自适应视频水印的嵌入和提取方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001111973A (ja) * 1999-08-04 2001-04-20 Ddi Corp 動画像電子透かし装置
WO2003056515A1 (en) * 2001-12-21 2003-07-10 The University Of Surrey Digital watermarking
JP2008288885A (ja) * 2007-05-17 2008-11-27 Mitsubishi Electric Corp 電子透かし埋め込み装置、電子透かし検出装置、電子透かし埋め込みプログラム及び電子透かし検出プログラム
CN101504758A (zh) * 2009-03-17 2009-08-12 陕西科技大学 基于dct算法数字图像水印嵌入方法
CN102142131A (zh) * 2011-05-12 2011-08-03 北京大学 基于加密相息图的数字图像水印嵌入、提取方法及其系统
CN103049880A (zh) * 2012-12-19 2013-04-17 焦点科技股份有限公司 基于离散余弦变换的数字水印方法
CN110191343A (zh) * 2019-06-03 2019-08-30 河海大学 一种基于方差分析的自适应视频水印的嵌入和提取方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KO, H. J. ET AL.: "Robust and blind image watermarking in DCT domain using inter-block coefficient correlation", INFORMATION SCIENCES, vol. 517, 9 November 2019 (2019-11-09), XP086039880, DOI: 10.1016/j.ins.2019.11.005 *

Also Published As

Publication number Publication date
CN116777719A (zh) 2023-09-19

Similar Documents

Publication Publication Date Title
Qin et al. Reversible data hiding in encrypted image with separable capability and high embedding capacity
Nguyen et al. An adaptive multi bit-plane image steganography using block data-hiding
Saha et al. Steganographic techniques of data hiding using digital images
Thabit et al. Medical image authentication using SLT and IWT schemes
Roy et al. Evaluating image steganography techniques: Future research challenges
Yao et al. Content-adaptive reversible visible watermarking in encrypted images
Bharti et al. A new approach of data hiding in images using cryptography and steganography
Shen et al. A novel data hiding for color images based on pixel value difference and modulus function
Leung et al. Adaptive reversible data hiding based on block median preservation and modification of prediction errors
Peng et al. Reversible data hiding based on RSBEMD coding and adaptive multi-segment left and right histogram shifting
Hanafy et al. A secure covert communication model based on video steganography
Ahmed et al. A secure image steganography using LSB and double XOR operations
Kumar et al. High capacity reversible data hiding based on histogram shifting for medical images
Soualmi et al. A novel blind medical image watermarking scheme based on Schur triangulation and chaotic sequence
Kiani et al. A multi-purpose digital image watermarking using fractal block coding
Huang et al. A divide-and-conquer fragile self-embedding watermarking with adaptive payload
Ye et al. Noise-free thumbnail-preserving image encryption based on MSB prediction
JP5248934B2 (ja) ビデオ処理権利を行使する方法及び装置
Mohammad et al. Lossless visible watermarking based on adaptive circular shift operation for BTC-compressed images
Caldelli et al. Joint near-lossless compression and watermarking of still images for authentication and tamper localization
Zain Strict authentication watermarking with JPEG compression (SAW-JPEG) for medical images
Khan et al. High payload watermarking based on enhanced image saliency detection
WO2023169516A1 (zh) 一种水印嵌入方法、装置、设备及可读存储介质
Hameed et al. A High Quality Secure Medical Image Steganography Method
Hong et al. Reversible data hiding based on histogram shifting of prediction errors

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: 23766093

Country of ref document: EP

Kind code of ref document: A1