Share Email Print

Proceedings Paper

Robust optimization solution to the data hiding problem using distributed source coding principles
Author(s): Jim C. Chou; S. Sandeep Pradhan; Laurent El Ghaoui; Kannan Ramchandran
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 April 2000
PDF: 10 pages
Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); doi: 10.1117/12.382959
Show Author Affiliations
Jim C. Chou, Univ. of California/Berkeley (United States)
S. Sandeep Pradhan, Univ. of California/Berkeley (United States)
Laurent El Ghaoui, Univ. of California/Berkeley (United States)
Kannan Ramchandran, Univ. of California/Berkeley (United States)

Published in SPIE Proceedings Vol. 3974:
Image and Video Communications and Processing 2000
Bhaskaran Vasudev; T. Russell Hsing; Andrew G. Tescher; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?