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

08/26/2019
by   Sunwoo Kim, et al.
0

We propose an iteration-free source separation algorithm based on Winner-Take-All (WTA) hash codes, which is a faster, yet accurate alternative to a complex machine learning model for single-channel source separation in a resource-constrained environment. We first generate random permutations with WTA hashing to encode the shape of the multidimensional audio spectrum to a reduced bitstring representation. A nearest neighbor search on the hash codes of an incoming noisy spectrum as the query string results in the closest matches among the hashed mixture spectra. Using the indices of the matching frames, we obtain the corresponding ideal binary mask vectors for denoising. Since both the training data and the search operation are bitwise, the procedure can be done efficiently in hardware implementations. Experimental results show that the WTA hash codes are discriminant and provide an affordable dictionary search mechanism that leads to a competent performance compared to a comprehensive model and oracle masking.

READ FULL TEXT
research
02/14/2020

Boosted Locality Sensitive Hashing: Discriminative Binary Codes for Source Separation

Speech enhancement tasks have seen significant improvements with the adv...
research
08/22/2017

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 ...
research
07/11/2013

Fast Exact Search in Hamming Space with Multi-Index Hashing

There is growing interest in representing image data and feature descrip...
research
04/18/2019

Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search

Hash based nearest neighbor search has become attractive in many applica...
research
02/04/2016

An ensemble diversity approach to supervised binary hashing

Binary hashing is a well-known approach for fast approximate nearest-nei...
research
06/18/2012

Compact Hyperplane Hashing with Bilinear Functions

Hyperplane hashing aims at rapidly searching nearest points to a hyperpl...
research
07/10/2019

Polytopes, lattices, and spherical codes for the nearest neighbor problem

We study locality-sensitive hash methods for the nearest neighbor proble...

Please sign up or login with your details

Forgot password? Click here to reset