KEYWORDS: Digital watermarking, Video, Receivers, Video processing, Video compression, Transparency, Signal processing, Computer programming, Telecommunications, Information security
When transaction watermarking is used to secure sales in online shops by embedding
transaction specific watermarks, the major challenge is embedding efficiency:
Maximum speed by minimal workload. This is true for all types of media. Video
transaction watermarking presents a double challenge. Video files not only are larger
than for example music files of the same playback time. In addition, video
watermarking algorithms have a higher complexity than algorithms for other types of
media. Therefore online shops that want to protect their videos by transaction
watermarking are faced with the problem that their servers need to work harder and
longer for every sold medium in comparison to audio sales. In the past, many
algorithms responded to this challenge by reducing their complexity. But this usually
results in a loss of either robustness or transparency.
This paper presents a different approach. The container technology separates
watermark embedding into two stages: A preparation stage and the finalization stage.
In the preparation stage, the video is divided into embedding segments. For each
segment one copy marked with "0" and anther one marked with "1" is created. This
stage is computationally expensive but only needs to be done once. In the finalization
stage, the watermarked video is assembled from the embedding segments according
to the watermark message. This stage is very fast and involves no complex
computations. It thus allows efficient creation of individually watermarked video files.
KEYWORDS: Digital watermarking, Video, Feature extraction, Video compression, Algorithm development, Video processing, Detection and tracking algorithms, Sensors, Visualization, Information security
Most of the MPEG watermarking schemes can only be embedded into I-frames. The other frames will not be marked.
Different attacks like frame rate changing can change the frame type of the marked I-frames. Thus the watermark could
be detected from wrong I-frames.
Due to these attacks an important issue of digital watermarking solutions for MPEG video is the temporal
synchronization of the video material to the proportions before the attacks to detect the watermark successfully. The
synchronization information can be embed as part of the information watermark or as a second watermark. The
weakness point is with the destruction of the synchronization information the watermark can not be detected more.
We provide a solution which analyzes the I-frames based on a robust image hash system. The hash solution was
developed for JPEG images and can also be used for MPEG I-frames because of their similar structure. The hash values
are robust against common manipulations, like compression, and can be used to detect the marked frames also after
manipulations at the video material. We analyze the usability of the image hash system and develop a concept based on
video and MPEG properties.
Most of the MPEG watermarking schemes can only be embedded into I-frames. The other frames will not be marked. Different attacks like frame rate changing can change the frame type of the marked I-frames. Thus the watermark could be detected from wrong I-frames. Due to these attacks an important issue of digital watermarking solutions for MPEG video is the temporal synchronization of the video material to the proportions before the attacks to detect the watermark successfully. The synchronization information can be embed as part of the information watermark or as a second watermark. The weakness point is with the destruction of the synchronization information the watermark can not be detected more. We provide a solution which analyzes the I-frames based on a robust image hash system. The hash solution was developed for JPEG images and can also be used for MPEG I-frames because of their similar structure. The hash values are robust against common manipulations, like compression, and can be used to detect the marked frames also after manipulations at the video material. We analyze the usability of the image hash system and develop a concept based on video and MPEG properties.
KEYWORDS: Digital watermarking, Video, Video compression, Visualization, Signal detection, Video processing, Directed energy weapons, Detection and tracking algorithms, Image compression, Computer programming
Most of the MPEG watermarking schemes are intracoded block based solutions. In a standard encoded MPEG video every 12th frame is an I-frame, consisting of intracoded blocks. The other frames will not be marked. I-frames have nearly the same structure as JPEG images and JPEG based watermarking solution are applicable for I-frames. Different attacks like frame rate changing can change the frame type of the marked I-frames. Thus the watermark can be detected from wrong I-frames and the capacity of the watermark solutions are lowly.
We propose an extended approach of an existing I-frame watermark solution. We embed the watermark also into the intercoded blocks of P- and B-frames. First the transferred intracoded watermark will be compensated by the drift compensation signal in the intercoded blocks. After this the same watermark information can be embedded in the P- and B-frames as in the I-frames. The advantages of this solution are a higher capacity and a good visual quality of the watermark solution.
We present the drawback points of existing intracoded solutions, our newly developed concept and provide the first test results.
KEYWORDS: Video, Digital watermarking, Video compression, Video processing, Information security, Transparency, Chemical elements, Image compression, Computer programming, Analytical research
A main problem of I-frame based watermarking schemes is their lack of robustness regarding re-encoding attacks on
MPEG material. After a normal post-processing modification the structure of the Groups of Pictures (GOPs) in the
modified video should be the same as in the original one. An attack, which has the goal to destroy the watermark, could
change this structure. The position of the marked intra coded frames will be shifted. Without detecting the correct frame
position an incorrect watermark message could be retrieved. Our conceptual paper proposes a possible solution. A
combined watermark, consisting of two watermark messages, is embedded into the video material to increase the
robustness of the watermark. The first part of the message is the synchronization information to locate the previously
marked frames. The second part contains the information watermark. Our approach is to design a template pattern based
on the synchronization information. With the pattern the original I-frame can be detected and the correct watermark
information can be retrieved. After the recovery of the attacked video material the watermark can be correctly retrieved.
We present the concept and the evaluation of the first test results.
KEYWORDS: Digital watermarking, Video, Multimedia, Information security, Video compression, 3D modeling, 3D video compression, Receivers, Standards development, Visualization
MPEG-4 is an international object-based standard that provides technological basis for digital television, interactive graphics and multimedia applications. These objects can be natural or synthetic e.g. textures, 3D objects, videos or sounds. In this paper we suggest an integrity approach to protect the content of MPEG-4 data. The essential part of this approach is to embed a robust watermark into each visual, audio and 3D object. The content fragile watermark verifying the integrity of a scene is the sum of all information retrieved from the robust watermarks extracted from the objects of the scene. The information of the fragile watermark will be distributed redundantly to all robust watermarks of the scene. Another essential part of our approach is to embed a part of the scene description or object descriptors as a watermark message into the video or audio streams. The amount of embedded information depends on the payload of the watermarking algorithms. We also analyze the possibility of embedding equivalent information into 3D models, depending on the application.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.