Constructing specific matrix for efficient matrix embedding

  • Authors:
  • Yunkai Gao;Xiaolong Li;Bin Yang

  • Affiliations:
  • Institute of Computer Science and Technology and Key Laboratory of Network and Software Security Assurance, Peking University, Ministry of Education, Beijing, China;Institute of Computer Science and Technology and Key Laboratory of Network and Software Security Assurance, Peking University, Ministry of Education, Beijing, China;Institute of Computer Science and Technology and Key Laboratory of Network and Software Security Assurance, Peking University, Ministry of Education, Beijing, China

  • Venue:
  • ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.