By Topic

Using Dynamic Programming Strategy to Find an Optimal Solution to Exploiting Modification Direction Embedding Method

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

3 Author(s)
Chin-Chen Chang ; Feng Chia Univ., Taichung ; Chin-Feng Lee ; Lin-Yi Chuang

In this paper, we use dynamic programming strategy to find an optimal solution to the EMD (exploiting modification direction) embedding method proposed by Zhang et al. to carry (2n+1)-ary secret digits. An embedding/extraction function defined as a weighted sum function modulo (2n+1) is put forward in the EMD embedding method for secret digit embedding/extraction to/from an image. Among all the different permutations of these (2n+1) numbers, there exists an optimal solution corresponding to an embedding/extraction function, which can be used to minimize the distortion of stego-image. Without doubt, finding the best permutation will take a lot of computational time. Therefore, we shall use dynamic programming strategy to get an optimal solution.

Published in:

Intelligent Information Hiding and Multimedia Signal Processing, 2007. IIHMSP 2007. Third International Conference on  (Volume:1 )

Date of Conference:

26-28 Nov. 2007