Secure Steganographic Methods for Palette Images
IH '99 Proceedings of the Third International Workshop on Information Hiding
A Secure Data Hiding Scheme for Two-Color Images
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
StegCure: a comprehensive steganographic tool using enhanced LSB scheme
WSEAS Transactions on Computers
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
| Hi-index | 0.00 |
In the area of palette image steganography, by Parity Assignment approach, we introduce two fast and near Optimal Parity Assignment (nOPA) methods. The first is called rho-method which does not take any reorder procedures on color space of palettes. The second is called for-loop method which is the fastest and simplest one. The experimental results on 1000 palette images randomly selected show that this algorithm runs faster than the algorithms in OPA approach, while the costs (of changing colors) of two methods are equal. Comparison of the rho-, for-loop and EzStego methods with the OPA method is presented which shows the advantages of the two nOPA methods over the third. Among these the rho- method is the best, and the costs of the rho- and OPA method are equal. To prevent steganalysis, base on our nOPA methods, we propose a practical scheme by an enhanced CPT scheme for palette images.