Increasing the Capacity and PSNR in Blind Watermarking Resist Against Cropping Attacks

Abstract

Watermarking has increased dramatically in recent years in the Internet and digital media. Watermarking is one of the powerful tools to protect copyright. Local image features have been widely used in watermarking techniques based on feature points. In various papers, the invariance feature has been used to obtain the robustness against attacks. The purpose of this research was based on local feature-based stability as the second-generation of watermarking due to invariance feature to achieve robustness against attacks. In the proposed algorithm, initially, the points were identified by the proposed function in the extraction and Harris and Surf algorithms. Then, an optimal selection process, formulated in the form of a Knapsack problem. That the Knapsack problem algorithm selects non-overlapping areas as they are more robust to embed watermark bits. The results are compared with each of the mentioned feature extraction algorithms and finally, we use the OPAP algorithm to increase the amount of PSNR. The evaluation of the results is based on most of the StirMark criterion.

Keywords

• watermarking
• feature point
• histogram
• knapsack problem
• geometric attacks
• opap algorithm.