Abstract
In today’s era, Fortifying robustness and imperceptibility of digital watermarking has become non trivial. In this paper, a digital image watermarking algorithm based on entropy of blocks and histogram is proposed to improve imperceptibility. In this, first host image is divided into blocks and then blocks are culled on the basis of entropy value for watermark embedding. After that, watermark is embedded into selected blocks by using histogram shape method. Histogram shape method divides selected blocks into groups and further locations of pixels within groups are identified for watermark embedding. Histogram shape method makes algorithm more robust against attacks. The integration of block based histogram shape approach and entropy makes algorithm more imperceptible. Experiment results demonstrate that proposed method has an excellent imperceptibility. Proposed method also resists against noise and scaling attacks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
