Next Article in Journal
Combining Adaptive Holonic Control and ISA-95 Architectures to Self-Organize the Interaction in a Worker-Industrial Robot Cooperative Workcell
Previous Article in Journal
G-Networks with Adders
Article Menu

Export Article

Future Internet 2017, 9(3), 33; doi:10.3390/fi9030033

Article
Robust Image Embedded Watermarking Using DCT and Listless SPIHT
J. L. Divya Shivani and Ranjan K. Senapati *
Department of ECE, K L University, Vaddeswaram, Guntur dist, Andhra Pradesh 522502, India
*
Correspondence: Tel.: +91-898-587-7023
Academic Editor: Luis Javier Garcia Villalba
Received: 3 June 2017 / Accepted: 5 July 2017 / Published: 12 July 2017

Abstract

:
This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversion, contrast manipulation, and compression. The proposed technique is made further robust by the incorporation of the Chinese remainder theorem (CRT) encryption technique. Our scheme is compared with the recently proposed CRT-based DCT technique, CRT-based spatial domain watermarking, and DCT-based inter block correlation techniques. Extensive simulation experiments show better robustness in common image manipulations and, at the same time, the proposed technique successfully makes the watermark perceptually invisible. A better Tamper Assessment Function (TAF) value of 2–15% and a better Normalized Correlation (NC) is achieved compared to some of the above techniques. In particular, the proposed technique shows better robustness on compression attacks at moderate to higher compression ratios. It is possible to maintain the imperceptibility and low TAF for various values by doubling the capacity of the watermark.
Keywords:
discrete cosine transform; watermarking; cryptography; random number generation; normalized correlation

1. Introduction

With the rapid growth in technology, the internet has become the most popular channel for every user to download digital multimedia data like images and videos. Since the environment of internet is open, this data can easily be tampered with or manipulated, for which data integrity must be ensured. Digital watermarking is a common technique that used to verify this integrity. The watermarking technique consists of three parts, namely: (i) the watermark; (ii) the embedding stage, and; (iii) the verification stage. In the embedding stage the algorithm incorporates the watermark into the host image. However, the algorithm extracts and authenticates the watermark in the verification stage. The goal of image authentication is to verify the originality of the host image by detecting malicious manipulations. There are two essential requirements for image watermarking. One is invisibility, i.e., the visual quality of the watermarked images should not be destroyed by embedding the watermark. The other is robustness, i.e., the watermark should be able to resist attacks, even if the attacks are deliberately made [1].
Digital watermarking techniques are performed in the spatial domain [2] and in the transformed domain [3,4,5,6,7]. The transformed domain is more robust and operates more imperceptibility than the spatial domain [8,9]. In the transform domain DCT make use of energy distribution properties and human visual system scheme for embedding the watermark [10]. Blind watermarking schemes with interesting results havebeen proposed in [11,12]. Some of the other transformed-domain watermarking schemes have been proposed in [13,14,15,16,17]. SVD (singular value decomposition) is also used in watermarking where the properties of U coefficients (after SVD decomposition) modification cause less degradation of image quality [17,18,19,20,21,22]. Some of the watermarking techniques using the Ridgelet transform are also proposed [23,24].
The CRT-based scheme, which provides robustness against some common image processing manipulations, is proposed in [25,26]. Digital watermarking is also performed using segmentation of DCT blocks [27]. Each DC coefficient is extracted and stored in a matrix before processing, making it expensive in terms of memory requirement [28]. Hsu and Wu [6] used middle DCT coefficients for embedding watermark. The algorithm is not very robust against JPEG compression.
Watermarking schemes can be implemented in VLSI (very large scale integration) chips. Hardware implementation in consumer electronic devices such as digital camera, PDAs, and mobile devices requires low power, high reliability, real-time performance and easy integration. For example, viability of integration of watermarking chips in any digital camera or JPEG codec. Several issues related to hardware implementation of several watermarking algorithms for images and videos have been reported by Kougianos et al. [29]. DCT domain watermarking is popular for hardware implementation because there are a number of fast algorithms exists [30,31,32,33,34]: 8 × 8 DCT is mostly used for hardware implementation; 4 × 4 DCT provides less computation at a cost of less energy compaction.
SPIHT [35] is a benchmark algorithm for the compression of still images and videos in an embedded fashion. It has precise rate control, i.e., the user can set any target bit rate (compression ratio) to reconstruct the compressed images. However, SPIHT uses an auxiliary list, which causes a lot of memory management problem for hardware realization. To overcome this listless SPIHT has been proposed which does not make use of auxiliary lists [36]. The state information that keeps track of set partitions is held in a state marker table in the memory. This algorithm takes less memory and is easy to implement in hardware compared to a conventional JPEG.
Recently, CRT-based watermarking with some results has been reported in [25,26]. CRT provides additional security, for example, in selecting a set of relatively prime numbers £ = {P1, P2, … Pr}, a large integer K can be represented by a set of smaller integers {k1, k2…. kn}. It is extremely difficult to get back the K value without the knowledge of £. This fact provides additional security. Further, CRT is based on simultaneous congruence of modular arithmetic and computationally efficient. This motivates the authors to combine listless SPIHT with CRT techniques in a blind watermarking scheme to provide added security and robustness against compression attacks. To the best of the authors’ knowledge there is no such work proposed in the literature that combines listless SPIHT with CRT in blind watermarking schemes.
The proposed method exhibits superior performance in terms of PSNR (peak signal to noise ratio)/structural similarity (SSIM) and tamper assessment function (TAF) over most of the recently proposed schemes in literature. Good TAF (in %) and Normalized Correlation (NC) values are also obtained for most of the common attacks such as cropping, tampering, noise addition, brightening, sharpening and compression. Attacks such as scaling, rotation, filtering and geometric transformation are not considered in this paper.
The rest of the paper is organized as follows: Related works are presented in Section 2. Section 3 discusses the implementation of embedding and the extraction aspect of the proposed scheme. Comparison results are presented in Section 4. Finally, in Section 5 the conclusion and future research direction have been made.

2. Related Work

SPIHT is a tree-based image compression algorithm. It scans the transformed coefficients in a depth first search. Set partitioning embedded block (SPECK) is block based image compression algorithm [37]. However, it scans the coefficients using a breadth-first approach. The listless variants of SPIHT and SPECK are called Listless SPIHT (i.e., NLS) and Listless SPECK (LSK), respectively [36,38]. These listless algorithms have been proposed to overcome the memory management problems associated with SPIHT and SPECK. Listless SPIHT and LSK can compress images from a lossy to a lossless format. These algorithms generate a bit string in order of importance. That means that the lower part of the bit string contains more information of the image than higher part of the bit string. The user can truncate at any point of the compressed bit string to reconstruct an image, which is a compressed representation of the original image. However, none of these algorithms are used in image/video watermarking schemes in the literature. Most of the works in literature use JPEG/JPEG 2000 for compression of the watermarked images. Compression using listless SPIHT and LSK has superior performance than JPEG and is highly competitive with JPEG 2000 [38]. JPEG 2000 is computationally intensive because of context modelling and adaptive arithmetic coding. Listless SPIHT and LSK are much less complex and take less memory for compression and reconstruction. The authors considered a modified listless SPIHT for compression of the watermarked image from lossy to lossless, because compression is considered as one of the attacks in the watermarking scheme [39,40].
CRT-based encryption technique provides additional security and robustness against the existing schemes. Patra et al. proposed DCT-based CRT techniques that provide better robustness against various attacks [25,26]. In order to achieve the merit of both CRT and listless SPIHT, we proposed a blind watermarking scheme which uses modified listless SPIHT (NLS) that combines with DCT coefficients and CRT encryption technique.

3. Proposed Scheme

The block diagram of the proposed scheme is shown in Figure 1. The uniqueness of the scheme is that the key is generated randomly during embedding process instead of using a known key for embedding in comparison to other methods. The generated key is required to send to the receiver for watermark extraction.
The embedding and extraction technique of the proposed method is based on combining the CRT technique in the DCT domain. The listless SPIHT compression scheme is used to generate an embedded compressed bit string which can be used for storage and/or transmission. This method added the flexibility to compress losslessly or lossy by setting a target bit rate. In addition, better security and better robustness is achieved during the extraction phase. We have presented the detailed algorithm for embedding and extraction in the following subsections.

3.1. Embedding Procedure

The following steps describe the watermark embedding procedure on the host image.
Step-1 Partition of blocks
The host image is taken as a grayscale image and watermark is a binary image. Initially, the host image is divided into blocks of 8 × 8 pixels. The single watermark bit is then embedded in a single block selected. Then the blocks are chosen as random.
Step-2 Selection of DCT coefficients
In order to improve robustness, the preferred choice is to embed the watermark into the most significant coefficients. However, it will degrade the quality of the watermark. If insignificant coefficients are used for embedding, the watermark may be lost during lossy compression. Since proposed scheme use block size 8 × 8 pixels, the resulting DCT block is also of the same size. This gives a total of 64 DCT coefficients. We have included both DC and low-frequency AC coefficients for embedding in order to achieve trade-off between quality and robustness. The DC component and the remaining 63 low-frequency AC components are selected as the possible locations for embedding the watermark bits in the DCT domain.
Step-3 Zigzag scanning of the DCT coefficients
After zigzagging the DCT coefficients, one value must be selected. During that selection, randomizing the coefficients is done using a pseudo random generator. Using randomization technique, security and authentication aspects will increase as the value is changing for every execution. During randomization, one of the selected coefficients is chosen and its index is stored as a secret key whenever we execute the code. This feature adds more security to the data while embedding the procedure.
Step-4 Arnold transform
This is a digital scrambling algorithm to randomize the bits of the watermark. It improves the robustness of the digital watermark. In order to increase the security and robustness of watermark, we use Torus automorphism (TA), which could disperse a watermark equally and randomly [41]. Applying TA for scrambling the binary watermark before embedding offers cryptographic protection against intentional reconstruction of watermark [39]. Further, the key utilized in the TA permutation procedure for scrambling the watermark is also required during the inverse TA permutation (descrambling) procedure. The TA permutation procedure is based on the following equation [39].
( i * j * ) = ( 1 1 k k + 1 ) × ( i j ) mod m ,
Equation (1) indicates that each pixel of the watermark pattern at coordinate ( i , j ) will move to ( i * , j * ) . The k and m are the key parameters given by the user.
Step-5 Embedding the watermark bits
After dividing 8 × 8 blocks, one watermark bit gets embedded in each of the block. Considering one block at a time, the procedure for embedding the watermark bits is listed as follows:
  • Randomly select an 8 × 8 block from host image and apply DCT to the block.
  • Randomly select a watermark bit from the watermark image in order to embed into the block.
  • Randomly select a DCT coefficient (DC or one of the AC components) to embed the watermark bit. Let its value be denoted as ϑ .
  • Let P1 and P2 be the pair-wise co-prime numbers used in CRT (say, P1 = 38 and P2 = 107) for the DC coefficient. For an AC coefficient, let the values of P1 = 38 and P2 = 55.
  • Find E1 and E2 by applying the inverse CRT to ϑ . Let the absolute difference between E1 and E2 value be z .
  • Determine the value D = max(P1,P2) – 1.
  • The required condition for embedding watermark bit ‘1’, is
    z D / u ,
    where u = 2 if ϑ is DC coefficient, otherwise, u = 3 . Apply CRT to modify ϑ . If the condition is not satisfied, then ϑ is modified in step of 8 until the required condition in Equation (2) is satisfied.
  • The required condition for embedding watermark bit ‘0’ is
    z < D / u ,
  • Apply CRT to modify ϑ . If the condition in Equation (3) is not satisfied, then ϑ is modified in step 8 until the required condition is satisfied.
  • Reconstruct DCT block with the modified DCT coefficient ϑ ^ and apply inverse DCT to the block to construct the watermarked image block.
  • Repeat the steps (represented in bullet form) 1–9 for all the remaining blocks until all the watermark bits are embedded.
Note that the range of possible values for DC and the AC coefficients are not the same. The range of the DC coefficient is from values 0 to 2040, while for AC coefficients, it will be from the −1020 to +1020 in monochrome images. According to CRT, the product of the pair-wise co-prime numbers (also called the dynamic range) must be greater than the largest possible number [25]. The block diagram for embedding procedure is shown in Figure 1.
Step-6 Hierarchical Pyramid-like coefficient arrangement:
Figure 2 shows an arrangement of the DCT coefficients in a hierarchical pyramid structure. The coefficients in each 8 × 8 block are arranged in a parent-child relationship. The parent of a coefficient i is i 4 for 4 i 63 , while the set of four children associated with j t h coefficient is { 4 j , 4 j + 1 , 4 j + 2 , 4 j + 3 } for 0 j 15 . The DC coefficient indexed as 0 is the root of the tree, which has only three children, e.g., 1, 2 and 3. The offspring corresponds to direct descendent in the same spatial location in the next finer band of pyramid. A tree corresponds to a node having 4 children which always form a group of 2 × 2 adjacent pixels. In the bottom part of the Figure 2, arrows indicate the same indexed coefficients of other blocks those are grouped together so as to form an overall 3-level pyramid structure.
Step-7 Listless SPIHT compression algorithm
SPIHT is the benchmark algorithm for compression of still images. It makes use of ordered auxiliary lists to encode significant information in a bit plane manner. The movement of list nodes, addition of new nodes to the list and deletion of a node from the list while processing the ordered bit planes in SPIHT causes a lot of memory management problems. To overcome this listless variant of SPIHT, called NLS is proposed in [36]. NLS reduces memory management problem by using state table markers for encoding coefficients. Further, NLS need less dynamic memory storage for the image. The proposed watermark algorithm makes use of modified NLS for compressing the image form lossy to lossless. Precise rate control can be achieved while compression is lossy. The modified NLS is similar to NLS except that the refinement pass is executed prior to sorting pass. This ensures better compression performance in modified NLS.

3.2. Extraction Procedure

The procedure of extraction is the reverse of embedding procedure. Figure 3 shows the extraction process. The detailed of watermark extraction process is outlined as follows:
Step-1 Listless SPIHT decoding
SPIHT decodes the image form the compressed bit string. It follows the exact reverse process that the SPIHT encoder does [36,37].
Step-2 Coefficient restoration algorithm
This process restore the coefficients back into the original position, i.e., individual 8 × 8 blocks of coefficients that has been arranged into hierarchical manner before SPIHT encoding.
Step-3 IDCT
Inverse DCT is applied in to all the 8 × 8 blocks to find the image pixels and merge all 8 × 8 block to construct a large compressed decoded watermarked image (512 × 512 in this case).
Step-4 Extraction of watermark
For this, following information must be known to get the watermark extracted from the watermarked image: (i) Image which is watermarked; (ii) Size of watermark; (iii) Watermark Key; and (iv) Pair-wise numbers of co-prime P1 and P2.
With knowledge of the watermark key, the DCT coefficient that is embedded with watermark information ϑ ^ is extracted. Thus, with values of P1, P2 and ϑ ^ , the E1, E2 are determined. Next, using a CRT scheme, a comparison is made between the z and D. If z D / u , the bit 1 would be extracted, otherwise the bit 0 would be get extracted. The scale factor u is then set to 2 for the coefficient of DC, otherwise it is get set to 3. Thus, the above steps were then repeated until every block consecutively to get all watermark bits extracted.
In order to improve robustness, the preferred choice is to embed the watermark into the most significant coefficients. However, it will degrade the quality of the watermark. If insignificant coefficients are used for embedding, the watermark may have been lost during lossy compression. Since the proposed scheme use block-size 8 × 8 pixels, the resulting DCT block is also of same size. This gives a total of 64 DCT coefficients.

3.3. Secret Keys

Secrete keys are vital for the proposed algorithm to implement embedding and extraction procedures. Three keys are utilized and these should be preserved well for watermark extraction and verification. These are:
  • The parameters for Torus automorphism permutation: The disarrangement parameters k and m obtained in Equation (1) are necessary when reconstructing the watermark pattern.
  • The record number of the selected block has to be preserved.
  • The embedding position of the watermark bits, i.e., the DCT coefficients and their positions have to be preserved.
  • Co-prime numbers used in CRT.

4. Simulation Results and Analysis

The experiments have been conducted on test images of size 512 × 512 pixels. MATLAB 14.1 tool is used for experiments on an Intel core i5 processor, 2.6 GHz CPU and 6 GB RAM. The watermark used in the experiment is a binary image of 62 × 64 pixels. In order to validate the objective judgement of the extracting fidelity, the performance comparison of the proposed method is compared with other schemes in terms of PSNR, Tamper assessment function (TAF) and Normalized Correlation (NC). For a watermark of size m × n , the TAF in percentage is defined as:
TAF ( % ) = 1 m n [ i = 0 m j = 0 n w ( i , j ) w ¯ ( i , j ) ] × 100 ,
and, Normalized Correlation (NC) is defined as:
NC = i = 0 m j = 0 n w ( i , j ) × w ¯ ( i , j ) i = 0 m j = 0 n [ w ( i , j ) ] 2 ,
where w ( i , j ) and w ¯ ( i , j ) represent the original and extracted watermarks at position ( i , j ) , respectively; and, is exclusive or operation. TAF represents the number of bits of the extracted watermark that are different from the original watermark. The acceptance level of TAF is usually 20% as the extracted watermark is not recognizable beyond this value. Similarly, the NC value is 1 for highest-quality watermark and 0 for lowest-quality watermark. Watermark having NC below 0.3–0.4 is not recognizable.
PSNR is a quantitative measure of image quality between original host image and watermarked image. The value of PSNR usually ranges between 20 dB (low quality) and 40 dB (high quality). For 8-bit grayscale images PSNR is given as:
PSNR ( dB ) = 10   log 10 [ 255 2 1 M N i = 1 M j = 1 N [ X ( i , j ) X ¯ ( i , j ) ] 2 ] ,
where X represents the host image, and X ¯ represents the watermarked image. M × N represents the size of the two images.
Structural similarity (SSIM) index is used for measuring similarity between two images. SSIM is designed to improve on traditional methods such as PSNR, which has been proven to be inconsistent with human visual perception. The measure between two images X and X ¯ of same size M × N is given by:
SSIM = ( 2 μ x μ x ¯ + c 1 ) ( 2 σ x x ¯ + c 2 ) ( μ x 2 + μ x ¯ 2 + c 1 ) ( σ x 2 + σ x ¯ 2 + c 2 ) ,
where μ x and σ x 2 are the average and variance of image X respectively, μ x ¯ and σ x ¯ 2 are the average and variance of watermarked image X ¯ respectively. σ x x ¯ is the covariance. c 1 and c 2 are two variables to stabilize the denominator. Its range is from 0 to 1. If two images are perfectly matched, SSIM = 1.
The performance comparison is carried out considering the following performance criteria:
  • Quality of the watermarked images.
  • Robustness of the scheme against common attacks such as compression, crop, histogram manipulation, auto contrast, noise, inversion and filtering.

4.1. Quality of the Watermarked Images

Table 1, Table 2 and Table 3 shows the compression performance comparison on the watermarked images for Lena, Barbara, and Boat images, respectively, using SPIHT, LSK and the proposed algorithm. The PSNR and SSIM performance is quite satisfactory below a BR (bit rate) of 0.25 bits per pixel (bpp). The corresponding compression ratio (CR) can be found using the formula CR = 8/BR, (i.e., CR = 32:1). The TAF (in %) and NC values are also listed. It can be noted from the Table 1, Table 2 and Table 3 that the extracted watermark using all the three algorithms are not recognizable above a BR of 0.25 bpp. As we increase the bit rate, the quality of the watermark and watermarked images is also improved. It can be seen from the Table 1, Table 2 and Table 3 that the proposed scheme provides better watermark quality and better compressed image quality at lossless compression mode for Lena, Barbara and Boat images. In lossy compression mode, our proposed scheme is highly competitive (with respect to watermarked image and the quality of extracted watermark) with SPIHT and LSK in most of the BR. A comparison of the extracted watermark quality is figured out in the Figure 4, Figure 5 and Figure 6 for Lena, Mandrill, and Boat images. For the Lena image (Figure 4), the proposed scheme outperforms NC and TAF values compared to the work by Patra et al. [25] at all compression ratios. Additionally, our scheme outperforms Das et al. [40] above 12:1 compression ratios. The similar improvements are also observed for Mandrill and Boat images in Figure 5 and Figure 6, respectively. We have not shown the comparison of TAF and NC values for Mandrill and Boat images due to unavailability of experimental datum by Das et al. [40]. Figure 7 shows the PSNR vs. Compression ratio for Mandrill, Lena, and Boat images. It is observed that for Mandrill image, our scheme outperforms the scheme by Patra et al. [25] in all CRs, i.e., the quality of the watermarked image is better using our scheme. However, a similar trend is not visualized in Lena and Boat images for all CRs. This is because our scheme provides better robustness and compression performance for texture images than smooth images.
Comparison of TAF and NC values on JPEG compression attacks:

4.2. Robustness after Different Attacks

Table 4 shows the quality of the extracted watermark after some conventional attacks such as cropping, addition of noise, sharpening, inversion, histogram equalization and auto contrast operations. It observed that the proposed method could able to extract a good quality watermark in all cases. Image inversion and auto contrast operation give better quality watermark with an NC value close to 1. Acceptable quality watermark is also obtained in cropping attack, masking face with a black box, cropping a quarter part of the image on any direction, noise and sharpen operations. Similar acceptable quality watermark can also be obtained by masking the image with a white box. The PSNR values indicate the extracted quality of the watermarked images. PSNR values of 35–36 dB indicate good quality watermarked images are also obtained in most of the attacks.
A comparison of quality of the watermark (NC values) for different attacks is shown in Table 5. The comparison is made with recent CRT-based algorithms by Patra et al. in [25,26]. It can be seen that there is a significant improvement in the quality of the watermark in invert, sharpen, histogram equalization and cropping attacks using the proposed scheme. There is also a noticeable improvement in cropping, sharpening, invert, histogram equalization attacks compared to Patra et al. [26]. Further, the proposed scheme shows some improvement for all the mentioned attacks compared to the scheme by Patra et al. [25].

5. Conclusions

A new approach for authentication and copyright protection based on DCT and listless SPIHT is proposed in this paper. The proposed method exhibit improved security and robustness due to incorporation of CRT for modifying the coefficients. The coefficient to be modified is selected randomly for every block. The average PSNR performance for compression is better compared to other CRT-based algorithms. Satisfactory TAF and NC values for watermark are obtained on a compression ratio up to 25:1 in most of the images, which is not possible in other schemes. Some major image attacks such as brightening, sharpening, noise, cropping, and inversion in the proposed scheme exhibit better resistance to the DCT-based CRT scheme. The overall complexity of the proposed scheme is less complex because CRT involves only modular operations for computation along with low-complexity listless SPIHT. Further research will involve implementing the proposed scheme on video watermarking.

Acknowledgments

We would like to thank anonymous reviewers for their valuable suggestions and comments to improve the quality of the manuscript.

Author Contributions

J. L. Divya Shivani analysed the data, contributed literature survey and assisted in simulation work; Ranjan K. Senapati conceived the idea, designed and performed the experiment.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Vleeschouwer, C.D.; Delaigle, J.F.; Marq, B. Invisibility and application functionalities in perceptual watermarking an overview. Proc. IEEE 2002, 90, 64–77. [Google Scholar] [CrossRef]
  2. Nikolaidis, N.; Pitas, I. Robust image watermarking in the spatial domain. Signal Process. 1997, 66, 385–403. [Google Scholar] [CrossRef]
  3. Cox, I.J.; Kilian, J.; Leighton, F.T.; Shamoon, T. Secure spread spectrum watermarking for multimedia. IEEE Trans. Image Process. 1997, 6, 1673–1687. [Google Scholar] [CrossRef] [PubMed]
  4. Chen, T.H.; Tsai, D.S. Owner—Customer right protection mechanism using a watermarking scheme and a watermarking protocol. Pattern Recognit. 2006, 39, 1530–1541. [Google Scholar] [CrossRef]
  5. Lin, C.Y.; Chang, S.F. A robust image authentication method distinguishing JPEG compression from malicious manipulation. IEEE Trans. Circuits Syst. Video Technol. 2001, 11, 153–168. [Google Scholar] [CrossRef]
  6. Hsu, C.T.; Wu, J.L. Hidden digital watermarks in images. IEEE Trans. Image Process. 1999, 8, 58–68. [Google Scholar] [CrossRef] [PubMed]
  7. Barni, M.; Bartolini, F.; Cappellini, V.; Piva, A. A DCT-domain system for robust image watermarking. Signal Process. 1977, 66, 357–372. [Google Scholar] [CrossRef]
  8. Mohanty, S.P.; Ranganathan, N.; Namballa, R.K. VLSI implementation of invisible digital watermarking algorithms towards the development of a secure JPEG encoder. In Proceedings of the IEEE Workshop on Signal Processing Systems, Seoul, Korea, 27–29 August 2003; pp. 183–188. [Google Scholar]
  9. Lu, Z.M.; Zheng, H.Y.; Huang, J. A digital watermarking scheme based on DCT and SVD. In Proceedings of the Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Kaohsiung, Taiwan, 26–28 November 2007; pp. 241–244. [Google Scholar] [CrossRef]
  10. Qi, H.; Zheng, D.; Zhao, J. Human visual system based adaptive digital image watermarking. Signal Process. 2007, 88, 174–188. [Google Scholar] [CrossRef]
  11. Liu, K.-C. Wavelet-based watermarking for color images through visual masking. AEU Int. J. Electron. Commun. 2010, 64, 112–124. [Google Scholar] [CrossRef]
  12. Nguyen, T.V.; Patra, J.C. A simple ICA-based watermarking scheme. Digital Signal Process. 2008, 18, 762–776. [Google Scholar] [CrossRef]
  13. Xin, Y.; Liao, S.; Pawlak, M. Circularly orthogonal moments for geometrically robust image watermarking. Pattern Recognit. 2007, 40, 3740–3752. [Google Scholar] [CrossRef]
  14. Ahmed, A.M.; Day, D.D. Applications of the naturalness preserving transform to image watermarking and data hiding. Digit. Signal Process. 2004, 14, 531–549. [Google Scholar] [CrossRef]
  15. Deng, C.; Gao, X.; Li, X.; Tao, D. A local Tchebichef moments-based robust image watermarking. Signal Process. 2009, 89, 1531–1539. [Google Scholar] [CrossRef]
  16. Liu, R.; Tan, T. An SVD-based watermarking scheme for protecting rightful ownership. IEEE Trans. Multimed. 2002, 4, 121–128. [Google Scholar] [CrossRef]
  17. Mohammad, A.A.; Alhaj, A.; Shaltaf, S. An improved SVD-based watermarking scheme for protecting rightful ownership. Signal Process. 2008, 88, 2158–2180. [Google Scholar] [CrossRef]
  18. Shieh, J.M.; Lou, D.C.; Chang, M.C. A semi-blind digital watermarking scheme based on singular value decomposition. Comput. Stand. Interface 2006, 28, 428–440. [Google Scholar] [CrossRef]
  19. Lee, S.; Jang, D.; Yoo, C.D. An SVD-based watermarking method for image content authentication with improved security. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Philadelphia, PA, USA, 22–27 April 2005; Volume 2, pp. 525–528. [Google Scholar] [CrossRef]
  20. Chung, K.L.; Yang, W.N.; Huang, Y.H.; Wu, S.T.; Hsu, Y.C. On SVD-based watermarking algorithm. Appl. Math. Comput. 2007, 188, 54–57. [Google Scholar] [CrossRef]
  21. Chang, C.-C.; Tsai, P.; Lin, C.-C. SVD-based digital image watermarking scheme. Pattern Recognit. Lett. 2005, 26, 1577–1586. [Google Scholar] [CrossRef]
  22. Patra, J.C.; Soh, W.; Ang, E.L.; Meher, P.K. An improved SVD-based watermarking technique for image and document authentication. In Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems, Singapore, 4–7 December 2006; pp. 1984–1987. [Google Scholar] [CrossRef]
  23. Kalantari, N.K.; Ahadi, S.M.; Vafadust, M. A robust image watermarking in the Ridgelet domain using universally optimum decoder. IEEE Trans. Circuits Syst. Video Technol. 2010, 20, 396–406. [Google Scholar] [CrossRef]
  24. Sadreazami, H.; Amini, M. A robust spread spectrum based image watermarking in ridgelet domain. AEU Int. J. Electron. Commun. 2002, 66, 364–371. [Google Scholar] [CrossRef]
  25. Patra, J.C.; Phua, J.E.; Bornand, C. A novel DCT domain CRT-based watermarking scheme for image authentication surviving JPEG compression. Digital Signal Process. 2010, 20, 1597–1611. [Google Scholar] [CrossRef]
  26. Patra, J.C.; Karthik, A.; Barnand, C. A novel CRT based watermarking techniques for authentication of multimedia content. Digital Signal Process. 2010, 20, 442–453. [Google Scholar] [CrossRef]
  27. Suhail, M.A.; Obaidat, M.S. Digital watermarking-based DCT and JPEG model. IEEE Trans. Instrum. Meas. 2003, 52, 1640–1677. [Google Scholar] [CrossRef]
  28. Rawat, S.; Raman, B. A publicly verifiable lossless watermarking scheme for copyright protection and ownership assertion. AEU Int. J. Electron. Commun. 2012, 66, 955–962. [Google Scholar] [CrossRef]
  29. Kougianos, E.; Mohanty, S.P.; Mahapatra, R.N. Hardware assisted watermarking for multimedia. Comp. Electr. Eng. 2009, 35, 339–358. [Google Scholar] [CrossRef]
  30. Sun, M.T.; Chen, T.C.; Gouulie, A.M. VLSI implementation of a 16×16 discrete cosine transform. IEEE Trans. Circuits Syst. 1989, 36, 610–617. [Google Scholar] [CrossRef]
  31. Uramoto, S.; Inoue, Y.; Takabatake, A.; Takeda, J.; Yamashita, Y.; Terane, H.; Yoshimoto, M. A 100 MHz 2-D discrete cosine transform core processor. J. Solid-State Circuits 1992, 27, 492–498. [Google Scholar] [CrossRef]
  32. Chan, Y.-H.; Siu, W.-C. On the realization of discrete cosine transform using distributed arithmetic. IEEE Trans. Circuits Syst. I: Fundam. Theory Appl. 1992, 39, 705–711. [Google Scholar] [CrossRef]
  33. Karthanasis, H.C. A low ROM distributed arithmetic implementation of the forward/inverse DCT/DST using rotations. IEEE Trans. Consum. Electron. 1995, 41, 263–272. [Google Scholar] [CrossRef]
  34. Srinivasan, V.; Liu, K.J.R. VLSI design of high-speed time recursive 2-D DCT/IDCT processor for video applications. IEEE Trans. Circuits Syst. Video Technol. 1996, 6, 87–96. [Google Scholar] [CrossRef]
  35. Said, A.; Pearlman, W. A. A new fast and efficient image codec based on set partitioning in hierarchical trees. IEEE Trans. Circuits Syst. Video Technol. 1996, 6, 243–250. [Google Scholar] [CrossRef]
  36. Wheeler, F.; Pearlman, W.A. SPIHT image compression without lists. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Istanbul, Turkey, 5–9 June 2000; Volume 4, pp. 2047–2050. [Google Scholar]
  37. Pearlman, W.A.; Islam, A.; Nagraj, N.; Said, A. Efficient, low complexity image coding with set partitioning embedded block coder. IEEE Trans. Circuits Syst. Video Technol. 2004, 6, 1219–1235. [Google Scholar] [CrossRef]
  38. Senapati, R.K.; Pati, U.C.; Mahapatra, K.K. Reduced memory, low complexity embedded image compression algorithm using hierarchical listless DTT. IET Image Process. 2014, 8, 213–238. [Google Scholar] [CrossRef]
  39. Engedy, M.; Munaga, V.N.K.; Saxena, A. A robust wavelet based digital watermarking scheme using chaotic mixing. In Proceedings of the First International Conference on Digital Information Management, Bangalore, India, 6–8 December 2006; pp. 36–40. [Google Scholar] [CrossRef]
  40. Das, C.; Panigrahi, S.; Sharma, V.K.; Mahapatra, K.K. A Novel blind robust image watermarking in DCT domain using inter-block coefficient correlation. AEU Int. J. Electron. Commun. 2014, 68, 244–253. [Google Scholar] [CrossRef]
  41. Chang, C.C.; Hsiao, J.Y.; Chiang, C.L. An image copyright protection scheme based on torus automorphosim. In Proceedings of the First International Symposium on Cyber Worlds, Tokyo, Japan, 6–8 November 2002; pp. 217–224. [Google Scholar]
Figure 1. Watermark embedding process; DCT: discrete cosine transform; CRT: Chinese remainder theorem; SPIHT: set partitioning in hierarchical trees.
Figure 1. Watermark embedding process; DCT: discrete cosine transform; CRT: Chinese remainder theorem; SPIHT: set partitioning in hierarchical trees.
Futureinternet 09 00033 g001
Figure 2. Coefficient rearrange algorithm.
Figure 2. Coefficient rearrange algorithm.
Futureinternet 09 00033 g002
Figure 3. Watermark extraction process.
Figure 3. Watermark extraction process.
Futureinternet 09 00033 g003
Figure 4. Performance of compression attack on Lena image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Figure 4. Performance of compression attack on Lena image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Futureinternet 09 00033 g004
Figure 5. Performance of compression attack on Mandrill image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Figure 5. Performance of compression attack on Mandrill image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Futureinternet 09 00033 g005
Figure 6. Performance of compression attack on Boat image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Figure 6. Performance of compression attack on Boat image on (a) NC vs. Compression ratio; and (b) TAF vs. Compression ratio.
Futureinternet 09 00033 g006
Figure 7. PSNR vs. Compression ratio on (a) Mandrill; (b) Lena; (c) Boat images.
Figure 7. PSNR vs. Compression ratio on (a) Mandrill; (b) Lena; (c) Boat images.
Futureinternet 09 00033 g007
Table 1. PSNR (Peak signal to noise ratio), structural similarity (SSIM), tamper assessment function (TAF), and Normalized Correlation (NC) performance on the Lena Image’; SPIHT: set partitioning in hierarchical trees; LSK: Listless SPECK. Bolded numbers indicate improvement in results.
Table 1. PSNR (Peak signal to noise ratio), structural similarity (SSIM), tamper assessment function (TAF), and Normalized Correlation (NC) performance on the Lena Image’; SPIHT: set partitioning in hierarchical trees; LSK: Listless SPECK. Bolded numbers indicate improvement in results.
ImageBit Rate (bpp)AlgorithmPSNR (dB)SSIMNCTAF (%)
Lena0.25SPIHT [35]31.240.90750.131765.15
LSK [38]30.930.89740.303252.75
Proposed30.930.89820.320151.61
0.5SPIHT31.100.91670.98481.71
LSK31.310.93010.98282.04
Proposed31.360.92920.98481.86
1.0SPIHT33.870.96000.98011.84
LSK34.020.96210.97971.91
Proposed34.130.96170.98041.94
1.5SPIHT34.350.96580.92276.14
LSK34.760.96770.91806.52
Proposed34.400.96760.91496.32
2.0SPIHT34.830.96860.92985.56
LSK34.760.96770.91806.52
Proposed34.900.96930.92575.26
2.5SPIHT35.410.97380.95104.00
LSK35.330.97330.95174.08
Proposed35.440.97400.95984.07
3.0SPIHT35.650.97240.94904.08
LSK35.520.97440.94804.28
Proposed35.650.97390.95583.27
LosslessSPIHT35.830.97620.98411.36
LSK35.680.97540.97472.24
Proposed36.000.97500.98311.36
Table 2. PSNR, SSIM, TAF and NC performance on the Barbara Image.
Table 2. PSNR, SSIM, TAF and NC performance on the Barbara Image.
ImageBit Rate (bpp)AlgorithmPSNR (dB)SSIMNCTAF (%)
Barbara0.25SPIHT [35]26.920.84540.030072.93
LSK [38]27.260.87490.052771.27
Proposed27.250.87300.070070.33
0.5SPIHT29.420.91060.378847.58
LSK29.030.90470.753919.63
Proposed28.970.90340.776217.94
1.0SPIHT31.480.94740.97843.09
LSK32.160.95720.96733.57
Proposed32.250.95720.97373.27
1.5SPIHT34.270.97140.97372.84
LSK34.430.97310.96893.25
Proposed34.500.97310.96593.57
2.0SPIHT34.770.97740.90347.68
LSK34.780.97750.89748.19
Proposed34.830.97840.90457.38
2.5SPIHT35.520.98010.93555.56
LSK35.250.98000.91366.98
Proposed35.540.98040.94165.26
3.0SPIHT35.770.98210.95214.15
LSK35.660.98300.94774.41
Proposed35.860.98240.94404.73
LosslessSPIHT36.060.98220.97912.04
LSK35.660.98140.94434.58
Proposed36.240.98270.97702.19
Table 3. PSNR, SSIM, TAF and NC performance on the Boat Image.
Table 3. PSNR, SSIM, TAF and NC performance on the Boat Image.
ImageBit Rate (bpp)AlgorithmPSNR (dB)SSIMNCTAF (%)
Boat0.25SPIHT [35]29.340.90660.07869.70
LSK [38]29.200.90240.142564.76
Proposed29.210.90360.161063.43
0.5SPIHT29.610.90850.98142.31
LSK30.040.92440.97912.41
Proposed30.100.92410.98012.41
1.0SPIHT33.200.95990.98012.31
LSK33.420.96600.97432.64
Proposed33.440.96410.97572.36
1.5SPIHT34.220.96480.91196.95
LSK34.320.96550.90887.15
Proposed34.340.96900.91366.75
2.0SPIHT34.870.96930.90557.40
LSK34.800.97020.90587.56
Proposed34.940.97090.90997.18
2.5SPIHT35.530.97320.94404.81
LSK35.440.97450.94704.41
Proposed35.520.97510.94564.51
3.0SPIHT35.700.97580.95643.48
LSK35.600.97380.93964.88
Proposed35.750.97560.95373.88
LosslessSPIHT35.920.97580.98041.89
LSK35.780.97470.96562.79
Proposed36.100.97600.98111.73
Table 4. Simulation results of common image processing attacks.
Table 4. Simulation results of common image processing attacks.
AttacksCropNoise (Impulse)SharpenInvertHistogram Equalize
Attacked Images Futureinternet 09 00033 i001 Futureinternet 09 00033 i002 Futureinternet 09 00033 i003 Futureinternet 09 00033 i004 Futureinternet 09 00033 i005
PSNR (dB)35.835.937.935.934.9
Extracted Watermark Futureinternet 09 00033 i006 Futureinternet 09 00033 i007 Futureinternet 09 00033 i008 Futureinternet 09 00033 i009 Futureinternet 09 00033 i010
NC0.71580.72080.50340.97710.5415
AttacksCrop (top left)Crop (top right)Crop (bottom left)Crop (bottom right)Auto contrast
Attacked Images Futureinternet 09 00033 i011 Futureinternet 09 00033 i012 Futureinternet 09 00033 i013 Futureinternet 09 00033 i014 Futureinternet 09 00033 i015
PSNR (dB)35.835.835.8435.8635.82
Extracted Watermark Futureinternet 09 00033 i016 Futureinternet 09 00033 i017 Futureinternet 09 00033 i018 Futureinternet 09 00033 i019 Futureinternet 09 00033 i020
NC0.73160.72690.74110.73160.9838
Table 5. NC comparison of extracted watermark after common attacks.
Table 5. NC comparison of extracted watermark after common attacks.
Scheme CropNoise Sharpen Invert Histogram EqualizeCrop (Bottom Left)
Patra et al. [39] Futureinternet 09 00033 i021 Futureinternet 09 00033 i022 Futureinternet 09 00033 i023 Futureinternet 09 00033 i024 Futureinternet 09 00033 i025 Futureinternet 09 00033 i026
NC0.76500.99700.37980.15630.13440.7529
Patra et al. [25] Futureinternet 09 00033 i027 Futureinternet 09 00033 i028 Futureinternet 09 00033 i029 Futureinternet 09 00033 i030 Futureinternet 09 00033 i031 Futureinternet 09 00033 i032
NC0.70970.70120.49970.94130.53710.7417
Proposed Futureinternet 09 00033 i033 Futureinternet 09 00033 i034 Futureinternet 09 00033 i035 Futureinternet 09 00033 i036 Futureinternet 09 00033 i037 Futureinternet 09 00033 i038
NC0.71580.72080.50340.97710.54150.7411
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top