A Secure Data Hiding Scheme for Two-Color Images
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Analysis of parity assignment steganography in palette images
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
On fastest optimal parity assignments in palette images
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A new data hiding scheme for small blocks of twelve pixels on binary images by module approach
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
| Hi-index | 0.00 |
Based on the ring of integers modulo 2r, Chen-Pan-Tseng (2000) introduced a block-based scheme (CPT scheme) which permits in each block F of size m×n of a given binary image B to embed r =⌊log2(k+1)⌋ secret bits by changing at most two entries of F, where k=mn . As shown, the highest number of embedded secret bits for at most two bits to be changed in each block of k positions of F in any CPT-based schemes is rmax=⌊log2(1+k (k+1)/2)⌋, approximately 2r-1, twice as much as r asymptotically, and this can reached approximately in our CPTE1 scheme by using modules on the ring Z2 of integers modulo 2. A new modified scheme-CPTE2 to control the quality of the embedded blocks, in the same way as Tseng-Pan's method (2001), is established. Approximately, CPTE2 scheme gives 2r-2 embedded bits in F, twice as much as r-1 bits given by Tseng-Pan' scheme, while the quality is the same.