On Reversibility of Random Binning Techniques: Multimedia Perspectives
نویسندگان
چکیده
In this paper, we analyze a possibility of reversibility of datahiding techniques based on random binning from multimedia perspectives. We demonstrate the capabilities of unauthorized users to perform hidden data removal using solely a signal processing approach based on optimal estimation as well as consider reversibility on the side of authorized users who have the knowledge of key used for the message hiding.
منابع مشابه
Detection- and Information-theoretic Analysis of Steganography and Fingerprinting
The proliferation of multimedia and the advent of the Internet and other public networks have created many new applications of information hiding in multimedia security and forensics. This dissertation focuses on two of these application scenarios: steganography (and its counter problem, steganalysis), and fingerprinting. First, from a detection-theoretic perspective, we quantify the detectabil...
متن کاملA New Random Coding Technique that Generalizes Superposition Coding and Binning
Proving capacity for networks without feedback or cooperation usually involves two fundamental random coding techniques: superposition coding and binning. Although conceptually very different, these two techniques often achieve the same performance, suggesting an underlying similarity. In this correspondence we propose a new random coding technique that generalizes superposition coding and binn...
متن کاملSecurity analysis of robust data-hiding with geometrically structured codebooks
In digital media transfer, geometrical transformations desynchronize the communications between the encoder and the decoder. Therefore, an attempt to decode the message based on the direct output of the channel with random geometrical state fails. The main goal of this paper is to analyze the conditions of reliable communications based on structured codebooks in channels with geometrical transf...
متن کاملMessage communications and channel state estimation for state dependent channels
In this paper, we consider the problem of pure information transmission and channel state estimation via state dependent channels. We show that the knowledge of auxiliary random variable, used in the codebook construction of random binning techniques, is sufficient to perform the optimal channel state estimation. We compare the obtained results with optimal rate-distortion region obtained using...
متن کاملOn Achievability via Random Binning
In [1], the authors present a novel tool to establish achievability results in network information theoretic problems. The main idea is to study a set of discrete memoryless correlated sources, and the ensuing statistics of the bin indices resulting from random binning of the sources. Sufficient conditions are established on rates of random binning such that these indices are mutually independe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005