Open Access

Linear and Nonlinear Oblivious Data Hiding

EURASIP Journal on Advances in Signal Processing20042004:970837

https://doi.org/10.1155/S1110865704403059

Received: 31 March 2003

Published: 28 October 2004

Abstract

The majority of the existing data hiding schemes are based on the direct-sequence (DS) modulation where a low-power random sequence is embedded into the original cover signal to represent hidden information. In this paper, we investigate linear and nonlinear modulation approaches in digital data hiding. One typical DS modulation algorithm is explored and its optimal oblivious detector is derived. The results expose its poor cover noise suppression as the hiding signature signal always has much lower energy than the cover signal. A simple nonlinear algorithm, called set partitioning, is proposed and its performance is analyzed. Analysis and simulation studies further demonstrate improvements over the existing schemes.

Keywords and phrases

data hiding watermarking ML detection data security

Authors’ Affiliations

(1)
InfoDesk, Inc
(2)
Department of Electrical and Computer Engineering (ECE), New Jersey Institute of Technology, University Heights
(3)
Department of Computer Science and Engineering, Mississippi State University

Copyright

© Gang et al. 2004