Abstract
The original exploiting modification direction (EMD) method proposed by Zhang and Wang is a novel data hiding technique which can achieve large embedding capacity with less distortion. The original EMD method can hide (2n+1)-ary numbers by modifying at most one least-significant bit (LSB) of n pixel values. The proposed methods in this paper, 2-EMD and EMD-2, modify at most two pixels of the LSB values. Efficiency of the proposed methods is shown theoretically and through experiments. The 2-EMD and EMD-2 can hide even larger numbers than the EMD with similar distortion under the same conditions. This paper shows that the EMD-2 is much better than the EMD, and slightly better than 2-EMD when n is 3, 4 and 5. The way to generate basis vector can be used for the generalization of the n-EMD and EMD-n where n > 1.
Original language | English |
---|---|
Pages (from-to) | 319-325 |
Number of pages | 7 |
Journal | Computers and Mathematics with Applications |
Volume | 60 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2010 Jul |
Bibliographical note
Funding Information:This work was in part supported by the CT R&D program of MCST/KOCCA [2-09-1205-001-10987-11-001, Development of Broadcasting Content Distribution Service Framework Technology using National Standard Content Identification], the IT R&D program of MKE/KEIT [2008-F-036-02, Development of Anonymity-based u-knowledge Security Technology], and the CT R&D program of MCST/KOCCA [2-09-1205-001-10987-11-001, Development of Broadcasting Content Distribution Service Framework Technology Using National Standard Content Identification], and the CTRC program.
Keywords
- Data hiding
- Number theory
- Steganography
ASJC Scopus subject areas
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics