Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
A new uncompressed-domain video watermarking approach robust to H.264/AVC compression
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
Geometric warping watermarking extended concerning geometric attacks and embedding artifacts
Proceedings of the 9th workshop on Multimedia & security
RST-resilient video watermarking using scene-based feature extraction
EURASIP Journal on Applied Signal Processing
Image watermarking based on invariant regions of scale-space representation
IEEE Transactions on Signal Processing
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
Geometrically invariant watermarking using feature points
IEEE Transactions on Image Processing
Digital watermarking of low bit-rate advanced simple profile MPEG-4 compressed video
IEEE Transactions on Circuits and Systems for Video Technology
Statistical characteristic-based robust audio watermarking for resolving playback speed modification
Digital Signal Processing
Hi-index | 0.00 |
We propose two temporal feature modulation algorithms that extract a feature from each video frame and modulate the features for a series of frames to embed a watermark codeword. In the first algorithm, the existence of a frame is used as the frame feature, and a watermark codeword is embedded into the original video by skipping selected frames. In the second algorithm, the centers of gravity of blocks in a frame are used as the frame feature. By modifying the centers of gravity, we embed 1-bit information into the frame. Simulation results demonstrate that the proposed algorithms are robust against compression and temporal attacks.