00001 /* 00002 This file is part of LIA_RAL which is a set of software based on ALIZE 00003 toolkit for speaker recognition. ALIZE toolkit is required to use LIA_RAL. 00004 00005 LIA_RAL project is a development project was initiated by the computer 00006 science laboratory of Avignon / France (Laboratoire Informatique d'Avignon - 00007 LIA) [http://lia.univ-avignon.fr <http://lia.univ-avignon.fr/>]. Then it 00008 was supported by two national projects of the French Research Ministry: 00009 - TECHNOLANGUE program [http://www.technolangue.net] 00010 - MISTRAL program [http://mistral.univ-avignon.fr] 00011 00012 LIA_RAL is free software: you can redistribute it and/or modify 00013 it under the terms of the GNU Lesser General Public License as 00014 published by the Free Software Foundation, either version 3 of 00015 the License, or any later version. 00016 00017 LIA_RAL is distributed in the hope that it will be useful, 00018 but WITHOUT ANY WARRANTY; without even the implied warranty of 00019 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00020 GNU Lesser General Public License for more details. 00021 00022 You should have received a copy of the GNU Lesser General Public 00023 License along with LIA_RAL. 00024 If not, see [http://www.gnu.org/licenses/]. 00025 00026 The LIA team as well as the LIA_RAL project team wants to highlight the 00027 limits of voice authentication in a forensic context. 00028 The "Person Authentification by Voice: A Need of Caution" paper 00029 proposes a good overview of this point (cf. "Person 00030 Authentification by Voice: A Need of Caution", Bonastre J.F., 00031 Bimbot F., Boe L.J., Campbell J.P., Douglas D.A., Magrin- 00032 chagnolleau I., Eurospeech 2003, Genova]. 00033 The conclusion of the paper of the paper is proposed bellow: 00034 [Currently, it is not possible to completely determine whether the 00035 similarity between two recordings is due to the speaker or to other 00036 factors, especially when: (a) the speaker does not cooperate, (b) there 00037 is no control over recording equipment, (c) recording conditions are not 00038 known, (d) one does not know whether the voice was disguised and, to a 00039 lesser extent, (e) the linguistic content of the message is not 00040 controlled. Caution and judgment must be exercised when applying speaker 00041 recognition techniques, whether human or automatic, to account for these 00042 uncontrolled factors. Under more constrained or calibrated situations, 00043 or as an aid for investigative purposes, judicious application of these 00044 techniques may be suitable, provided they are not considered as infallible. 00045 At the present time, there is no scientific process that enables one to 00046 uniquely characterize a persones voice or to identify with absolute 00047 certainty an individual from his or her voice.] 00048 00049 Copyright (C) 2004-2010 00050 Laboratoire d'informatique d'Avignon [http://lia.univ-avignon.fr] 00051 LIA_RAL admin [alize@univ-avignon.fr] 00052 Jean-Francois Bonastre [jean-francois.bonastre@univ-avignon.fr] 00053 */ 00054 00055 #if !defined(ALIZE_BNgram_h) 00056 #define ALIZE_BNgram_h 00057 00058 #include <iostream> 00059 #include <fstream> // pour outFile 00060 #include <cstdio> // pour printf() 00061 #include <cassert> // pour le debug pratique 00062 #include <cmath> 00063 #include <liatools.h> 00064 00065 // NGRAM FUNCTIONS 00066 struct BNgramNode{ 00067 short int idx; // First symb of the node 00068 unsigned long *count; // Count array for the symbs of the node 00069 BNgramNode**child; // child array for the next level 00070 BNgramNode *brother; // link for the next node of this level 00071 }; 00072 class BNgram{ 00073 // unsigned long _nb; 00074 unsigned long _totalCount; 00075 short int _maxLength; 00076 unsigned long *_circArray; 00077 unsigned long _readIdx; 00078 short int _nbElt; 00079 BNgramNode *_seed; 00080 void _freeTree(BNgramNode*); 00081 BNgramNode*_new(); 00082 void _add(short int,bool,short int); 00083 BNgramNode *_newNode(short int,BNgramNode*); 00084 BNgramNode *_findInsert(BNgramNode*,short int); 00085 void _show(BNgramNode*,String,ostream &); 00086 public: 00087 BNgram(unsigned long,unsigned long); 00088 ~BNgram(); 00089 void beginSeq(short int,short int=1 ); 00090 void addSymb(short int,short int=1 ); 00091 void endSeq(short int=1); 00092 void show(ostream &); 00093 }; 00094 00095 void testBNgram(Config &config); 00096 #endif
1.7.2