25
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A highly robust and secure digital image watermarking using modified optimal foraging algorithm - based SVM classifier and hyperchaotic Fibonacci Q-matrix

&
 

Abstract

Transmission media is at rise over the internet, due to which the copyright risk is alarming. In such situation, enhanced security is the main concern. Digital image watermarking is the technique that ensures the copyright protection, security, and authenticity of the digital image. This research work recommends a highly secured and robust digital image watermarking system. In this method, the cover image is confused by arbitrarily generated numbers by a six-dimensional hyperchaotic technique, then this permuted image is scattered by applying the Fibonacci Q matrix to generate a scattered host image. This scattered image is decomposed up to 3 levels through DWT and the low pass sub-band caused by DWT are further decomposed by SVD. Singular values generated by SVD are used for watermark embedding as a slight change in the value does not affect the image quality. SVM classifier is used to classify the appropriate location to insert the scattered binary watermark. In this method SVM parameters are optimized by a modified optimal foraging algorithm, so that classification error can be reduced. Pixel rearrangement of the watermark image and host image makes the proposed method more secure, and it is highly robust as SVM is trained to classify locations that are less distorted by noise. Experimental outcomes depicts that the proposed method is accurate and better to the current cutting-edge methods in terms of security and robustness of digital image watermarking, as PSNR is approx. 72db and NC values are 1 after applying all the possible attacks.

Subject Classification:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.