In the evolving landscape of digital media, the discipline of media forensics, which encompasses the critical examination and authentication of digital images, videos, and audio recordings, has emerged as an area of paramount importance. This heightened significance is predominantly attributed to the burgeoning concerns surrounding the proliferation of DeepFakes, which are highly realistic and manipulated media content, often created using advanced artificial intelligence techniques. Such developments necessitate a profound understanding and advancement in media forensics to ensure the integrity of digital media in various domains. Current research endeavours are primarily directed towards addressing a common challenge observed in DeepFake datasets, which pertains to the issue of overfitting. Many suggested remedies centre around the application of data augmentation methods, with a frequently adopted strategy being the incorporation of random erasure or cutout. This method entails the random removal of sections from an image to introduce diversity and mitigate overfitting. Generating disparities between the altered and unaltered images serves to inhibit the model from excessively adapting itself to individual samples, thus leading to more favourable results. Nonetheless, the stochastic nature of this approach may inadvertently obscure facial regions that harbour vital information necessary for DeepFake detection. Due to the lack of guidelines on specific regions for cutout, most studies use a randomised approach. However, in recent research, face landmarks have been integrated to designate specific facial areas for removal, even though the selection remains somewhat random. Therefore, there is a need to acquire a more comprehensive insight into facial features and identify which regions hold more crucial data for the identification of DeepFakes. In this study, the investigation delves into the data conveyed by various facial components through the excision of distinct facial regions during the training of the model. The goal is to offer valuable insights to enhance forthcoming face removal techniques within DeepFake datasets, fostering a deeper comprehension among researchers and advancing the realm of DeepFake detection. Our study presents a novel method that uses face cutout techniques to improve understanding of key facial features crucial in DeepFake detection. Moreover, the method combats overfitting in DeepFake datasets by generating diverse images with these techniques, thereby enhancing model robustness. The developed methodology is validated against publicly available datasets like FF++ and Celeb-DFv2. Both face cutout groups surpassed the Baseline, indicating cutouts improve DeepFake detection. Face Cutout Group 2 excelled, with 91% accuracy on Celeb-DF and 86% on the compound dataset, suggesting external facial features’ significance in detection. The study found that eyes are most impactful and the nose is least in model performance. Future research could explore the augmentation policy’s effect on video-based DeepFake detection. Full article

The research focuses on the analysis of seismic data, specifically targeting the detection, edge segmentation, and classification of seismic images. These processes are fundamental in image processing and are crucial in understanding the stratigraphic structure and identifying oil and natural gas resources. However, there is a lack of sufficient resources in the field of seismic image detection, and interpreting 2D seismic image slices based on 3D seismic data sets can be challenging. In this research, image segmentation involves image preprocessing and the use of a U-net network. Preprocessing techniques, such as Gaussian filter and anisotropic diffusion, are employed to reduce blur and noise in seismic images. The U-net network, based on the Canny descriptor is used for segmentation. For image classification, the ResNet-50 and Inception-v3 models are applied to classify different types of seismic images. In image detection, Tchebichef invariants are computed using the Tchebichef polynomials’ recurrence relation. These invariants are then used in an optimized multi-class SVM network for detecting and classifying various types of seismic images. The promising results of the SVM model based on Tchebichef invariants suggest its potential to replace Hu moment invariants (HMIs) and Zernike moment invariants (ZMIs) for seismic image detection. This approach offers a more efficient and dependable solution for seismic image analysis in the future. Full article

Orbitrap mass spectrometers have gained widespread popularity in ground-based environmental component analysis. However, their application in atmospheric exploration for space missions remains limited. Existing data acquisition solutions for Orbitrap instruments primarily rely on commercial systems and computer-based spectrum analysis. In this study, we developed a self-designed data acquisition solution specifically tailored for atmospheric molecule detection. The implementation involved directly integrating a spectrum analysis algorithm onto a field programmable gate array (FPGA), enabling miniaturization, real-time performance, and meeting the desired requirements. The system comprises signal conditioning circuits, analog-to-digital conversion (ADC) circuits, programmable logic circuits, and related software. These components facilitate real-time spectrum analysis and signal processing on hardware, enabling high-speed acquisition and analysis of signals generated by the Orbitrap. Experimental results demonstrate that the system can sample front-end analog signals at a rate of 25 MHz and differentiate signal spectra with an error margin of less than 7 kHz. This establishes the viability of the designed data acquisition system for atmospheric mass spectrometry analysis. Full article

Krawtchouk polynomials (KPs) are discrete orthogonal polynomials associated with the Gauss hypergeometric functions. These polynomials and their generated moments in 1D or 2D formats play an important role in information and coding theories, signal and image processing tools, image watermarking, and pattern recognition. In this paper, we introduce a new four-term recurrence relation to compute KPs compared to their ordinary recursions (three-term) and analyse the proposed algorithm speed. Moreover, we use Clenshaw’s technique to accelerate the computation procedure of the Krawtchouk moments (KMs) using a fast digital filter structure to generate a lattice network for KPs calculation. The proposed method confirms the stability of KPs computation for higher orders and their signal reconstruction capabilities as well. The results show that the KMs calculation using the proposed combined method based on a four-term recursion and Clenshaw’s technique is reliable and fast compared to the existing recursions and fast KMs algorithms. Full article

Image watermarking is most often used to prove that an image belongs to someone and to make sure that the image is the same as was originally produced. The type of watermarking used for the detection of originality and tampering is known as authentication-type watermarking. In this paper, a blind semi-fragile authentication watermarking method is introduced. Although the main concern in this paper is authenticating the image, watermarking for proving ownership is additionally implemented. The method considers the image as two main parts: an inner part and an outer part. The inner and outer parts are divided into non-overlapping blocks. The block size of the inner and outer part are different. The outer blocks have a greater area than the inner blocks so that their watermark-holding capacity is greater, providing enough robustness for semi-fragility. The method is semi-fragile and the watermarked image is authenticated despite the JPEG being compressed to 75% quality. The embedded watermark also survives innocent types of image operations, such as intensity adjustment, histogram equalization and gamma correction. Semi-fragile and selectively fragile authentication is valuable and in high demand specifically because it survives these innocent image operations while detecting ill-intentioned tampering. In this work, we embed a binary watermark into the inner and outer parts of images using a scrambling algorithm, discrete wavelet transform (DWT) and discrete cosine transform (DCT) in the blocks. The proposed methodology has high image quality after watermarking, with a PSNR value of 40.577, and high quality is also achieved after JPEG compression. The embedding process provides acceptable image quality after tamper attacks, including JPEG compression, Gaussian noise, average filtering, and scaling attacks with PSNR values greater than 29. Experimental results obtained show that the proposed semi-fragile watermarking algorithm is more robust, secure and resistant than other algorithms in the literature. Full article

In the Mallat algorithm, calculations are performed in the time domain. To speed up the signal conversion at each level, the wavelet coefficients are sequentially halved. This paper presents an algorithm for increasing the speed of multiscale signal analysis using fast Fourier transform. In this algorithm, calculations are performed in the frequency domain, which is why the authors call this algorithm multiscale analysis in the frequency domain. For each level of decomposition, the wavelet coefficients are determined from the signal and can be calculated in parallel, which reduces the conversion time. In addition, the zoom factor can be less than two. The Mallat algorithm uses non-symmetric wavelets, and to increase the accuracy of the reconstruction, large-order wavelets are obtained, which increases the transformation time. On the contrary, in our algorithm, depending on the sample length, the wavelets are symmetric and the time of the inverse wavelet transform can be faster by 6–7 orders of magnitude compared to the direct numerical calculation of the convolution. At the same time, the quality of analysis and the accuracy of signal reconstruction increase because the wavelet transform is strictly orthogonal. Full article