Watermarking of uncompressed and compressed video
Signal Processing
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
A Study of Block-Based Medical Image Watermarking Using a Perceptual Similarity Metric
DICTA '05 Proceedings of the Digital Image Computing on Techniques and Applications
Defending against statistical steganalysis
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
A MPEG-2 video watermarking algorithm with compensation in bit stream
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Watermarking security: theory and practice
IEEE Transactions on Signal Processing - Part II
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
A capacity estimation technique for JPEG-to-JPEG image watermarking
IEEE Transactions on Circuits and Systems for Video Technology
Lossless data hiding in JPEG bitstream
Journal of Systems and Software
An improved VLC-based lossless data hiding scheme for JPEG images
Journal of Systems and Software
Hi-index | 0.02 |
We propose an algorithm to embed data directly in the bitstream of JPEG imagery. The motivation for this approach is that images are seldom available in uncompressed form. Algorithms that operate in spatial domain, or even in coefficient domain, require full (or at best) partial decompression. Our approach exploits the fact that only a fraction of JPEG code space is actually used by available encoders. Data embedding is performed by mapping a used variable length code (VLC) to an unused VLC. However, standard viewers unaware of the change will not properly display the image.We address this problem by a novel error concealment technique. Concealment works by remapping run/size values of marked VLCs so that standard viewers do not lose synchronization and displays the image with minimum loss of quality. It is possible for the embedded image to be visually identical to the original even though the two files are bitwise different. The algorithm is fast and transparent and embedding is reversible and file-size preserving. Under certain circumstances, file size may actually decrease despite carrying a payload.