The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Study on Embedding Efficiency of Matrix Encoding
|
|
Author(s): Lifang Yu (Beijing Jiaotong University, China), Yun Q. Shi (New Jersey Institute of Technology, USA), Yao Zhao (Beijing Jiaotong University, China), Rongrong Ni (Beijing Jiaotong University, China)and Gang Cao (Beijing Jiaotong University, China)
Copyright: 2013
Pages: 11
Source title:
Emerging Digital Forensics Applications for Crime Detection, Prevention, and Security
Source Author(s)/Editor(s): Chang-Tsun Li (University of Warwick, UK)
DOI: 10.4018/978-1-4666-4006-1.ch007
Purchase
|
Abstract
In this paper, the authors examine embedding efficiency, which influences the most concerned performance of steganography, security, directly. Embedding efficiency is defined as the number of random message bits embedded per embedding change. Recently, matrix embedding has gained extensive attention because of its outstanding performance in boosting steganographic schemes’ embedding efficiency. Firstly, the authors evaluate embedding change not only on the number of changed coefficients but also on the varying magnitude of changed coefficients. Secondly, embedding efficiency of matrix embedding with different radixes is formularized and investigated. A conclusion is drawn that ternary matrix embedding can achieve the highest embedding efficiency.
Related Content
|
Hossam Nabil Elshenraki.
© 2024.
23 pages.
|
|
Ibtesam Mohammed Alawadhi.
© 2024.
9 pages.
|
|
Akashdeep Bhardwaj.
© 2024.
33 pages.
|
|
John Blake.
© 2024.
12 pages.
|
|
Wasswa Shafik.
© 2024.
36 pages.
|
|
Amar Yasser El-Bably.
© 2024.
12 pages.
|
|
Sameer Saharan, Shailja Singh, Ajay Kumar Bhandari, Bhuvnesh Yadav.
© 2024.
23 pages.
|
|
|