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

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...

Full description

Saved in:
Bibliographic Details
Published inThird International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007) Vol. 1; pp. 489 - 492
Main Authors Chin-Chen Chang, Chin-Feng Lee, Lin-Yi Chuang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2007
Subjects
Binary sequences
Computer science
Cryptography
Data encapsulation
Dynamic programming
Equations
Image converters
Internet
Matrices
Steganography
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780769529943
0769529941
DOI:10.1109/IIH-MSP.2007.318