A New Digital Watermarking Algorithm Using Combination of Least Significant Bit (LSB) and Inverse Bit

11/2011; 3(4).
Source: arXiv


In this paper, we introduce a new digital watermarking algorithm using least
significant bit (LSB). LSB is used because of its little effect on the image.
This new algorithm is using LSB by inversing the binary values of the watermark
text and shifting the watermark according to the odd or even number of pixel
coordinates of image before embedding the watermark. The proposed algorithm is
flexible depending on the length of the watermark text. If the length of the
watermark text is more than ((MxN)/8)-2 the proposed algorithm will also embed
the extra of the watermark text in the second LSB. We compare our proposed
algorithm with the 1-LSB algorithm and Lee's algorithm using Peak
signal-to-noise ratio (PSNR). This new algorithm improved its quality of the
watermarked image. We also attack the watermarked image by using cropping and
adding noise and we got good results as well.

Download full-text


Available from: Rosziati Ibrahim, May 06, 2014
  • Source
    • "Depending on the work domain that a watermark is embedded in, watermarking techniques can be divided into two main categories: transform domain [4] [5] [6] [7] and spatial domain [8] [9]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In the past a few years, many watermarking approaches have been proposed for solving the copyright protection problems. This paper presents a new grayscale watermarking method in spatial domain. In the host image analysis, the characteristics of human visual system's masking of images were analyzed. Based on the insensitive characteristics of human eyes to complicated texture area, the insensitive areas in the host image were screened. The threshold was used to determine the number of masked areas and the size of embedding capacity. The higher bit plane of the image contain partial image information, and its change may cause a larger variation of the image and attract human eyes. In the embedding stage, the characteristics of the masked area were utilized. First the secret information was processed with pseudo random ordering to eliminate the correlation between adjacent pixels. Then the multi-bit planes replacement embedding algorithm was used for modifying the spatial domain value of the multi-bit planes to embed secret information to the lower bit plane of image and the higher bit plane in the masked area. The algorithm had very high embedding capacity as well as high imperceptibility.
    Journal of Information and Computational Science 08/2015; 12(12):4759-4769. DOI:10.12733/jics20106318
  • [Show abstract] [Hide abstract]
    ABSTRACT: The rapid evolution in data transmission by the wide use of the internet, as provided an urgent need to prevent penetration and maintain the confidentiality of this data through the applying of some techniques to hide data within the carrier for example, text, image, audio and Video. A variety of image watermarking techniques have been published in the last few years which attempts to develop techniques and methods which are used to obtain better results through the fact that the changes that took place after the concealment is visible to the human eye. Digital image watermarking is one of the general information hiding problem. This study is to highlight some of these studies and analysis for use in future research and development to get to the best results.
    Advanced Computer Science Applications and Technologies (ACSAT), 2012 International Conference on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Dropped frames identification in a given video stream is always a challenging task for research community due to required heavy computation. To preserve the quality of service during any processing over visual information, drop of frame is least desired. Many contemporary work identifies the frame drop in terms of full reference algorithm (where reference and distorted video streams are available for comparison), or reduced reference algorithm (where some information about reference video are available) or no reference algorithm (where information about reference video are not available). This paper presents a novel full reference heuristic approach using genetic algorithm which identifies the dropped frame indices in a given distorted video stream with respect to original video stream. The proposed algorithm efficiently identifies dropped frame indices even if reference video stream contains repeated frames and spatially distorted too with low or high spatial distortions. The proposed algorithm is simulated and tested with 12 video streams. Simulation results suggested that it is more efficient with a video stream having lesser repeated frames.
    International Journal of Digital Content Technology and its Applications 11/2012; 6(20):562-573. DOI:10.4156/jdcta.vol6.issue20.61
Show more