Abstract
In this paper, a dynamic robust multiple watermarking algorithm is proposed based on Discrete Wavelet Transform (DWT) and Human Visual System (HVS). Watermark image is transformed by Arnold transform. Original image is divided into blocks with 8 by 8 and each block is transformed by DWT. By adopting the Just Noticeable Difference (JND) of HVS and changing low frequency coefficients, binary string message can be embedded into the decomposed original image. Watermark can be extracted blindly. Experimental results have shown that the proposed watermarking has robust against many attacks such as JPEG compressing, cropping, additive noise, line removal, median filter and related attacks with sinStirMark.
Highlights
Digital watermarking is a new technology of information hiding and it has effective effect for Copyright Protection
A dynamic robust multiple watermarking algorithm is proposed based on Discrete Wavelet Transform (DWT) and Human Visual System (HVS)
Original image is divided into blocks with 8 by 8 and each block is transformed by DWT
Summary
From the view of image processing, embedding watermark information can be seemed that a puny signal overlap in a strength signal. Compared with the Discrete Cosine Transform (DCT), DWT has a better performance. It has good time-frequency decomposition in accordance with the characteristic of HVS. Embedding watermark information in the DWT domain [7] has better robust against JPEG compression. An algorithm for data hiding by using DWT and JND model of HVS is proposed. It is a dynamic multiple blind watermarking algorithm, since more than one watermarks can be embedded into the original image.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.