Research for Robust Watermarking Algorithm Using Least Significant Bit

Abstract:

Article Preview

An image watermarking algorithm using Least Significant Bit is presented. Firstly, Logistic chaotic map is utilized to generate embedding bits for the watermark. Then, the discrete cosine transform is performed on the host image, and the hiding bit is embedded in the coefficient of discrete cosine transform by replacing Least Significant Bit, which causes minimal distortion of the host image.The original host image is not required when extracting the watermark . Experimental results show that the watermarked image almost has no difference from the original host image, and the quality of the extracted image is satisfying, the capacity of this algorithm is high. This algorithm is robust to many attacks, such as noise attack, JPEG Compression attack. Introduction

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Edited by:

Feng Xiong

Pages:

1697-1700

DOI:

10.4028/www.scientific.net/AMR.268-270.1697

Citation:

J. J. Wang et al., "Research for Robust Watermarking Algorithm Using Least Significant Bit", Advanced Materials Research, Vols. 268-270, pp. 1697-1700, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.