Recently, several studies have been concerned with modeling the parenthood relationships between near duplicates in a set of images. Two images share a parenthood relationship if one is obtained by applying transformations to the other. However, this is not the only form of parenting that can exist among images. An image might be a composition created through the combination of the semantic information existent in two or more source images, establishing a relationship between the sources and the composite. The problem of identifying these relations in a set containing near-duplicate subsets of source and composition images is referred to as multiple parenting phylogeny. Thus far, researchers tackled this problem with a three-step solution: 1) separation of near-duplicate groups; 2) classification of the relations between the groups; and 3) identification of the images used to create the original composition. In this work, we extend upon this framework by introducing key improvements, such as better identification of when two images share content, and improved ways to compare this content. In addition, we also introduce a new realistic professionally created data set of compositions involving multiple parenting relationships. The method we present in this paper is properly evaluated through quantitative metrics, established for assessing the accuracy in finding multiple parenting relationships. Finally, we discuss some particularities of the framework, such as the importance of an accurate reconstruction of phylogenies and the method's behavior when dealing with more complex compositions.

Image forensic analysis for the detection of contrast enhancement and other histogram-based processing, usually relies on the study of first-order statistics derived from image histogram. Methods based on such an approach, though, are easily circumvented by adopting some counter-forensic attacks. To overcome such a problem, we propose a novel forensic technique based on the study of second-order statistics derived from the co-occurrence matrix. The experiments we carried out demonstrate that the proposed approach is very effective even in the presence of counter-forensic attacks, while it retains the good performance of histogram-based methods when no attack is present.

Image phylogeny deals with tracing back parent-child relationships among near duplicates, images that share the same semantic content. This approach results in a visual structure showing the inheritance of semantic content among images, called phylogeny tree. In this paper, we extend upon the image phylogeny's original formulation, which considers that an image may inherit content from only a single parent, to deal with situations whereby an image may inherit it from multiple different parents. Our objective is to find the multiple parenting relationships in a set of images, a problem which we refer to as multiple parenting phylogeny. The proposed solution works by first identifying near-duplicate groups and reconstructing their phylogenies; then among the found groups we determine the one(s) representing the composition images; finally, we detect the parenting relations between those compositions and the source images used to create them.

Abstract In this work, by exploiting the traces left by double compression in the statistics of quantized modified discrete cosine transform coefficients, a single measure has been derived that allows to decide whether an MP3 file is singly or doubly compressed and, in the last case, to devise also the bit-rate of the first compression. Moreover, the proposed method as well as two state-of-the-art methods have been applied to analyze short temporal windows of the track, allowing the localization of possible tampered portions in the MP3 file under analysis. Experiments confirm the good performance of the proposed scheme and demonstrate that current detection methods are useful for tampering localization, thus offering a new tool for the forensic analysis of MP3 audio tracks.

In this paper, a method to detect the presence of double compression in a MP3 audio file is proposed. By exploiting the effect of double compression in the statistical properties of quantized MDCT coefficients, a single measure is derived to decide if a MP3 file is single compressed or it has been double compressed and also to devise the bit-rate of the first compression. Experimental results confirm the performance of the detector, mainly when the bit-rate of the second compression is higher than the bit-rate of the first one.

A comparison between two forensic techniques for the reverse engineering of a chain composed by a double JPEG compression interleaved by a linear contrast enhancement is presented here. The first approach is based on the well known peak-to-valley behavior of the histogram of double-quantized DCT coefficients, while the second approach is based on the distribution of the first digit of DCT coefficients. These methods have been extended to the study of the considered processing chain, for both the chain detection and the estimation of its parameters. More specifically, the proposed approaches provide an estimation of the quality factor of the previous JPEG compression and the amount of linear contrast enhancement.

This work addresses forgery localization in MPEG-2 compressed videos. The proposed method is based on the analysis of Double Quantization (DQ) traces in frames that were encoded twice as intra (i.e., I-frames). Employing a state-of-the-art method, such frames are located in the video under analysis by estimating the size of the Group Of Pictures (GOP) that was used in the first compression; then, the DQ analysis is devised for the MPEG-2 encoding scheme and applied to frames that were intra-coded in both the first and second compression. In such a way, regions that were manipulated between the two encodings are detected. Compared to existing methods based on double quantization analysis, the proposed scheme makes forgery localization possible on a wider range of settings.

In this work, we present a decision fusion strategy for image forensics. We define a framework that exploits information provided by available forensic tools to yield a global judgment about the authenticity of an image. Sources of information are modeled and fused using Dempster-Shafer Theory of Evidence, since this theory allows us to handle uncertain answers from tools and lack of knowledge about prior probabilities better than the classical Bayesian approach. The proposed framework permits us to exploit any available information about tools reliability and about the compatibility between the traces the forensic tools look for. The framework is easily extendable: new tools can be added incrementally with a little effort. Comparison with logical disjunction- and SVM-based fusion approaches shows an improvement in classification accuracy, particularly when strong generalization capabilities are needed.

In this paper, a forensic tool able to discriminate between original and forged regions in an image captured by a digital camera is presented. We make the assumption that the image is acquired using a Color Filter Array, and that tampering removes the artifacts due to the demosaicking algorithm. The proposed method is based on a new feature measuring the presence of demosaicking artifacts at a local level, and on a new statistical model allowing to derive the tampering probability of each 2 × 2 image block without requiring to know a priori the position of the forged region. Experimental results on different cameras equipped with different demosaicking algorithms demonstrate both the validity of the theoretical model and the effectiveness of our scheme.

In this paper, we propose a statistical test to discriminate between original and forged regions in JPEG images, under the hypothesis that the former are doubly compressed while the latter are singly compressed. New probability models for the DCT coefficients of singly and doubly compressed regions are proposed, together with a reliable method for estimating the primary quantization factor in the case of double compression. Based on such models, the probability for each DCT block to be forged is derived. Experimental results demonstrate a better discriminating behavior with respect to previously proposed methods.

Client-side watermark embedding systems have been proposed as a possible solution for the copyright protection in large-scale content distribution environments. In this framework, we propose a new look-up-table-based secure client-side embedding scheme properly designed for the spread transform dither modulation watermarking method. A theoretical analysis of the detector performance under the most known attack models is presented and the agreement between theoretical and experimental results verified through several simulations. The experimental results also prove that the advantages of the informed embedding technique in comparison to the spread-spectrum watermarking approach, which are well known in the classical embedding schemes, are preserved in the client-side scenario. The proposed approach permits us to successfully combine the security of client-side embedding with the robustness of informed embedding methods.

Client side watermark embedding schemes have been proposed as a possible solution for the copyright protection in large scale content distribution environments. In this framework, we propose a look-up-table based secure embedding system, designed for the Spread Transform Dither Modulation (ST-DM) watermarking algorithm, that outperforms Spread Spectrum based systems.

In art diagnostics it is often needed to compare and integrate different sets of information, coming from different sources, and stored in different images. In order to successfully integrate these data, images corresponding to the same areas need to be registered, that is a geometrical transformation that aligns points in one picture with corresponding points in another picture needs to be found and applied. In this paper we present an automatic registration technique for multispectral images, based on the computation of mutual information. We applied this method to obtain RGB images from multispectral data, and derive a (undersampled) spectral signature per pixel of the painting.

Abstract Advances in electronic imaging over recent years have encouraged the development of new tools for cultural heritage applications. In this paper a software application called ArtShop is described, containing some tools for artwork image restoration, developed during several years of research at the Image and Communications Laboratory of the University of Florence. Copyright © 2003 John Wiley & Sons, Ltd.

Progress in electronic imaging over the last years has encouraged the development of new tools for cultural heritage applications. In particular, the areas of painting preservation and restoration have attracted the interest of researchers working in the field of image processing. A virtual tool for painting restoration, which simulates the actual restoration carried out in the restoration laboratory, is presented; in particular, the proposed techniques allow the virtual recovery and filling of the areas of a painting which are damaged by lacunas.

Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.

The MPEG-4 standard is revealing very attractive for a large set of applications. In some of them a copy protection system allowing to control the distribution of multimedia data is required. A new technology useful for copyright protection is watermarking: a digital code (watermark), indicating the copyright owner, is directly embedded into the video signal. The possibility of the MPEG-4 standard to directly access objects within a video sequence introduces a constraint to the watermarking process: even if a video object is transferred from a sequence to another, the copyright data of the single object has to be correctly detected. Another requirement is that, in order to be robust against format conversions, the watermark has to be inserted before compression. The method proposed in this paper satisfies the previous requirements by relying on an image watermarking algorithm which embeds the code in the discrete wavelet transform of each frame.

The evaluation of the number of bits that can be hidden within an image through digital watermarking is a crucial topic, which has been addressed only for additive watermarks. The evaluation of watermark capacity is very important because it allows to put a theoretical upper bound on the amount of information that can be hidden into an image by a given watermarking procedure, regardless of the watermark extraction technique. It is the purpose of this work to suggest a methodology for the evaluation of the watermark capacity in a nonadditive, non-Gaussian framework, and to discuss the results we obtained by applying it to a set of standard images.