Low-complexity Data Hiding Algorithms with Graph-based Parity Check
碩士 === 國立暨南國際大學 === 資訊工程學系 === 101 === This paper presents low-complexity steganographic algorithm based on the proposed graph-based parity check methodology for gray-scale images. Both algorithms embed a segment of n secret bits into n+1 and n cover pixels, respectively. The performances of both al...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86638303060323745273 |
| Summary: | 碩士 === 國立暨南國際大學 === 資訊工程學系 === 101 === This paper presents low-complexity steganographic algorithm based on the proposed graph-based parity check methodology for gray-scale images. Both algorithms embed a segment of n secret bits into n+1 and n cover pixels, respectively. The performances of both algorithms are given by theoretical distortion analysis. Algorithm1 can generate an optimal toggle sequence with the least number of 1’s under the graph-based parity check model. Algorithm 2 can further enhance the embedding rate and the embedding efficiency of Algorithm1 by the technique of +/-1 steganography. The theoretical distortion analyses show that both algorithms are better than the other schemes.
|
|---|