scholarly journals Exposing Speech Transsplicing Forgery with Noise Level Inconsistency

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Diqun Yan ◽  
Mingyu Dong ◽  
Jinxing Gao

Splicing is one of the most common tampering techniques for speech forgery in many forensic scenarios. Some successful approaches have been presented for detecting speech splicing when the splicing segments have different signal-to-noise ratios (SNRs). However, when the SNRs between the spliced segments are close or even same, no effective detection methods have been reported yet. In this study, noise inconsistency between the original speech and the inserted segment from other speech is utilized to detect the splicing trace. First, noise signal of the suspected speech is extracted by a parameter-optimized noise estimation algorithm. Second, the statistical Mel frequency features are extracted from the estimated noise signal. Finally, the spliced region is located by utilizing a change point detection algorithm on the estimated noise signal. The effectiveness of the proposed method is evaluated on a well-designed speech splicing dataset. The comparative experimental results show that the proposed algorithm can achieve better detection performance than other algorithms.

Smart Cities ◽  
2020 ◽  
Vol 4 (1) ◽  
pp. 1-16
Author(s):  
Haoran Niu ◽  
Olufemi A. Omitaomu ◽  
Qing C. Cao

Events detection is a key challenge in power grid frequency disturbances analysis. Accurate detection of events is crucial for situational awareness of the power system. In this paper, we study the problem of events detection in power grid frequency disturbance analysis using synchrophasors data streams. Current events detection approaches for power grid rely on individual detection algorithm. This study integrates some of the existing detection algorithms using the concept of machine committee to develop improved detection approaches for grid disturbance analysis. Specifically, we propose two algorithms—an Event Detection Machine Committee (EDMC) algorithm and a Change-Point Detection Machine Committee (CPDMC) algorithm. Both algorithms use parallel architecture to fuse detection knowledge of its individual methods to arrive at an overall output. The EDMC algorithm combines five individual event detection methods, while the CPDMC algorithm combines two change-point detection methods. Each method performs the detection task separately. The overall output of each algorithm is then computed using a voting strategy. The proposed algorithms are evaluated using three case studies of actual power grid disturbances. Compared with the individual results of the various detection methods, we found that the EDMC algorithm is a better fit for analyzing synchrophasors data; it improves the detection accuracy; and it is suitable for practical scenarios.


2018 ◽  
Vol 8 ◽  
Author(s):  
Nathan Gold ◽  
Martin G. Frasch ◽  
Christophe L. Herry ◽  
Bryan S. Richardson ◽  
Xiaogang Wang

2020 ◽  
Author(s):  
Simon Letzgus

Abstract. Analysis of data from wind turbine supervisory control and data acquisition (SCADA) systems has attracted considerable research interest in recent years. The data is predominantly used to gain insights into turbine condition without the need for additional sensing equipment. Most successful approaches apply semi-supervised anomaly detection methods, also called normal behaivour models, that use clean training data sets to establish healthy component baseline models. However, one of the major challenges when working with wind turbine SCADA data in practice is the presence of systematic changes in signal behaviour induced by malfunctions or maintenance actions. Even though this problem is well described in literature it has not been systematically addressed so far. This contribution is the first to comprehensively analyse the presence of change-points in wind turbine SCADA signals and introduce an algorithm for their automated detection. 600 signals from 33 turbines are analysed over an operational period of more than two years. During this time one third of the signals are affected by change-points. Kernel change-point detection methods have shown promising results in similar settings but their performance strongly depends on the choice of several hyperparameters. This contribution presents a comprehensive comparison between different kernels as well as kernel-bandwidth and regularisation-penalty selection heuristics. Moreover, an appropriate data pre-processing procedure is introduced. The results show that the combination of Laplace kernels with a newly introduced bandwidth and penalty selection heuristic robustly outperforms existing methods. In a signal validation setting more than 90 % of the signals were classified correctly regarding the presence or absence of change-points, resulting in a F1-score of 0.86. For a change-point-free sequence selection the most severe 60 % of all CPs could be automatically removed with a precision of more than 0.96 and therefore without a significant loss of training data. These results indicate that the algorithm can be a meaningful step towards automated SCADA data pre-processing which is key for data driven methods to reach their full potential. The algorithm is open source and its implementation in Python publicly available.


2005 ◽  
Vol 22 (01) ◽  
pp. 51-70 ◽  
Author(s):  
KYONG JOO OH ◽  
TAE HYUP ROH ◽  
MYUNG SANG MOON

This study suggests time-based clustering models integrating change-point detection and neural networks, and applies them to financial time series forecasting. The basic concept of the proposed models is to obtain intervals divided by change points, to identify them as change-point groups, and to involve them in the forecasting model. The proposed models consist of two stages. The first stage, the clustering neural network modeling stage, is to detect successive change points in the dataset, and to forecast change-point groups with backpropagation neural networks (BPNs). In this stage, three change-point detection methods are applied and compared. They are: (1) the parametric approach, (2) the nonparametric approach, and (3) the model-based approach. The next stage is to forecast the final output with BPNs. Through the application to financial time series forecasting, we compare the proposed models with a neural network model alone and, in addition, determine which of three change-point detection methods performs better. Furthermore, we evaluate whether the proposed models play a role in clustering to reflect the time. Finally, this study examines the predictability of the integrated neural network models based on change-point detection.


Sign in / Sign up

Export Citation Format

Share Document