Constructing specific matrix for efficient matrix embedding

In order to enhance the steganographic security, higher embedding efficiency (average number of secret data bits embedded per one embedding change) is desired. Matrix embedding is a well-known steganographic scheme that can improve the embedding efficiency. However, the embedding cost (running time) is expensive when employing high dimensional matrix, while higher dimensional matrix usually provides better embedding efficiency. In this paper, we construct a specific matrix for matrix embedding, in which data embedding procedure can be implemented with linear computational complexity. The novel scheme is computationally efficient, and meanwhile it leads to a relatively good embedding efficiency.