Welcome to the InfoSci Platform
A Study on Embedding Efficiency of Matrix Encoding

A Study on Embedding Efficiency of Matrix Encoding

Lifang Yu, Yun Q. Shi, Yao Zhao, Rongrong Ni, Gang Cao
Copyright: © 2012 |Volume: 4 |Issue: 1 |Pages: 12
ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781466611597|DOI: 10.4018/jdcf.2012010103
Cite Article Cite Article

MLA

Yu, Lifang, et al. "A Study on Embedding Efficiency of Matrix Encoding." IJDCF vol.4, no.1 2012: pp.37-48. http://doi.org/10.4018/jdcf.2012010103

APA

Yu, L., Shi, Y. Q., Zhao, Y., Ni, R., & Cao, G. (2012). A Study on Embedding Efficiency of Matrix Encoding. International Journal of Digital Crime and Forensics (IJDCF), 4(1), 37-48. http://doi.org/10.4018/jdcf.2012010103

Chicago

Yu, Lifang, et al. "A Study on Embedding Efficiency of Matrix Encoding," International Journal of Digital Crime and Forensics (IJDCF) 4, no.1: 37-48. http://doi.org/10.4018/jdcf.2012010103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.