By Topic

A New CPT Extension Scheme for High Data Embedding Ratio in Binary Images

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

6 Author(s)
Phan Trung Huy ; Fac. of Math. & Inf., Hanoi Univ. of Technol., Hanoi, Vietnam ; Vu Phuong Bac ; Nguyen Manh Thang ; Truong Duc Manh
more authors

In this paper, an extension of CPT scheme (CPTE for short) is introduced. In watermarking area, this is a block-based approach. Given a binary image B, in each block F of a size m×n of B, by CPT scheme, ones can embed r = Round(log2(m.n+1)) bits by changing at most two entries of F. In our CPTE scheme, r = Round(log2(m.n)) + 1 bits can be embedded by changing at most two entries of F, too. That means, in most cases, the number of embedded bits given by our CPTE scheme is larger than that by CPT scheme one bit. As a consequence, we establish a new modified scheme-MCPTE based on CPTE scheme to control the quality for security of the embedded blocks, in the same way due to [Tseng-Pan, 2001]. Experimental results show that in general, MCPTE scheme gives more embedded bits than those by Tseng-Pan' scheme, while the quality is the same.

Published in:

Knowledge and Systems Engineering, 2009. KSE '09. International Conference on

Date of Conference:

13-17 Oct. 2009