The rise of AI-generated synthetic media, or deepfakes, has introduced unprecedented opportunities and challenges across various fields, including entertainment, cybersecurity, and digital communication. Using advanced frameworks such as Generative Adversarial Networks (GANs) and Diffusion Models (DMs), deepfakes are capable of producing highly realistic yet fabricated content, while these advancements enable creative and innovative applications, they also pose severe ethical, social, and security risks due to their potential misuse. The proliferation of deepfakes has triggered phenomena like “Impostor Bias”, a growing skepticism toward the authenticity of multimedia content, further complicating trust in digital interactions. This paper is mainly based on the description of a research project called FF4ALL (FF4ALL-Detection of Deep Fake Media and Life-Long Media Authentication) for the detection and authentication of deepfakes, focusing on areas such as forensic attribution, passive and active authentication, and detection in real-world scenarios. By exploring both the strengths and limitations of current methodologies, we highlight critical research gaps and propose directions for future advancements to ensure media integrity and trustworthiness in an era increasingly dominated by synthetic media.

The minimun description length (MDL) is a powerful criterion for model selection that is gaining increasing interest from both theorists and practicioners. It allows for automatic selection of the best model for representing data without having a priori information about them. It simply uses both data and model complexity, selecting the model that provides the least coding length among a predefined set of models. In this paper, we briefly review the basic ideas underlying the MDL criterion and its applications in different fields, with particular reference to the dimension reduction problem. As an example, the role of MDL in the selection of the best principal components in the well known PCA is investigated.

The improvement of the readability of time-frequency transforms is an important topic in the field of fast-oscillating signal processing. The reassignment method is often used due to its adaptivity to different transforms and nice formal properties. However, it strongly depends on the selection of the analysis window and it requires the computation of the same transform using three different but well-defined windows. The aim of this work is to provide a simple method for spectrogram reassignment, named FIRST (Fast Iterative and Robust Reassignment Thinning), with comparable or better precision than classical reassignment method, a reduced computational effort, and a near independence of the adopted analysis window. To this aim, the time-frequency evolution of a multicomponent signal is formally provided and, based on this law, only a subset of time-frequency points is used to improve spectrogram readability. Those points are the ones less influenced by interfering components. Preliminary results show that the proposed method can efficiently reassign spectrograms more accurately than the classical method in the case of interfering signal components, with a significant gain in terms of required computational effort.

Frequency modulated signals appear in many applied disciplines, including geology, communication, biology and acoustics. They are naturally multicomponent, i.e., they consist of multiple waveforms, with specific time-dependent frequency (instantaneous frequency). In most practical applications, the number of modes—which is unknown—is needed for correctly analyzing a signal; for instance for separating each individual component and for estimating its instantaneous frequency. Detecting the number of components is a challenging problem, especially in the case of interfering modes. The Rényi Entropy-based approach has proven to be suitable for signal modes counting, but it is limited to well separated components. This paper addresses this issue by introducing a new notion of signal complexity. Specifically, the spectrogram of a multicomponent signal is seen as a non-stationary process where interference alternates with non-interference. Complexity concerning the transition between consecutive spectrogram sections is evaluated by means of a modified Run Length Encoding. Based on a spectrogram time-frequency evolution law, complexity variations are studied for accurately estimating the number of components. The presented method is suitable for multicomponent signals with non-separable modes, as well as time-varying amplitudes, showing robustness to noise.

Instantaneous frequency (IF) is a fundamental feature in multicomponent signals analysis and its estimation is required in many practical applications. This goal can be successfully reached for well separated components, while it still is an open problem in case of interfering modes. Most of the methods addressing this issue are parametric, that is, they apply to a specific IF class. Alternative approaches consist of non-parametric time filtering-based procedures, which do not show robustness to destructive interference—the most critical scenario in crossing modes. In this paper, a method for IF curves estimation is proposed. The case of amplitude and frequency modulated two-component signals is addressed by introducing a spectrogram time-frequency evolution law, whose coefficients depend on signal IFs time derivatives, that is, the chirp rates. The problem is then turned into the resolution of a two-dimensional linear system which provides signal chirp rates; IF curves are then obtained by a simple integration. The method is non-parametric and it results quite robust to destructive interference. An estimate of the estimation error, as well as a numerical study concerning method sensitivity and robustness to noise are also provided in the paper.