Linear and Nonlinear Oblivious Data Hiding
- PDF / 854,774 Bytes
- 11 Pages / 600 x 792 pts Page_size
- 2 Downloads / 222 Views
Linear and Nonlinear Oblivious Data Hiding Litao Gang InfoDesk, Inc., 660 White Plains Road, Tarrytown, NY 10591, USA Email: [email protected]
Ali N. Akansu Department of Electrical and Computer Engineering (ECE), New Jersey Institute of Technology, University Heights, Newark, NJ 07102-1982, USA Email: [email protected]
Mahalingam Ramkumar Department of Computer Science and Engineering, Mississippi State University, MS 39762-9637, USA Email: [email protected] Received 31 March 2003; Revised 6 October 2003 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.
1.
INTRODUCTION
Multimedia data hiding is the art of hiding information in a multimedia content cover signal, like image, video, audio and so forth. Its potential applications include, but not limit to authentication, copyright enforcement, piracy tracking, and others. Various data hiding techniques are deployed in different scenarios. For instance, fragile data hiding is often used for multimedia content authentication, while the robust data hiding techniques are mostly employed for copyright and ownership proof, illegal replication prevention, and the like. The requirements and techniques in different applications vary considerably. This paper focuses on the robust data hiding techniques. Transparency and robustness are the two basic requirements in the robust data hiding applications. The former requires that the information embedding not compromise the multimedia perceptual quality; and the latter guarantees that the embedded information can be reliably identified under unintentional attacks and malicious tampering efforts. The data hiding employment can be further classified into two categories, oblivious and escrow cases. In the oblivious scenarios, the hidden information can be extracted without refer-
ence to the original signal; by contrast, the cover signal is necessary for embedded message identification in escrow cases. In practice, the most useful and challenging application is the oblivious data hiding since the original cover signal is often unavailable at the decoder. Most work in the paper is devoted to the oblivious data hiding. Among the existing robust message embedding schemes, direct-sequence (DS) modulation algorithms have been extensively studied and widely employed [1, 2, 3, 4]. The algorithms b
Data Loading...
