GRAPH-BASED SPECTRO-TEMPORAL DEPENDENCY MODELING FOR ANTI-SPOOFING
Feng Chen (Harbin Institute of Technology); Shiwen Deng (Harbin Normal University); 铁然 郑 (哈尔滨工业大学 ); 勇军 何 (50+); jiqing Han (Harbin Institute of Technology)
-
SPS
IEEE Members: $11.00
Non-members: $15.00
A great deal of recent research reveals that artifacts introduced by spoofing algorithms reside in specific frequency subbands or temporal segments. Therefore, the performance of spoofing detection can be improved by focusing on these regions. However, it is difficult for the detection system to choose an appropriate region when it encounters an unknown spoofing algorithm, resulting in poor generalization. Actually, there is a noticeable difference in the inter-region relationship between the bonafide and spoofed speeches. We name the inter-region relationship spectro-temporal dependency and design a method to model it for anti-spoofing. By focusing on the general dependency difference rather than specific regions, the generalization ability of the detection system can be improved. We employ a graph neural network to model the dependency and incorporate prior knowledge into the graph by designing the graph structure and edge weight, which forces the network to pay more attention to potential relationships. In addition, an attention mechanism is introduced in the graph pooling to focus on more critical nodes. The proposed method achieves an equal error rate of 0.58% on the ASVspoof 2019 LA dataset and outperforms all competing systems.