IHW '01 Proceedings of the 4th International Workshop on Information Hiding
An information-theoretic model for steganography
Information and Computation
Minimizing the embedding impact in steganography
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Linear codes for high payload steganography
Discrete Applied Mathematics
Employing Optimal Matrix for Efficient Matrix Embedding
IIH-MSP '09 Proceedings of the 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Steganography in Digital Media: Principles, Algorithms, and Applications
Steganography in Digital Media: Principles, Algorithms, and Applications
On steganographic embedding efficiency
IH'06 Proceedings of the 8th international conference on Information hiding
Edge adaptive image steganography based on LSB matching revisited
IEEE Transactions on Information Forensics and Security
Using high-dimensional image models to perform highly undetectable steganography
IH'10 Proceedings of the 12th international conference on Information hiding
Adaptive Data Hiding in Edge Areas of Images With Spatial LSB Domain Systems
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
Hi-index | 0.00 |
Matrix embedding (ME) is an effective way to reduce the distortion of steganography. In ME, the sender and recipient agree on a matrix in advance, and the message will be embedded into the cover data according to the matrix. By this means, matrices with the same dimension can provide the same capacity but may introduce quite different distortions. Thus the choice of matrices is crucial to the performance of ME and it is meaningful to determine the optimal matrix which can introduce the least distortion. In this paper, we study the optimal-matrix-determination problem for ME in $\mathbb{F}_3 = \{0,\pm1\}$ . Some initial results are obtained.