Paper
19 April 2000 Robust optimization solution to the data hiding problem using distributed source coding principles
Jim C. Chou, S. Sandeep Pradhan, Laurent El Ghaoui, Kannan Ramchandran
Author Affiliations +
Abstract
Inspired by a recently proposed constructive framework for the distributed source coding problem, we propose a powerful constructive approach to the watermarking problem, emphasizing the dual roles of 'source codes' and 'channel codes.' In our framework, we explore various source and channel codes to achieve watermarks that are robust to attackers in terms of maximizing the distortion between the corrupted coded-source signal and the original signal while holding the distortion between the coded-source signal and the original signal constant. We solve the resulting combinatorial optimization problem using an original technique based on robust optimization and convex programming.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jim C. Chou, S. Sandeep Pradhan, Laurent El Ghaoui, and Kannan Ramchandran "Robust optimization solution to the data hiding problem using distributed source coding principles", Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); https://doi.org/10.1117/12.382959
Lens.org Logo
CITATIONS
Cited by 33 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Digital watermarking

Data compression

Distortion

Data hiding

Forward error correction

Distance measurement

RELATED CONTENT

Turbo-coded trellis-based constructions for data hiding
Proceedings of SPIE (April 29 2002)
Military Data Compression Standard
Proceedings of SPIE (July 30 1982)
Multiple-description framework for oblivious watermarking
Proceedings of SPIE (August 01 2001)
Side-match vector quantization design for noisy channel
Proceedings of SPIE (September 16 1994)

Back to Top