A Frame Work for Various Watermarking Algorithms

Back to Journal

Home»Articles»A Frame Work for Various Watermarking Algorithms

A Frame Work for Various Watermarking Algorithms

Author : S.Thabasu Kannan and S.Azhagu Senthil
Volume 4 No.1 January-June 2015 pp 21-28

Abstract

Now-a-days watermarking plays a pivotal role in most of the industries for providing security to their own as
well as hired or leased data. This paper its main aim is to study Spatial and Fractal watermarking algorithms and also choosing the effective and efficient one for improving the resistance in data compression. In the Spatial domain method, there is no costly transforms needed to be computed for watermark embedding. The luminance values will be manipulated directly. The fractal domain is to determine a set of contractive transformation to approximate each block of the image with a larger block. The composition of all these transformations has the image as its fixed point. Starting with any image hence to apply the composition of the transformations repeatedly and get an approximation of the original image. For the implementation, we have used minimum nine coordinate positions. The watermarking algorithms to be taken for this study are Bruyn algorithm and Langelaar algorithm. In all graph, we have plotted X axis as peak signal to noise ratio (PSNR) and y axis as Correlation with original watermark. The threshold value ά is set to 5. The result is smaller than the threshold value then it is feasible, otherwise it is not.

Keywords

Full Text:

References

Asian Journal of Computer Science and Technology is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and research papers covering all aspects of future computer and Information Technology areas. Topics include, but are not limited to:

Foundations of High-performance ComputingTheory of algorithms and computability

Parallel & distributed computing

Computer networks

Neural networks

LAN/WAN/MAN

Database theory & practice

Mobile Computing for e-Commerce

Future Internet architecture

Protocols and services

Mobile and ubiquitous networks

Green networking

Internet content search

Opportunistic networking

Network applications

Network scaling and limits

Artifial Intelligences

Pattern/Image Recognitions

Communication Network

Information Security

Knowledge Management

Management Information systems

Multimedia communicatiions

Operations research

Optical networks

Software Engineering

Virtual reality

Web Technologies

Wireless technology

Now-a-days watermarking plays a pivotal role in most of the industries for providing security to their own as well as hired or leased data. This paper its main aim is to study Spatial and Fractal watermarking algorithms and also choosing the effective and efficient one for improving the resistance in data compression. In the Spatial domain method, there is no costly transforms needed to be computed for watermark embedding. The luminance values will be manipulated directly. The fractal domain is to determine a set of contractive transformation to approximate each block of the image with a larger block. The composition of all these transformations has the image as its fixed point. Starting with any image hence to apply the composition of the transformations repeatedly and get an approximation of the original image. For the implementation, we have used minimum nine coordinate positions. The watermarking algorithms to be taken for this study are Bruyn algorithm and Langelaar algorithm. In all graph, we have plotted X axis as peak signal to noise ratio (PSNR) and y axis as Correlation with original watermark. The threshold value ά is set to 5. The result is smaller than the threshold value then it is feasible, otherwise it is not.