New Geometric Analysis of Spread-Spectrum Data Hiding with Repetition Coding, with Implications for Side-Informed Schemes

Balado, Félix

doi:10.1007/11551492_26

Cited by 10 publications

(22 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, it is possible to build a scheme of a given (virtually, as high as possible), provided (24) admits a solution with . The fundamental equation can also be written as (25) with being the Laplacian of .…”

Section: Synthesismentioning

confidence: 99%

A Constructive and Unifying Framework for Zero-Bit Watermarking

Furon

2007

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Abstract-In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks for the presence of this particular weak signal in received contents. The article looks at this problem from a classical detection theory point of view, but with side information enabled at the embedding side. This means that the watermark signal is a function of the host content. Our study is twofold. The first step is to design the best embedding function for a given detection function, and the best detection function for a given embedding function. This yields two conditions, which are mixed into one 'fundamental' partial differential equation. It appears that many famous watermarking schemes are indeed solution to this 'fundamental' equation. This study thus gives birth to a constructive framework unifying solutions, so far perceived as very different.

show abstract

Section: Synthesismentioning

confidence: 99%

A Constructive and Unifying Framework for Zero-Bit Watermarking

Furon

2007

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

show abstract

“…Afterwards, we make a comparison with the vector LQIM [21] which uses non‐uniform quantisation and sphere‐hardening dither modulation (SHDM) [33] which utilises uniform quantisation levels. ‘Lena’ standard image of size 512 × 512 is used in the schemes.…”

Section: Resultsmentioning

confidence: 99%

Geometric modelling of the wavelet coefficients for image watermarking using optimum detector

Hamghalam¹,

Mirzakuchaki²,

Akhaee

2014

IET Image Processing

View full text Add to dashboard Cite

“…Note that the direction of the signal vector x is not changed by embedding, which is advantageous from a perceptual point of view, as opposed to related methods like STDM. As is shown in [2], SHDM offers the same level of robustness against additive white noise as STDM.…”

Section: Shdmmentioning

confidence: 86%

“…Sphere Hardening Dither Modulation, or SHDM for short, was proposed by Balado in [2] and [3] as an alternative to STDM (Spread-Transform Dither Modulation), which was proposed in [11]. Both SHDM and STDM have in common that in order to embed a single bit b, a multidimensional host vector x is extracted from the cover work C 0 and modified using some dithered quantization function Q b , where different message bits lead to different dither values.…”

Section: Shdmmentioning

confidence: 99%

“…In recent years, a number of commutative watermarking-encryption (CWE) schemes have been formulated. The present paper describes a novel CWE scheme, that couples sign-bit encryption of selected pixel greyvalues or transform coefficients as encryption part with Sphere-Hardening-Dither-Modulation (SHDM) [2,3] as the watermarking part. The encryption part can optionally be enhanced by permuting the pixels or transform coeffcients, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Use of SHDM in Commutative Watermarking-Encryption

Schmitz¹

2020

Preprint

View full text Add to dashboard Cite

SHDM stands for Sphere Hardening Dither Modulation and is a watermarking algorithm based on quantizing the norm of a vector extracted from the cover work. We show how SHDM can be integrated into a fully commutative watermarking encryption scheme and investigate implementations in the spatial, DCT- and DWT-domain with respect to their delity, robustness, capacity and security of encryption. The watermarking scheme, when applied in the DCT- or DWT-domain, proves to be very robust against JPEG/JPEG2000 compression. On the other hand, the spatial domain-based approach offers a large capacity. The increased robustness of the watermarking schemes, however, comes at the cost of rather weak encryption primitives, making the proposed CWE scheme suited for low - medium security applications with high robustness requirements.

show abstract

New Geometric Analysis of Spread-Spectrum Data Hiding with Repetition Coding, with Implications for Side-Informed Schemes

Cited by 10 publications

References 8 publications

A Constructive and Unifying Framework for Zero-Bit Watermarking

A Constructive and Unifying Framework for Zero-Bit Watermarking

Geometric modelling of the wavelet coefficients for image watermarking using optimum detector

Use of SHDM in Commutative Watermarking-Encryption

Contact Info

Product

Resources

About