A Robust Digital Image Watermarking in Hybrid Frequency Domain
Keywords:Singular value decomposition (SVD), discrete wavelet transform, discrete cosine transform, arnold transform.
Image watermarking is a method to hide the secret information in a host image for copyright protection of watermark data during the transmission by means of insecure channel. The proposed scheme protects our data with adaptive level of visual quality and robustness against signal processing and geometric attacks. The proposed method divides the host image into four non-overlapping segments labelled as sub-images, DWT is applied on each sub images and then block based DCT is applied on mid frequency channels LH and HL of discrete wavelet transform. Embedded matrix is formed using hybrid transformed coefficients where matrix elements are chosen from the localized two mid frequency coefficients of each block in DCT. SV Decomposition is applied on embedded matrix to factorize it into singular values, left and right singular vectors and embed the scrambled watermark image along with scaling factor in singular value matrix. This repetition of watermark data in each sub-image reduces the PSNR values of the watermarked image. Despite this proposed scheme scales down PSNR value, changing the scaling factor favours to adjust the PSNR to the acceptable level and withstand the signal processing attacks such as JPEG compression and geometrical attack such as rotation, translation. Compared to the other method, the proposed scheme gives better correlation coefficient value for above mentioned kinds of attacks and also provide adaptive PSNR for imperceptibility on watermarked image.
 Yadav N & Singh K, â€œRobust image-adaptive watermarking using an adjustable dynamic strength factorâ€, Signal, Image and Video Processing Springer-Verlag London, (2015), pp.1531â€“1542.
 Takore TT, Rajesh Kumar P & Lavanya Devi G, â€œA Modified Blind Image Watermarking Scheme Based on DWT, DCT and SVD domain Using GA to Optimize Robustnessâ€, International Conference on Electrical, Electronics, and Optimization Techniques, (2016), pp.2725-2729.
 Cedillo-HernÃ¡ndez M, GarcÃa-Ugalde F, Nakano-Miyatake M & PÃ©rez-Meana HM, â€œRobust hybrid color image watermarking method based on DFT domain and 2D histogram modificationâ€, Signal Image Video P., Vol.8, No.1, (2014), pp.49â€“63.
 Nikolaidis A, â€œAffine transformation invariant image watermarking using moment Normalization and radial symmetry transformâ€,18th IEEE International Conference on Image Processing, (2011), pp.2729-2732.
 Xin Y, Liao S & Pawlak M, â€œCircularly orthogonal moments for geo-metrically robust image watermarkingâ€, Pattern Recognit., Vol.40, No.12, (2007), pp.3740â€“3752.
 Hemalatha T, Joevivek V, Sukumar K & Soman K, â€œRobust water-marking of remote sensing images without the loss of spatial informationâ€, Proc. 10th ESRI India User Conf., Vol.1, No.2, (2009), pp.1â€“8.
 Praveen K & Sethumadhavan M, â€œA Probabilistic Essential Visual Cryptographic Scheme for Plural Secret Imagesâ€, International Conference on Adv.Comp. Net. and Informatics, Vol.2, (2014), pp.225-231.
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).