Login / Signup
On the complexity and hardness of the steganography embedding problem.
Rajarathnam Chandramouli
Shalin P. Trivedi
R. N. Uma
Published in:
Security, Steganography, and Watermarking of Multimedia Contents (2004)
Keyphrases
</>
data hiding
information hiding
computational complexity
worst case
cover image
np hardness
data embedding
high capacity
signal processing
vector space
spread spectrum
secret data
secret message