利用视频帧块的高效半盲鲁棒水印算法

针对视频水印算法鲁棒性差或需过多先验信息提高鲁棒性的问题,提出利用视频帧块、KAZE特征匹配和DCT变换方法实现半盲鲁棒视频水印算法。首先,利用用户注册信息作为水印并为之产生唯一的秘钥,基于该秘钥随机产生唯一的帧块并存入数据库;然后,将帧与帧块进行KAZE特征匹配并检测出嵌入区域,进而嵌入水印;最后,将帧块与扭曲视频进行KAZE匹配修正视频各帧并提取水印。仿真试验结果显示,在半盲的前提下,本算法具有高鲁棒性、水印提取过程同步性、版权纠纷解决和非法传播追踪的优点,且具有高应用价值。     

Image watermarking with feature point based synchronization robust to print-scan attack

In this paper we propose a content based multibit watermarking method robust to print-scan attack. A method to extract feature points, robust in terms of watermarking, is proposed. The location of the watermark is tied to a coordinate system defined by robust feature points. A message sequence is mapped to a directional angle of periodic patterns, which are scattered and embedded into triangles in permuted locations. In watermark extraction, an interplay between feature extraction and watermarking ensures reliability and a multibit message can be decoded blindly from the locations pointed by the key. By detecting the alignment of the autocorrelations peaks and using a coding table, a multibit message can be extracted. Experiments show that the method provides robust and blind extraction of watermark information after a print-scan attack and a set of compound attacks.     

Localized image watermarking in spatial domain resistant to geometric attacks

Watermark robustness to geometric attacks is still a challenging research field. In this paper, a novel robust image watermarking scheme is proposed for resisting such attacks. Watermark synchronization is first achieved by local invariant regions which can be generated using scale normalization and image feature points. The watermark is embedded into all the local regions repeatedly in spatial domain. During embedding, each circular region is first divided into homocentric cirque regions. Then the watermark bits are embedded by quantizing each cirque region into an “odd” or “even” region using odd–even quantization. In the decoder, an odd–even detector (OED) is designed to extract the watermark from the distorted image directly. Localized embedding achieves good invisibility and repeated insertion enhances watermark robustness. Simulation results show that the proposed scheme is robust to both geometric attacks and traditional signal processing attacks.     

Discrete Multiwavelet–Based Video Watermarking Scheme Using SURF

This paper proposes a robust, imperceptible block‐based digital video watermarking algorithm that makes use of the Speeded Up Robust Feature (SURF) technique. The SURF technique is used to extract the most important features of a video. A discrete multiwavelet transform (DMWT) domain in conjunction with a discrete cosine transform is used for embedding a watermark into feature blocks. The watermark used is a binary image. The proposed algorithm is further improved for robustness by an error‐correction code to protect the watermark against bit errors. The same watermark is embedded temporally for every set of frames of an input video to improve the decoded watermark correlation. Extensive experimental results demonstrate that the proposed DMWT domain video watermarking using SURF features is robust against common image processing attacks, motion JPEG2000 compression, frame averaging, and frame swapping attacks. The quality of a watermarked video under the proposed algorithm is high, demonstrating the imperceptibility of an embedded watermark.     

基于帧间相关性的盲视频数字水印算法

提出了一种在原始视频中嵌入水印的算法。嵌入的水印由2部分组成:标志水印和信息水印。首先从一段原始视频里随机选出若干视频帧,在这些帧的像素平面亮度分量上固定位置嵌入标志水印,再根据密钥选取其他若干图像块在其离散余弦变换(DCT)直流系数中嵌入信息水印。然后在整段视频的每一小段中重复嵌入水印。提取水印时,只需从整段视频中截取足够包含完整信息水印的一小段视频,通过搜索标志水印快速地选出包含水印信息的帧。然后利用水印帧与前后相邻视频帧之间内容的高度相关性,得到嵌入水印位置像素值的估计,与包含水印信息帧相应位置做比较,提取出水印信息,实现了水印的盲提取。实验结果表明本算法能够抵抗压缩、缩放、帧删除/插入等各种攻击,具有较强的健壮性。     

基于重同步的高容量鲁棒图像水印算法

如何有效地抵抗组合几何攻击,并且提高水印的嵌入容量,一直是数字水印领域一个具有挑战性的课题.针对此种状况,本文提出了一种抗组合几何攻击,且嵌入容量较大的水印算法.首先利用SURF算法从受攻击的图像提取特征点,并与原图像中的少量鲁棒性较强的特征点匹配,根据特征点对间的坐标关系准确估计出仿射矩阵;然后根据仿射矩阵对失真的图像进行几何校正,恢复水印的重同步.由于几何攻击与还原过程中的像素插值仍会导致变换域水印的位置发生细微的误差,本文在空间域嵌入一层定位水印以便精准地同步;最后,考虑到LT码具有良好的纠删性能,因而先将变换域水印信息进行LT码编码,以尽量提高算法的抗剪切性能.实验结果表明,该算法不仅实现了较高容量的嵌入,而且对于剪切、组合几何攻击具有较好的鲁棒性.     

A feature-based digital watermarking scheme for halftone image

It is a challenging work to design a robust halftone image watermarking scheme against desynchronization attacks. In this paper, we propose a feature-based digital watermarking method for halftone images with low computational complexity, good visual quality and reasonable resistance toward desynchronization attacks. Firstly, the feature points are extracted from host halftone image by using multi-scale Harris–Laplace detector, and the local feature regions (LFRs) are constructed according to the feature scale theory. Secondly, discrete Fourier transform (DFT) is performed on the LFRs, and the embedding positions (DFT coefficients) are selected adaptively according to the magnitude spectrum information. Finally, the digital watermark is embedded into the LFRs by quantizing the magnitudes of the selected DFT coefficients. By binding the watermark with the geometrically invariant halftone image features, the watermark detection can be done without synchronization error. Simulation results show that the proposed scheme is invisible and robust against common signals processing such as median filtering, sharpening, noise adding, and JPEG compression, etc., and desynchronization attacks such as rotation, scaling, translation (RST), cropping, local random bend, and print-scan, etc.     

A feature-based robust digital image watermarking scheme

A robust digital image watermarking scheme that combines image feature extraction and image normalization is proposed. The goal is to resist both geometric distortion and signal processing attacks. We adopt a feature extraction method called Mexican hat wavelet scale interaction. The extracted feature points can survive a variety of attacks and be used as reference points for both watermark embedding and detection. The normalized image of an image (object) is nearly invariant with respect to rotations. As a result, the watermark detection task can be much simplified when it is applied to the normalized image. However, because image normalization is sensitive to image local variation, we apply image normalization to nonoverlapped image disks separately. The disks are centered at the extracted feature points. Several copies of a 16-bit watermark sequence are embedded in the original image to improve the robustness of watermarks. Simulation results show that our scheme can survive low-quality JPEG compression, color reduction, sharpening, Gaussian filtering, median filtering, row or column removal, shearing, rotation, local warping, cropping, and linear geometric transformations.     

一种在原始视频帧中嵌入的鲁棒的数字水印

该文提出的在原始视频帧中的扩频水印方案,使用二值图像作为水印,采用每帧索引的办法,并且利用相邻帧的统计相关性来嵌入水印。对于丢帧、帧重组以及共谋攻击有很强的鲁棒性。水印提取时不需要用到原始视频。文中对该方案进行了详细的介绍,并给出了仿真实验结果。     

Study on semantic-based video watermarking method

A new video watermarking method for the Audio Video coding Standard (AVS) is proposed. According to human visual masking properties, this method determines the region of interest for watermark embedding by analyzing video semantics, and generates dynamic robust watermark according to video motion semantics, and embeds watermarks in the Intermediate Frequency (IF) Discrete Cosine Transform (DCT) coefficients of the luminance sub-block prediction residual in the region of interest. This method controls watermark embedding strength adaptively by video textures semantics. Experiments show that this method is robust not only to various conventional attacks, but also to re-frame, frame cropping, frame deletion and other video-specific attacks.     

A robust blind watermarking algorithm for depth-image-based rendering 3D images

The protection of 3D contents from illegal distribution has attracted considerable attention and depth-image-based rendering (DIBR) is proved to be a promising technology for 3D image and video displaying. In this paper, we propose a new digital watermarking scheme for DIBR 3D images based on feature regions and ridgelet transform (RT). In this scheme, the center view and the depth map are made available at the content provider side. After selecting the reference points of the center view, we construct the feature regions for watermark embedding. Considering the sparse image representation and directional sensitivity of the RT, the watermark bits are embedded into the amplitudes of the ridgelet coefficients of the most energetic direction. The virtual left and virtual right views are generated from the watermarked center view and the associated depth map at the content consumer side. The watermarked view has good perceptual quality under both the objective and subjective image quality evaluations. The embedded watermark can be detected blindly with low bit error rate (BER) from the watermarked center view, the synthesized left and right views even when the views are distorted and distributed separately. The experimental results demonstrate that the proposed scheme exhibits good performance in terms of robustness against various image processing attacks. Meanwhile, our method can be robust to common DIBR processing, such as depth image variation, baseline distance adjustment and different rendering conditions. Furthermore, compared with other related and state-of-the-art methods, the proposed algorithm shows higher accuracy in watermark extraction.     

Visual attention guided video copy detection based on feature points matching with geometric-constraint measurement

In this paper, to efficiently detect video copies, focus of interests in videos is first localized based on 3D spatiotemporal visual attention modeling. Salient feature points are then detected in visual attention regions. Prior to evaluate similarity between source and target video sequences using feature points, geometric constraint measurement is employed for conducting bi-directional point matching in order to remove noisy feature points and simultaneously maintain robust feature point pairs. Consequently, video matching is transformed to frame-based time-series linear search problem. Our proposed approach achieves promising high detection rate under distinct video copy attacks and thus shows its feasibility in real-world applications.     

A Frame‐Based Video Signature Method for Very Quick Video Identification and Location

A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame‐based video signature that uses the spatial information and a two‐stage matching method is presented. The proposed method is pair‐wise independent and is robust against common video modifications. The proposed two‐stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG‐7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.     

Robust video watermarking based on affine invariant regions in the compressed domain

This paper proposes a novel robust video watermarking scheme based on local affine invariant features in the compressed domain. This scheme is resilient to geometric distortions and quite suitable for DCT-encoded compressed video data because it performs directly in the block DCTs domain. In order to synchronize the watermark, we use local invariant feature points obtained through the Harris-Affine detector which is invariant to affine distortions. To decode the frames from DCT domain to the spatial domain as fast as possible, a fast inter-transformation between block DCTs and sub-block DCTs is employed and down-sampling frames in the spatial domain are obtained by replacing each sub-blocks DCT of 2×2 pixels with half of the corresponding DC coefficient. The above-mentioned strategy can significantly save computational cost in comparison with the conventional method which accomplishes the same task via inverse DCT (IDCT). The watermark detection is performed in spatial domain along with the decoded video playing. So it is not sensitive to the video format conversion. Experimental results demonstrate that the proposed scheme is transparent and robust to signal-processing attacks, geometric distortions including rotation, scaling, aspect ratio changes, linear geometric transforms, cropping and combinations of several attacks, frame dropping, and frame rate conversion.     

SIFT特征区域Contourlet域遥感图像水印算法

针对现有遥感图像数字水印算法多为基于图像全局的水印算法,抵抗旋转、缩放、行列剪切以及联合几何攻击能力较差的问题,提出一种基于SIFT特征区域的Contourlet域遥感图像数字水印新方法。算法选取二值数字图像作为水印图像,将二值水印图像置乱预处理后,对其进行行扫描形成一维向量作为待嵌入的水印信息;然后,在宿主遥感图像中提取SIFT特征点,筛选特征点,并依据特征点确定水印嵌入的特征区域;最后,规范所选特征区域,对其进行归一化后实施Contourlet变换,利用奇偶量化方法将水印信息嵌入所选的变换系数内。实验结果表明算法对JEPG压缩、噪声以及滤波等常规信号处理具有较好的鲁棒性,同时能够更好地抵抗旋转、缩放、平移及其联合等几何攻击。      

一种基于图像特征点的数字水印嵌入方法

如何有效抵抗去同步攻击是数字图像水印研究领域的热点问题之一.本文提出了一种可有效抵抗去同步攻击的图像水印新算法.该算法首先利用Harris-Laplace算子从载体图像中提取尺度空间特征点;再结合特征尺度自适应确定局部特征区域;最后,采纳DFT中频幅值量化策略将水印重复嵌入到多个不相交的局部特征区域中.检测时,利用特征点实现水印的重同步,无须求助于原始图像.仿真结果表明,本文算法不仅具有较好的透明性,而且对常规信号处理和去同步攻击均具有较好的鲁棒性.     

Robust dual watermarking algorithm for AVS video

In this paper, we propose a robust dual watermarking algorithm for video based on the audio video coding standard (AVS). One watermark is embedded in luminance components, whose embedding positions are optimized using the particle swarm optimization (PSO) technique, resisting common signal processing operations such as median filtering, adding noises, cropping and so on. To combat geometric and re-encoding attacks, the other watermark is embedded in chrominance components by adjusting the energy relationship between Cb and Cr components based on the just noticeable distortion (JND) concept of the human vision system (HVS). Both of them are implemented in the compressed domain by modifying the quantized coefficients, combined together to satisfy the requirements of robustness and imperceptibility. Only entropy decoding is required to detect the watermark, and thus the watermark detection process has low computational complexity. Extensive experimental results show that the high robustness and good quality of watermarked AVS video can be achieved simultaneously.     

An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms

Although it has been known that oblivious (or blind) watermarking schemes are less robust than nonoblivious ones, they are more useful for various applications where a host signal is not available in the watermark detection procedure. From a viewpoint of oblivious watermarking for a three-dimensional (3-D) polygonal mesh model, distortionless attacks, such as similarity transforms and vertex reordering, might be more serious than distortion attacks including adding noise, smoothing, simplification, remeshing, clipping, and so on. Clearly, it is required to develop an oblivious watermarking that is robust against distortionless as well as distortion attacks. In this paper, we propose two oblivious watermarking methods for 3-D polygonal mesh models, which modify the distribution of vertex norms according to the watermark bit to be embedded. One method is to shift the mean value of the distribution and another is to change its variance. Histogram mapping functions are introduced to modify the distribution. These mapping functions are devised to reduce the visibility of watermark as much as possible. Since the statistical features of vertex norms are invariant to the distortionless attacks, the proposed methods are robust against such attacks. In addition, our methods employ an oblivious watermark detection scheme, which can extract the watermark without referring to the cover mesh model. Through simulations, we demonstrate that the proposed approaches are remarkably robust against distortionless attacks. In addition, they are fairly robust against various distortion attacks     

Robust Video Watermarking of H.264/AVC

A robust video watermarking scheme of the state-of-the-art video coding standard H.264/AVC is proposed in this brief. 2-D 8-bit watermarks such as detailed company trademarks or logos can be used as inconvertible watermark for copyright protection. A grayscale watermark pattern is first modified to accommodate the H.264/AVC computational constraints, and then embedded into video data in the compressed domain. With the proposed method, the video watermarking scheme can achieve high robustness and good visual quality without increasing the overall bit-rate. Experimental results show that our algorithm can robustly survive transcoding process and strong common signal processing attacks, such as bit-rate reduction, Gaussian filtering and contrast enhancement     

基于提升小波的多重数字音频水印

该文提出了一种在提升小波域同时嵌入鲁棒水印和易损水印的音频水印算法。原始音频信号经过提升小波变换后,将低频小波系数进行均值量化嵌入鲁棒水印,具有较好的鲁棒性和不可感知性;对高频小波系数直接进行单个系数量化嵌入易损水印,当音频内容发生篡改时,这些水印信息会发生相应的改变,从而可以鉴定原始音频的完整性。水印的提取不需要原始音频信号。实验结果表明,鲁棒水印对MP3压缩、低通滤波、加噪、重量化、重采样等信号处理攻击具有很强的鲁棒性;而易损水印对上述攻击则具有很强的敏感性。