Abstract. Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipien...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
The notion of relations is extremely important in mathematics. In this paper, we use relations to describe the embedding problem and propose a novel stochastic relational model fo...
Gang Wang, Hui Zhang, Zhihua Zhang, Frederick H. L...
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
We propose a novel framework for synchronization in feature-based data embedding systems. The framework is tolerant to de-synchronizing errors in feature estimates, which have hit...
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
In this article we provide an embedding of an interaction-based service notion into UML2. Such an embedding is needed, because to this date, UML2 has only limited support for servi...
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
In this paper, we present three embedding schemes for extensions of least significant bit overwriting to both of the two lowest bit planes in digital images. Our approaches are in...
We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multip...