Abstract

In recent years, with the rapid development of internet, digital data has been widely used in various science and engineering applications. But, this development has also led to several threats and attacks from the intruders. Most of the organizations are very much concerned about the Illegal copyright activities which have become a series issue. A number of copyright protection schemes have been developed in the literature. Watermarking is one of the best known methods for copyright protection. Earlier Bit Error Rate (BER) is been observed to provide good results for choosing the optimal feature region from the watermarked image. However it fails to produce more accurate image quality measures. This research work mainly focuses on a novel technique implemented based on the simulated attacking approach and the GA-based Multi Dimensional Knapsack Problem (MDKP) solving technique to select the most sufficient feature regions for robust digital image watermarking without affecting the image quality. A major limitation in existing methods is the security problems which lead to decrease in the integrity of digital watermarking scheme. With that problem, the definite optimization problems (variant problems) cannot be resolved using genetic algorithms. To focus on the above mentioned problems, the proposed work uses two approaches. Chaotic Iterative Process encryption scheme is used to solve the security problems for watermarking image. Next, the optimal feature points can be chosen from the watermarked image by Modified version of Peak Signal Noise Ratio (MPSNR). MPSNR is based on the enhanced quality measurement of which point opposes the predefined and undefined attacks. With those two approaches the PSO algorithm is employed as a search strategy for identifying an optimal feature subset. The experimental results illustrates that comparing with various well-known feature-based techniques, the proposed method shows better performance in robust and more secure digital watermarking.

Full Text
Published version (Free)

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