Rotation, scale and translation invariant digital image watermarking

O'Ruanaidh, Joséph John; Pun, Thierry

doi:10.1109/icip.1997.647968

Cited by 260 publications

(128 citation statements)

References 8 publications

Supporting

Mentioning

127

Contrasting

Unclassified

Order By: Relevance

“…They appear to be parallel with the curve N o = N c σ 2 x /γ 2 . Tests done with different N v confirm that the efficiency of the 2 We discovered after submission a similar approach uniquely devoted to watermark removal and only based on PCA in [37]. attack does not depend on the vector length.…”

Section: A Known Message Attackmentioning

confidence: 93%

See 1 more Smart Citation

Watermarking security: theory and practice

Cayre

Fontaine

Furon

2005

IEEE Trans. Signal Process.

245

166

View full text Add to dashboard Cite

This article proposes a theory of watermarking security based on a cryptanalysis point of view. The main idea is that information about the secret key leaks from the observations, for instance watermarked pieces of content, available to the opponent. Tools from information theory (Shannon's mutual information and Fisher's information matrix) can measure this leakage of information. The security level is then defined as the number of observations the attacker needs to successfully estimate the secret key. This theory is applied to two common watermarking methods: the substitutive scheme and the spread spectrum based techniques. Their security levels are calculated against three kinds of attack. The experimental work illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels derived in the theoretical part of the article.

show abstract

Section: A Known Message Attackmentioning

confidence: 93%

“…Some key events in this quest are the use of spread spectrum [1], the invention of resynchronization schemes [2], [3], the discovery of side information channel [4], [5], and the formulation of the opponent actions as a game [6].…”

Section: Introductionmentioning

confidence: 99%

Watermarking security: theory and practice

Cayre

Fontaine

Furon

2005

IEEE Trans. Signal Process.

245

166

View full text Add to dashboard Cite

show abstract

“…Let the sequence x = {x n } of length N represent the content (luminance of pixels [4], DCT coefficients [6], Fourier-Mellin transform coefficients [5], wavelet transform coefficients for still picture, location of grid nodes of computer image, facial animation parameters of MPEG-4 head object, sample of sound [15]...). Assume there is an algorithm based on some Human Perception Model considerations which is able to calculate the amount of noise that each coefficient can bear without perceptible quality loss.…”

Section: Embedding Processmentioning

confidence: 99%

An Asymmetric Public Detection Watermarking Technique

Furon

Duhamel

2000

Information Hiding

View full text Add to dashboard Cite

Abstract. The new watermarking technique 1 presented in this paper is an example of an asymmetric public detection scheme. The detection process does not need the original picture nor the secret key used in the embedding process. It is the translation, in the watermarking domain, of a public key pair cryptosystem. The key idea is to filter the pseudo-noise sequence before embedding it in the cover-content. Contrary to classical techniques, the heart of the detection algorithm is not a correlation measure but a consistent statistical test hypothesis in spectral analysis. Some signal based considerations show that knowing the public key used in the detection process is no use for pirate who wants to discover the secret key. An example of a copyright protection system for digital content using this technique is briefly described.

show abstract

“…There have been several studies related to watermark synchronization: the use of periodic sequences [5], the use of templates insertion [10], and the use of invariant transforms [1,7,11,12]. One way to synchronize the location for watermark insertion and detection is to use the media content itself.…”

mentioning

confidence: 99%

Geometrically invariant watermarking: synchronization through circular Hough transform

Lee

2007

Multimed Tools Appl

View full text Add to dashboard Cite

This paper addresses a geometrically invariant watermarking method for digital images. Most previous watermarking algorithms perform weakly against geometric distortions, which desynchronize the location for the inserted watermark. Watermark synchronization, which is a process for finding the location for watermark insertion and detection, is crucial for robust watermarking. In this paper, we propose a watermarking method that is robust to geometric distortions. In order to synchronize the location for watermark insertion and detection, we use circular Hough transform, which extracts circular features that are invariant to geometric distortions. The circular features are then watermarked using additive way on the spatial domain. Our method belongs to the category of blind watermarking techniques, because we do not need the original image during detection. Experimental results support the contention that our method is useful and considerably robust against both geometric distortion attacks and signal processing attacks as listed in Stirmark 3.1.

show abstract

Rotation, scale and translation invariant digital image watermarking

Cited by 260 publications

References 8 publications

Watermarking security: theory and practice

Watermarking security: theory and practice

An Asymmetric Public Detection Watermarking Technique

Geometrically invariant watermarking: synchronization through circular Hough transform

Contact Info

Product

Resources

About