&lt;title&gt;Exhaustive geometrical search and the false positive watermark detection probability&lt;/title&gt;

Lichtenauer, Jeroen; Setyawan, Iwan; Kalker, Ton; Lagendijk, Reginald L.

doi:10.1117/12.503186

Cited by 47 publications

(25 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the interest of reducing the computational complexity of geometrical synchronization, we adopt K = 2 steerable basis filters, i.e., G 0 (θ) = cos (θ) and G 1 (θ) = cos(θ − π/2) according to Eq. (6). From the sufficient and necessary condition of shiftability [29], the steerable interpolation function b k (ϕ) satisfies the following equation:…”

Section: Derivation Of Interpolation Functionmentioning

confidence: 99%

See 1 more Smart Citation

Counteracting geometrical attacks on robust image watermarking by constructing a deformable pyramid transform

Wang

Zhang

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Counteracting geometrical attacks remains one of the most challenging problems in robust watermarking. In this paper, we resist rotation, scaling, and translation (RST) by constructing a kind of deformable pyramid transform (DPT) that is shift-invariant, steerable, and scalable. The DPT is extended from a closed-form polar-separable steerable pyramid transform (SPT). The radial component of the SPT's basis filters is taken as the kernel of the scalable basis filters, and the angular component is used for the steerable basis filters. The shift-invariance is inherited from the SPT by retaining undecimated high-pass and band-pass subbands. Based on the designed DPT, we theoretically derive interpolation functions for steerability and scalability and synchronization mechanisms for translation, rotation, and scaling. By exploiting the preferable characteristics of DPT, we develop a new template-based robust image watermarking scheme that is resilient to RST. Translation invariance is achieved by taking the Fourier magnitude of the cover image as the DPT's input. The resilience to rotation and scaling is obtained using the synchronization mechanisms for rotation and scaling, for which an efficient template-matching algorithm has been devised. Extensive simulations show that the proposed scheme is highly robust to geometrical attacks, such as RST, cropping, and row/column line removal, as well as common signal processing attacks such as JPEG compression, additive white Gaussian noise, and median filtering.

show abstract

Section: Derivation Of Interpolation Functionmentioning

confidence: 99%

“…The exhaustive search method [5][6][7] iteratively corrects each geometrical distortion in the search space and then evaluates the watermark extracted from the geometrically corrected carrier accordingly. This method generally leads to high computational complexity and a large probability of false positives.…”

Section: Introductionmentioning

confidence: 99%

Counteracting geometrical attacks on robust image watermarking by constructing a deformable pyramid transform

Wang

Zhang

2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Naive search is not practical for many applications because the cardinality of the set of all coordinate transformations (or subsets such as the set of affine transformations or the set of shifts) is an obstacle for computationally efficient search. It has also been shown that the exhaustive search is prone to false positives, which makes this approach questionable even if computational cost is not a constraint [16].…”

Section: Introductionmentioning

confidence: 99%

<title>Temporal synchronization in video watermarking</title>

Lin

Delp

2002

SPIE Proceedings

View full text Add to dashboard Cite

Abstract-One of the challenges for blind watermark detection is synchronization. Synchronization is the process of identifying the coordinates of an embedded watermark and is crucial in successful watermark detection. If the detector's input is watermarked but synchronization fails, then the embedded watermark will not be detected. In this paper, temporal synchronization for blind video watermark detection is examined by developing new models for watermark embedding and detection. The structure of the watermark, and specifically its key schedule, dramatically affects the ease of synchronization. The new embedder models the construction of the watermark by using a state machine key generator. The key generator can produce time-invariant, time-independent, and time-periodic key schedules as special cases. The watermark detector uses a queue and a state predictor to perform a search to establish and maintain temporal synchronization. These models are general and can be applied to many symmetric blind video watermarking techniques. It is shown that a watermark without temporal redundancy in its key schedule is vulnerable to attacks such as frame dropping and transposition. Using the models, a watermark more resilient against temporal synchronization attacks is designed by adding temporal redundancy in the watermark construction. Experimental results from an implementation of the models are presented.

show abstract

“…This grid reference information is usually either the original non-watermarked image -leading to non-blind approaches (5) -, or embedded structure or marker information -leading to blind inversion approaches (6,7,8) . A different blind approach is to perform a geometrical search for the watermark, however this has important drawbacks concerning false positive detection probability, as we explained in (9) .…”

Section: Introductionmentioning

confidence: 99%

Hiding correlation-based watermark templates using secret modulation

2004

Self Cite

View full text Add to dashboard Cite

A possible solution to the difficult problem of geometrical distortion of watermarked images in a blind watermarking scenario is to use a template grid in the autocorrelation function. However, the important drawback of this method is that the watermark itself can be estimated and subtracted, or the peaks in the Fourier magnitude spectrum can be removed. A recently proposed solution is to modulate the watermark with a pattern derived from the image content and a secret key. This effectively hides the watermark pattern, making malicious attacks much more difficult. However, the algorithm to compute the modulation pattern is computationally intensive. We propose an efficient implementation, using frequency domain filtering, to make this hiding method more practical. Furthermore, we evaluate the performance of different kinds of modulation patterns. We present experimental results showing the influence of template hiding on detection and payload extraction performance. The results also show that modulating the ACF based watermark improves detection performance when the modulation signal can be retrieved sufficiently accurately. Modulation signals with small average periods between zero crossings provide the most watermark detection improvement. Using these signals, the detector can also make the most errors in retrieving the modulation signal until the detection performance drops below the performance of the watermarking method without modulation.

show abstract

<title>Exhaustive geometrical search and the false positive watermark detection probability</title>

Cited by 47 publications

References 8 publications

Counteracting geometrical attacks on robust image watermarking by constructing a deformable pyramid transform

Counteracting geometrical attacks on robust image watermarking by constructing a deformable pyramid transform

<title>Temporal synchronization in video watermarking</title>

Hiding correlation-based watermark templates using secret modulation

Contact Info

Product

Resources

About