SPEAKERS IDENTIFICATION SYSTEM FOR CORE NETWORKS USING HADOOP CLUSTERS

PROJECT SUPERVISOR: DR.SHOAB A.KHAN GROUP MEMBERS: AMSAL NAEEM TAHREEM KHALID RAHEEL MUMTAZ DE 30 (CE) COLLEGE OF E&ME, NUST

OUTLINE
O Motivation & problem definition
O System level design O Algorithms O Implementation O Results

MOTIVATION
O Security
O Terrorism O Keep a check on important people O Political issues O Cricket

Terrorist Incidents

Match Fixing in Cricket

PROBLEM SOLUTION
Design a system that can O Process large number of calls at a time O Process large data sets O Identify the person an a particular call O Monitor the communication without interruption

SYSTEM LEVEL DESIGN

O Components
O GUI explanation

Recoding

Feature Extraction

Matching

Database

Graphical User Interface

Graphical User Interface

Design And Implementation

O Training
O Testing O Hadoop architecture O Hbase architecture O Speaker identification O Mfcc O Vector quantization O Matching (distance measurement)

IN 1 IN N

IN 2

HADOOP MASTER

MASTER
TaskTracker

SLAVE 1
TaskTracker

SLAVE 2
TaskTracker

SLAVE 3
TaskTracker

SLAVE 4
TaskTracker

MAP

MAP

MAP

MAP

MAP

SORT

SORT

SORT

SORT

SORT

MERGE

REDUCE

OUTPUT

TRAINING
O The voice samples are

recorded in Matlab
O MFCC Features are

extracted from the voice input.

O Vector Quantization

using K-Means is done to reduce feature vectors.

O Insert above feature

vectors to HBase table.

TESTING
O Input recorded O MFCC Features are O O

O
O O

extracted Features input to HADOOP Cluster. Distributed inputs to all machines MapReduce tasks on each TaskTracker. Euclidean distance is measured The output consists of the most likely matched speaker.

HADOOP ARCHITECTURE

MAPREDUCE WORKING

HBASE ARCHITECTURE

Speak er 1
Unknown Speaker

Speak er 2

Speak er N

FEATURE EXTRACTION

FEATURE EXTRACTION

MATCHING SPEAKER MODELLING SPEAKER IDENTIFIED DATABASE

Mel Frequency Cepstral Coefficients

Voice Signal
Samplin g
Framing & Windowin g

Log

MelFrequenc y Warping

Discrete Fourier Transfor m

Inverse DFT

Mel Cepstru m

MFCC
O Hamming Window

where 0 n N-1 N=length of frame

O Discrete Fourier Transform

MFCC
O Mel-Frequency warping

O Inverse Discrete Fourier Transform

VECTOR QUANTIZATION

K-Means Clustering
Select K objects randomly from M data objects to take as initial clustering centers Assign all data object to its nearest cluster center

Update each center by averaging all of the points that have been assigned to it

Have centroids changed? NO Stop

YES

MATCHING
Euclidean Distance

RESULTS
O Graphs
O Comparisons

COMPARISON

COMPARISON

COMPARISON

RESULTS

CONCLUSION
O Summary of project
O Summary of results O Future extension