In this work, we consider the problem of blind geometric synchronization of images for watermarking. Existing
solutions involve insertion of periodic templates, geometrically-invariant domains, and feature-point-based
techniques. However, security leakage and poor watermark detection performance under under lossy geometric
attacks are some known disadvantages of these methods. Different from above, recently a perceptual-hash-based
secure and robust image synchronization scheme has been proposed. Although it has some promising results, it
requires a series of heavy computations which prevents it from being employed in real time (or near real time)
applications and from being extended to wider range of geometric attack models. In this paper, we focus on the
computational efficiency of this scheme and introduce a novel randomized algorithm which conducts geometric
synchronization much faster.
In this paper, we propose a semi-blind video watermarking scheme, where we use pseudo-random robust semi-global features of video in the spatially wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. We use a novel approach in generating the watermark such that the temporal correlation within the video frames is reflected on the generated watermark. This is achieved by i) using a special weight distribution along the time axis ii) modifying the regularization step to reflect the temporal characteristic of the host. We experimentally show the robustness of our algorithm against temporal filtering attacks and at the same time show a common weakness in 3D transform based video mark embedding methods.
KEYWORDS: Video, Receivers, Digital watermarking, Computer programming, Forensic science, Video surveillance, Cryptography, Sensors, Digital forensics, Information security
In this paper, we concentrate on video watermarking for forensics applications and consider the temporal synchronization problem, which has been overlooked in the literature so far. As a result,
we propose a system that provides temporal synchronization in video
watermarking by using side information at the receiver. Short perceptually-robust representations (also known as robust hash values) of randomly selected frames from the watermarked video regions is derived at the encoder and transmitted to the decoder. Synchronization is then achieved by computing perceptually-representative information of all frames of the received video
at the receiver and finding the "best matching region" via solving
a combinatorial optimization problem efficiently using dynamic programming techniques. A suitably-chosen "robust image hash" function is used to derive the necessary representative information of the video frames; the resulting hash values possess properties of being short in length, computable in real time, and similar (resp. different) for perceptually similar (resp. different) video frames with high probability. We experimentally illustrate the effectiveness of our method against several attacks, which include frame-wise geometric attacks, as well as temporal de-synchronization attacks, such as random temporal interpolation, scene editing, cutting and swapping.
KEYWORDS: Video, Digital watermarking, Receivers, Quantization, Sensors, Prisms, Optimization (mathematics), Video compression, Information security, Signal detection
In this paper, we propose a novel semi-blind video watermarking scheme, where we use pseudo-random robust semi-global features of video in the three dimensional wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. The exact realizations of the algorithmic parameters are chosen pseudo-randomly
via a secure pseudo-random number generator, whose seed is the secret key, that is known (resp. unknown) by the embedder and the receiver (resp. by the public). We experimentally show the robustness of our algorithm against several attacks, such as conventional signal processing modifications and adversarial estimation attacks.
In digital media transfer, geometrical transformations desynchronize the communications between the encoder and the decoder. Therefore, an attempt to decode the message based on the direct output of the channel with random geometrical state fails. The main goal of this paper is to analyze the conditions of reliable communications based on structured codebooks in channels with geometrical transformations. Structured codebooks include codewords that have some features or statistics designed for synchronization purposes. In the design of capacity approaching data-hiding codes, host interference problem should be resolved. The solution to this problem is to perform the message coding based on random binning dependent on host-state. On the other hand, to achieve robustness to geometrical transformations, the codewords should have host independent statistics and encoding should be performed using random coding. To satisfy these conflicting requirements we propose Multiple Access Channel (MAC) framework where the message is split between two encoders designed based on the random binning and random coding principles. The message encoded according to random coding additionally serves for synchronization purposes. Sequentially, all existing methods that are proposed for reliable communications in channels with geometrical transformations are analyzed within the proposed MAC set-up. Depending on the particular codebook design, we classify these methods into two main groups: template-based codebooks and redundant codebooks. Finally, we perform the analysis of security leaks of each codebook structure in terms of complexity of the worst case attack.
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.