Abstract

Local image features have been widely applied in feature-based watermarking schemes. The feature invariance is exploited to achieve robustness against attacks, but the leakage of information about hidden watermarks from publicly known locations and sizes of features are often unconsidered in security. This paper, therefore, proposes a novel image watermarking approach, which adopts invariant feature regions to jointly enhance its robustness and security. Initially, circular feature regions are determined by the scale-adapted auto-correlation matrix and the Laplacian-of-Gaussian operation. Leakage of secret information is also controlled carefully during feature detection procedure. An optimal selection process formulated as a multidimensional knapsack problem is then proposed to select robust non-overlapping regions from those circular feature regions to resist various attacks. This process is implemented by a genetic algorithm-based approach, and incorporates randomization to mitigate the security risk. Finally, each selected region is normalized to obtain a geometrically invariant feature region, and embedded with a region-dependent watermark to overcome the weakness of multiple-redundant watermarks. The evaluation results based on the StirMark benchmark present the proposed scheme can tolerate various attacks, including noise-like signal processing and geometric distortions. A security analysis in terms of differential entropy also confirms the security improvement of the proposed method.

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 call

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.