/usr/share/doc/pocketsphinx/html/ms__gauden_8c_source.html is in pocketsphinx-doc 0.8.0+real5prealpha-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>PocketSphinx: src/libpocketsphinx/ms_gauden.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">PocketSphinx
 <span id="projectnumber">5prealpha</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('ms__gauden_8c_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">ms_gauden.c</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">/* ====================================================================</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * reserved.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Redistribution and use in source and binary forms, with or without</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * modification, are permitted provided that the following conditions</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * are met:</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * notice, this list of conditions and the following disclaimer. </span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> *</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * notice, this list of conditions and the following disclaimer in</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * the documentation and/or other materials provided with the</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * distribution.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> *</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> *</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> *</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * ====================================================================</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> *</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> */</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">/*</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * gauden.c -- gaussian density module.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> *</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> ***********************************************</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * CMU ARPA Speech Project</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> *</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * Copyright (c) 1996 Carnegie Mellon University.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * ALL RIGHTS RESERVED.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> ***********************************************</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> *</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * HISTORY</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * $Log$</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * Revision 1.7 2006/02/22 17:09:55 arthchan2003</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * Merged from SPHINX3_5_2_RCI_IRII_BRANCH: 1, Followed Dave's change, keep active to be uint8 instead int8 in gauden_dist_norm.\n 2, Introdued gauden_dump and gauden_dump_ind. This allows debugging of ms_gauden routine. \n 3, Introduced gauden_free, this fixed some minor memory leaks. \n 4, gauden_init accept an argument precompute to specify whether the distance is pre-computed or not.\n 5, Added license. \n 6, Fixed dox-doc.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * </span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> *</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Revision 1.5.4.7 2006/01/16 19:45:59 arthchan2003</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * Change the gaussian density dumping routine to a function.</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> *</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * Revision 1.5.4.6 2005/10/09 19:51:05 arthchan2003</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * Followed Dave's changed in the trunk.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> *</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * Revision 1.5.4.5 2005/09/25 18:54:20 arthchan2003</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * Added a flag to turn on and off precomputation.</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> *</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * Revision 1.6 2005/10/05 00:31:14 dhdfu</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * Make int8 be explicitly signed (signedness of 'char' is</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * architecture-dependent). Then make a bunch of things use uint8 where</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * signedness is unimportant, because on the architecture where 'char' is</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * unsigned, it is that way for a reason (signed chars are slower).</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> *</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * Revision 1.5.4.4 2005/09/07 23:29:07 arthchan2003</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * Added FIXME warning.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> *</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * Revision 1.5.4.3 2005/09/07 23:25:10 arthchan2003</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * 1, Behavior changes of cont_mgau, instead of remove Gaussian with zero variance vector before flooring, now remove Gaussian with zero mean and variance before flooring. Notice that this is not yet synchronize with ms_mgau. 2, Added warning message in multi-stream gaussian distribution.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> *</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * Revision 1.5.4.2 2005/08/03 18:53:44 dhdfu</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * Add memory deallocation functions. Also move all the initialization</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * of ms_mgau_model_t into ms_mgau_init (duh!), which entails removing it</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * from decode_anytopo and friends.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> *</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * Revision 1.5.4.1 2005/07/20 19:39:01 arthchan2003</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * Added licences in ms_* series of code.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * Revision 1.5 2005/06/21 18:55:09 arthchan2003</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * 1, Add comments to describe this modules, 2, Fixed doxygen documentation. 3, Added $ keyword.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> *</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * Revision 1.3 2005/03/30 01:22:47 archan</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * Fixed mistakes in last updates. Add</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> *</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * </span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * 20-Dec-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * Changed gauden_param_read to use the new libio/bio_fread functions.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * </span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * 26-Sep-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * Added gauden_mean_reload() for application of MLLR; and correspondingly</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * made gauden_param_read allocate memory for parameter only if not</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * already allocated.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * </span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * 09-Sep-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * Interleaved two density computations for speed improvement.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * </span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * 19-Aug-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * Added compute_dist_all special case for improving speed.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> * </span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> * 26-Jan-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> * Added check for underflow and floor insertion in gauden_dist.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> * </span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> * 20-Jan-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> * Added active argument to gauden_dist_norm and gauden_dist_norm_global,</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * and made the latter a static function.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * </span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * 07-Nov-95 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * Initial version created.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * Very liberally borrowed/adapted from Eric's S3 trainer implementation.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> */</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">/* System headers. */</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor">#include <assert.h></span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor">#include <math.h></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor">#include <float.h></span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">/* SphinxBase headers. */</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor">#include <sphinxbase/bio.h></span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#include <sphinxbase/err.h></span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">/* Local headesr. */</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor">#include "<a class="code" href="ms__gauden_8h.html">ms_gauden.h</a>"</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor">#define GAUDEN_PARAM_VERSION "1.0"</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor">#ifndef M_PI</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#define M_PI 3.1415926535897932385e0</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#define WORST_DIST (int32)(0x80000000)</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="ms__gauden_8h.html#a8efb2c45fd5ac2b34bbff067a15fe6f5"> 138</a></span> <a class="code" href="ms__gauden_8h.html#a8efb2c45fd5ac2b34bbff067a15fe6f5">gauden_dump</a>(<span class="keyword">const</span> <a class="code" href="structgauden__t.html">gauden_t</a> * g)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  int32 c;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (c = 0; c < g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>; c++)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="ms__gauden_8h.html#a9489d75ad3dbdc2bb413b43a17f48188">gauden_dump_ind</a>(g, c);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="ms__gauden_8h.html#a9489d75ad3dbdc2bb413b43a17f48188"> 148</a></span> <a class="code" href="ms__gauden_8h.html#a9489d75ad3dbdc2bb413b43a17f48188">gauden_dump_ind</a>(<span class="keyword">const</span> <a class="code" href="structgauden__t.html">gauden_t</a> * g, <span class="keywordtype">int</span> senidx)</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  int32 f, d, i;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (f = 0; f < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; f++) {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  E_INFO(<span class="stringliteral">"Codebook %d, Feature %d (%dx%d):\n"</span>,</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  senidx, f, g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>, g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (d = 0; d < g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>; d++) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  printf(<span class="stringliteral">"m[%3d]"</span>, d);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (i = 0; i < g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]; i++)</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  printf(<span class="stringliteral">" %7.4f"</span>, MFCC2FLOAT(g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[senidx][f][d][i]));</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  printf(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  printf(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (d = 0; d < g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>; d++) {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  printf(<span class="stringliteral">"v[%3d]"</span>, d);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (i = 0; i < g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]; i++)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  printf(<span class="stringliteral">" %d"</span>, (<span class="keywordtype">int</span>)g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[senidx][f][d][i]);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  printf(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  printf(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">for</span> (d = 0; d < g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>; d++)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  printf(<span class="stringliteral">"d[%3d] %d\n"</span>, d, (<span class="keywordtype">int</span>)g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>[senidx][f][d]);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  fflush(stderr);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> gauden_param_read(float32 ***** out_param, <span class="comment">/* Alloc space iff *out_param == NULL */</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  int32 * out_n_mgau,</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  int32 * out_n_feat,</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  int32 * out_n_density,</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  int32 ** out_veclen, <span class="keyword">const</span> <span class="keywordtype">char</span> *file_name)</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordtype">char</span> tmp;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  FILE *fp;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  int32 i, j, k, l, n, blk;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  int32 n_mgau;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  int32 n_feat;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  int32 n_density;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  int32 *veclen;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  int32 byteswap, chksum_present;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  float32 ****out;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  float32 *buf;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">char</span> **argname, **argval;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  uint32 chksum;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  E_INFO(<span class="stringliteral">"Reading mixture gaussian parameter: %s\n"</span>, file_name);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> ((fp = fopen(file_name, <span class="stringliteral">"rb"</span>)) == NULL)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  E_FATAL_SYSTEM(<span class="stringliteral">"Failed to open file '%s' for reading"</span>, file_name);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">/* Read header, including argument-value info and 32-bit byteorder magic */</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">if</span> (bio_readhdr(fp, &argname, &argval, &byteswap) < 0)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  E_FATAL(<span class="stringliteral">"Failed to read header from file '%s'\n"</span>, file_name);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">/* Parse argument-value list */</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  chksum_present = 0;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (i = 0; argname[i]; i++) {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"version"</span>) == 0) {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (strcmp(argval[i], GAUDEN_PARAM_VERSION) != 0)</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  E_WARN(<span class="stringliteral">"Version mismatch(%s): %s, expecting %s\n"</span>,</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  file_name, argval[i], GAUDEN_PARAM_VERSION);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"chksum0"</span>) == 0) {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  chksum_present = 1; <span class="comment">/* Ignore the associated value */</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  bio_hdrarg_free(argname, argval);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  argname = argval = NULL;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  chksum = 0;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">/* #Codebooks */</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (bio_fread(&n_mgau, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  E_FATAL(<span class="stringliteral">"fread(%s) (#codebooks) failed\n"</span>, file_name);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  *out_n_mgau = n_mgau;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">/* #Features/codebook */</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (bio_fread(&n_feat, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  E_FATAL(<span class="stringliteral">"fread(%s) (#features) failed\n"</span>, file_name);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  *out_n_feat = n_feat;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">/* #Gaussian densities/feature in each codebook */</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> (bio_fread(&n_density, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  E_FATAL(<span class="stringliteral">"fread(%s) (#density/codebook) failed\n"</span>, file_name);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  *out_n_density = n_density;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">/* #Dimensions in each feature stream */</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  veclen = ckd_calloc(n_feat, <span class="keyword">sizeof</span>(uint32));</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  *out_veclen = veclen;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">if</span> (bio_fread(veclen, <span class="keyword">sizeof</span>(int32), n_feat, fp, byteswap, &chksum) !=</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  n_feat)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  E_FATAL(<span class="stringliteral">"fread(%s) (feature-lengths) failed\n"</span>, file_name);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">/* blk = total vector length of all feature streams */</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (i = 0, blk = 0; i < n_feat; i++)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  blk += veclen[i];</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">/* #Floats to follow; for the ENTIRE SET of CODEBOOKS */</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (bio_fread(&n, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  E_FATAL(<span class="stringliteral">"fread(%s) (total #floats) failed\n"</span>, file_name);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (n != n_mgau * n_density * blk) {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  E_FATAL</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  (<span class="stringliteral">"%s: #mfcc_ts(%d) doesn't match dimensions: %d x %d x %d\n"</span>,</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  file_name, n, n_mgau, n_density, blk);</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">/* Allocate memory for mixture gaussian densities if not already allocated */</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span> (!(*out_param)) {</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  out = (float32 ****) ckd_calloc_3d(n_mgau, n_feat, n_density,</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">sizeof</span>(float32 *));</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  buf = (float32 *) ckd_calloc(n, <span class="keyword">sizeof</span>(float32));</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">for</span> (i = 0, l = 0; i < n_mgau; i++) {</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (j = 0; j < n_feat; j++) {</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (k = 0; k < n_density; k++) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  out[i][j][k] = &buf[l];</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  l += veclen[j];</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  out = (float32 ****) *out_param;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  buf = out[0][0][0];</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">/* Read mixture gaussian densities data */</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (bio_fread(buf, <span class="keyword">sizeof</span>(float32), n, fp, byteswap, &chksum) != n)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  E_FATAL(<span class="stringliteral">"fread(%s) (densitydata) failed\n"</span>, file_name);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">if</span> (chksum_present)</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  bio_verify_chksum(fp, byteswap, chksum);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (fread(&tmp, 1, 1, fp) == 1)</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  E_FATAL(<span class="stringliteral">"More data than expected in %s\n"</span>, file_name);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  fclose(fp);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  *out_param = out;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  E_INFO(<span class="stringliteral">"%d codebook, %d feature, size: \n"</span>, n_mgau, n_feat);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">for</span> (i = 0; i < n_feat; i++)</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  E_INFO(<span class="stringliteral">" %dx%d\n"</span>, n_density, veclen[i]);</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> gauden_param_free(mfcc_t **** p)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  ckd_free(p[0][0][0]);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  ckd_free_3d(p);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> }</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment">/*</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"> * Some of the gaussian density computation can be carried out in advance:</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> * log(determinant) calculation,</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * 1/(2*var) in the exponent,</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * NOTE; The density computation is performed in log domain.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> */</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> gauden_dist_precompute(<a class="code" href="structgauden__t.html">gauden_t</a> * g, logmath_t *lmath, float32 varfloor)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  int32 i, m, f, d, flen;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  mfcc_t *meanp;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  mfcc_t *varp;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  mfcc_t *detp;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  int32 floored;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  floored = 0;</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">/* Allocate space for determinants */</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a> = ckd_calloc_3d(g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>, g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>, g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>, <span class="keyword">sizeof</span>(***g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>));</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">for</span> (m = 0; m < g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>; m++) {</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">for</span> (f = 0; f < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; f++) {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  flen = g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f];</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">/* Determinants for all variance vectors in g->[m][f] */</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">for</span> (d = 0, detp = g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>[m][f]; d < g->n_density; d++, detp++) {</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  *detp = 0;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (i = 0, varp = g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[m][f][d], meanp = g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[m][f][d];</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  i < flen; i++, varp++, meanp++) {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  float32 *fvarp = (float32 *)varp;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="preprocessor">#ifdef FIXED_POINT</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  float32 *fmp = (float32 *)meanp;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  *meanp = FLOAT2MFCC(*fmp);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (*fvarp < varfloor) {</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  *fvarp = varfloor;</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  ++floored;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  *detp += (mfcc_t)logmath_log(lmath,</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  1.0 / sqrt(*fvarp * 2.0 * M_PI));</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">/* Precompute this part of the exponential */</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  *varp = (mfcc_t)logmath_ln_to_log(lmath,</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  (1.0 / (*fvarp * 2.0)));</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  E_INFO(<span class="stringliteral">"%d variance values floored\n"</span>, floored);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <a class="code" href="structgauden__t.html">gauden_t</a> *</div><div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="ms__gauden_8h.html#ae4587b0aeb39fd926622a422969ecebc"> 361</a></span> <a class="code" href="ms__gauden_8h.html#ae4587b0aeb39fd926622a422969ecebc">gauden_init</a>(<span class="keywordtype">char</span> <span class="keyword">const</span> *meanfile, <span class="keywordtype">char</span> <span class="keyword">const</span> *varfile, float32 varfloor, logmath_t *lmath)</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  int32 i, m, f, d, *flen;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  float32 ****fgau;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="structgauden__t.html">gauden_t</a> *g;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  assert(meanfile != NULL);</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  assert(varfile != NULL);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  assert(varfloor > 0.0);</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  g = (<a class="code" href="structgauden__t.html">gauden_t</a> *) ckd_calloc(1, <span class="keyword">sizeof</span>(<a class="code" href="structgauden__t.html">gauden_t</a>));</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  g-><a class="code" href="structgauden__t.html#ae05c9b82d8a586bea347681ebe04bb83">lmath</a> = lmath;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">/* Read means and (diagonal) variances for all mixture gaussians */</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  fgau = NULL;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  gauden_param_read(&fgau, &g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>, &g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>, &g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>,</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  &g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>, meanfile);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a> = (mfcc_t ****)fgau;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  fgau = NULL;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  gauden_param_read(&fgau, &m, &f, &d, &flen, varfile);</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a> = (mfcc_t ****)fgau;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">/* Verify mean and variance parameter dimensions */</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> ((m != g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>) || (f != g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>) || (d != g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>))</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  E_FATAL</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  (<span class="stringliteral">"Mixture-gaussians dimensions for means and variances differ\n"</span>);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">for</span> (i = 0; i < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; i++)</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[i] != flen[i])</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  E_FATAL(<span class="stringliteral">"Feature lengths for means and variances differ\n"</span>);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  ckd_free(flen);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">/* Floor variances and precompute variance determinants */</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  gauden_dist_precompute(g, lmath, varfloor);</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">return</span> g;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> }</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00399"></a><span class="lineno"><a class="line" href="ms__gauden_8h.html#a0306e088fa33894ca40182d2392ffe4d"> 399</a></span> <a class="code" href="ms__gauden_8h.html#a0306e088fa33894ca40182d2392ffe4d">gauden_free</a>(<a class="code" href="structgauden__t.html">gauden_t</a> * g)</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> {</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">if</span> (g == NULL)</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>)</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  gauden_param_free(g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>);</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>)</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  gauden_param_free(g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  ckd_free_3d(g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>);</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>)</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  ckd_free(g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>);</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  ckd_free(g);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment">/* See compute_dist below */</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> compute_dist_all(<a class="code" href="structgauden__dist__t.html">gauden_dist_t</a> * out_dist, mfcc_t* obs, int32 featlen,</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  mfcc_t ** mean, mfcc_t ** var, mfcc_t * det,</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  int32 n_density)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> {</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  int32 i, d;</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">for</span> (d = 0; d < n_density; ++d) {</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  mfcc_t *m;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  mfcc_t *v;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  mfcc_t dval;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  m = mean[d];</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  v = var[d];</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  dval = det[d];</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">for</span> (i = 0; i < featlen; i++) {</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  mfcc_t diff;</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="preprocessor">#ifdef FIXED_POINT</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">/* Have to check for underflows here. */</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  mfcc_t pdval = dval;</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  diff = obs[i] - m[i];</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  dval -= MFCCMUL(MFCCMUL(diff, diff), v[i]);</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (dval > pdval) {</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  dval = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a">WORST_SCORE</a>;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  diff = obs[i] - m[i];</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">/* The compiler really likes this to be a single</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> * expression, for whatever reason. */</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  dval -= diff * diff * v[i];</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  out_dist[d].<a class="code" href="structgauden__dist__t.html#ab08100d4953998dad76bfcf30864c0c5">dist</a> = dval;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  out_dist[d].<a class="code" href="structgauden__dist__t.html#a93e978149bae5b5bf089769458c42ee4">id</a> = d;</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  }</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> }</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment">/*</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> * Compute the top-N closest gaussians from the chosen set (mgau,feat)</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> * for the given input observation vector.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> */</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> compute_dist(<a class="code" href="structgauden__dist__t.html">gauden_dist_t</a> * out_dist, int32 n_top,</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  mfcc_t * obs, int32 featlen,</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  mfcc_t ** mean, mfcc_t ** var, mfcc_t * det,</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  int32 n_density)</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> {</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  int32 i, j, d;</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="structgauden__dist__t.html">gauden_dist_t</a> *worst;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">/* Special case optimization when n_density <= n_top */</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (n_top >= n_density)</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">return</span> (compute_dist_all</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  (out_dist, obs, featlen, mean, var, det, n_density));</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">for</span> (i = 0; i < n_top; i++)</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  out_dist[i].dist = WORST_DIST;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  worst = &(out_dist[n_top - 1]);</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">for</span> (d = 0; d < n_density; d++) {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  mfcc_t *m;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  mfcc_t *v;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  mfcc_t dval;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  m = mean[d];</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  v = var[d];</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  dval = det[d];</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">for</span> (i = 0; (i < featlen) && (dval >= worst-><a class="code" href="structgauden__dist__t.html#ab08100d4953998dad76bfcf30864c0c5">dist</a>); i++) {</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  mfcc_t diff;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="preprocessor">#ifdef FIXED_POINT</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="comment">/* Have to check for underflows here. */</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  mfcc_t pdval = dval;</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  diff = obs[i] - m[i];</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  dval -= MFCCMUL(MFCCMUL(diff, diff), v[i]);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (dval > pdval) {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  dval = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a">WORST_SCORE</a>;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  diff = obs[i] - m[i];</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">/* The compiler really likes this to be a single</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> * expression, for whatever reason. */</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  dval -= diff * diff * v[i];</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">if</span> ((i < featlen) || (dval < worst->dist)) <span class="comment">/* Codeword d worse than worst */</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">/* Codeword d at least as good as worst so far; insert in the ordered list */</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">for</span> (i = 0; (i < n_top) && (dval < out_dist[i].dist); i++);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  assert(i < n_top);</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">for</span> (j = n_top - 1; j > i; --j)</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  out_dist[j] = out_dist[j - 1];</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  out_dist[i].<a class="code" href="structgauden__dist__t.html#ab08100d4953998dad76bfcf30864c0c5">dist</a> = dval;</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  out_dist[i].<a class="code" href="structgauden__dist__t.html#a93e978149bae5b5bf089769458c42ee4">id</a> = d;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> }</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment">/*</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> * Compute distances of the input observation from the top N codewords in the given</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> * codebook (g->{mean,var}[mgau]). The input observation, obs, includes vectors for</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> * all features in the codebook.</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> */</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> int32</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <a class="code" href="ms__gauden_8h.html#a68cd25af0a2faf05eacd17afd5407ea4">gauden_dist</a>(<a class="code" href="structgauden__t.html">gauden_t</a> * g,</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">int</span> mgau, int32 n_top, mfcc_t** obs, <a class="code" href="structgauden__dist__t.html">gauden_dist_t</a> ** out_dist)</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> {</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  int32 f;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  assert((n_top > 0) && (n_top <= g->n_density));</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">for</span> (f = 0; f < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; f++) {</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  compute_dist(out_dist[f], n_top,</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  obs[f], g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f],</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[mgau][f], g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[mgau][f], g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>[mgau][f],</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>);</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  E_DEBUG(3, (<span class="stringliteral">"Top CW(%d,%d) = %d %d\n"</span>, mgau, f, out_dist[f][0].<span class="keywordtype">id</span>,</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  (<span class="keywordtype">int</span>)out_dist[f][0].dist >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a>));</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> int32</div><div class="line"><a name="l00550"></a><span class="lineno"><a class="line" href="ms__gauden_8h.html#ab640722f2c2b1e8bc6e883d9b5b72494"> 550</a></span> <a class="code" href="ms__gauden_8h.html#ab640722f2c2b1e8bc6e883d9b5b72494">gauden_mllr_transform</a>(<a class="code" href="structgauden__t.html">gauden_t</a> *g, <a class="code" href="structps__mllr__s.html">ps_mllr_t</a> *mllr, cmd_ln_t *config)</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> {</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  int32 i, m, f, d, *flen;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  float32 ****fgau;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> </div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">/* Free data if already here */</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>)</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  gauden_param_free(g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>);</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>)</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  gauden_param_free(g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>);</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>)</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  ckd_free_3d(g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>)</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  ckd_free(g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a> = NULL;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a> = NULL;</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a> = NULL;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a> = NULL;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> </div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">/* Reload means and variances (un-precomputed). */</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  fgau = NULL;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  gauden_param_read(&fgau, &g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>, &g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>, &g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>,</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  &g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>, cmd_ln_str_r(config, <span class="stringliteral">"-mean"</span>));</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a> = (mfcc_t ****)fgau;</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  fgau = NULL;</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  gauden_param_read(&fgau, &m, &f, &d, &flen, cmd_ln_str_r(config, <span class="stringliteral">"-var"</span>));</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a> = (mfcc_t ****)fgau;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">/* Verify mean and variance parameter dimensions */</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">if</span> ((m != g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>) || (f != g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>) || (d != g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>))</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  E_FATAL</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  (<span class="stringliteral">"Mixture-gaussians dimensions for means and variances differ\n"</span>);</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">for</span> (i = 0; i < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; i++)</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[i] != flen[i])</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  E_FATAL(<span class="stringliteral">"Feature lengths for means and variances differ\n"</span>);</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  ckd_free(flen);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">/* Transform codebook for each stream s */</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">for</span> (i = 0; i < g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a>; ++i) {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">for</span> (f = 0; f < g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>; ++f) {</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  float64 *temp;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  temp = (float64 *) ckd_calloc(g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f], <span class="keyword">sizeof</span>(float64));</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">/* Transform each density d in selected codebook */</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">for</span> (d = 0; d < g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>; d++) {</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordtype">int</span> l;</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">for</span> (l = 0; l < g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]; l++) {</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  temp[l] = 0.0;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">for</span> (m = 0; m < g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]; m++) {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">/* FIXME: For now, only one class, hence the zeros below. */</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  temp[l] += mllr-><a class="code" href="structps__mllr__s.html#a4cfa5d4c6637282b947b525a673cc3d0">A</a>[f][0][l][m] * g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[i][f][d][m];</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  temp[l] += mllr-><a class="code" href="structps__mllr__s.html#a65430ba654d0af5e508715de24077f2d">b</a>[f][0][l];</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">for</span> (l = 0; l < g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[f]; l++) {</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[i][f][d][l] = (float32) temp[l];</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[i][f][d][l] *= mllr-><a class="code" href="structps__mllr__s.html#ae92b910e17202389aca99ee5105085b0">h</a>[f][0][l];</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  }</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  ckd_free(temp);</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  }</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">/* Re-precompute (if we aren't adapting variances this isn't</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> * actually necessary...) */</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  gauden_dist_precompute(g, g-><a class="code" href="structgauden__t.html#ae05c9b82d8a586bea347681ebe04bb83">lmath</a>, cmd_ln_float32_r(config, <span class="stringliteral">"-varfloor"</span>));</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> }</div><div class="ttc" id="ms__gauden_8h_html_a8efb2c45fd5ac2b34bbff067a15fe6f5"><div class="ttname"><a href="ms__gauden_8h.html#a8efb2c45fd5ac2b34bbff067a15fe6f5">gauden_dump</a></div><div class="ttdeci">void gauden_dump(const gauden_t *g)</div><div class="ttdoc">Dump the definitionn of Gaussian distribution. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00138">ms_gauden.c:138</a></div></div>
<div class="ttc" id="structgauden__t_html_ae05c9b82d8a586bea347681ebe04bb83"><div class="ttname"><a href="structgauden__t.html#ae05c9b82d8a586bea347681ebe04bb83">gauden_t::lmath</a></div><div class="ttdeci">logmath_t * lmath</div><div class="ttdoc">log math computation </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00087">ms_gauden.h:87</a></div></div>
<div class="ttc" id="structgauden__t_html_ab5104d8fa59bc94b12b36104dd4c19ac"><div class="ttname"><a href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">gauden_t::n_density</a></div><div class="ttdeci">int32 n_density</div><div class="ttdoc">Number gaussian densities in each codebook-feature stream. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00090">ms_gauden.h:90</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_a0306e088fa33894ca40182d2392ffe4d"><div class="ttname"><a href="ms__gauden_8h.html#a0306e088fa33894ca40182d2392ffe4d">gauden_free</a></div><div class="ttdeci">void gauden_free(gauden_t *g)</div><div class="ttdoc">Release memory allocated by gauden_init. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00399">ms_gauden.c:399</a></div></div>
<div class="ttc" id="structgauden__dist__t_html_a93e978149bae5b5bf089769458c42ee4"><div class="ttname"><a href="structgauden__dist__t.html#a93e978149bae5b5bf089769458c42ee4">gauden_dist_t::id</a></div><div class="ttdeci">int32 id</div><div class="ttdoc">Index of codeword (gaussian density) </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00072">ms_gauden.h:72</a></div></div>
<div class="ttc" id="structgauden__t_html_a315918a44ff97b95a6fcdf8739d8089b"><div class="ttname"><a href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">gauden_t::det</a></div><div class="ttdeci">mfcc_t *** det</div><div class="ttdoc">log(determinant) for each variance vector; actually, log(sqrt(2*pi*det)) </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00085">ms_gauden.h:85</a></div></div>
<div class="ttc" id="structgauden__dist__t_html"><div class="ttname"><a href="structgauden__dist__t.html">gauden_dist_t</a></div><div class="ttdoc">Structure to store distance (density) values for a given input observation wrt density values in some...</div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00071">ms_gauden.h:71</a></div></div>
<div class="ttc" id="structps__mllr__s_html_ae92b910e17202389aca99ee5105085b0"><div class="ttname"><a href="structps__mllr__s.html#ae92b910e17202389aca99ee5105085b0">ps_mllr_s::h</a></div><div class="ttdeci">float32 *** h</div><div class="ttdoc">Diagonal transformation of variances. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00089">acmod.h:89</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_ab640722f2c2b1e8bc6e883d9b5b72494"><div class="ttname"><a href="ms__gauden_8h.html#ab640722f2c2b1e8bc6e883d9b5b72494">gauden_mllr_transform</a></div><div class="ttdeci">int32 gauden_mllr_transform(gauden_t *s, ps_mllr_t *mllr, cmd_ln_t *config)</div><div class="ttdoc">Transform Gaussians according to an MLLR matrix (or, eventually, more). </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00550">ms_gauden.c:550</a></div></div>
<div class="ttc" id="structps__mllr__s_html_a65430ba654d0af5e508715de24077f2d"><div class="ttname"><a href="structps__mllr__s.html#a65430ba654d0af5e508715de24077f2d">ps_mllr_s::b</a></div><div class="ttdeci">float32 *** b</div><div class="ttdoc">Bias part of mean transformations. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00088">acmod.h:88</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_ae4587b0aeb39fd926622a422969ecebc"><div class="ttname"><a href="ms__gauden_8h.html#ae4587b0aeb39fd926622a422969ecebc">gauden_init</a></div><div class="ttdeci">gauden_t * gauden_init(char const *meanfile, char const *varfile, float32 varfloor, logmath_t *lmath)</div><div class="ttdoc">Read mixture gaussian codebooks from the given files. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00361">ms_gauden.c:361</a></div></div>
<div class="ttc" id="hmm_8h_html_a833f100ee293ad0f1c03f2a5ef9be77a"><div class="ttname"><a href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a">WORST_SCORE</a></div><div class="ttdeci">#define WORST_SCORE</div><div class="ttdoc">Large "bad" score. </div><div class="ttdef"><b>Definition:</b> <a href="hmm_8h_source.html#l00084">hmm.h:84</a></div></div>
<div class="ttc" id="structgauden__t_html_aca099d830de926e628ac0b523046b32c"><div class="ttname"><a href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">gauden_t::featlen</a></div><div class="ttdeci">int32 * featlen</div><div class="ttdoc">feature length for each feature </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00091">ms_gauden.h:91</a></div></div>
<div class="ttc" id="structgauden__t_html_af15df11bd2f3ab0290e0a33ca15c836c"><div class="ttname"><a href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">gauden_t::n_mgau</a></div><div class="ttdeci">int32 n_mgau</div><div class="ttdoc">Number codebooks. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00088">ms_gauden.h:88</a></div></div>
<div class="ttc" id="ms__gauden_8h_html"><div class="ttname"><a href="ms__gauden_8h.html">ms_gauden.h</a></div><div class="ttdoc">(Sphinx 3.0 specific) Gaussian density module. </div></div>
<div class="ttc" id="structps__mllr__s_html"><div class="ttname"><a href="structps__mllr__s.html">ps_mllr_s</a></div><div class="ttdoc">Feature space linear transform structure. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00082">acmod.h:82</a></div></div>
<div class="ttc" id="structps__mllr__s_html_a4cfa5d4c6637282b947b525a673cc3d0"><div class="ttname"><a href="structps__mllr__s.html#a4cfa5d4c6637282b947b525a673cc3d0">ps_mllr_s::A</a></div><div class="ttdeci">float32 **** A</div><div class="ttdoc">Rotation part of mean transformations. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00087">acmod.h:87</a></div></div>
<div class="ttc" id="hmm_8h_html_af94da16e3e5b550b9be05b0f07402cc7"><div class="ttname"><a href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a></div><div class="ttdeci">#define SENSCR_SHIFT</div><div class="ttdoc">Shift count for senone scores. </div><div class="ttdef"><b>Definition:</b> <a href="hmm_8h_source.html#l00073">hmm.h:73</a></div></div>
<div class="ttc" id="structgauden__t_html_aa76d63009601dcb6b99f17db96167f37"><div class="ttname"><a href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">gauden_t::mean</a></div><div class="ttdeci">mfcc_t **** mean</div><div class="ttdoc">mean[codebook][feature][codeword] vector </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00083">ms_gauden.h:83</a></div></div>
<div class="ttc" id="structgauden__t_html_a6dea221962b4a278dbae4806925a7be0"><div class="ttname"><a href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">gauden_t::n_feat</a></div><div class="ttdeci">int32 n_feat</div><div class="ttdoc">Number feature streams in each codebook. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00089">ms_gauden.h:89</a></div></div>
<div class="ttc" id="structgauden__dist__t_html_ab08100d4953998dad76bfcf30864c0c5"><div class="ttname"><a href="structgauden__dist__t.html#ab08100d4953998dad76bfcf30864c0c5">gauden_dist_t::dist</a></div><div class="ttdeci">mfcc_t dist</div><div class="ttdoc">Density value for input observation wrt above codeword; NOTE: result in logs3 domain, but var_t used for speed. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00073">ms_gauden.h:73</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_a9489d75ad3dbdc2bb413b43a17f48188"><div class="ttname"><a href="ms__gauden_8h.html#a9489d75ad3dbdc2bb413b43a17f48188">gauden_dump_ind</a></div><div class="ttdeci">void gauden_dump_ind(const gauden_t *g, int senidx)</div><div class="ttdoc">Dump the definition of Gaussian distribution of a particular index to the standard output stream...</div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00148">ms_gauden.c:148</a></div></div>
<div class="ttc" id="structgauden__t_html"><div class="ttname"><a href="structgauden__t.html">gauden_t</a></div><div class="ttdoc">Multivariate gaussian mixture density parameters. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00082">ms_gauden.h:82</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_a68cd25af0a2faf05eacd17afd5407ea4"><div class="ttname"><a href="ms__gauden_8h.html#a68cd25af0a2faf05eacd17afd5407ea4">gauden_dist</a></div><div class="ttdeci">int32 gauden_dist(gauden_t *g, int mgau, int n_top, mfcc_t **obs, gauden_dist_t **out_dist)</div><div class="ttdoc">Compute gaussian density values for the given input observation vector wrt the specified mixture gaus...</div></div>
<div class="ttc" id="structgauden__t_html_a172cb69c018608ab8c33d54e6f0fdf19"><div class="ttname"><a href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">gauden_t::var</a></div><div class="ttdeci">mfcc_t **** var</div><div class="ttdoc">like mean; diagonal covariance vector only </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00084">ms_gauden.h:84</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_8d034a1e03e98d9b7ac467250bbebdea.html">libpocketsphinx</a></li><li class="navelem"><b>ms_gauden.c</b></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.11 </li>
</ul>
</div>
</body>
</html>
|