Boosted Locality Sensitive Hashing: Discriminative Binary Codes for Source Separation

by   Sunwoo Kim, et al.

Speech enhancement tasks have seen significant improvements with the advance of deep learning technology, but with the cost of increased computational complexity. In this study, we propose an adaptive boosting approach to learning locality sensitive hash codes, which represent audio spectra efficiently. We use the learned hash codes for single-channel speech denoising tasks as an alternative to a complex machine learning model, particularly to address the resource-constrained environments. Our adaptive boosting algorithm learns simple logistic regressors as the weak learners. Once trained, their binary classification results transform each spectrum of test noisy speech into a bit string. Simple bitwise operations calculate Hamming distance to find the K-nearest matching frames in the dictionary of training noisy speech spectra, whose associated ideal binary masks are averaged to estimate the denoising mask for that test mixture. Our proposed learning algorithm differs from AdaBoost in the sense that the projections are trained to minimize the distances between the self-similarity matrix of the hash codes and that of the original spectra, rather than the misclassification rate. We evaluate our discriminative hash codes on the TIMIT corpus with various noise types, and show comparative performance to deep learning methods in terms of denoising performance and complexity.


Nearest Neighbor Search-Based Bitwise Source Separation Using Discriminant Winner-Take-All Hashing

We propose an iteration-free source separation algorithm based on Winner...

Bitwise Source Separation on Hashed Spectra: An Efficient Posterior Estimation Scheme Using Partial Rank Order Metrics

This paper proposes an efficient bitwise solution to the single-channel ...

Sparse Mixture of Local Experts for Efficient Speech Enhancement

In this paper, we investigate a deep learning approach for speech denois...

Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering

When reasoning about tasks that involve large amounts of data, a common ...

Bio-Inspired Hashing for Unsupervised Similarity Search

The fruit fly Drosophila's olfactory circuit has inspired a new locality...

Learning Binary Codes and Binary Weights for Efficient Classification

This paper proposes a generic formulation that significantly expedites t...

Learning Hash Codes via Hamming Distance Targets

We present a powerful new loss function and training scheme for learning...

Please sign up or login with your details

Forgot password? Click here to reset