CFP last date
20 December 2024
Reseach Article

A Watermark for Image Authentication using Mapping Code Book

by N. Leelavathy, B. S. Priyatham, S. Srinivas Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 93 - Number 12
Year of Publication: 2014
Authors: N. Leelavathy, B. S. Priyatham, S. Srinivas Kumar
10.5120/16270-6004

N. Leelavathy, B. S. Priyatham, S. Srinivas Kumar . A Watermark for Image Authentication using Mapping Code Book. International Journal of Computer Applications. 93, 12 ( May 2014), 38-42. DOI=10.5120/16270-6004

@article{ 10.5120/16270-6004,
author = { N. Leelavathy, B. S. Priyatham, S. Srinivas Kumar },
title = { A Watermark for Image Authentication using Mapping Code Book },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 93 },
number = { 12 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 38-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume93/number12/16270-6004/ },
doi = { 10.5120/16270-6004 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:15:36.141778+05:30
%A N. Leelavathy
%A B. S. Priyatham
%A S. Srinivas Kumar
%T A Watermark for Image Authentication using Mapping Code Book
%J International Journal of Computer Applications
%@ 0975-8887
%V 93
%N 12
%P 38-42
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In 2011, Chan proposed a blind image authentication technique by generating the Parity-Check-Bits using Hamming code from a set of pixels whose bits have been reorganized. The Parity-Check-Bits generated are added by modifying other pixels. Due to this rearrangement, the most-significant bit of each suspected pixel can be determined. Using this information, the pixel can be recovered by calculating the average value and selecting one of the two possible original code words. However, calculating the average value, selects the same code word every time yielding to incorrect predictions. Moreover, use of Modulus function to facilitate improvement in quality of embedded image may alter the unused fifth position of each pixel. It is obvious that, the additional one bit or redundancy to detect the correct value may degrade the quality of the authenticated image. This paper proposes the mapping code book to generate Parity-Check-Bits and modified the embedding and recovery algorithms to avoid incorrect predictions and safeguard the fifth position of each pixel. The experimental results prove that the proposed algorithm has a greater capability to recover tampered regions with sufficiently good quality.

References
  1. Chan, C. S. An image authentication method by applying Hamming code on rearranged bits. Pattern Recognition Letters, 2011, 32(14), 1679-1690.
  2. Chan, C. S. , & Chang, C. C. An efficient image authentication method based on Hamming code. Pattern Recognition, 2007, 40(2), 681-690.
  3. Hamming, R. W. Error detecting and error correcting codes. Bell System technical journal, 1950, 29(2), 147-160.
  4. Dadkhah, S. , Manaf, A. A. , & Sadeghi, S. Efficient Two Level Image Tamper Detection Using Three LSB Watermarking. Fourth International Conference on Computational Intelligence and Communication Networks (CICN), IEEE Nov. , 2012.
  5. Chan, C. S. , Lin, C. Y. , & Lin, Y. H. Apply the modulus function to secret image sharing. International Journal of Innovative Computing Information And Control, 8(1 A), 2012, 375-385.
  6. Chan, C. S. , Tsai, Y. Y. , & Liu, C. L. An Image Authentication Method by Grouping Most Significant Bits, Journal of Electronic Science and Technology, Vol. 11, March 2013.
  7. Thien, C. C. , & Lin, J. C. A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function. Pattern Recognition, 36(12), 2875-2881, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Authentication Parity-Check-Bits Tampered Block effect Least Significant Bits (LSB) Most Significant Bits (MSB).