Team:Valencia Biocampus/talking
From 2012.igem.org
Line 172: | Line 172: | ||
is most likely to have generated Y , i.e. the decoder tries to find.<br><br> | is most likely to have generated Y , i.e. the decoder tries to find.<br><br> | ||
- | + | w' = argmax{P(w|Y)} for all the words w considered<br><br> | |
operating this (Bayes rule) the likelihood p(Y|w) is determined by the | operating this (Bayes rule) the likelihood p(Y|w) is determined by the |
Revision as of 20:37, 25 September 2012
- The basic life cycle of our biological agent is based on an input/output process through the use of interfaces.
- The input used is a voice signal (question), which will be collected by our voice recognizer.
- The voice recognizer identifies the question and, through the program in charge of establishing the communication, its corresponding identifier is written in the assigned port of the arduino.
- The software of the arduino reads the written identifier and, according to it, the corresponding port is selected, indicating the flourimeter which wavelength has to be emitted on the culture. There are four possible questions (q), and each of them is associated to a different wavelength.
- The fluorimeter emits light (Bioinput), exciting the compound through optic filters.
- Due to the excitation produced, the compound emits fluorescence (BioOutput), which is measured by the fluorimeter with a sensor.
- This fluorescence corresponds to one of the four possible answers (r: response).
- The program of the arduino identifies the answer and writes its identifier in the corresponding port.
- The communication program reads the identifier of the answer from the port.
- "Espeak" emits the answer via a voice signal (Output).
- Voice recognizer
- Arduino
- Fluorimeter
- Acoustic Analysis
Acoustic models take the acoustic properties of the input signal. They acquire a group of vectors of certain characteristics that will later be compared with a group of patterns that represent symbols of a phonetic alphabet and return the symbols which resembles them the most. This is the basis of the mathematical probabilistic process called Hidden Markov Model. The acoustic analysis is based on the extraction of a vector similar to the input acoustic signal with the purpose of applying the theory of pattern recognition. This vector is a parametric representation of the acoustic signal, containing the most relevant information and storing as compressed as possible. In order to obtain a good group of vectors, the signal is pre-processed, reducing background noise and correlation.
- HMM, Hidden Markov Model
Hidden Markov Models (HMMs) provide a simple and effective framework for modelling time-varying spectral vector sequences. As a consequence, almost all present day large vocabulary continuous speech recognition systems are based on HMMs.
The core of all speech recognition systems consists of a set of statistical models representing the various sounds of the language to be recognised. Since speech has temporal structure and can be encoded as a sequence of spectral vectors spanning the audio frequency range, the hidden Markov model (HMM) provides a natural framework for constructing such models.
Basically, the input audio waveform from a microphone is converted into a sequence of fixed size acoustic vectors Y[1:T] = y1, . . . ,yT in a process called feature extraction. The decoder then attempts to find the sequence of words w'[1:L] = w1,...,wL which is most likely to have generated Y , i.e. the decoder tries to find.
w' = argmax{P(w|Y)} for all the words w considered
operating this (Bayes rule) the likelihood p(Y|w) is determined by the acoustic model and the prior P(w) is determined by the language model.
Talking Interfaces
THE PROCESS
The main objective of our project is to accomplish a verbal communication with our microorganisms. To do that, we need to establish the following process:
In this section we analyse in detail the main element used in the process:
VOICE RECOGNIZER
Julius is a continuous speech real-time recongizer engine. It is based on Markov's interpretation of hidden models. It's opensource and distributed with a BSD licence. Its main platfomorm is Linux and other Unix systems, but it also works in Windows. It has been developed as a part of a free software kit for research in large-vocabulary continuous speech recognition (LVCSR) from 1977, and the Kyoto University of Japan has continued the work from 1999 to 2003.
In order to use Julius, it is necessary to create a language model and an acoustic model. Julius adopts the acoustic models and the pronunctiation dictionaries from the HTK software, which is not opensource, but can be used and downloaded for its use and posterior generation of acoustic models.
ACOUSTIC MODEL
An acoustic model is a file which contains an statistical representation of each of the different sounds that form a word (phoneme). Julius allows voice recognition through continuous dictation or by using a previously introduced grammar. However, the use of continuous dictation carries a problem. It requires an acoustic model trained with lots of voice files. As the amount of sound files containing voices and different texts increases, the ratio of good hits of the acoustic model will improve. This implies several variations: the pronunciation of the person training the model, the dialect used, etc. Nowadays, Julius doesn't count with any model good enough for continuous dictation in English.
Due to the different problems presented by this kind of recognition, we chose the second option. We designed a grammar using the Voxforce acoustic model based in Markov's Hidden Models.
To do this, we need the following file:
-file .dict:a list of all the words that we want our culture to recognize and its corresponding decomposition into phonemes.
LANGUAGE MODEL
Language model refers to the grammar on which the recognizer will work and specify the phrases that it will be able to identify.
In Julius, recognition grammar is composed by two separate files:
- .voca: List of words that the grammar contains.
- .grammar: specifies the grammar of the language to be recognised.
Both files must be converted to .dfa and to .dict using the grammar compilator "mkdfa.pl" The .dfa file generated represents a finite automat. The .dict archive contains the dictionary of words in Julius format.
Once the acoustic language and the language model have been defined, all we need is the implementation of the main program in Python.
Arduino
Fluorimeter
A fluorometer is an electronic device that can read the light and transform it in an electrical signal. In our project, that light proceeds from a bacterial culture that has been excited.
Its principle of operation is as follows:
First, an electrical signal is sent from Arduino to an LED to activate it. This LED has a determinate wavelength to excite the fluorescent protein present in the microbial culture.
When these bacteria are shining, we receive that light intensity with a photodiode, and transform it into electrical current. Now, we have an electrical current that is proportional with the light and therefor to the concentration of fluorescent protein present in the culture. We have to be careful with the orientation between the LED and the photodiode because interferences may occur in the measurement due to light received by photodiode but not emitted by the fluorescence in the culture but scattered light emitted by the LED. Also, a proper band-pass filter has been placed between culture and photodiode to allow only the desired wavelengths to pass through.
The electric current coming from the photodiode has a very small amplitude, thereby we have to amplify it and translate it into a electric voltage with an electronic trans-impedance amplifier. We can choose the gain of this amplification changing the value of resistances of the circuit. The resistances must be properly chosen to select the desired amplification gain. Excessive amplification will not only amplify the signal but also amplify the noise, which is no desired in the measurement.
Finally, the output voltage is sent to Arduino, and it will translate that in a digital signal.