Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- DOI: 10.1016/j.sigpro.2013.11.009
- Abstract:
- Many high performance steganographic schemes work at a limited or sparsely distributed set of embedding rates. We have shown that some steganographic changes will be wasted as these schemes are utilized individually for messages of various lengths. To measure the wasted changes and compare different schemes in this respect, we have built a framework based on two new criteria: the Relative Change Waste (RCW) and the Expected Changes per Pixel (ECP). To decrease the wasted changes a systematic combination of schemes is introduced and proved to be equivalent to nonlinear interpolation of points in a two-dimensional space. We have proved that a special case which leads to a linear interpolation - named Scheme Interpolation - is the most efficient combination. The Convex Hull Point Selection and the Waste Aware Interpolation algorithms are then proposed to construct optimally efficient scheme interpolations for any given level of RCW. Examples of the combined schemes are simulated and proved to outperform the well-known schemes presented so far in terms of ECP, RCW, PSNR and efficiency. Practical usage of scheme interpolation, the performance of the more general cases - called multi-scheme interpolation - and achieving the lower bounds of ECP and RCW are fully discussed
- Keywords:
- Scheme interpolation ; Wasted changes ; Efficient schemes ; Embedding efficiency ; Interpolation algorithms ; Linear Interpolation ; Nonlinear interpolation ; Steganographic schemes ; Two dimensional spaces ; Electrical engineering ; Signal processing ; Interpolation
- Source: Signal Processing ; Vol. 98 , May , 2014 , pp. 23-36 ; ISSN: 01651684
- URL: http://www.sciencedirect.com/science/article/pii/S0165168413004349