By Topic

Invertible Data Hiding in Color Images Using Multiple Peaks Histogram

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thanuja, T.C. ; V Coll. of Eng., Bangalore, India ; Kumari, U.

In this paper we propose an algorithm for embedding data a into color image which uses Increased multiple peaks histogram. The scheme does not require the knowledge of original image for recovery of watermark. The watermark is embedded in spatial domain in red, green and blue components (planes). This scheme can embed more data as compared to the existing schemes and maintain higher quality of host image. It provides an exact recovery of the host and the watermark images. 4.125 bits per pixel (bpp) of capacity is achieved with the quality of image level as 44.47 dB for a color Lena image of the size 512 X 512 X 3 X 8.

Published in:

2009 International Conference on Signal Processing Systems

Date of Conference:

15-17 May 2009