Visualizing Classifier Adjacency Relations: A Case Study in Speaker Verification and Voice Anti-Spoofing

• URL: http://arxiv.org/abs/2106.06362v1
• Date: Fri, 11 Jun 2021 13:03:33 GMT
• Title: Visualizing Classifier Adjacency Relations: A Case Study in Speaker Verification and Voice Anti-Spoofing
• Authors: Tomi Kinnunen, Andreas Nautsch, Md Sahidullah, Nicholas Evans, Xin Wang, Massimiliano Todisco, H\'ector Delgado, Junichi Yamagishi, Kong Aik Lee
• Abstract summary: We propose a simple method to derive 2D representation from detection scores produced by an arbitrary set of binary classifiers. Based upon rank correlations, our method facilitates a visual comparison of classifiers with arbitrary scores. While the approach is fully versatile and can be applied to any detection task, we demonstrate the method using scores produced by automatic speaker verification and voice anti-spoofing systems.
• Score: 72.4445825335561
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Whether it be for results summarization, or the analysis of classifier fusion, some means to compare different classifiers can often provide illuminating insight into their behaviour, (dis)similarity or complementarity. We propose a simple method to derive 2D representation from detection scores produced by an arbitrary set of binary classifiers in response to a common dataset. Based upon rank correlations, our method facilitates a visual comparison of classifiers with arbitrary scores and with close relation to receiver operating characteristic (ROC) and detection error trade-off (DET) analyses. While the approach is fully versatile and can be applied to any detection task, we demonstrate the method using scores produced by automatic speaker verification and voice anti-spoofing systems. The former are produced by a Gaussian mixture model system trained with VoxCeleb data whereas the latter stem from submissions to the ASVspoof 2019 challenge.

Related papers

• Combining X-Vectors and Bayesian Batch Active Learning: Two-Stage Active Learning Pipeline for Speech Recognition [0.0]
  This paper introduces a novel two-stage active learning pipeline for automatic speech recognition (ASR) The first stage utilizes unsupervised AL by using x-vectors clustering for diverse sample selection from unlabeled speech data. The second stage incorporates a supervised AL strategy, with a batch AL method specifically developed for ASR.
  arXiv  Detail & Related papers  (2024-05-03T19:24:41Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• Identifying Spurious Correlations using Counterfactual Alignment [5.782952470371709]
  Models driven by spurious correlations often yield poor generalization performance. We propose the counterfactual (CF) alignment method to detect and quantify spurious correlations.
  arXiv  Detail & Related papers  (2023-12-01T20:16:02Z)
• Convolutional autoencoder-based multimodal one-class classification [80.52334952912808]
  One-class classification refers to approaches of learning using data from a single class only. We propose a deep learning one-class classification method suitable for multimodal data.
  arXiv  Detail & Related papers  (2023-09-25T12:31:18Z)
• Efficient Failure Pattern Identification of Predictive Algorithms [15.02620042972929]
  We propose a human-machine collaborative framework that consists of a team of human annotators and a sequential recommendation algorithm. The results empirically demonstrate the competitive performance of our framework on multiple datasets at various signal-to-noise ratios.
  arXiv  Detail & Related papers  (2023-06-01T14:54:42Z)
• Connective Reconstruction-based Novelty Detection [3.7706789983985303]
  Deep learning has enabled us to analyze real-world data which contain unexplained samples. GAN-based approaches have been widely used to address this problem due to their ability to perform distribution fitting. We propose a simple yet efficient reconstruction-based method that avoids adding complexities to compensate for the limitations of GAN models.
  arXiv  Detail & Related papers  (2022-10-25T11:09:39Z)
• Speaker Embedding-aware Neural Diarization: a Novel Framework for Overlapped Speech Diarization in the Meeting Scenario [51.5031673695118]
  We reformulate overlapped speech diarization as a single-label prediction problem. We propose the speaker embedding-aware neural diarization (SEND) system.
  arXiv  Detail & Related papers  (2022-03-18T06:40:39Z)
• Dual Adversarial Auto-Encoders for Clustering [152.84443014554745]
  We propose Dual Adversarial Auto-encoder (Dual-AAE) for unsupervised clustering. By performing variational inference on the objective function of Dual-AAE, we derive a new reconstruction loss which can be optimized by training a pair of Auto-encoders. Experiments on four benchmarks show that Dual-AAE achieves superior performance over state-of-the-art clustering methods.
  arXiv  Detail & Related papers  (2020-08-23T13:16:34Z)
• Open-Set Recognition with Gaussian Mixture Variational Autoencoders [91.3247063132127]
  In inference, open-set classification is to either classify a sample into a known class from training or reject it as an unknown class. We train our model to cooperatively learn reconstruction and perform class-based clustering in the latent space. Our model achieves more accurate and robust open-set classification results, with an average F1 improvement of 29.5%.
  arXiv  Detail & Related papers  (2020-06-03T01:15:19Z)
• Random Hyperboxes [9.061408029414455]
  We show a generalization error bound of the proposed classifier based on the strength of the individual hyperbox-based classifiers. The effectiveness of the proposed classifier is analyzed using a carefully selected illustrative example. We identify the existing issues related to the generalization error bounds of the real datasets and inform the potential research directions.
  arXiv  Detail & Related papers  (2020-06-01T03:42:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.