# Hardware Implementation of Probabilistic State Machine for Word Recognition

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 ISSN : (Online) ISSN : (Print) Hardware Implementation of Probabilistic State Machine for Word Recognition 1 Soorya Asokan, 2 Dr. K.A Narayanankutty 1,2 Amrita Vishwavidyapeetham,Coimbatore, India Abstract Probabilistic Finite State Machines (PFSM) are used in feature Extraction, training and testing which are the most important steps in any speech recognition system. An important PFSM is the Hidden Markov Model which is dealt in this paper. This paper proposes a hardware architecture for the forward-backward algorithm as well as the Viterbi Algorithm used in speech recognition based on Hidden Markov models. The feature extraction and the training process is done using Hidden Markov Model (HTK) tool kit. The testing of the utterance of a new word is done using the hardware proposed in the paper. Finally the results obtained from the HTK tool kit and the hardware is compared. Keywords HMM (Hidden Markov Model), HTK (Hidden Markov Model Toolkit) I. Introduction Markov models can model random processes that can be in discrete states as a function of time. Suppose a system has different states, it can change from one state to another and the probability of transition depends only on the state of the system at time t[1]. Let s[t]denotes the state of the system at time t, and initial state is selected according to a probability. =P( S[1]= i); i=1,2,,s. The probability of transition depends only on the current state. This property is called the Markov property. P(s(t+1)) = j s[t]=i Here the observation sequences are discrete in nature, but in the case of speech recognition the observations are continuous vectors. [1-2]. An Hidden Markov Model (HMM ) can be represented by three probability measures namely 1. -The initial probability matrix; 1 i N ; N is the number of states. P(q 1 = S i ] ; 1 i N 2. aij -State transition probability distribution a ij =P(q t+1 = S j q t =S i ); 1 i, j N. 3. B The observation probability distribution B=b j (O) =P(O t at t q t = S j ) ; 1 j N;1 T O; So an HMM model can be represented as λ=(a,b,п). Problem: 3 This is about how the parameters are adjusted to maximize the probability of observation sequence called the Learning problem. B. Solutions for the Basic Problems 1. Evaluation Problem The evaluation problem can be solved by the forward backward procedure. (i). Forward Procedure Consider the forward variable αt(i) defined as α t (i) =P(O 1, O 2,, O t, Q t = S i λ) i.e the probability of the partial observation sequence and a particular state at time t, given the model λ [1-2]. Various steps involved are: 1. Initialization α t (i) =П i b i (O 1 ) 1 i N 2. Induction 3. Termination P (O λ) = A hardware architecture for the above algorithm is proposed in fig. 1. Here a discrete hidden Markov model is considered. The number of states is taken as 2. A. The Basic problems for HMMs The three problems are: Problem: 1 Given an observation sequence O = O 1,O 2,,O T and a model λ=(a,b,п) how can we compute the probability of observation sequence for a given model. This problem is called the Evaluation problem. Problem: 2 Given an observation sequence and the model how do we choose a corresponding state sequence q=q 1, q 2,,q T which best explains the observations. This is called the Decoding problem. 38 International Journal of Electronics & Communication Technology

2 ISSN : (Online) ISSN : (Print) IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 Fig. 1: Forward Procedure International Journal of Electronics & Communication Technology 39

3 IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 ISSN : (Online) ISSN : (Print) Fig. 2: Backward Procedure 40 International Journal of Electronics & Communication Technology

4 ISSN : (Online) ISSN : (Print) (ii). Backward Procedure Consider a backward variable βt(i) β t (i) =P(O t+1,o t+2,,o t q t =S i,λ) This variable again gives the probability of the partial observation sequence from t+1 to the end,given state S i at time t and the model λ[1-2]. Various steps are: (a). Initialization IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 maximized using an iterative procedure known as the Baum-Welch estimation method. Here an initial estimate of the parameters is taken, then by the iterative procedure a better estimate is obtained such that the new model maximizes the probability of observation sequence. II. Speech Recognition The basic blocks in a speech recognition system involves the following: (b). Induction Speech Signal SPEECH ANALYSIS FEATURE EXTRACTION TRAINING FEATURE VECTORS This is similar to the forward procedure. Here the observation sequences are accounted from time t+1 to time t considering all the possible states. Both the forward and the backward procedure gives the same probability. The architecture for the backward procedure is shown in fig. 2. In this paper the forward and the backward hardware architectures are implemented for a system with two states and two sets of observation symbols.this has been implemented and found out that both forward as well as the backward probabilities are the same. 2. Decoding Problem The solution for the decoding problem can be obtained by the Viterbi Algorithm. Here a single best state sequence, for the given observation sequence can be obtained. The procedure is as follows: (i). Initialization (ii). Recursion (iii). Termination REFERENCE MODELS Fig. 3: Basic Processes in Speech Recognition TESTING RECOGNITION RESULTS Speech waveform is taken as the input and the feature vectors are extracted by the feature extraction process. Feature extraction process involves the following [3]: Framing Speech signal is divided into number of frames and the number of frames depends on the length of the speech signal. Windowing After the framing is done a Hamming window is applied to each frame. This windowing effect reduces the signal discontinuity at the ends of each block. Hamming window can be defined as W(k) = Cos(2пk)/K-1. Mel-Cepstrum Method The method used to extract information from each frame is the Mel-Cepstrum Method. The Mel-Cepstrum consists of two methods Mel-scaling and Cepstrum calculation. Mel Spectrum Coefficients With Filterbank The human perception of the frequency content in a speech signal is not linear so there is a need for a mapping scale. The commonly used scale is the Mel scale. This scale is warping a measured frequency of a pitch to a corresponding pitch measured on the Mel scale. The warping from frequency in Hz to frequency in Mel scale is described by the equation (iv). Path Backtracking The Viterbi algorithm is similar to the forward-backward procedure except for the maximization step. 3. Learning Problem The third problem is to determine a method to adjust the model parameters (A,B, ) to maximize the probability of observation sequence for a given model. A model is chosen such that the probability of an observation sequence for a given model is locally The practical warping is done using a triangular Mel scale filterbank which handles the warping from Frequency in Hz to frequency in mel scale. Mel-Cepstrum Coefficients, DCT Discrete Cosine Transform To derive the Mel Cepstrum coefficients the inverse discrete cosine transform will be calculated. Finally from each frame 39 dimensional coefficients are obtained. International Journal of Electronics & Communication Technology 41

5 IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 ISSN : (Online) ISSN : (Print) A. HMM in isolated word recognition An HMM model is represented by three probability measures namely λ = (A,B, п). In case of speech recognition theory initial probability is considered as п= [1 0 0 N]; N is the number of states. Initially a transition probability matrix is assumed, after the training process a reestimated transition matrix is obtained. The continuous observation probability distribution matrix represents the probability that the state has produced the observed mel frequency cepstrum coefficients. The Gaussian distribution is the commonly used one. The continuous observation probability density function matrix, B can be represented by the mean, μ and variance, Σ.[5]. In this paper a 32-mixture Gaussian distribution is used. Here each state is modeled by a 32 mixture Gaussian distribution [1-3]. The continuous probability distribution can be represented by 1. Initialization for t=1, 1 j N 2. Recursion ;for 2 t T ; 1 j N 3. Termination ; for t=t Here N is the number of states, T is the number of frames for the feature vectors. A Hardware architecture for the Viterbi algorithm is proposed and is shown in the fig. 4.The initial probabilities, observation probabilities and the transition probabilities are stored in 3 different memories and then used for further computation. For the utterances considered here the number of frames taken is 298,number of states taken is 10. M is the number of mixture weights, coefficient. is the weight The observation probabilities can be computed by the following equations: Initially a global mean and variance is calculated for all the states. Then by the training process a better estimate of the mean and variance is obtained which is then used for the subsequent iterative processes [1-2]. A better estimate of mean and variance are obtained by using the following equations: Fig. 4: Viterbi Algorithm B. Implementation Details and Results 1. Speech Database The training and testing of a speech recognition system needs collection of speech utterances. Here the language used is English and the utterances were obtained from the TIMIT database. It consists of about 3000 training files which are speaker independent. The sampling frequency used is 16kHz. After the training process a re-estimated transition matrix is also obtained. So finally the probability measures corresponding to a word model is obtained. In word recognition a model is obtained for each word, the recognizer computes and compares the output for each word model The probability of an observation for a given word model is obtained by the viterbi algorithm [3]. Here log viterbi algorithm is used as it avoids underflow. The log viterbi algorithm is as follows: 42 International Journal of Electronics & Communication Technology 2. Front End Processing Front end features consist of 39 dimensional MFCC coefficients which are extracted using the HTK. 3. Training and Testing Here each word is modeled by a 10 state left to right models with a 32-mixture Gaussian output probability density function for each state. Baum-Welche training is used to estimate the HMM parameters.the trained model was tested for various utterances using HTK. The system was found to have an accuracy of 92%. After training the log probability of each utterance is obtained

6 ISSN : (Online) ISSN : (Print) by using Viterbi algorithm in HTK tool kit. These obtained probabilities are compared with those obtained by the hardware architecture of Viterbi algorithm. These probabilities are again compared with software results. The hardware architecture for the forward as well as the backward procedure is also proposed. The result obtained from the hardware is compared with the software. The accuracy is found to be 100%. In case of isolated word recognition the feature extraction process as well as the training process is done in HTK toolkit. A hardware architecture for the Viterbi algorithm is also proposed. The hardware result is compared with the results obtained from the HTK tool kit. The architecture has been synthesized in Altera Quartus-II. Altera Cyclone II 2C20 FPGA-EP2C20F484C7 device in the Altera DE-1 board is used to test the hardware. IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 HMM-Based Speech Recognition and VLSI Implementation in Complete System, IEEE Transactions on circuits and systems, Vol. 53, No. 1, January 2006 Table:1 Comparison of HTK and Hardware for finding the word probability UTTERANCES HTK (Log Probability) HARDWARE (Log Probability) III. Conclusion This work has used Mel-Frequency Cepstrum Coefficient method for feature extraction process, training has been done using the Baum-Welche algorithm, and testing has been done using the Viterbi algorithm. The feature extraction as well as the training has been done using the HTK tool kit. Then the hardware architecture for the Viterbi algorithm is implemented in hardware and is compared against the HTK results. IV. Acknowledgement I express my sincere gratitude to my guide Prof Dr. K.A.Narayanankutty, Professor, Amrita School of Engineering, for his valuable help, timely guidance and supervision throughout my project work. I greatly acknowledge Mr. Govind D Menon, Assistant Professor, CEN Department, Amrita School of Engineering for his constant encouragement and suggestions. References [1] L.R.Rabiner, B.H.Juang, An Introduction to Hidden Markov Models, IEEE ASSP Magazine January [2] L.R.Rabiner, A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition, Proceedings of the IEEE, Vol 77, No. 2, February [3] E- Hocine Bourouba, Mouldi Bedda, Rafik Djemili, Isolated Words Recognition System Based on Hybrid Approach DTW/GHMM, Informatica 30, 2006, pp [4] S J Melnikoff, S F Quigley, M J Russell, Implementing a Simple Continuous Speech Recognition System on an FPGA, Proceedings of the 10 th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 02) 2002 IEEE. [5] Shingo Yoshizawa, Naoya Wada, Noboru Hayasaka, Yoshikazu Miyanaga, Scalable Architecture for Word International Journal of Electronics & Communication Technology 43

### Ericsson T18s Voice Dialing Simulator

Ericsson T18s Voice Dialing Simulator Mauricio Aracena Kovacevic, Anna Dehlbom, Jakob Ekeberg, Guillaume Gariazzo, Eric Lästh and Vanessa Troncoso Dept. of Signals Sensors and Systems Royal Institute of

### School Class Monitoring System Based on Audio Signal Processing

C. R. Rashmi 1,,C.P.Shantala 2 andt.r.yashavanth 3 1 Department of CSE, PG Student, CIT, Gubbi, Tumkur, Karnataka, India. 2 Department of CSE, Vice Principal & HOD, CIT, Gubbi, Tumkur, Karnataka, India.

### Speech Recognition on Cell Broadband Engine UCRL-PRES-223890

Speech Recognition on Cell Broadband Engine UCRL-PRES-223890 Yang Liu, Holger Jones, John Johnson, Sheila Vaidya (Lawrence Livermore National Laboratory) Michael Perrone, Borivoj Tydlitat, Ashwini Nanda

### Advanced Signal Processing and Digital Noise Reduction

Advanced Signal Processing and Digital Noise Reduction Saeed V. Vaseghi Queen's University of Belfast UK WILEY HTEUBNER A Partnership between John Wiley & Sons and B. G. Teubner Publishers Chichester New

### Speech: A Challenge to Digital Signal Processing Technology for Human-to-Computer Interaction

: A Challenge to Digital Signal Processing Technology for Human-to-Computer Interaction Urmila Shrawankar Dept. of Information Technology Govt. Polytechnic, Nagpur Institute Sadar, Nagpur 440001 (INDIA)

### Myanmar Continuous Speech Recognition System Based on DTW and HMM

Myanmar Continuous Speech Recognition System Based on DTW and HMM Ingyin Khaing Department of Information and Technology University of Technology (Yatanarpon Cyber City),near Pyin Oo Lwin, Myanmar Abstract-

### AUTOMATIC PHONEME SEGMENTATION WITH RELAXED TEXTUAL CONSTRAINTS

AUTOMATIC PHONEME SEGMENTATION WITH RELAXED TEXTUAL CONSTRAINTS PIERRE LANCHANTIN, ANDREW C. MORRIS, XAVIER RODET, CHRISTOPHE VEAUX Very high quality text-to-speech synthesis can be achieved by unit selection

### Hidden Markov Models for biological systems

Hidden Markov Models for biological systems 1 1 1 1 0 2 2 2 2 N N KN N b o 1 o 2 o 3 o T SS 2005 Heermann - Universität Heidelberg Seite 1 We would like to identify stretches of sequences that are actually

### Artificial Neural Network for Speech Recognition

Artificial Neural Network for Speech Recognition Austin Marshall March 3, 2005 2nd Annual Student Research Showcase Overview Presenting an Artificial Neural Network to recognize and classify speech Spoken

### Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. HMM tutorial 4. by Dr Philip Jackson

Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. HMM tutorial 4 by Dr Philip Jackson Discrete & continuous HMMs - Gaussian & other distributions Gaussian mixtures -

### A Supervised Approach To Musical Chord Recognition

Pranav Rajpurkar Brad Girardeau Takatoki Migimatsu Stanford University, Stanford, CA 94305 USA pranavsr@stanford.edu bgirarde@stanford.edu takatoki@stanford.edu Abstract In this paper, we present a prototype

### Emotion Detection from Speech

Emotion Detection from Speech 1. Introduction Although emotion detection from speech is a relatively new field of research, it has many potential applications. In human-computer or human-human interaction

### Data driven design of filter bank for speech recognition

Data driven design of filter bank for speech recognition Lukáš Burget 12 and Hynek Heřmanský 23 1 Oregon Graduate Institute, Anthropic Signal Processing Group, 2 NW Walker Rd., Beaverton, Oregon 976-8921,

### Video Affective Content Recognition Based on Genetic Algorithm Combined HMM

Video Affective Content Recognition Based on Genetic Algorithm Combined HMM Kai Sun and Junqing Yu Computer College of Science & Technology, Huazhong University of Science & Technology, Wuhan 430074, China

### Establishing the Uniqueness of the Human Voice for Security Applications

Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 7th, 2004 Establishing the Uniqueness of the Human Voice for Security Applications Naresh P. Trilok, Sung-Hyuk Cha, and Charles C.

### Speech Analysis for Automatic Speech Recognition

Speech Analysis for Automatic Speech Recognition Noelia Alcaraz Meseguer Master of Science in Electronics Submission date: July 2009 Supervisor: Torbjørn Svendsen, IET Norwegian University of Science and

### L9: Cepstral analysis

L9: Cepstral analysis The cepstrum Homomorphic filtering The cepstrum and voicing/pitch detection Linear prediction cepstral coefficients Mel frequency cepstral coefficients This lecture is based on [Taylor,

### Introduction to Algorithmic Trading Strategies Lecture 2

Introduction to Algorithmic Trading Strategies Lecture 2 Hidden Markov Trading Model Haksun Li haksun.li@numericalmethod.com www.numericalmethod.com Outline Carry trade Momentum Valuation CAPM Markov chain

### Comp 14112 Fundamentals of Artificial Intelligence Lecture notes, 2015-16 Speech recognition

Comp 14112 Fundamentals of Artificial Intelligence Lecture notes, 2015-16 Speech recognition Tim Morris School of Computer Science, University of Manchester 1 Introduction to speech recognition 1.1 The

### SPEAKER IDENTIFICATION FROM YOUTUBE OBTAINED DATA

SPEAKER IDENTIFICATION FROM YOUTUBE OBTAINED DATA Nitesh Kumar Chaudhary 1 and Shraddha Srivastav 2 1 Department of Electronics & Communication Engineering, LNMIIT, Jaipur, India 2 Bharti School Of Telecommunication,

### Available from Deakin Research Online:

This is the authors final peered reviewed (post print) version of the item published as: Adibi,S 2014, A low overhead scaled equalized harmonic-based voice authentication system, Telematics and informatics,

### Automatic Evaluation Software for Contact Centre Agents voice Handling Performance

International Journal of Scientific and Research Publications, Volume 5, Issue 1, January 2015 1 Automatic Evaluation Software for Contact Centre Agents voice Handling Performance K.K.A. Nipuni N. Perera,

### An introduction to Hidden Markov Models

An introduction to Hidden Markov Models Christian Kohlschein Abstract Hidden Markov Models (HMM) are commonly defined as stochastic finite state machines. Formally a HMM can be described as a 5-tuple Ω

### BLIND SOURCE SEPARATION OF SPEECH AND BACKGROUND MUSIC FOR IMPROVED SPEECH RECOGNITION

BLIND SOURCE SEPARATION OF SPEECH AND BACKGROUND MUSIC FOR IMPROVED SPEECH RECOGNITION P. Vanroose Katholieke Universiteit Leuven, div. ESAT/PSI Kasteelpark Arenberg 10, B 3001 Heverlee, Belgium Peter.Vanroose@esat.kuleuven.ac.be

### COMPARATIVE STUDY OF RECOGNITION TOOLS AS BACK-ENDS FOR BANGLA PHONEME RECOGNITION

ITERATIOAL JOURAL OF RESEARCH I COMPUTER APPLICATIOS AD ROBOTICS ISS 2320-7345 COMPARATIVE STUDY OF RECOGITIO TOOLS AS BACK-EDS FOR BAGLA PHOEME RECOGITIO Kazi Kamal Hossain 1, Md. Jahangir Hossain 2,

### Secure-Access System via Fixed and Mobile Telephone Networks using Voice Biometrics

Secure-Access System via Fixed and Mobile Telephone Networks using Voice Biometrics Anastasis Kounoudes 1, Anixi Antonakoudi 1, Vasilis Kekatos 2 1 The Philips College, Computing and Information Systems

### Solutions to Exam in Speech Signal Processing EN2300

Solutions to Exam in Speech Signal Processing EN23 Date: Thursday, Dec 2, 8: 3: Place: Allowed: Grades: Language: Solutions: Q34, Q36 Beta Math Handbook (or corresponding), calculator with empty memory.

### Cloud User Voice Authentication enabled with Single Sign-On framework using OpenID

Cloud User Voice Authentication enabled with Single Sign-On framework using OpenID R.Gokulavanan Assistant Professor, Department of Information Technology, Nandha Engineering College, Erode, Tamil Nadu,

### Automatic Transcription of Continuous Speech using Unsupervised and Incremental Training

INTERSPEECH-2004 1 Automatic Transcription of Continuous Speech using Unsupervised and Incremental Training G.L. Sarada, N. Hemalatha, T. Nagarajan, Hema A. Murthy Department of Computer Science and Engg.,

### Hidden Markov Models. Terminology and Basic Algorithms

Hidden Markov Models Terminology and Basic Algorithms Motivation We make predictions based on models of observed data (machine learning). A simple model is that observations are assumed to be independent

### Spot me if you can: Uncovering spoken phrases in encrypted VoIP conversations

Spot me if you can: Uncovering spoken phrases in encrypted VoIP conversations C. Wright, L. Ballard, S. Coull, F. Monrose, G. Masson Talk held by Goran Doychev Selected Topics in Information Security and

### Dimension Reduction. Wei-Ta Chu 2014/10/22. Multimedia Content Analysis, CSIE, CCU

1 Dimension Reduction Wei-Ta Chu 2014/10/22 2 1.1 Principal Component Analysis (PCA) Widely used in dimensionality reduction, lossy data compression, feature extraction, and data visualization Also known

### Membering T M : A Conference Call Service with Speaker-Independent Name Dialing on AIN

PAGE 30 Membering T M : A Conference Call Service with Speaker-Independent Name Dialing on AIN Sung-Joon Park, Kyung-Ae Jang, Jae-In Kim, Myoung-Wan Koo, Chu-Shik Jhon Service Development Laboratory, KT,

### VLSI Architecture for DCT Based On High Quality DA

International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-6, June 2014 VLSI Architecture for DCT Based On High Quality DA Urbi Sharma, Tarun Verma, Rita Jain

### Improvement of an Automatic Speech Recognition Toolkit

Improvement of an Automatic Speech Recognition Toolkit Christopher Edmonds, Shi Hu, David Mandle December 14, 2012 Abstract The Kaldi toolkit provides a library of modules designed to expedite the creation

### Hidden Markov Models in Bioinformatics with Application to Gene Finding in Human DNA Machine Learning Project

Hidden Markov Models in Bioinformatics with Application to Gene Finding in Human DNA 308-761 Machine Learning Project Kaleigh Smith January 17, 2002 The goal of this paper is to review the theory of Hidden

### Application of Hidden Markov Model in Credit Card Fraud Detection

Application of Hidden Markov Model in Credit Card Fraud Detection V. Bhusari 1, S. Patil 1 1 Department of Computer Technology, College of Engineering, Bharati Vidyapeeth, Pune, India, 400011 Email: vrunda1234@gmail.com

### Investigations on Error Minimizing Training Criteria for Discriminative Training in Automatic Speech Recognition

, Lisbon Investigations on Error Minimizing Training Criteria for Discriminative Training in Automatic Speech Recognition Wolfgang Macherey Lars Haferkamp Ralf Schlüter Hermann Ney Human Language Technology

### Cell Phone based Activity Detection using Markov Logic Network

Cell Phone based Activity Detection using Markov Logic Network Somdeb Sarkhel sxs104721@utdallas.edu 1 Introduction Mobile devices are becoming increasingly sophisticated and the latest generation of smart

### HMM : Viterbi algorithm - a toy example

MM : Viterbi algorithm - a toy example.5.3.4.2 et's consider the following simple MM. This model is composed of 2 states, (high C content) and (low C content). We can for example consider that state characterizes

### Data a systematic approach

Pattern Discovery on Australian Medical Claims Data a systematic approach Ah Chung Tsoi Senior Member, IEEE, Shu Zhang, Markus Hagenbuchner Member, IEEE Abstract The national health insurance system in

### Segmentation of Human Body Movement using Inertial Measurement Unit

203 IEEE International Conference on Systems, Man, and Cybernetics Segmentation of Human Body Movement using Inertial Measurement Unit Takashi AOKI, Gentiane VENTURE Department of Mechanical Systems Engineering

### KEYWORD SPOTTING USING HIDDEN MARKOV MODELS. by Şevket Duran B.S. in E.E., Boğaziçi University, 1997

KEYWORD SPOTTING USING HIDDEN MARKOV MODELS by Şevket Duran B.S. in E.E., Boğaziçi University, 1997 Submitted to the Institute for Graduate Studies in Science and Engineering in partial fulfillment of

### JPEG compression of monochrome 2D-barcode images using DCT coefficient distributions

Edith Cowan University Research Online ECU Publications Pre. JPEG compression of monochrome D-barcode images using DCT coefficient distributions Keng Teong Tan Hong Kong Baptist University Douglas Chai

### MUSICAL INSTRUMENT FAMILY CLASSIFICATION

MUSICAL INSTRUMENT FAMILY CLASSIFICATION Ricardo A. Garcia Media Lab, Massachusetts Institute of Technology 0 Ames Street Room E5-40, Cambridge, MA 039 USA PH: 67-53-0 FAX: 67-58-664 e-mail: rago @ media.

### Hidden Markov Models 1

Hidden Markov Models 1 Hidden Markov Models A Tutorial for the Course Computational Intelligence http://www.igi.tugraz.at/lehre/ci Barbara Resch (modified by Erhard and Car line Rank) Signal Processing

### Marathi Interactive Voice Response System (IVRS) using MFCC and DTW

Marathi Interactive Voice Response System (IVRS) using MFCC and DTW Manasi Ram Baheti Department of CSIT, Dr.B.A.M. University, Aurangabad, (M.S.), India Bharti W. Gawali Department of CSIT, Dr.B.A.M.University,

### Multi-factor Authentication in Banking Sector

Multi-factor Authentication in Banking Sector Tushar Bhivgade, Mithilesh Bhusari, Ajay Kuthe, Bhavna Jiddewar,Prof. Pooja Dubey Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering

### HMM Based Enhanced Security System for ATM Payment [AICTE RPS sanctioned grant project, Affiliated to University of Pune, SKNCOE, Pune]

HMM Based Enhanced Security System for ATM Payment [AICTE RPS sanctioned grant project, Affiliated to University of Pune, SKNCOE, Pune] Vivek V. Jog 1, Sonal S.Dhamak 3 Vikalpa B. Landge 5, Aaradhana A.

### Implementation of the 5/3 Lifting 2D Discrete Wavelet Transform

Implementation of the 5/3 Lifting 2D Discrete Wavelet Transform 1 Jinal Patel, 2 Ketki Pathak 1 Post Graduate Student, 2 Assistant Professor Electronics and Communication Engineering Department, Sarvajanik

### VLSI BASED COLOR INTERPOLATION ALGORITHM FOR REAL TIME IMAGE APPLICATIONS

VOL. 10, NO. 7, APRIL 2015 ISSN 1819-6608 VLSI BASED COLOR INTERPOLATION ALGORITHM FOR REAL TIME IMAGE APPLICATIONS Sudalai Utchimahali C. 1 and Rajakumar G. 2 1 M.E VLSI Design, Francis Xavier Engineering

### Gender Identification using MFCC for Telephone Applications A Comparative Study

Gender Identification using MFCC for Telephone Applications A Comparative Study Jamil Ahmad, Mustansar Fiaz, Soon-il Kwon, Maleerat Sodanil, Bay Vo, and * Sung Wook Baik Abstract Gender recognition is

### CS 2750 Machine Learning. Lecture 1. Machine Learning. http://www.cs.pitt.edu/~milos/courses/cs2750/ CS 2750 Machine Learning.

Lecture Machine Learning Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square, x5 http://www.cs.pitt.edu/~milos/courses/cs75/ Administration Instructor: Milos Hauskrecht milos@cs.pitt.edu 539 Sennott

### Automatic Detection of Laughter and Fillers in Spontaneous Mobile Phone Conversations

Automatic Detection of Laughter and Fillers in Spontaneous Mobile Phone Conversations Hugues Salamin, Anna Polychroniou and Alessandro Vinciarelli University of Glasgow - School of computing Science, G128QQ

### Chapter 4: Hidden Markov Models

Chapter 4: Hidden Markov Models 4.3 HMM raining Prof. Yechiam Yemini (YY) Computer Science Department Columbia University Overview Learning HMM parameters Supervise learning Unsupervised learning (Viterbi,

### Security in Voice Authentication

Security in Voice Authentication by Chenguang Yang A Dissertation Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE In partial fulfillment of the requirements for the Degree of Doctor of

### B. Raghavendhar Reddy #1, E. Mahender *2

Speech to Text Conversion using Android Platform B. Raghavendhar Reddy #1, E. Mahender *2 #1 Department of Electronics Communication and Engineering Aurora s Technological and Research Institute Parvathapur,

### CONATION: English Command Input/Output System for Computers

CONATION: English Command Input/Output System for Computers Kamlesh Sharma* and Dr. T. V. Prasad** * Research Scholar, ** Professor & Head Dept. of Comp. Sc. & Engg., Lingaya s University, Faridabad, India

### Speech Signal Processing: An Overview

Speech Signal Processing: An Overview S. R. M. Prasanna Department of Electronics and Electrical Engineering Indian Institute of Technology Guwahati December, 2012 Prasanna (EMST Lab, EEE, IITG) Speech

### Revision Sign off. Name Signature Date. Josh Alvord. Alex Grosso. Jose Marquez. Sneha Popley. Phillip Stromberg. Ford Wesner

Revision Sign-off By signing the following, the team member asserts that he/she has read all changes since the last revision and has, to the best of his/her knowledge, found the information contained herein

### THE goal of Speaker Diarization is to segment audio

1 The ICSI RT-09 Speaker Diarization System Gerald Friedland* Member IEEE, Adam Janin, David Imseng Student Member IEEE, Xavier Anguera Member IEEE, Luke Gottlieb, Marijn Huijbregts, Mary Tai Knox, Oriol

### Separation and Classification of Harmonic Sounds for Singing Voice Detection

Separation and Classification of Harmonic Sounds for Singing Voice Detection Martín Rocamora and Alvaro Pardo Institute of Electrical Engineering - School of Engineering Universidad de la República, Uruguay

### Developing an Isolated Word Recognition System in MATLAB

MATLAB Digest Developing an Isolated Word Recognition System in MATLAB By Daryl Ning Speech-recognition technology is embedded in voice-activated routing systems at customer call centres, voice dialling

### Machine Learning I Week 14: Sequence Learning Introduction

Machine Learning I Week 14: Sequence Learning Introduction Alex Graves Technische Universität München 29. January 2009 Literature Pattern Recognition and Machine Learning Chapter 13: Sequential Data Christopher

### MFCC-Based Voice Recognition System for Home Automation Using Dynamic Programming

International Journal of Science and Research (IJSR) MFCC-Based Voice Recognition System for Home Automation Using Dynamic Programming Sandeep Joshi1, Sneha Nagar2 1 PG Student, Embedded Systems, Oriental

### Java Modules for Time Series Analysis

Java Modules for Time Series Analysis Agenda Clustering Non-normal distributions Multifactor modeling Implied ratings Time series prediction 1. Clustering + Cluster 1 Synthetic Clustering + Time series

### HIGH LEVEL SYNTHESIS OF A 2D-DWT SYSTEM ARCHITECTURE FOR JPEG 2000 USING FPGAs

HIGH LEVEL SYNTHESIS OF A 2D-DWT SYSTEM ARCHITECTURE FOR JPEG 2000 USING FPGAs V. Srinivasa Rao 1, Dr P.Rajesh Kumar 2, Dr Rajesh Kumar. Pullakura 3 1 ECE Dept. Shri Vishnu Engineering College for Women,

### From Concept to Production in Secure Voice Communications

From Concept to Production in Secure Voice Communications Earl E. Swartzlander, Jr. Electrical and Computer Engineering Department University of Texas at Austin Austin, TX 78712 Abstract In the 1970s secure

### Coding and decoding with convolutional codes. The Viterbi Algor

Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition

### Computation of Forward and Inverse MDCT Using Clenshaw s Recurrence Formula

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 5, MAY 2003 1439 Computation of Forward Inverse MDCT Using Clenshaw s Recurrence Formula Vladimir Nikolajevic, Student Member, IEEE, Gerhard Fettweis,

### Probability and Random Variables. Generation of random variables (r.v.)

Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly

### EFFECTS OF TRANSCRIPTION ERRORS ON SUPERVISED LEARNING IN SPEECH RECOGNITION

EFFECTS OF TRANSCRIPTION ERRORS ON SUPERVISED LEARNING IN SPEECH RECOGNITION By Ramasubramanian Sundaram A Thesis Submitted to the Faculty of Mississippi State University in Partial Fulfillment of the

### Weighting and Normalisation of Synchronous HMMs for Audio-Visual Speech Recognition

ISCA Archive http://www.isca-speech.org/archive Auditory-Visual Speech Processing 27 (AVSP27) Hilvarenbeek, The Netherlands August 31 - September 3, 27 Weighting and Normalisation of Synchronous HMMs for

### Adaptive Training for Large Vocabulary Continuous Speech Recognition

Adaptive Training for Large Vocabulary Continuous Speech Recognition Kai Yu Hughes Hall College and Cambridge University Engineering Department July 2006 Dissertation submitted to the University of Cambridge

### Training Ircam s Score Follower

Training Ircam s Follower Arshia Cont, Diemo Schwarz, Norbert Schnell To cite this version: Arshia Cont, Diemo Schwarz, Norbert Schnell. Training Ircam s Follower. IEEE International Conference on Acoustics,

### Design and Analysis of Parallel AES Encryption and Decryption Algorithm for Multi Processor Arrays

IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 5, Issue, Ver. III (Jan - Feb. 205), PP 0- e-issn: 239 4200, p-issn No. : 239 497 www.iosrjournals.org Design and Analysis of Parallel AES

### Automatic Detection of Emergency Vehicles for Hearing Impaired Drivers

Automatic Detection of Emergency Vehicles for Hearing Impaired Drivers Sung-won ark and Jose Trevino Texas A&M University-Kingsville, EE/CS Department, MSC 92, Kingsville, TX 78363 TEL (36) 593-2638, FAX

### METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS.

SEDM 24 June 16th - 18th, CPRI (Italy) METHODOLOGICL CONSIDERTIONS OF DRIVE SYSTEM SIMULTION, WHEN COUPLING FINITE ELEMENT MCHINE MODELS WITH THE CIRCUIT SIMULTOR MODELS OF CONVERTERS. Áron Szûcs BB Electrical

### Efficient on-line Signature Verification System

International Journal of Engineering & Technology IJET-IJENS Vol:10 No:04 42 Efficient on-line Signature Verification System Dr. S.A Daramola 1 and Prof. T.S Ibiyemi 2 1 Department of Electrical and Information

### Constructing Probabilistic Process Models based on Hidden Markov Models for Resource Allocation

Constructing Probabilistic Process Models based on Hidden Markov Models for Resource Allocation Berny Carrera and Jae-Yoon Jung Dept. of Industrial and Management Systems Engineering, Kyung Hee University

### Reconfigurable Low Area Complexity Filter Bank Architecture for Software Defined Radio

Reconfigurable Low Area Complexity Filter Bank Architecture for Software Defined Radio 1 Anuradha S. Deshmukh, 2 Prof. M. N. Thakare, 3 Prof.G.D.Korde 1 M.Tech (VLSI) III rd sem Student, 2 Assistant Professor(Selection

### Reinforcement Learning

Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Martin Lauer AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg martin.lauer@kit.edu

### EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set

EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set Amhmed A. Bhih School of Electrical and Electronic Engineering Princy Johnson School of Electrical and Electronic Engineering Martin

### Speech Recognition System of Arabic Alphabet Based on a Telephony Arabic Corpus

Speech Recognition System of Arabic Alphabet Based on a Telephony Arabic Corpus Yousef Ajami Alotaibi 1, Mansour Alghamdi 2, and Fahad Alotaiby 3 1 Computer Engineering Department, King Saud University,

### New Pulse Width Modulation Technique for Three Phase Induction Motor Drive Umesha K L, Sri Harsha J, Capt. L. Sanjeev Kumar

New Pulse Width Modulation Technique for Three Phase Induction Motor Drive Umesha K L, Sri Harsha J, Capt. L. Sanjeev Kumar Abstract In this paper, various types of speed control methods for the three

### THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS O.U. Sezerman 1, R. Islamaj 2, E. Alpaydin 2 1 Laborotory of Computational Biology, Sabancı University, Istanbul, Turkey. 2 Computer Engineering

### Information Retrieval Statistics of Text

Information Retrieval Statistics of Text James Allan University of Massachusetts, Amherst (NTU ST770-A) Fall 2002 All slides copyright Bruce Croft and/or James Allan Outline Zipf distribution Vocabulary

### IBM Research Report. CSR: Speaker Recognition from Compressed VoIP Packet Stream

RC23499 (W0501-090) January 19, 2005 Computer Science IBM Research Report CSR: Speaker Recognition from Compressed Packet Stream Charu Aggarwal, David Olshefski, Debanjan Saha, Zon-Yin Shae, Philip Yu

### FAST MIR IN A SPARSE TRANSFORM DOMAIN

ISMIR 28 Session 4c Automatic Music Analysis and Transcription FAST MIR IN A SPARSE TRANSFORM DOMAIN Emmanuel Ravelli Université Paris 6 ravelli@lam.jussieu.fr Gaël Richard TELECOM ParisTech gael.richard@enst.fr

### Hidden Markov Models

8.47 Introduction to omputational Molecular Biology Lecture 7: November 4, 2004 Scribe: Han-Pang hiu Lecturer: Ross Lippert Editor: Russ ox Hidden Markov Models The G island phenomenon The nucleotide frequencies

### Finding soon-to-fail disks in a haystack

Finding soon-to-fail disks in a haystack Moises Goldszmidt Microsoft Research Abstract This paper presents a detector of soon-to-fail disks based on a combination of statistical models. During operation

### Course: Model, Learning, and Inference: Lecture 5

Course: Model, Learning, and Inference: Lecture 5 Alan Yuille Department of Statistics, UCLA Los Angeles, CA 90095 yuille@stat.ucla.edu Abstract Probability distributions on structured representation.

### Speech recognition for human computer interaction

Speech recognition for human computer interaction Ubiquitous computing seminar FS2014 Student report Niklas Hofmann ETH Zurich hofmannn@student.ethz.ch ABSTRACT The widespread usage of small mobile devices

### Incremental Learning of Human Behaviors using Hierarchical Hidden Markov Models

Incremental Learning of Human Behaviors using Hierarchical Hidden Markov Models Dana Kulić and Yoshihiko Nakamura Abstract This paper proposes a novel approach for extracting a model of movement primitives

### THE problem of tracking multiple moving targets arises

728 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 16, NO. 4, MAY 2008 Binaural Tracking of Multiple Moving Sources Nicoleta Roman and DeLiang Wang, Fellow, IEEE Abstract This paper

### Probabilistic Credit Card Fraud Detection System in Online Transactions

Probabilistic Credit Card Fraud Detection System in Online Transactions S. O. Falaki 1, B. K. Alese 1, O. S. Adewale 1, J. O. Ayeni 2, G. A. Aderounmu 3 and W. O. Ismaila 4 * 1 Federal University of Technology,

### Accurate and robust image superresolution by neural processing of local image representations

Accurate and robust image superresolution by neural processing of local image representations Carlos Miravet 1,2 and Francisco B. Rodríguez 1 1 Grupo de Neurocomputación Biológica (GNB), Escuela Politécnica

### Bayesian networks - Time-series models - Apache Spark & Scala

Bayesian networks - Time-series models - Apache Spark & Scala Dr John Sandiford, CTO Bayes Server Data Science London Meetup - November 2014 1 Contents Introduction Bayesian networks Latent variables Anomaly

### Image Compression through DCT and Huffman Coding Technique

International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul

### Automated Model Based Testing for an Web Applications

Automated Model Based Testing for an Web Applications Agasarpa Mounica, Lokanadham Naidu Vadlamudi Abstract- As the development of web applications plays a major role in our day-to-day life. Modeling the