閱讀全文 | |
篇名 |
A Further Study of Optimal Matrix Construction for Matrix Embedding Steganography
|
---|---|
並列篇名 | A Further Study of Optimal Matrix Construction for Matrix Embedding Steganography |
作者 | Zhanzhan Gao、Guangming Tang |
英文摘要 | Matrix embedding is a general approach that can be applied to most steganographic schemes to improve their embedding efficiency. In order to apply matrix embedding to voice-over-IP (VoIP) steganography better, this paper analyses the means to realizing fast matrix embedding. For small payloads, we discuss the feasibility of combining several Hamming codes into parity check matrix (PCM) construction and propose a novel PCM structure. On this basis, a corresponding optimization algorithm is proposed. It can adaptively generate specific PCMs to accommodate to the given cover and provide the best performance while guaranteeing the allowable computational complexity. For large payloads, another PCM structure is presented by combining the PCM of syndrome trellis codes (STCs) and several referential columns. The corresponding optimal construction algorithm is also given. Experimental results show that compared with existing methods, two novel matrix embedding methods achieve higher embedding efficiency and faster embedding speed. |
起訖頁 | 205-217 |
關鍵詞 | Steganography、Matrix embedding、Parity check matrix、Embedding efficiency、Embedding speed |
刊名 | 網際網路技術學刊 |
期數 | 201901 (20:1期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Efficient Lookup Schemes Based on Splitting Name for NDN |
該期刊 下一篇
| The Analysis of Cross-border Venture Capital Networks and Investment Performances Using a Logit Model |