<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Deepfake Algorithm Recognition System with Augmented Data for ADD 2023 Challenge</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xiao-Min Zeng</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jian-Tao Zhang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kang Li</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhuo-Li Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei-Lin Xie</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yan Song</string-name>
          <email>songy@ustc.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Engineering Research Center of Speech and Language Information Processing, University of Science and Technology of China</institution>
          ,
          <addr-line>Hefei</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <fpage>31</fpage>
      <lpage>36</lpage>
      <abstract>
        <p>In this paper, we describe our submitted systems to the ADD2023 Challenge Track 3-Deepfake algorithm recognition (AR). This task requires not only identifying known deepfake algorithms in closed-set but also distinguishing unknown algorithms. By closed-set classification experiments, we select the output of the pre-trained wav2vec2.0-base model as acoustic features. Then, we apply the ECAPA-TDNN model to recognize diferent deepfake algorithms and determine whether the samples belong to the unknown algorithms by threshold. Besides, we adopt data augmentation to improve the generalization and robustness of our model. We evaluate our system on the ADD2023 Challenge Track 3 and achieve a 75.41% F1-score. Our submission ranked third in the deepfake algorithm recognition track of the ADD2023 Challenge.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;deepfake algorithm recognition</kwd>
        <kwd>open-set recognition</kwd>
        <kwd>data augmentation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>robustness of the model is one of the key objectives for
deepfake detection systems.</p>
      <p>
        Speech synthesis and voice conversion technologies [1] However, there are many algorithms for generating
are evolving rapidly, thanks to the development of deep deepfake audio. While detecting spoof audio, we would
neural networks. While these advanced technologies pro- like to know by which algorithms this fake audio is
vide convenience for application, they also threaten the generated. Recently, the second Audio Deepfake
Detecidentity of speaker [2]. For the safety of speakers, audio tion C
        <xref ref-type="bibr" rid="ref33">hallenge (ADD 2023</xref>
        ) [23] is launched, aiming at
deepfake detection systems are required to develop, and spurring researchers around the world to build new
innothese defense technologies have attracted lots of research. vative technologies that can further accelerate and foster
A classic example is the ASVspoof Challenges [3, 4, 5, 6] research on detecting and analyzing deepfake speech
that focus on the development of anti-spoofing counter- utterances. In ADD2023 Challenge Track 3 [23], the
obmeasures for verification systems. Besides, the first Audio jective of this task is to recognize the algorithms of
deepDeepfake Detection Challenge
        <xref ref-type="bibr" rid="ref30">(ADD 2022)</xref>
        [7] introduces fake utterances. The deepfake algorithms are diverse,
more challenging attacking situations in realistic scenar- and it is impossible to cover all algorithms in the training
ios. set. Therefore, the testing process is actually an open-set
      </p>
      <p>In past work, several handcrafted features are used recognition [24], which requires not only correctly
classifor deepfake audio detection, including MFCC, iMFCC, fying the types of algorithms that appear in the training
LFCC, DCT-DFTspec, log-linear filterbank, and CQT fea- set but also distinguishing the unknown algorithms.
tures [8, 9, 10, 11, 12, 13, 14]. Previous works indicate In the field of open-set recognition, advanced methods
that LFCC or CQT is more suitable for deepfake audio have been proposed, e.g. OpenMax [25], OpenGAN [26]
detection. In addition, some works [15, 16, 17] adopt raw and OpenHybrid [27]. These methods specifically design
waveforms as the input to construct end-to-end deepfake a novel module for identifying the open-set samples.
Bedetection systems. Moreover, various data augmentation sides, distinguishing the open-set samples based on the
technologies are also applied to develop detection sys- comparison of threshold and posterior probabilities is
tems. Codec augmentation are used in [8, 18, 19, 20, 21]. one of the most general methods. It is also interesting to
Noise augmentation, reverberation, and cutmix are also note that S. Vaze et al. [28] proves a positive correlation
essential technologies in anti-spoof systems [20, 21, 22]. between closed-set accuracy and open-set recognition
It demonstrates that improving the generalization and performance.</p>
      <p>In this paper, we describe our submission for ADD2023
Challenge Track 3 in detail. First, motivated by [28],
we conduct classification experiments on closed
training set for selecting the optimal input acoustic features.</p>
      <p>Finally, we choose the output of wav2vec2.0 [29] for</p>
      <p>© 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License the experiment of open-set recognition. The pre-trained
CPWrEooUrckReshdoinpgs IhStpN:/c1e6u1r3-w-0s.o7r3g ACttEribUutRion W4.0oInrtekrnsahtioonpal (PCCroBYce4.0e).dings (CEUR-WS.org) wav2vec2.0 model extracts powerful acoustic features,
Noisy
Original
Mixed</p>
      <p>Add Noise &amp; Reverb
Utterance Mixup</p>
      <sec id="sec-1-1">
        <title>Wav2vec2.0-base</title>
      </sec>
      <sec id="sec-1-2">
        <title>ECAPA-TDNN</title>
      </sec>
      <sec id="sec-1-3">
        <title>Cross-Entropy Loss</title>
      </sec>
      <sec id="sec-1-4">
        <title>Cross-Entropy Loss for Mixed Samples</title>
        <p>and then these features are fed into ECAPA-TDNN [30] is extracted as a 512-dimensional vector representation,
to classify deepfake algorithms. In addition, we exploit and the stride is 20ms. Then, the vector representations
several data augmentation, including noise [31], rever- are processed by a series of transformer blocks. With
beration [32], and utterance mixup [33], to generate aug- the help of self-attention module and feed-forward
netmented samples. In our experiments, all augmented and work, the context and content information is shown in
original samples form a larger training batch for improv- representations, which is conducive to learning more
ing the generalization and robustness of our model. Ulti- informative representations.
mately, we achieve a 75.41% F1-score, which ranks 3rd The wav2vec2.0 is pre-trained in a self-supervised
manin ADD2023 Challenge Track 3. ner using contrastive loss. The objective is to predict the
true quantized latent speech representation for a masked
time step within a set of distractors. The output of
pre2. Methods trained wav2vec2.0 can be applied to downstream
supervised learning tasks associated with speech.</p>
        <p>In our deepfake algorithm recognition system, we
adopt wav2vec2.0-base as the pre-trained feature
extractor, aiming at extracting more helpful information from
the waveform.</p>
        <p>Our deepfake algorithms recognition system is illustrated
in Fig. 1. We apply several data augmentation (add noise
&amp; reverb [31, 32] and utterance mixup [33]) to obtain
augmented samples. These samples are used along with
the original samples for training. They are fed into the
ifxed wav2vec2.0-base model to extract acoustic features
and then are classified by ECAPA-TDNN. In this section, 2.1.2. Classification Model
we introduce the model’s architecture, data augmentation ECAPA-TDNN [30] is a classical model in the field of
methods, and open-set recognition approaches we used. speaker recognition and verification. As front-end
systems of speaker recognition, deepfake detection systems
2.1. The Architecture of Model are also required to process speaker-related information.
Therefore, we think that ECAPA-TDNN is also suitable
2.1.1. Feature Extractor for deepfake algorithm recognition systems.
Wav2vec2.0 can learn powerful representations from After extracting the representations from wav2vec2.0,
speech audio [29]. After pre-training with a large dataset, we adopt ECAPA-TDNN to aggregate the features further.
it has been demonstrated the feasibility of speech recog- The SE-Res2Block achieves channel attention that uses
nition with limited amounts of labeled data. a global context incorporated in the frame layers. Then,</p>
        <p>The raw speech signal is first fed into a feature en- attentive statistic pooling is used to aggregate
utterancecoder which consists of several convolution layers (CNN), level embeddings about the deepfake algorithm. After
where the kernel widths and strides behave as the win- the embedding of input speech is obtained, it is fed into
dow length and hop of the Short-Time Fourier Trans- an algorithm classifier. Simple, this classifier is achieved
form (STFT). Following wav2vec2.0, every 25ms of audio by a fully-connected layer.</p>
        <sec id="sec-1-4-1">
          <title>2.2. Data Augmentation</title>
          <p>In this work, we employ several data augmentation
methods in order to improve the generalization and robustness
of the learned representations.
2.2.1. Add Noise and Reverb
We use the MUSAN dataset [31] and the RIR dataset [32]
to randomly add noise or reverb to the input audio. We
get a random number  that follows a uniform
distribution between 0 to 1 and choose diferent data
augmentation methods depending on . Specifically, the
relationship between  and diferent data augmentations
is shown in Table 1. In our work, the augmented
samples and the original samples form a larger batch that is
utilized together to optimize the network.
2.2.2. Utterance Mixup</p>
        </sec>
        <sec id="sec-1-4-2">
          <title>2.3. Unknown Algorithm Recognition</title>
          <p>In the training procedure, we follow the closed-set
setting, and the model is optimized to perform well under
the multi-classes classification task. The objective is to
accurately distinguish the deepfake algorithms in the
training set so that a compact category distribution is
obtained.</p>
          <p>During the testing phase, we have to solve an open-set
recognition task. We first calculate the prototypes  of
known algorithm categories in the training set,
 =
1</p>
          <p>∑︁  ()
|| ∈</p>
          <p>(4)
where  is a set of all training samples labeled with
deepfake algorithm  and || is its cardinality.  is the
model we use with parameter  .</p>
          <p>After obtaining prototypes, we calculate the
cosinesimilarity between test embedding and prototypes .</p>
          <p>The category corresponding to the maximum similarity
simimax is the classification result we determine. For
unknown algorithm recognition, if the maximum similarity
is lower than a pre-defined threshold , this
sample is regarded as an open-set category, i.e. unknown
deepfake algorithm. This process can be expressed as,
result =
{︃known class if simimax ≥ 
unknown class if simimax ≤ 
(5)
Then, the loss function is also modified to,
 =  1 + (1 − ) 2
ℒ = ℒ 1 + (1 − )ℒ 2
where ℒ represents the loss calculated with the label
 corresponding to sample .</p>
          <p>Mixup [33] is one of the common methods of data
augmentation in the field of computer vision. We introduce This is one of the most widely applied methods of
openutterance mixup to speech deepfake algorithm recog- set recognition. The method is simple and intuitive, so
nition. The utterance mixup aims to simulate multiple we adopt it to distinguish unknown deepfake algorithms.
deepfake algorithm audio and improve model generaliza- Meanwhile, this threshold determination method has to
tion. guarantee the accuracy of the closed-set categories.</p>
          <p>To generate the mixed audio from multiple deepfake
algorithms, we randomly select two utterances 1, 2 3. Experimental Setup
from each training batch and mix them according to the
following equation,</p>
          <p>=  1 + (1 − ) 2
where mixing coeficient  ∼ Beta(,  ). Obviously, the
mixed sample contains two diferent deepfake algorithms,
which means the mixed samples belong to two diferent
algorithmic categories. Therefore, the label of mixed
sample is modified as follows,
(1)
(2)
(3)</p>
        </sec>
        <sec id="sec-1-4-3">
          <title>3.1. Datasets</title>
          <p>
            T
            <xref ref-type="bibr" rid="ref33">he ADD2023</xref>
            Challenge Track 3 [23] aims to
recognize the algorithms of deepfake utterances. The training
dataset contains seven classes, including one real
category and six deepfake algorithm generated categories. In
addition, ADD2023 also released a development dataset
For ADD2023 Challenge Track 3, we are required to
recognize the known and unknown algorithms of the deepfake
utterances. Therefore, the performance is evaluated by
macro-average precision, recall, and F1-score. The final
ranking of this challenge is based on the F1-score [23].
4. Results
for model optimization and selection. The number of 4.1. Closed-set Experimental Results
samples for each category in the training and
development datasets is presented in Table 2. It can be found According to the conclusion in [28], the more accurate
that there is a diference in the sampling rate. Therefore, the closed-set classification, the better the performance of
we resample all the audio so that all sampling rates are open-set recognition. Therefore, in order to select the
op16kHz. We integrate all samples in the training and de- timal input acoustic features, we first conduct closed-set
velopment datasets into a larger dataset for optimizing classification experiments on the training set. We adopt
the model. diferent acoustic features as input and classify seven
          </p>
          <p>
            In the test set, there are 79490 test utterances in total. deepfake algorithms of the training set using ResNet18
It contains eight categories, seven of which are the same with Time-Frequency Attention Pooling [34]. The results
as the training and development datasets. Besides, one of closed-set classification are presented in Table 3. It
additional deepfake algorithm category is added as an is not hard to obverse that when LFCC and wav2vec2.0
open-set class. T
            <xref ref-type="bibr" rid="ref33">herefore, the ADD2023</xref>
            Challenge Track are utilized, the closed-set can achieve satisfactory
per3 is a typical open-set recognition task. formances. We believe that these two features can
relfect more information about deepfake algorithms, so
3.2. Implementation Details we choose them for the following open-set recognition
experiments.
          </p>
          <p>Our network consists of wav2vec2.0-base and
ECAPATDNN. In our experiments, we employ an open-source, 4.2. Open-set Recognition Results
self-supervised pre-trained wav2vec2.0-base model. The
output of wav2vec2.0-base is 768-dimensional features. We compare the performance of various input features
Thus the input dimension of ECAPA-TDNN needs to and classification models for open-set recognition. We
be modified to match. In the training phase, we fix the adopt grid search for unknown algorithm thresholds
parameters of the pre-trained wav2vec2.0-base model  and present the optimal results in Table 4. The
reand optimize only the ECAPA-TDNN model. sults indicate that the output of pre-trained wav2vec2.0</p>
          <p>For each training utterance, we randomly crop 4 sec- captures higher-level semantic information and more
onds of audio to construct batches with a batch size of 64. detailed information from waveform than LFCC. It is
An SGD algorithm is utilized with a momentum of 0.9 more beneficial for deepfake algorithm recognition. The
and weight decay of 1e-4 to optimize our model over 50 ResNet18 exploits 2D convolution to process features
epochs. The initial learning rate of 0.1 is used for
training during the first 25 epochs, declining to 0.01 between
the 25th and 40th epochs and 0.001 for the remaining 10
epochs. Moreover, the hyper-parameter  in utterance
mixup is set to 1.0 in our experiments, and we select the
optimal  by grid searching.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>5. Conclusions</title>
      <p>
        This paper has presented our proposed systems for t
        <xref ref-type="bibr" rid="ref33">he
ADD2023</xref>
        Challenge Deepfake Algorithm Recognition
Track, which is based on pre-trained wav2vec2.0-base
and ECAPA-TDNN models. According to the accuracy of
closed-set algorithm classification experiments, we select
the output of pre-trained wav2vec2.0-base as acoustic
features. While the wav2vec2.0 is robust and general, we
adapt the ECAPA-TDNN to deepfake algorithm
recognition through data augmentation techniques. Our
proposed systems show competitive results and rank third in
Track 3 of t
        <xref ref-type="bibr" rid="ref33">he ADD2023</xref>
        Challenge. In future work, more
general data augmentation and more eficient open-set
recognition approaches should be further considered.
and treats the input as images, which is not the most
appropriate way for audio. Instead, the ECAPA-TDNN is
designed specifically for speech tasks. The results also
show that ECAPA-TDNN achieves better performance.
Besides, we discover that when using ECAPA-TDNN
as a classification model, the optimal unknown
algorithm threshold  is much larger than that when
ResNet18 is employed. This phenomenon suggests that
ECAPA-TDNN models a more compact embedding space
for closed-set samples, which results in a higher
confidence level and better performance. This conclusion is
consistent with [28].
      </p>
      <p>
        To improve the generalization and robustness of the
model, we applied various data augmentation in the
training process. In Table 5, we study the influences of the
different data augmentations on performance. After adding
noise and reverbing, the performance is significantly
improved. The larger value of  means that more
augmented samples caused by noise and reverberation are
generated. We find that the model makes further progress
as the number of augmented samples increases. Utilizing
utterance mixup on the basis of noise addition and
reverberation, we further improve the performance. With
the help of several data augmentation, the optimal
F1score of 75.41% is achieved. This result ranks 3rd in t
        <xref ref-type="bibr" rid="ref33">he
ADD2023</xref>
        Challenge Track 3.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <source>ume</source>
          <year>2016</year>
          ,
          <year>2016</year>
          , pp.
          <fpage>283</fpage>
          -
          <lpage>290</lpage>
          . and
          <string-name>
            <surname>Analysis (DADA</surname>
          </string-name>
          <year>2023</year>
          ),
          <year>2023</year>
          . [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <surname>R. K. Das</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Extended constant-q cep-</article-title>
          [24]
          <string-name>
            <given-names>C.</given-names>
            <surname>Geng</surname>
          </string-name>
          , S.-j. Huang,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          , Recent advances in
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>in: 2018 Asia-Pacific Signal and Information Pro- on pattern analysis and machine intelligence 43</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>cessing Association Annual Summit and Confer-</surname>
          </string-name>
          (
          <year>2020</year>
          )
          <fpage>3614</fpage>
          -
          <lpage>3631</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <article-title>ence (APSIPA ASC)</article-title>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>1024</fpage>
          -
          <lpage>1029</lpage>
          . [25]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bendale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Boult</surname>
          </string-name>
          , Towards open set deep [14]
          <string-name>
            <surname>R. K. Das</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Long Range Acoustic Fea- networks</article-title>
          ,
          <source>in: Proceedings of the IEEE conference</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <article-title>tures for Spoofed Speech Detection</article-title>
          ,
          <source>in: Proc. Inter- on computer vision and pattern recognition</source>
          ,
          <year>2016</year>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>speech</source>
          <year>2019</year>
          ,
          <year>2019</year>
          , pp.
          <fpage>1058</fpage>
          -
          <lpage>1062</lpage>
          . doi:
          <volume>10</volume>
          .21437/ pp.
          <fpage>1563</fpage>
          -
          <lpage>1572</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Interspeech.2019-</surname>
          </string-name>
          <year>1887</year>
          . [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ramanan</surname>
          </string-name>
          , Opengan: Open-set recog[15]
          <string-name>
            <given-names>H.</given-names>
            <surname>Tak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Patino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Todisco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nautsch</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Evans, nition via open data generation</article-title>
          , in: Proceedings
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Larcher</surname>
          </string-name>
          ,
          <article-title>End-to-end anti-spoofing with rawnet2, of the IEEE</article-title>
          /CVF International Conference on Com-
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <source>in: ICASSP2021</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>6369</fpage>
          -
          <lpage>6373</lpage>
          .
          <source>puter Vision</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>813</fpage>
          -
          <lpage>822</lpage>
          . [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Tak</surname>
          </string-name>
          , J. weon Jung,
          <string-name>
            <given-names>J.</given-names>
            <surname>Patino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kamble</surname>
          </string-name>
          , [27]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guo</surname>
          </string-name>
          , Hybrid models
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <article-title>graph attention networks for speaker verification ECCV 2020: 16th European Conference</article-title>
          , Glasgow,
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <article-title>anti-spoofing and speech deepfake detection</article-title>
          ,
          <source>in: UK, August 23-28</source>
          ,
          <year>2020</year>
          , Proceedings, Part III 16,
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <source>Proc. 2021 Edition of the Automatic Speaker Verifi- Springer</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>102</fpage>
          -
          <lpage>117</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          cation and Spoofing Countermeasures Challenge, [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaze</surname>
          </string-name>
          , K. Han,
          <string-name>
            <given-names>A</given-names>
            .
            <surname>Vedaldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          , Open-set
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <year>2021</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . doi:
          <volume>10</volume>
          .21437/ASVSPOOF.2021
          <article-title>-1. recognition: A good closed-set classifier is all you</article-title>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Patino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Todisco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Evans</surname>
          </string-name>
          , Raw Difer- need?, in: International Conference on Learning
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <source>entiable Architecture Search for Speech Deepfake Representations</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>and Spoofing</given-names>
            <surname>Detection</surname>
          </string-name>
          ,
          <source>in: Proc. 2021 Edition</source>
          [29]
          <string-name>
            <given-names>A.</given-names>
            <surname>Baevski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Auli</surname>
          </string-name>
          , wav2vec
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <source>of the Automatic Speaker Verification and Spoof- 2</source>
          .
          <article-title>0: A framework for self-supervised learning of</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>ing Countermeasures</surname>
            <given-names>Challenge</given-names>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <fpage>22</fpage>
          -
          <lpage>28</lpage>
          . speech representations,
          <source>Advances in neural infor-</source>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>doi:10.21437/ASVSPOOF.2021-4. mation processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>12449</fpage>
          -
          <lpage>12460</lpage>
          . [18]
          <string-name>
            <surname>R. K. Das</surname>
          </string-name>
          ,
          <string-name>
            <surname>Known-unknown Data</surname>
            Augmentation [30]
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Desplanques</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Thienpondt</surname>
          </string-name>
          , K. Demuynck,
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <year>2021</year>
          , in: Proc.
          <year>2021</year>
          <article-title>Edition of the Automatic TDNN Based Speaker Verification</article-title>
          , in:
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>Speaker Verification and Spoofing Countermea- Proc. Interspeech</source>
          <year>2020</year>
          ,
          <year>2020</year>
          , pp.
          <fpage>3830</fpage>
          -
          <lpage>3834</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <source>sures Challenge</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>36</lpage>
          . doi:
          <volume>10</volume>
          .21437/ doi:10.21437/Interspeech.2020-
          <volume>2650</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <surname>ASVSPOOF.</surname>
          </string-name>
          <year>2021</year>
          -
          <volume>5</volume>
          . [31]
          <string-name>
            <given-names>D.</given-names>
            <surname>Snyder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Povey</surname>
          </string-name>
          , Musan: A mu[19]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Khoury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Phatak</surname>
          </string-name>
          , G. Sivaraman, Pin- sic, speech, and noise corpus, arXiv preprint
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          drop Labs'
          <article-title>Submission to the ASVspoof 2021 Chal-</article-title>
          arXiv:
          <fpage>1510</fpage>
          .08484 (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          lenge, in
          <source>: Proc. 2021 Edition of the Automatic</source>
          [32]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Peddinti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Povey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Seltzer</surname>
          </string-name>
          , S. Khu-
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <source>sures Challenge</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>93</lpage>
          . doi:
          <volume>10</volume>
          .21437/
          <article-title>berant speech for robust speech recognition</article-title>
          , in:
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <string-name>
            <surname>ASVSPOOF.</surname>
          </string-name>
          <year>2021</year>
          -
          <fpage>14</fpage>
          . ICASSP2017, IEEE,
          <year>2017</year>
          , pp.
          <fpage>5220</fpage>
          -
          <lpage>5224</lpage>
          . [20]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          , H.
          <string-name>
            <surname>-C. Kuo</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-H. Hung</surname>
            ,
            <given-names>H.</given-names>
            -Y. Lee, [33] H.
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Cissé</surname>
            ,
            <given-names>Y. N.</given-names>
          </string-name>
          <string-name>
            <surname>Dauphin</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          Lopez-Paz,
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tsao</surname>
          </string-name>
          , H.
          <string-name>
            <surname>-M. Wang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Meng</surname>
          </string-name>
          ,
          <article-title>Partially fake audio mixup: Beyond empirical risk minimization</article-title>
          ,
          <source>in: 6th</source>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          ery, in: ICASSP2022, IEEE,
          <year>2022</year>
          , pp.
          <fpage>9236</fpage>
          -
          <lpage>9240</lpage>
          . tions,
          <year>2018</year>
          . [21]
          <string-name>
            <given-names>R.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          , Audio [34]
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.-R.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. McLoughlin</surname>
          </string-name>
          , L. Liu,
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <source>add</source>
          <year>2022</year>
          , in: ICASSP2022, IEEE,
          <year>2022</year>
          , pp.
          <fpage>9226</fpage>
          -
          <article-title>pervised anomalous sound detection under domain</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          9230. shift, in: ICASSP2022, IEEE,
          <year>2022</year>
          , pp.
          <fpage>471</fpage>
          -
          <lpage>475</lpage>
          . [22]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tang</surname>
          </string-name>
          , P. Hu, Fake audio detec-
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <surname>ICASSP2022</surname>
          </string-name>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>9231</fpage>
          -
          <lpage>9235</lpage>
          . [23]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          , C. Y.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          <string-name>
            <given-names>H.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <year>Add 2023</year>
          :
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          <source>IJCAI 2023 Workshop on Deepfake Audio Detection</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>