Back to Listing

Using generalizations of Kuznetsov-Tsybakov problem for new possibilities of steganography

Event Type
CSL Communications Seminar
141 Coordinated Science Lab
May 10, 2013   3:00 pm  
Jarek Duda, Visitor (Dr. Pierre Moulin)

ABSTRACT:  To hide information within a picture we usually replace the least significant bits. This approach is no longer available if there is only 1 bit/pixel like for Quick Response Codes we meet everyday now. I will talk about theoretical limitation and practical aspects of hiding information in such situations: by generating encoding sequences fulfilling given constraints, for example to enforce resemblance to given picture (grayness of pixels define using "1" there). If the receiver would know the constraints/picture, we could just use entropy coder for this purpose, but we would like to omit this requirement here. In Kuznetsov-Tsybakov problem only the sender knows simple constraints, but it turns out that we can approach the same channel capacity as if both sides would know them. I will talk about generalizations to statistical constraints and applications for example to picture codes, steganography or lossy compression.


""Jaroslaw Duda has received MSc in Computer Science, Mathematics and Physics, and PhD in Computer Science and Physics from Jagiellonian University in Cracow, Poland. His main interest is information theory, both directly applied in computer science and as an integral part of different fields of science.

He is currently a Postdoctoral Researcher in the Center for Science of Information and the Computer Science Department at Purdue University, USA, working with W. Szpankowski and Y. Baryshinkov. For April-June he is staying at University of Illinois, Champaign-Urbana."

link for robots only