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_Svm_h) 00056 #define ALIZE_Svm_h 00057 00058 #include "alize.h" 00059 #include "libsvm.h" 00060 using namespace alize; 00061 using namespace std; 00062 00063 int svmTrain(alize:: Config &); 00064 int svmPredict(alize:: Config &); 00065 int svmPredictTnorm(alize:: Config &); 00066 00067 // 00068 // svm_model redeclaration as it is not in svm.h (bad) 00069 // 00070 struct svm_model 00071 { 00072 svm_parameter param; // parameter 00073 int nr_class; // number of classes, = 2 in regression/one class svm 00074 int l; // total #SV 00075 svm_node **SV; // SVs (SV[l]) 00076 double **sv_coef; // coefficients for SVs in decision functions (sv_coef[k-1][l]) 00077 double *rho; // constants in decision functions (rho[k*(k-1)/2]) 00078 double *probA; // pariwise probability information 00079 double *probB; 00080 00081 // for classification only 00082 00083 int *label; // label of each class (label[k]) 00084 int *nSV; // number of SVs for each class (nSV[k]) 00085 // nSV[0] + nSV[1] + ... + nSV[k-1] = l 00086 // XXX 00087 int free_sv; // 1 if svm_model is created by svm_load_model 00088 // 0 if svm_model is created by svm_train 00089 }; 00090 00091 class Instance { // to integrate, this is clean! 00092 private: 00093 Matrix <double> _ex; 00094 RealVector <unsigned long> _labels; 00095 XLine _id; 00096 public: 00097 Instance(unsigned long nbEx,unsigned long dimension) { 00098 _ex.setDimensions(nbEx,dimension);} 00099 double value(unsigned long i,unsigned long j) { 00100 return _ex(i,j);} 00101 unsigned long dimension() { 00102 return _ex.cols();} 00103 unsigned long nbEx() { 00104 return _ex.rows();} 00105 String& getId(unsigned long idx) { 00106 return _id.getElement(idx);} 00107 unsigned long getIdx(String & name) { 00108 for (unsigned long i=0;i<_id.getElementCount();i++) 00109 if (_id.getElement(i)==name) return i; 00110 else return -1; 00111 } 00112 void setId(String& name,unsigned long idx){ 00113 _id.getElement(idx)=name;} 00114 void setLabels(RealVector <unsigned long>& labels) { 00115 _labels=labels;} 00116 void setLabel(unsigned long t,unsigned long idx) { 00117 _labels[idx]=t;} 00118 unsigned long getLabel(unsigned long idx){ 00119 return _labels[idx];} 00120 unsigned long getLabel(String& name) { 00121 return this->getLabel(getIdx(name));} 00122 void setLabel(String & name,unsigned long t) { 00123 this->setLabel(t,getIdx(name));} 00124 }; 00125 00126 00127 #endif // !defined(Svm)
1.7.2