Digital watermarking is a key ingredient to copyright protection. It provides a solution to illegal copying of digital material and has many other useful applications such as broadcast monitoring and the recording of electronic transactions. Now, for the first time, there is a book that focuses exclusively on this exciting technology. Digital Watermarking covers the crucial research findings in the field: it explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied. As a result, additional groundwork is laid for future developments in this field, helping the reader understand and anticipate new approaches and applications.

Digital Watermarking

Trends in extreme learning machines

Currently, the most successful approach to steganography in empirical objects, such as digital media, is to embed the payload while minimizing a suitably defined distortion function. The design of the distortion is essentially the only task left to the steganographer since efficient practical codes exist that embed near the payload-distortion bound. The practitioner’s goal is to design the distortion to obtain a scheme with a high empirical statistical detectability. In this paper, we propose a universal distortion design called universal wavelet relative distortion (UNIWARD) that can be applied for embedding in an arbitrary domain. The embedding distortion is computed as a sum of relative changes of coefficients in a directional filter bank decomposition of the cover image. The directionality forces the embedding changes to such parts of the cover object that are difficult to model in multiple directions, such as textures or noisy regions, while avoiding smooth regions or clean edges. We demonstrate experimentally using rich models as well as targeted attacks that steganographic methods built using UNIWARD match or outperform the current state of the art in the spatial domain, JPEG domain, and side-informed JPEG domain.

/pdf/universal-distortion-function-for-steganography-in-an-3uayce1tdz.pdf

Universal distortion function for steganography in an arbitrary domain

This paper presents a complete methodology for designing practical and highly-undetectable stegosystems for real digital media. The main design principle is to minimize a suitably-defined distortion by means of efficient coding algorithm. The distortion is defined as a weighted difference of extended state-of-the-art feature vectors already used in steganalysis. This allows us to "preserve" the model used by steganalyst and thus be undetectable even for large payloads. This framework can be efficiently implemented even when the dimensionality of the feature set used by the embedder is larger than 107. The high dimensional model is necessary to avoid known security weaknesses. Although high-dimensional models might be problem in steganalysis, we explain, why they are acceptable in steganography. As an example, we introduce HUGO, a new embedding algorithm for spatial-domain digital images and we contrast its performance with LSB matching. On the BOWS2 image database and in contrast with LSB matching, HUGO allows the embedder to hide 7× longer message with the same level of security level.

/pdf/using-high-dimensional-image-models-to-perform-highly-h4pbo3rq9n.pdf

Using high-dimensional image models to perform highly undetectable steganography

This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases. This algorithm employs prediction errors to embed data into an image. A sorting technique is used to record the prediction errors based on magnitude of its local variance. Using sorted prediction errors and, if needed, though rarely, a reduced size location map allows us to embed more data into the image with less distortion. The performance of the proposed reversible watermarking scheme is evaluated using different images and compared with four methods: those of Kamstra and Heijmans, Thodi and Rodriguez, and Lee et al. The results clearly indicate that the proposed scheme can embed more data with less distortion.

Reversible Watermarking Algorithm Using Sorting and Prediction

Introduction to the special issue on authentication, copyright protection, and information hiding

Total least squares (TLS) parameter estimation is an alternative to least squares (LS) estimation when there are errors in both data matrix and observation vector. Especially, when some of the columns, not all, of the data matrix A are free of error, we call it a mixed LS-TLS problem. Accordingly, a sequential algorithm for solving a mixed LS-TLS problem is proposed here. The proposed algorithm employs an efficient algorithm to locate the minimum eigenpair, instead of singular value decomposition (SVD) which is computationally exacting. The proposed algorithm is applied to an accelerometer model to identify error parameters which are very important in inertial navigation systems (INS).

An LS-TLS-based sequential identification algorithm: Application to an accelerometer

We consider price-dependent demand and develop an integrated inventory and transportation policy with strategic pricing to maximize the total profit for a ubiquitous enterprise. The proposed policy provides the optimal ordering, shipment and pricing decision. We first assume that demand for a product is a linear function of the price. A mathematical model for the total profit under quantity based dispatch is developed in consideration of ordering, shipment and pricing variables. Optimality properties for the model are then obtained and an efficient algorithm is provided to compute the optimal parameters for ordering, shipment and pricing decision. Finally, we extend our results to a more general case where demand for the product is a convex or a concave function of the price.

Integrated inventory and transportation decision for ubiquitous supply chain management

https://www-sop.inria.fr/members/Francois.Bremond/Postscript/Tracking_Suresh.pdf

Online learning neural tracker

Image hashing as a compact abstract can be used for content search. Towards this end, a desired image hashing function should be resistant to those content-preserving manipulations (including additive-noise like processing and geometric deformation operations). Most countermeasures proposed in the literature usually focus on the problem of additive noises and global affine transform operations, but few are resistant to recently reported random bending attacks (RBAs). In this paper, we address an efficient and effective image hashing algorithm by using the resistance of two statistical features (image histogram in shape and mean value) for those challenging geometric deformations. Since the features are extracted from Gaussian-filtered images, the hash is also robust to common additive noise-like operations (e.g., lossy compression, low-pass filtering). The hash uniqueness is satisfactory for different sources of images.With a large number of real-world images, we construct a hash-based image search system to show that the hash function can be used for searching content-preserving copies from the same source.

Hyoung Joong Kim

Papers

Introduction to the special issue on authentication, copyright protection, and information hiding

An LS-TLS-based sequential identification algorithm: Application to an accelerometer

Integrated inventory and transportation decision for ubiquitous supply chain management

Online learning neural tracker

Histogram-based image hashing for searching content-preserving copies