Speaker Linking and Applications using Non-Parametric Hashing Methods

Abstract

Large unstructured audio data sets have become ubiquitous and present a challenge for organization and search. One logical approach for structuring data is to find common speakers and link occurrences across different recordings. Prior approaches to this problem have focused on basic methodology for the linking task. In this paper, we introduce a novel trainable nonparametric hashing method for indexing large speaker recording data sets. This approach leads to tunable computational complexity methods for speaker linking. We focus on a scalable clustering method based on hashingcanopy-clustering. We apply this method to a large corpus of speaker recordings, demonstrate performance tradeoffs, and compare to other hashing methods.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 08, 2016
Accession Number
AD1033823

Entities

People

  • Douglas E. Sturim
  • William M. Campbell

Organizations

  • MIT Lincoln Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Base Lines
  • Clustering
  • Computations
  • Data Sets
  • Hash Tables
  • Index Terms
  • Indexes
  • Intervals
  • Pattern Recognition
  • Probability
  • Random Walk
  • Recognition
  • Standards
  • Training
  • United States Government

Fields of Study

  • Computer science

Readers

  • Distributed Systems and Data Platform Development
  • Neural Network Machine Learning.
  • Speech Processing/Speech Recognition.