Robust digital image watermarking method against geometrical attacks

Kim, Bum Soo; Choi, Jae-Gark; Park, Chul-Hyun; Won, Jong-Un; Kwak, Dong-Min; Oh, Sung‐Kwun; Koh, Chang-Rim; Park, Kil−Houm

doi:10.1016/s1077-2014(03)00020-2

Cited by 58 publications

(25 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When compared with other methods more robustness and watermark embedding capacity are noted. In addition, when compared with [19], [20], this method proved its efficiency for the high amount of embedded data and a better robustness against different geometrical attacks As shown in Fig. 9, our proposed algorithm is highly more robust to JPEG compression when compared with different well known algorithms in the DCT and spatial domains such as Kutter, Cox, Koch, Langelaar, Bruyndonckx, and Frifirich algorithms [21], [22], [24]- [26].…”

Section: ) Jpeg Compression Attackmentioning

confidence: 93%

Multiple Binary Images Watermarking in Spatial and Frequency Domains

Oueslati¹,

Chérif²,

Solaiman³

2013

IJCTE

View full text Add to dashboard Cite

Abstract-Watermarking is used for the protection of intellectual property, data integrity, and data authentication. This paper proposes a novel method for image watermarking based on embedding multiples watermarks in different domains of the image representation (spatial and DCT domains), without any distortion of the watermarked image. In the spatial domain, the processing method is based on study of segmentation by fuzzy c-means clustering method that outputs the zones of watermark embedding and respectively the associated appropriate embedding gain factors. However in the DCT domain a proper choice of the DCT coefficients based on the quantization JPEG table in the middle frequencies band is carried out. Several watermarks were embedded in these two domains in order to take advantage of the spatial domain robustness against different asynchronous attacks, associated to the DCT domain robustness against jpeg compression and some other signal processing distortions. Experimental results show that the proposed method is robust against a large set of synchronous and asynchronous image attacks such as filtering, lossy compression, cropping and rotation attack. IndexTerms-Image watermarking, multi-domains, multi-watermark, insertion force, fuzzy c-mean (FCM)

show abstract

Section: ) Jpeg Compression Attackmentioning

confidence: 93%

Multiple Binary Images Watermarking in Spatial and Frequency Domains

Oueslati¹,

Chérif²,

Solaiman³

2013

IJCTE

View full text Add to dashboard Cite

show abstract

“…Correlation [15] is a measure of similarity of two signals as it depicts the amount by which the signal is deviated from the other signal. Normalized correlation is defined as follows: The low-pass filter [7] [8] used is a second-order Butterworth filter with cut-off frequency 11,025 Hz.…”

Section: Robustness Testmentioning

confidence: 99%

Robust Digital Audio Watermarking Based on SVD and Modified Firefly Algorithm

Rizvi¹,

Chauhan²

2018

JIS

View full text Add to dashboard Cite

Digital Watermarking is a technology, to facilitate the authentication, copyright protection and Security of digital media. The objective of developing a robust watermarking technique is to incorporate the maximum possible robustness without compromising with the transparency. Singular Value Decomposition (SVD) using Firefly Algorithm provides this objective of an optimal robust watermarking technique. Multiple scaling factors are used to embed the watermark image into the host by multiplying these scaling factors with the Singular Values (SV) of the host audio. Firefly Algorithm is used to optimise the modified host audio to achieve the highest possible robustness and transparency. This approach can significantly increase the quality of watermarked audio and provide more robustness to the embedded watermark against various attacks such as noise, resampling, filtering attacks etc.

show abstract

“…Reason for choosing block size as 8*8 is that 8*8 is also the size of JPEG blocks so the JPEG compression will affect each watermarked bit independently [5]. Size of the region is taken 128*128 as 128 is the exact divisor of 512 which is assumed to be the size of our test image in both the direction and also supports the concept of multiple watermarking [19] (1,2,3,4) for the sake of convenience. Host image I is divided into its component Images I R , I G , I B such that I R (i, j ), I G (i, j ) and I B (i, j ) are in the range [0 255] (where (i, j) is the pixel location such that 0 < i, j < = 512).…”

Section: Embedding Proceduresmentioning

confidence: 99%

“…Watermarking can be classified in two broad categories based on their working domains; spatialdomain and frequency domain [4]. Watermarking in frequency domain shows more robustness but complexity and computational cost of forward and inverse transforms can be termed as their drawbacks Moreover in frequency domain methods the size * For correspondence of watermark is restricted to preserve the quality of watermarked image.…”

Section: Introductionmentioning

confidence: 99%

Dual plane multiple spatial watermarking with self-encryption

Sadh

Mishra

Sharma

2016

Sadhana

View full text Add to dashboard Cite

Watermarking has established itself as a promising solution in the context of digital image copyright protection. Frequency domain watermarking is mainly preferred due to associated robustness and perceptual issues but requires a large amount of computation. On the other hand spatial domain watermarking is much faster but lacks when robustness is concerned. In this paper a block based spatial domain watermarking technique for color images is proposed that is fast and robust. Two-way embedding introduced in the paper provides capability to previously estimate perceptual degradation in host image due to watermark embedding. Multiple watermarking in two component images is used to achieve better imperceptibility and better robustness. Self-encryption introduced aims to remove dependency over external secret key however optional encryption with random secret keys is proposed for providing better security. Proposed embedding technique is an effort to achieve proper balance between robustness and quality degradation of image. Experiments suggest proposed method is robust against processing attacks such as spatial filtering transformations image enhancement and loss compression.

show abstract

Robust digital image watermarking method against geometrical attacks

Cited by 58 publications

References 17 publications

Multiple Binary Images Watermarking in Spatial and Frequency Domains

Multiple Binary Images Watermarking in Spatial and Frequency Domains

Robust Digital Audio Watermarking Based on SVD and Modified Firefly Algorithm

Dual plane multiple spatial watermarking with self-encryption

Contact Info

Product

Resources

About