Optimization of data-driven filterbank for automatic speaker verification

• URL: http://arxiv.org/abs/2007.10729v1
• Date: Tue, 21 Jul 2020 11:42:20 GMT
• Title: Optimization of data-driven filterbank for automatic speaker verification
• Authors: Susanta Sarangi, Md Sahidullah, Goutam Saha
• Abstract summary: We propose a new data-driven filter design method which optimize filter parameters from a given speech data. The main advantage of the proposed method is that it requires very limited amount of unlabeled speech-data. We show that the acoustic features created with proposed filterbank are better than existing mel-frequency cepstral coefficients (MFCCs) and speech-signal-based frequency cepstral coefficients (SFCCs) in most cases.
• Score: 8.175789701289512
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Most of the speech processing applications use triangular filters spaced in mel-scale for feature extraction. In this paper, we propose a new data-driven filter design method which optimizes filter parameters from a given speech data. First, we introduce a frame-selection based approach for developing speech-signal-based frequency warping scale. Then, we propose a new method for computing the filter frequency responses by using principal component analysis (PCA). The main advantage of the proposed method over the recently introduced deep learning based methods is that it requires very limited amount of unlabeled speech-data. We demonstrate that the proposed filterbank has more speaker discriminative power than commonly used mel filterbank as well as existing data-driven filterbank. We conduct automatic speaker verification (ASV) experiments with different corpora using various classifier back-ends. We show that the acoustic features created with proposed filterbank are better than existing mel-frequency cepstral coefficients (MFCCs) and speech-signal-based frequency cepstral coefficients (SFCCs) in most cases. In the experiments with VoxCeleb1 and popular i-vector back-end, we observe 9.75% relative improvement in equal error rate (EER) over MFCCs. Similarly, the relative improvement is 4.43% with recently introduced x-vector system. We obtain further improvement using fusion of the proposed method with standard MFCC-based approach.

Related papers

• Frequency-aware Graph Signal Processing for Collaborative Filtering [26.317108637430664]
  We propose a frequency-aware graph signal processing method (FaGSP) for collaborative filtering. Firstly, we design a Cascaded Filter Module, consisting of an ideal high-pass filter and an ideal low-pass filter. Then, we devise a Parallel Filter Module, consisting of two low-pass filters that can easily capture the hierarchy of neighborhood.
  arXiv  Detail & Related papers  (2024-02-13T12:53:18Z)
• Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler [103.97487121678276]
  Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs. We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
  arXiv  Detail & Related papers  (2023-07-01T02:28:41Z)
• Multiplierless In-filter Computing for tinyML Platforms [6.878219199575747]
  We present a novel multiplierless framework for in-filter acoustic classification. We use MP-based approximation for training, including backpropagation mitigating approximation errors. The framework is more efficient than traditional classification frameworks with just less than 1K slices.
  arXiv  Detail & Related papers  (2023-04-24T04:33:44Z)
• Filter Pruning based on Information Capacity and Independence [11.411996979581295]
  This paper introduces a new filter pruning method that selects filters in an interpretable, multi-perspective, and lightweight manner. For the amount of information contained in each filter, a new metric called information capacity is proposed. For correlations among filters, another metric called information independence is designed.
  arXiv  Detail & Related papers  (2023-03-07T04:26:44Z)
• Sparse Regularized Correlation Filter for UAV Object Tracking with adaptive Contextual Learning and Keyfilter Selection [20.786475337107472]
  correlation filter has been widely applied in unmanned aerial vehicle (UAV) tracking. It is fragile because of two inherent defects, i.e. boundary effect and filter corruption. We propose a novel $ell_1$ regularization correlation filter with adaptive contextual learning and keyfilter selection.
  arXiv  Detail & Related papers  (2022-05-07T10:25:56Z)
• FAMLP: A Frequency-Aware MLP-Like Architecture For Domain Generalization [73.41395947275473]
  We propose a novel frequency-aware architecture, in which the domain-specific features are filtered out in the transformed frequency domain. Experiments on three benchmarks demonstrate significant performance, outperforming the state-of-the-art methods by a margin of 3%, 4% and 9%, respectively.
  arXiv  Detail & Related papers  (2022-03-24T07:26:29Z)
• Filter-enhanced MLP is All You Need for Sequential Recommendation [89.0974365344997]
  In online platforms, logged user behavior data is inevitable to contain noise. We borrow the idea of filtering algorithms from signal processing that attenuates the noise in the frequency domain. We propose textbfFMLP-Rec, an all-MLP model with learnable filters for sequential recommendation task.
  arXiv  Detail & Related papers  (2022-02-28T05:49:35Z)
• Direct design of biquad filter cascades with deep learning by sampling random polynomials [5.1118282767275005]
  In this work, we learn a direct mapping from the target magnitude response to the filter coefficient space with a neural network trained on millions of random filters. We demonstrate our approach enables both fast and accurate estimation of filter coefficients given a desired response. We compare our method against existing methods including modified Yule-Walker and gradient descent and show IIRNet is, on average, both faster and more accurate.
  arXiv  Detail & Related papers  (2021-10-07T17:58:08Z)
• Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering [59.349057602266]
  Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering. We propose to decompose the inner-product-based softmax probability based on the inverted multi-index. FastVAE can outperform the state-of-the-art baselines in terms of both sampling quality and efficiency.
  arXiv  Detail & Related papers  (2021-09-13T08:31:59Z)
• Innovative And Additive Outlier Robust Kalman Filtering With A Robust Particle Filter [68.8204255655161]
  We propose CE-BASS, a particle mixture Kalman filter which is robust to both innovative and additive outliers, and able to fully capture multi-modality in the distribution of the hidden state. Furthermore, the particle sampling approach re-samples past states, which enables CE-BASS to handle innovative outliers which are not immediately visible in the observations, such as trend changes.
  arXiv  Detail & Related papers  (2020-07-07T07:11:09Z)
• iffDetector: Inference-aware Feature Filtering for Object Detection [70.8678270164057]
  We introduce a generic Inference-aware Feature Filtering (IFF) module that can easily be combined with modern detectors. IFF performs closed-loop optimization by leveraging high-level semantics to enhance the convolutional features. IFF can be fused with CNN-based object detectors in a plug-and-play manner with negligible computational cost overhead.
  arXiv  Detail & Related papers  (2020-06-23T02:57:29Z)

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.