Elsevier

Applied Soft Computing

Volume 10, Issue 1, January 2010, Pages 332-343
Applied Soft Computing

BCH coding and intelligent watermark embedding: Employing both frequency and strength selection

https://doi.org/10.1016/j.asoc.2009.08.004Get rights and content

Abstract

This paper presents a novel approach of adaptive visual tuning of a watermark in Discrete Cosine Transform (DCT) domain. The proposed approach intelligently selects appropriate frequency bands as well as optimal strength of alteration. Genetic Programming (GP) is applied to structure the watermark by exploiting both the characteristics of human visual system and information pertaining to a cascade of conceivable attacks. The developed visual tuning expressions are dependent on frequency and luminance sensitivities, and contrast masking. To further enhance robustness, spread spectrum based watermarking and Bose–Chadhuri–Hocquenghem (BCH) coding is employed. The combination of spread spectrum sequence, BCH coding and GP based non-linear structuring makes it extremely difficult for an attacker to gain information about the secret knowledge of the watermarking system. Experimental results show the superiority of the proposed approach against the existing approaches. Especially, the margin of improvement in robustness will be of high importance in medical and context aware related applications of watermarking.

Introduction

To implement Digital Rights Management (DRM), digital watermarking has received substantial attraction. A very recent example is the focus of Distributed Computing Industry Association on “how digital watermarks can ensure DRM in peer-to-peer Applications”. As regards DRM, two important but contradicting properties of a watermarking system; robustness and imperceptibility, are of prime importance. Making a tradeoff between these two properties in view of both human visual system (HVS) and the anticipated application is a challenging problem. The intended application of the watermarking scheme needs a specific balance between these properties. Therefore, treating this balance achievement as an optimization problem and developing strategies that may adaptively deliver this delicate balance for a new application has attracted many researchers.

A watermark is generally structured using perceptual models, which exploit the characteristics of HVS in order to attain imperceptibility. These perceptual models are able to learn the frequency content of a cover image by exploiting the sensitivities/insensitivities of HVS. They take advantage of frequency sensitivity models that are based on viewing conditions as well as the cover image dependent, luminance sensitivity and contrast masking effects. Frequency sensitivity describes the HVS sensitivity to sine wave gratings at different spatial frequencies and depends only on the surrounding conditions. Luminance sensitivity on the other hand, is a measure of the effect of the detectable threshold of a signal on a constant background. It depends on the average luminance value of the background as well as on the signal's luminance level. In block-based Discrete Cosine Transform (DCT) case, the DC coefficient of each block dictates the luminance sensitivity for that block. The third important property of HVS that is exploited for hiding a watermark is the contrast masking. It represents the ability of detecting one signal in the presence of another signal. This masking effect increases when the masking signal and the signal to be masked have same spatial frequency, orientation and location. In block-based DCT, the AC coefficients dictate this behavior.

Watson's Perceptual Model [1] is an appropriate example of such models, as it has been extensively used in image compression and digital watermarking [2], [3]. Other pertinent examples of such models include Lambrecht's Gabor filters based model [4], and Kutter's model based on local isotropic measure and a masking function [5]. However, all these perceptual models are devised in view of invisibility requirements alone, and thus, lack in exploiting the information pertaining to distortions caused by a set of probable attacks. As a result, they are inefficient to cater, concurrently, for both robustness and imperceptibility needs of a watermarking system. These approaches are thus inappropriate for applications, such as online catalogs, medical imagery and Print-to-Web technology, which, besides imperceptibility, require a high degree of robustness as well. In [3], an effort is put to cope with this problem; however, their approach does not perform frequency band selection and thus is not able to survive a series of attacks on the watermarking system.

A variety of watermarking schemes are proposed in literature, including transform domain techniques [6], [7], [8], [9], and spatial domain methods [10]. Almost all of the transform domain watermarking approaches make use of a predetermined set of coefficients, mostly in the middle frequency range, to serve as a tradeoff for watermark embedding. The disadvantages of such a selection are discussed in detail by Shieh et al. [11], who also proposed a scheme in which suitable embedding positions in a block based DCT domain watermarking are selected using Genetic Algorithm. Nevertheless, they do not take into consideration the allowable strength of alteration and robustness against a series of attacks. Harrak et al. [12] proposed a GP based watermarking technique which makes a tradeoff in terms of image quality and robustness. The drawbacks of their scheme include non-blind extraction of the watermark, no position selection and inability to preserve the watermark after even a single unintentional attack like Gaussian noise or JPEG compression. Lee et al. [13] proposed a hybrid watermarking scheme based on Genetic Algorithm and Particle Swarm Optimization in Discrete Wavelet Transform (DWT) domain. Their work is based on the assumption that higher detection response could be expected if two complementary watermarks are simultaneously embedded into the transformed coefficients through positive and negative modulations, respectively. Nevertheless, each type of modulation resists a specific class of attacks, and thus, limits the watermark detection in case where different classes of attacks are presented in a sequence. Lu et al. [14] have proposed a robust watermarking scheme based on DWT and non-negative matrix factorization, which is robust against a single attack. Li and Wang [15] have achieved the robustness–imperceptibility tradeoff against individual attacks by combining Radon transform with 2D wavelet transform. Chang et al. [16] used Singular Value Decomposition (SVD) in an attempt to achieve a subtle balance between the robustness and imperceptibility requirements. On the other hand, Zheng et al. [17] have used Particle Swarm Optimization (PSO) in integer DCT domain to optimize the two watermarking objectives. Recently, Aslantas et al. [18] have proposed the idea of utilizing SVD and PSO in a DWT based image watermarking technique. Their proposed idea is to intelligently select the optimum scaling factors for different wavelet sub-bands in view of different attacks. The drawback of their scheme is that it does not allow the blind extraction of the watermark and is robust against a single attack only. Khan [19] also presented a GP based attack resistant watermarking approach.

Therefore, the performance of the existing watermarking approaches is not up to the task when we consider watermark structuring in view of a sequence of attacks, which is much desirous in real world applications. In the present work, in order to resist a series of attacks, we employ selection of both frequency band, as well as, strength of alteration for watermark embedding simultaneously.

Error correcting codes (ECCs) are gaining more popularity in terms of their capability to enhance watermark robustness. Alattar et al. have used spread spectrum technique and BCH coding for watermarking electronic documents [20]. The work by Miaou et al. [21] demonstrates significant improvement in robustness by using BCH coded watermarks in error-prone transmission of MPEG video. Other pertinent examples include the use of low-density parity check codes (LDPC) [22], and Reed-Solomon codes [23] as error correcting codes to enhance robustness in digital watermarking.

The remaining part of this paper is organized as follows: Section 2 introduces perceptual modeling. Our proposed method is described in Section 3, which includes GP simulation, implementation of frequency band selection through the concept of a wrapper function and application of BCH codes in the proposed watermark structuring approach. Implementation details are presented in Section 4. Section 5 discusses the potential applications of the proposed approach. Results and discussion are presented in Section 6, followed by conclusion in the last section.

Section snippets

Perceptual modeling

Development of an adaptive watermarking scheme to structure a watermark requires the understanding of the cover image in the context of HVS. In spatial domain, this understanding means knowing the distribution of smooth and textured areas in a cover image. In transform domain, it means knowing the distribution of low, mid and high frequency components of the cover image. Thus, in order to hide the watermark, the watermark is tuned/shaped using perceptual models that exploit

Proposed watermark structuring in frequency domain

The proposed watermarking scheme utilizes GP and a Discrete Cosine Transform (DCT) based watermarking approach [24], to illustrate the concept of adaptively structuring a watermark both in view of HVS as well as the anticipated series of attacks. The watermark is embedded in DCT domain with GP providing the delicate balance between robustness and imperceptibility by developing application specific VTF. Fig. 1 illustrates the basic architecture of our GP based proposed scheme. Theoretical

Implementation details

Simulations are carried out in MATLAB. To employ GP, we have used MATLAB-based GPLAB toolbox [28]. Initial population in GP simulation is generated through Ramped Half-and-Half method. Initial operator probabilities are set to ‘variable’, while the selection method for reproduction is set to ‘tournament’. The remaining parameters used are as default in the software and summarized in Table 1.

Ten images, such as, Baboon, Boat, Trees, Couple, Lena, etc., of size 256 × 256 are used as cover images

Potential applications of the proposed approach

In this section we discuss some of the potential applications of our proposed GP based adaptive visual tuning scheme. The first potential application is in medical information handling and sharing, with applications ranging from cooperative working sessions, telediagnosis to telesurgery [29]. The high security risks involved in medical data such as electronic patient records (EPRs), and concomitantly, a higher desired visual quality such as in telediagnosis and telesurgery, urges for the use of

Experimental results and discussion

Initially, during the training phase, a random population is created with each individual representing potential VTF using Eq. (9). Every candidate is evaluated using a fitness function based on objective measures for watermark robustness and imperceptibility. VTFs are evolved using 10 standard training images as displayed in Fig. 3. Their performance is tested in the light of a typical transform domain watermarking scheme [24], by using 300 test images from everyday life. In order to

Conclusion

We have proposed an intelligent technique capable of adaptively structuring a watermark in DCT domain. The developed visual tuning functions are able to learn and exploit the frequency content of a given image. It has shown substantial improvement in robustness, even in applications, where series of attacks are anticipated. Applying an error correction strategy during GP simulation, such as BCH coding, further improves robustness. It is easy to implement and is applicable to all watermarking

Acknowledgment

This work is supported by the Higher Education Commission of Pakistan under the indigenous PhD scholarship program (17-5-1(Cu-204)/HEC/Sch/2004).

References (36)

  • C.J. van den Branden Lambrecht et al.

    Perceptual quality metric for digitally coded color images

  • M. Kutter et al.

    A vision-based masking model for spread-spectrum image watermarking

    IEEE Transactions on Image Processing

    (2002)
  • H.M. Wang et al.

    Wavelet-based digital image watermarking

    Optics Express

    (1998)
  • Z. Li et al.

    Geometric distortion-invariant watermarking based on Tschebycheff transform and dual-channel detection

    Optics Express

    (2007)
  • F. Ahmed

    A dual Fourier-wavelet domain authentication-identification watermark

    Optics Express

    (2007)
  • B. Hao-Xian Wang et al.

    Robust blind video watermarking with adaptive embedding mechanism

    International Journal of Innovative Computing, Information and Control

    (2005)
  • H. Harrak et al.

    DCT watermarking optimization by genetic programming

    Advances in Soft Computing

    (2006)
  • Y. Li et al.

    A watermarking method combined with Radon transform and 2D-wavelet transform

  • Cited by (50)

    • Protection of medical images and patient related information in healthcare: Using an intelligent and reversible watermarking technique

      2017, Applied Soft Computing Journal
      Citation Excerpt :

      Generally, watermarking is categorized as Fragile, Robust, and Semi-fragile watermarking [10,20,7]. In fragile watermarking, alteration in image results in the destruction of watermark and robust watermarking aims to resist attacks [34,30]. Whereas in semi fragile watermarking, a watermark is supposed to resist unintentional attacks but get destroyed in case of intentional attacks.

    • Improving MR brain image segmentation using self-organising maps and entropy-gradient clustering

      2014, Information Sciences
      Citation Excerpt :

      In semi-automatic segmentation, the human expert is usually aided by an image-processing procedure. The most common procedures are based on image histograms [28,44,49,52,67,56], statistical classifiers [59], fuzzy classifiers [38,43], support vector machine classifiers (SVM) [13,42,52,53], neural network-based classifiers [3,15,20,40,55] and evolutionary computation [29,30,63,55]. Histogram thresholding uses peaks of the histogram that correspond to specific tissues [49].

    • A blind color image watermarking based on DC component in thespatial domain

      2013, Optik
      Citation Excerpt :

      The coefficients in frequency domain are further altered to embed the watermark. In order to achieve better robustness against attacks, many watermarking schemes in the frequency domain have been developed see [3–11] and the reference therein. The key feature of frequency domain algorithm is of stronger robustness.

    • Fast intelligent watermarking of heterogeneous image streams through mixture modeling of PSO populations

      2013, Applied Soft Computing Journal
      Citation Excerpt :

      In intelligent watermarking (IW), evolutionary computing (EC) algorithms such as genetic algorithms (GA) [4], particle swarm optimization (PSO) [5] are employed in order to automatically find the embedding parameters that result in an optimal trade-off for a given image [6]. A population of candidate embedding parameters is evolved through time using a combination of robustness and quality metrics as objective function [7–20]. But this process is not feasible in a large scale scenario due to the high computational cost of EC [10].

    View all citing articles on Scopus
    View full text